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

Emerging optical and virtualization technologies enable the design of moreflexible and demand-aware networked systems, in which resources can beoptimized toward the actual workload they serve. For example, in a demand-awaredatacenter network, frequently communicating nodes (e.g., two virtual machinesor a pair of racks in a datacenter) can be placed topologically closer,reducing communication costs and hence improving the overall networkperformance.  This paper revisits the bounded-degree network design problem underlying suchdemand-aware networks. Namely, given a distribution over communicating serverpairs, we want to design a network with bounded maximum degree that minimizesexpected communication distance. In addition to this known problem, weintroduce and study a variant where we allow Steiner nodes (i.e., additionalrouters) to be added to augment the network.  We improve the understanding of this problem domain in several ways. First,we shed light on the complexity and hardness of the aforementioned problems,and study a connection between them and the virtual networking embeddingproblem. We then provide a constant-factor approximation algorithm for theSteiner node version of the problem, and use it to improve over priorstate-of-the-art algorithms for the original version of the problem with sparsecommunication distributions. Finally, we investigate various heuristicapproaches to bounded-degree network design problem, in particular providing areliable heuristic algorithm with good experimental performance.  We report on an extensive empirical evaluation, using several real-worldtraffic traces from datacenters, and find that our approach results in improveddemand-aware network designs.

Demand-Aware Network Design with Steiner Nodes and a Connection to Virtual Network Embedding