LIPIcs.ESA.2024.52.pdf
- Filesize: 0.84 MB
- 15 pages
Document
Toward Self-Adjusting k-Ary Search Tree Networks
Authors
Anton Paramonov 
,
Iosif Salem ,
Vitaly Aksenov ,
Stefan Schmid
-
Part of:
Volume:
32nd Annual European Symposium on Algorithms (ESA 2024)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: European Symposium on Algorithms (ESA) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2024-09-23
File
Document Identifiers
Author Details
Cite As Get BibTex
Evgeniy Feder, Anton Paramonov, Pavel Mavrin, Iosif Salem, Vitaly Aksenov, and Stefan Schmid. Toward Self-Adjusting k-Ary Search Tree Networks. In 32nd Annual European Symposium on Algorithms (ESA 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 308, pp. 52:1-52:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.ESA.2024.52
Abstract
Datacenter networks are becoming increasingly flexible with the incorporation of new optical communication technologies, such as optical circuit switches, enabling self-adjusting topologies that can adapt to the traffic pattern in a demand-aware manner. In this paper, we take the first steps toward demand-aware and self-adjusting k-ary tree networks. These are more powerful generalizations of existing binary search tree networks (like SplayNet [Stefan Schmid et al., 2016]), which have been at the core of self-adjusting network (SAN) designs. k-ary search tree networks are a natural generalization offering nodes of higher degrees, reduced route lengths, and local routing in spite of reconfigurations (due to maintaining the search property). Our main results are two online heuristics for self-adjusting k-ary tree networks. Empirical results show that our heuristics work better than SplayNet in most of the real network traces and for average to low locality synthetic traces, and are only a little inferior to SplayNet in all remaining traces. We build our online algorithms by first solving the offline case. First, we compute an offline (optimal) static demand-aware network for arbitrary traffic patterns in 𝒪(n³ ⋅ k) time via dynamic programming, where n is the number of network nodes (e.g., datacenter racks), and also improve the bound for the special case of uniformly distributed traffic. Then, we present a centroid-based approach to demand-aware network designs that we use both in the offline static and online settings. In the offline uniform-workload case, we construct this centroid network in linear time 𝒪(n).
Subject Classification
ACM Subject Classification
- Networks → Network algorithms
- Networks → Network design principles
- Theory of computation → Online algorithms
- Theory of computation → Data structures design and analysis
Keywords
- self-adjusting networks
- networks
- splay-tree
- k-ary tree
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads
References
- Chen Avin, Marcin Bienkowski, Iosif Salem, Robert Sama, Stefan Schmid, and Paweł Schmidt. Deterministic self-adjusting tree networks using rotor walks. In 42nd IEEE International Conference on Distributed Computing Systems, ICDCS 2022, Bologna, Italy, July 10-13, 2022, pages 67-77. IEEE, IEEE, 2022. URL: https://doi.org/10.1109/ICDCS54860.2022.00016.
- Chen Avin, Manya Ghobadi, Chen Griner, and Stefan Schmid. On the complexity of traffic traces and implications. Proceedings of the ACM on Measurement and Analysis of Computing Systems, 4(1):1-29, 2020. URL: https://doi.org/10.1145/3379486.
- Chen Avin, Bernhard Haeupler, Zvi Lotker, Christian Scheideler, and Stefan Schmid. Locally self-adjusting tree networks. In 2013 IEEE 27th International Symposium on Parallel and Distributed Processing, pages 395-406. IEEE, 2013. URL: https://doi.org/10.1109/IPDPS.2013.40.
- Chen Avin, Kaushik Mondal, and Stefan Schmid. Demand-aware network designs of bounded degree. Distributed Computing, pages 1-15, 2019. URL: https://doi.org/10.1007/s00446-019-00351-5.
- Chen Avin, Kaushik Mondal, and Stefan Schmid. Demand-aware network design with minimal congestion and route lengths. IEEE/ACM Transactions on Networking, 30(4):1838-1848, 2022. URL: https://doi.org/10.1109/TNET.2022.3153586.
- Chen Avin, Kaushik Mondal, and Stefan Schmid. Push-down trees: optimal self-adjusting complete trees. IEEE/ACM Transactions on Networking, 30(6):2419-2432, 2022. URL: https://doi.org/10.1109/TNET.2022.3174118.
- Chen Avin, Iosif Salem, and Stefan Schmid. Working set theorems for routing in self-adjusting skip list networks. In IEEE INFOCOM 2020-IEEE Conference on Computer Communications, pages 2175-2184. IEEE, 2020. URL: https://doi.org/10.1109/INFOCOM41043.2020.9155495.
- Chen Avin and Stefan Schmid. Toward demand-aware networking: A theory for self-adjusting networks. ACM SIGCOMM Computer Communication Review, 48(5):31-40, 2019. URL: https://doi.org/10.1145/3310165.3310170.
- Chen Avin and Stefan Schmid. Renets: Statically-optimal demand-aware networks. In Symposium on Algorithmic Principles of Computer Systems (APOCS), pages 25-39. SIAM, 2021. URL: https://doi.org/10.1137/1.9781611976489.3.
- Otávio Augusto de Oliviera Souza, Olga Goussevskaia, and Stefan Schmid. Cbnet: Minimizing adjustments in concurrent demand-aware tree networks. In 35th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2021, Portland, OR, USA, May 17-21, 2021, pages 382-391. IEEE, IEEE, 2021. URL: https://doi.org/10.1109/IPDPS49936.2021.00046.
- US DOE. Characterization of the doe mini-apps. https://portal.nersc.gov/project/CAL/doe-miniapps.htm, 2016.
- Evgenii Feder, Anton Paramonov, Iosif Salem, Stefan Schmid, and Vitaly Aksenov. Toward self-adjusting k-ary search tree networks. arXiv preprint arXiv:2302.13113, 2023. URL: https://doi.org/10.48550/arXiv.2302.13113.
- Evgeniy Feder, Ichha Rathod, Punit Shyamsukha, Robert Sama, Vitaly Aksenov, Iosif Salem, and Stefan Schmid. Toward self-adjusting networks for the matching model. In Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures, pages 429-431, 2021. URL: https://doi.org/10.1145/3409964.3461824.
- Evgeniy Feder, Ichha Rathod, Punit Shyamsukha, Robert Sama, Vitaly Aksenov, Iosif Salem, and Stefan Schmid. Lazy self-adjusting bounded-degree networks for the matching model. In 41th IEEE Conference on Computer Communications, INFOCOM 2020, Virtual Conference, May 2-5, 2022. IEEE, 2022. URL: https://doi.org/10.1109/INFOCOM48880.2022.9796885.
- Monia Ghobadi, Ratul Mahajan, Amar Phanishayee, Nikhil Devanur, Janardhan Kulkarni, Gireeja Ranade, Pierre-Alexandre Blanche, Houman Rastegarfar, Madeleine Glick, and Daniel Kilper. Projector: Agile reconfigurable data center interconnect. In Proceedings of the 2016 ACM SIGCOMM Conference, pages 216-229, 2016. URL: https://doi.org/10.1145/2934872.2934911.
- Chen Griner, Johannes Zerwas, Andreas Blenk, Manya Ghobadi, Stefan Schmid, and Chen Avin. Cerberus: The power of choices in datacenter topology design-a throughput perspective. Proceedings of the ACM on Measurement and Analysis of Computing Systems, 5(3):1-33, 2021. URL: https://doi.org/10.1145/3491050.
- Matthew Nance Hall, Klaus-Tycho Foerster, Stefan Schmid, and Ramakrishnan Durairajan. A survey of reconfigurable optical networks. Optical Switching and Networking, 41:100621, 2021. URL: https://doi.org/10.1016/j.osn.2021.100621.
- Charles Martel. Self-adjusting multi-way search trees. Information Processing Letters, 38(3):135-141, 1991. URL: https://doi.org/10.1016/0020-0190(91)90235-A.
- Bruna Peres, Otavio Augusto de Oliveira Souza, Olga Goussevskaya, Chen Avin, and Stefan Schmid. Distributed self-adjusting tree networks. IEEE Transactions on Cloud Computing, 11(1):716-729, 2023. URL: https://doi.org/10.1109/TCC.2021.3112067.
- Leon Poutievski, Omid Mashayekhi, Joon Ong, Arjun Singh, Muhammad Mukarram Bin Tariq, Rui Wang, Jianan Zhang, Virginia Beauregard, Patrick Conner, Steve D. Gribble, Rishi Kapoor, Stephen Kratzer, Nanfang Li, Hong Liu, Karthik Nagaraj, Jason Ornstein, Samir Sawhney, Ryohei Urata, Lorenzo Vicisano, Kevin Yasumura, Shidong Zhang, Junlan Zhou, and Amin Vahdat. Jupiter evolving: Transforming google’s datacenter network via optical circuit switches and software-defined networking. In SIGCOMM '22: ACM SIGCOMM 2022 Conference, Amsterdam, The Netherlands, August 22 - 26, 2022, pages 66-85, 2022. URL: https://doi.org/10.1145/3544216.3544265.
- Arjun Roy, Hongyi Zeng, Jasmeet Bagga, George Porter, and Alex C Snoeren. Inside the social network’s (datacenter) network. In Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication, pages 123-137, 2015. URL: https://doi.org/10.1145/2785956.2787472.
- Stefan Schmid, Chen Avin, Christian Scheideler, Michael Borokhovich, Bernhard Haeupler, and Zvi Lotker. Splaynet: Towards locally self-adjusting networks. IEEE/ACM Trans. Netw., 24(3):1421-1433, 2016. URL: https://doi.org/10.1109/TNET.2015.2410313.
- Murray Sherk. Self-adjusting k-ary search trees. Journal of Algorithms, 19(1):25-44, 1995. URL: https://doi.org/10.1006/jagm.1995.1026.
- Daniel Dominic Sleator and Robert Endre Tarjan. Self-adjusting binary search trees. Journal of the ACM (JACM), 32(3):652-686, 1985. URL: https://doi.org/10.1145/3828.3835.