English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Efficient embedding virtual clusters in physical network is a challengingproblem. In this paper we consider a scenario where physical network has astructure of a balanced tree. This assumption is justified by many real- worldimplementations of datacenters. We consider an extension to virtual clusterembedding by introducing replication among data chunks. In many real-worldapplications, data is stored in distributed and redundant way. This assumptionintroduces additional hardness in deciding what replica to process. Byreduction from classical NP-complete problem of Boolean Satisfia- bility, weshow limits of optimality of embedding. Our result holds even in trees of edgeheight bounded by three. Also, we show that limiting repli- cation factor totwo replicas per chunk type does not make the problem simpler.

Hardness of Virtual Network Embedding with Replica Selection