Demand-aware network designs of bounded degree
From MaRDI portal
Publication:2189175
Abstract: Traditionally, networks such as datacenter interconnects are designed to optimize worst-case performance under arbitrary traffic patterns. Such network designs can however be far from optimal when considering the actual workloads and traffic patterns which they serve. This insight led to the development of demand-aware datacenter interconnects which can be reconfigured depending on the workload. Motivated by these trends, this paper initiates the algorithmic study of demand-aware networks (DANs) designs, and in particular the design of bounded-degree networks. The inputs to the network design problem are a discrete communication request distribution, D, defined over communicating pairs from the node set V , and a bound, d, on the maximum degree. In turn, our objective is to design an (undirected) demand-aware network N = (V,E) of bounded-degree d, which provides short routing paths between frequently communicating nodes distributed across N. In particular, the designed network should minimize the expected path length on N (with respect to D), which is a basic measure of the efficiency of the network. We show that this fundamental network design problem exhibits interesting connections to several classic combinatorial problems and to information theory. We derive a general lower bound based on the entropy of the communication pattern D, and present asymptotically optimal network-aware design algorithms for important distribution families, such as sparse distributions and distributions of locally bounded doubling dimensions.
Recommendations
Cites work
- $(1 + \epsilon,\beta)$-Spanner Constructions for General Graphs
- O(log log n)-competitive dynamic binary search trees
- A Doubling Dimension Threshold Θ(loglogn) for Augmented Graph Navigability
- A history of graph entropy measures
- Additive spanners and \(({\alpha}, {\beta})\)-spanners
- An Optimal Synchronizer for the Hypercube
- An improved approximation ratio for the minimum linear arrangement problem
- Chordal completions of planar graphs
- Dynamic Optimality—Almost
- Embedding Graphs with Bounded Treewidth into Their Optimal Hypercubes
- Fast Construction of Nets in Low-Dimensional Metrics and Their Applications
- Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)
- Graph spanners
- Introduction to algorithms.
- Low distortion spanners
- Minimizing Average Shortest Path Distances via Shortcut Edge Addition
- Nearly optimal binary search trees
- Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
- On hierarchical routing in doubling metrics
- Optimal Assignments of Numbers to Vertices
- Self-adjusting binary search trees
- Self-adjusting grid networks to minimize expected path length
- Small hop-diameter sparse spanners for doubling metrics
- Spanners and emulators with sublinear distance errors
- Spanners with Slack
- Sparse Sourcewise and Pairwise Distance Preservers
- The complexity of the network design problem
- The geometry of binary search trees
- \(\ell ^2_2\) spreading metrics for vertex ordering problems
- rDAN: toward robust demand-aware network designs
Cited in
(4)
This page was built for publication: Demand-aware network designs of bounded degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2189175)
