Document Open Access Logo

Demand-Aware Small-World Networks on Clustered Demands

Authors Chen Avin , Robert Elsässer , Aleksander Figiel , Darya Melnyk , Stefan Schmid

PDF

File

Thumbnail PDF
PDF
LIPIcs.OPODIS.2025.28.pdf
  • Filesize: 1.03 MB
  • 19 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Networks → Peer-to-peer networks
  • Networks → Data center networks
  • Theory of computation → Social networks
Keywords
  • Small-world networks
  • demand-aware network designs
  • algorithms and analysis
  • clustering

Metrics

Abstract

Small-world networks are attractive for the efficient routing they provide, requiring only a low link density. They have hence also been considered for the design of distributed systems, such as peer-to-peer networks. However, existing small-world network designs are oblivious to the actual traffic they serve. In this paper, we initiate the study of demand-aware small-world networks. In particular, we extend the Kleinberg graph model, by allowing the nodes to choose the distribution of long-range links according to the traffic demand. We present a formal analysis of the weighted route lengths for the important case of clustered demands. We show both in theory and in simulations, using real-world traffic workloads, that demand-aware small-world graphs can significantly outperform their demand-oblivious counterparts.

Cite As Get BibTex

Chen Avin, Robert Elsässer, Aleksander Figiel, Darya Melnyk, and Stefan Schmid. Demand-Aware Small-World Networks on Clustered Demands. In 29th International Conference on Principles of Distributed Systems (OPODIS 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 361, pp. 28:1-28:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.OPODIS.2025.28

Author Details

Chen Avin
  • Ben-Gurion University of the Negev, Be'er-Sheva, Israel
Robert Elsässer
  • University of Salzburg, Austria
Aleksander Figiel
  • TU Berlin, Germany
Darya Melnyk
  • TU Berlin, Germany
Stefan Schmid
  • TU Berlin, Germany

Funding

Supported by the European Research Council (ERC), grant agreement No. 864228 (AdjustNet), Horizon 2020, 2020-2025.

References

  1. Emmanuel Abbe. Community detection and stochastic block models: Recent developments. Journal of Machine Learning Research, 18(177):1-86, 2018. URL: https://jmlr.org/papers/v18/16-480.html.
  2. Vamsi Addanki, Chen Avin, and Stefan Schmid. Mars: Near-optimal throughput with shallow buffers in reconfigurable datacenter networks. Proc. ACM Meas. Anal. Comput. Syst., 7(1), March 2023. URL: https://doi.org/10.1145/3579312.
  3. Farhan Amin, Rashid Abbasi, Abdul Rehman, and Gyu Sang Choi. An advanced algorithm for higher network navigation in social internet of things using small-world networks. Sensors, 19(9), 2019. URL: https://doi.org/10.3390/s19092007.
  4. Daniel Amir, Tegan Wilson, Vishal Shrivastav, Hakim Weatherspoon, Robert Kleinberg, and Rachit Agarwal. Optimal oblivious reconfigurable networks. In Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2022, 2022. URL: https://doi.org/10.1145/3519935.3520020.
  5. 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.
  6. Chen Avin and Stefan Schmid. Renets: Statically-optimal demand-aware networks. In Proc. SIAM Symposium on Algorithmic Principles of Computer Systems (APOCS), 2021. Google Scholar
  7. Marian Boguna and Dmitri Krioukov. Navigability of complex networks. Nature Physics, 5(1):74-80, 2009. Google Scholar
  8. Marián Boguná, Fragkiskos Papadopoulos, and Dmitri Krioukov. Sustaining the internet with hyperbolic mapping. Nature communications, 1(1):62, 2010. Google Scholar
  9. Fan Chung and Linyuan Lu. Connected components in random graphs with given expected degree sequences. Annals of combinatorics, 6(2):125-145, 2002. Google Scholar
  10. Ian Clarke, Oskar Sandberg, Brandon Wiley, and Theodore W. Hong. Freenet: A distributed anonymous information storage and retrieval system. In Designing privacy enhancing technologies: international workshop on design issues in anonymity and unobservability Berkeley, CA, USA, July 25-26, 2000 Proceedings, pages 46-66. Springer, 2001. URL: https://doi.org/10.1007/3-540-44702-4_4.
  11. Fred Douglis, Seth Robertson, Eric Van den Berg, Josephine Micallef, Marc Pucci, Alex Aiken, Maarten Hattink, Mingoo Seok, and Keren Bergman. Fleet—fast lanes for expedited execution at 10 terabits: Program overview. IEEE Internet Computing, 25(3):79-87, 2021. URL: https://doi.org/10.1109/MIC.2021.3075326.
  12. M. Draief and A. Ganesh. Efficient routing in poisson small-world networks. Journal of Applied Probability, 43(3):678-686, 2006. Google Scholar
  13. David Easley and Jon Kleinberg. Networks, Crowds, and Markets: Reasoning about a Highly Connected World. Cambridge University Press, 2010. URL: https://doi.org/10.1017/CBO9780511761942.
  14. Micha Elsner and Warren Schudy. Bounding and comparing methods for correlation clustering beyond ilp. In Proceedings of the Workshop on Integer Linear Programming for Natural Langauge Processing, ILP '09, pages 19-27, USA, 2009. Association for Computational Linguistics. Google Scholar
  15. Klaus-Tycho Foerster, Thibault Marette, Stefan Neumann, Claudia Plant, Ylli Sadikaj, Stefan Schmid, and Yllka Velaj. Analyzing the communication clusters in datacenters. In Proceedings of the ACM Web Conference (WWW), pages 3022-3032, 2023. Google Scholar
  16. Pierre Fraigniaud, Cyril Gavoille, and Christophe Paul. Eclecticism shrinks even small worlds. In Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, PODC '04, 2004. URL: https://doi.org/10.1145/1011767.1011793.
  17. Pierre Fraigniaud and George Giakkoupis. On the searchability of small-world networks with arbitrary underlying structure. In Proceedings of the Forty-Second ACM Symposium on Theory of Computing, STOC '10, pages 389-398, New York, NY, USA, 2010. Association for Computing Machinery. URL: https://doi.org/10.1145/1806689.1806744.
  18. Massimo Franceschetti and Ronald Meester. Navigation in small-world networks: a scale-free continuum model. Journal of Applied Probability, 43(4):1173-1180, 2006. URL: https://doi.org/10.1239/jap/1165505216.
  19. 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. ACM, 2016. URL: https://doi.org/10.1145/2934872.2934911.
  20. Šarunas Girdzijauskas. Designing peer-to-peer overlays: a small-world perspective. PhD thesis, EPFL, Lausanne, 2009. URL: https://doi.org/10.5075/epfl-thesis-4327.
  21. 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). Proc. ACM Meas. Anal. Comput. Syst., 5(3), December 2021. URL: https://doi.org/10.1145/3491050.
  22. 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.
  23. Navid Hamedazimi, Zafar Qazi, Himanshu Gupta, Vyas Sekar, Samir R. Das, Jon P. Longtin, Himanshu Shah, and Ashish Tanwer. Firefly: A reconfigurable wireless data center fabric using free-space optics. In ACM SIGCOMM Comput. Commun. Rev. (CCR), volume 44, pages 319-330. ACM, 2014. Google Scholar
  24. Jon Kleinberg. The small-world phenomenon: an algorithmic perspective. In Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, STOC '00, 2000. URL: https://doi.org/10.1145/335305.335325.
  25. Dmitri Krioukov, Fragkiskos Papadopoulos, Maksim Kitsak, Amin Vahdat, and Marián Boguñá. Hyperbolic geometry of complex networks. Phys. Rev. E, 82:036106, September 2010. URL: https://doi.org/10.1103/PhysRevE.82.036106.
  26. Mei Li, Wang-Chien Lee, and A. Sivasubramaniam. Semantic small world: an overlay network for peer-to-peer search. In Proceedings of the 12th IEEE International Conference on Network Protocols, 2004. ICNP 2004., pages 228-238, 2004. URL: https://doi.org/10.1109/ICNP.2004.1348113.
  27. Yu A. Malkov and Dmitry A. Yashunin. Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs. IEEE Trans. Pattern Anal. Mach. Intell., 42(4):824-836, April 2018. URL: https://doi.org/10.1109/TPAMI.2018.2889473.
  28. Chip Martel and Van Nguyen. Analyzing kleinberg’s (and other) small-world models. In Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, PODC '04, 2004. URL: https://doi.org/10.1145/1011767.1011794.
  29. Stanley Milgram. The Small World Problem. Psychology Today, 2:60-67, 1967. Google Scholar
  30. NERC. Hopper, nercs’s cray xe6 system. URL: https://web.archive.org/web/20120717045546/https://www.nersc.gov/use rs/computational-systems/hopper/.
  31. Fragkiskos Papadopoulos, Dmitri Krioukov, Marian Boguna, and Amin Vahdat. Greedy forwarding in dynamic scale-free networks embedded in hyperbolic metric spaces. In 2010 Proceedings IEEE INFOCOM, 2010. URL: https://doi.org/10.1109/INFCOM.2010.5462131.
  32. David Pollard. The moment generating function method. Yale Univ., Mini-Empirical Rep, 2021. Google Scholar
  33. Fatemeh Shirazi, Milivoj Simeonovski, Muhammad Rizwan Asghar, Michael Backes, and Claudia Diaz. A survey on routing in anonymous communication protocols. ACM Comput. Surv., 51(3), 2018. URL: https://doi.org/10.1145/3182658.
  34. Min Yee Teh, Zhenguo Wu, and Keren Bergman. Flexspander: augmenting expander networks in high-performance systems with optical bandwidth steering. IEEE/OSA Journal of Optical Communications and Networking, 12(4):B44-B54, 2020. URL: https://doi.org/10.1364/JOCN.379487.
  35. D. J. Watts and S. H. Strogatz. Collective dynamics of `small-world'networks. Nature, 393(6684):440-442, 1998. Google Scholar
  36. Tegan Wilson, Daniel Amir, Nitika Saran, Robert Kleinberg, Vishal Shrivastav, and Hakim Weatherspoon. Breaking the vlb barrier for oblivious reconfigurable networks. In Proceedings of the 56th Annual ACM Symposium on Theory of Computing, STOC 2024, 2024. URL: https://doi.org/10.1145/3618260.3649608.
  37. Johannes Zerwas, C. Gyorgyi, A. Blenk, Stefan Schmid, and Chen Avin. Duo: A high-throughput reconfigurable datacenter network using local routing and control. In Proc. ACM SIGMETRICS, 2023. Google Scholar
  38. Mingyang Zhang, Jianan Zhang, Rui Wang, Ramesh Govindan, Jeffrey C. Mogul, and Amin Vahdat. Gemini: Practical reconfigurable datacenter networks with topology and traffic engineering, 2021. URL: https://arxiv.org/abs/2110.08374.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact