TY - GEN
T1 - Demand-Aware Small-World Networks on Clustered Demands
AU - Avin, Chen
AU - Elsässer, Robert
AU - Figiel, Aleksander
AU - Melnyk, Darya
AU - Schmid, Stefan
N1 - Publisher Copyright:
© Chen Avin, Robert Elsässer, Aleksander Figiel, Darya Melnyk, and Stefan Schmid;
PY - 2025/1/1
Y1 - 2025/1/1
N2 - 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.
AB - 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.
KW - algorithms and analysis
KW - clustering
KW - demand-aware network designs
KW - Small-world networks
UR - https://www.scopus.com/pages/publications/105031416739
U2 - 10.4230/LIPIcs.OPODIS.2025.28
DO - 10.4230/LIPIcs.OPODIS.2025.28
M3 - Conference contribution
AN - SCOPUS:105031416739
T3 - Leibniz International Proceedings in Informatics, LIPIcs
BT - 29th International Conference on Principles of Distributed Systems, OPODIS 2025
A2 - Arusoaie , Andrei
A2 - Onica, Emanuel
A2 - Spear, Michael
A2 - Tucci-Piergiovanni, Sara
PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
T2 - 29th International Conference on Principles of Distributed Systems, OPODIS 2025
Y2 - 3 December 2025 through 5 December 2025
ER -