TY - GEN
T1 - Demand-Aware Network Design with Minimal Congestion and Route Lengths
AU - Avin, Chen
AU - Mondal, Kaushik
AU - Schmid, Stefan
N1 - Funding Information:
We regard our work as a first step and believe that it opens several interesting avenues for future research. In particular, it will be interesting to investigate more fault-tolerant designs as well as dynamic demand-aware networks which can self-adjust over time to temporally changing traffic patterns. Acknowledgments. Research supported by German-Israeli Foundation for Scientific Research and Development (G.I.F. No I-1245-407.6/2014).
Publisher Copyright:
© 2019 IEEE.
PY - 2019/4/1
Y1 - 2019/4/1
N2 - Emerging communication technologies allow to reconfigure the physical network topology at runtime, enabling demand-aware networks (DANs): networks whose topology is optimized toward the workload they serve. However, today, only little is known about the fundamental algorithmic problems underlying the design of such demand-aware networks. This paper presents the first bounded-degree, demand-aware network, ct-DAN, which minimizes both congestion and route lengths. The designed network is provably (asymptotically) optimal in each dimension individually: we show that there do not exist any bounded-degree networks providing shorter routes (independently of the load), nor do there exist networks providing lower loads (independently of the route lengths). The main building block of the designed ct-DAN networks are ego-trees: communication sources arrange their communication partners in an optimal tree, individually. While the union of these ego-trees forms the basic structure of cl-DANs, further techniques are presented to ensure bounded degrees (for scalability).
AB - Emerging communication technologies allow to reconfigure the physical network topology at runtime, enabling demand-aware networks (DANs): networks whose topology is optimized toward the workload they serve. However, today, only little is known about the fundamental algorithmic problems underlying the design of such demand-aware networks. This paper presents the first bounded-degree, demand-aware network, ct-DAN, which minimizes both congestion and route lengths. The designed network is provably (asymptotically) optimal in each dimension individually: we show that there do not exist any bounded-degree networks providing shorter routes (independently of the load), nor do there exist networks providing lower loads (independently of the route lengths). The main building block of the designed ct-DAN networks are ego-trees: communication sources arrange their communication partners in an optimal tree, individually. While the union of these ego-trees forms the basic structure of cl-DANs, further techniques are presented to ensure bounded degrees (for scalability).
UR - http://www.scopus.com/inward/record.url?scp=85066475727&partnerID=8YFLogxK
U2 - 10.1109/INFOCOM.2019.8737431
DO - 10.1109/INFOCOM.2019.8737431
M3 - Conference contribution
AN - SCOPUS:85066475727
T3 - Proceedings - IEEE INFOCOM
SP - 1351
EP - 1359
BT - INFOCOM 2019 - IEEE Conference on Computer Communications
PB - Institute of Electrical and Electronics Engineers
T2 - 2019 IEEE Conference on Computer Communications, INFOCOM 2019
Y2 - 29 April 2019 through 2 May 2019
ER -