Abstract
In this paper we study decentralized routing in small-world networks that combine a wide variation in node degrees with a notion of spatial embedding. Specifically, we consider a variant of J. Kleinberg’s grid-based small-world model in which (1) the number of long-range edges of each node is not fixed, but is drawn from a power-law probability distribution with exponent parameter \(\alpha \ge 0\) and constant mean, and (2) the long-range edges are considered to be bidirectional for the purposes of routing. This model is motivated by empirical observations indicating that several real networks have degrees that follow a power-law distribution. The measured power-law exponent \(\alpha \) for these networks is often in the range between 2 and 3. For the small-world model we consider, we show that when \(2 < \alpha < 3\) the standard greedy routing algorithm, in which a node forwards the message to its neighbor that is closest to the target in the grid, finishes in an expected number of \(O(\log ^{\alpha -1} n\cdot \log \log n)\) steps, for any source–target pair. This is asymptotically smaller than the \(O(\log ^2 n)\) steps needed in Kleinberg’s original model with the same average degree, and approaches \(O(\log n)\) as \(\alpha \) approaches 2. Further, we show that when \(0\le \alpha < 2\) or \(\alpha \ge 3\) the expected number of steps is \(O(\log ^2 n)\), while for \(\alpha = 2\) it is \(O(\log ^{4/3} n)\). We complement these results with lower bounds that match the upper bounds within at most a \(\log \log n\) factor.
Similar content being viewed by others
Notes
The extent to which this model resembles real social networks has yet to be evaluated empirically.
For the case of \(\ell =1\), this follows also from a general lower bound by Dietzfelbinger and Woelfel [11].
In Kleinberg’s original model, a node has edges to all nodes at distance at most \(r\); in our model we assume that \(r=1\). Further, in Kleinberg’s model the grid does not wrap around; this assumption, however, is used in many subsequent works, e.g., by Martel and Nguyen [31, 32]. We expect that these two assumptions are not critical for our results.
In fact, it holds for any \(i\) that is at most a polylogarithmic function of \(n\), but for our purposes it suffices to assume that \(i \le \log ^3 n\).
The value of \(\lambda \) is not optimized; it was chosen so that the same simple expression works for all three cases.
References
Abraham, I., Gavoille, C.: Object location using path separators. In: Proceedings of the 25th ACM Symposium on Principles of Distributed Computing (PODC), pp. 188–197 (2006)
Adamic, L.A., Lukose, R.M., Puniyani, A.R., Huberman, B.A.: Search in power-law networks. Phys. Rev. E 64, 46135 (2001)
Albert, R., Barabási, A.L.: Statistical mechanics of complex networks. Rev. Mod. Phys. 74(1), 47–97 (2002)
Aspnes, J., Diamadi, Z., Shah, G.: Fault-tolerant routing in peer-to-peer systems. In: Proceedings of the 21st ACM Symposium on Principles of Distributed Computing (PODC), pp. 223–232 (2002)
Backstrom, L., Boldi, P., Rosa, M., Ugander, J., Vigna, S.: Four degrees of separation. In: Proceedings of the 3rd ACM Web Science Conference (WebSci), pp. 33–42 (2012)
Barrière, L., Fraigniaud, P., Kranakis, E., Krizanc, D.: Efficient routing in networks with long range contacts. In: Proceedings of the 15th International Symposium on Distributed Computing (DISC), pp. 270–284 (2001)
Bollobás, B., Riordan, O.: The diameter of a scale-free random graph. Combinatorica 24(1), 5–34 (2004)
Chung, F.R.K., Lu, L.: The average distance in a random graph with given expected degrees. Intern Math 1(1), 91–113 (2003)
Coppersmith, D., Gamarnik, D., Sviridenko, M.: The diameter of a long range percolation graph. In: Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 329–337 (2002)
Dietzfelbinger, M., Rowe, J., Wegener, I., Woelfel, P.: Tight bounds for blind search on the integers. In: Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science (STACS), pp. 241–252 (2008)
Dietzfelbinger, M., Woelfel, P.: Tight lower bounds for greedy routing in uniform small world rings. In: Proceedings of the 41st ACM Symposium on Theory of Computing (STOC), pp. 591–600 (2009)
Dodds, P.S., Muhamad, R., Watts, D.J.: An experimental study of search in global social networks. Science 301(5634), 827–829 (2003)
Dorogovtsev, S.N., Mendes, J.F.F.: Evolution of networks: from biological networks to the Internet and WWW. Oxford University Press, Oxford (2003)
Duchon, P., Hanusse, N., Lebhar, E., Schabanel, N.: Could any graph be turned into a small-world? In: Proceedings of the 19th International Symposium on Distributed Computing (DISC), pp. 511–513 (2005)
Flammini, M., Moscardelli, L., Navarra, A., Pérennes, S.: Asymptotically optimal solutions for small world graphs. In: Proceedings of the 19th International Symposium on Distributed Computing (DISC), pp. 414–428 (2005)
Fraigniaud, P.: Greedy routing in tree-decomposed graphs. In: Proceedings of the 13th European Symposium on Algorithms (ESA), pp. 791–802 (2005)
Fraigniaud, P., Gavoille, C., Paul, C.: Eclecticism shrinks even small worlds. In: Proceedings of the 23rd ACM Symposium on Principles of Distributed Computing (PODC), pp. 169–178 (2004)
Fraigniaud, P., Giakkoupis, G.: The effect of power-law degrees on the navigability of small worlds. In: Proceedings of the 28th ACM Symposium on Principles of Distributed Computing (PODC), pp. 240–249 (2009)
Fraigniaud, P., Giakkoupis, G.: On the searchability of small-world networks with arbitrary underlying structure. In: Proceedings of the 42nd ACM Symposium on Theory of Computing (STOC), pp. 389–398 (2010)
Giakkoupis, G., Hadzilacos, V.: On the complexity of greedy routing in ring-based peer-to-peer networks. In: Proceedings of the 26th ACM Symposium on Principles of Distributed Computing (PODC), pp. 99–108 (2007)
Giakkoupis, G., Schabanel, N.: Optimal path search in small worlds: dimension matters. In: Proceedings of the 43rd ACM Symposium on Theory of Computing (STOC), pp. 393–402 (2011)
Kim, B., Yoon, C., Han, S., Jeong, H.: Path finding strategies in scale-free networks. Phys. Rev. E 65, 027103 (2002)
Kleinberg, J.: Navigation in a small world. Nature 406, 845 (2000)
Kleinberg, J.: The small-world phenomenon: An algorithmic perspective. In: Proceedings of the 32nd ACM Symposium on Theory of Computing (STOC), pp. 163–170 (2000)
Kleinberg, J.: Small-world phenomena and the dynamics of information. In: Advances Neural Information Processing Systems (NIPS) 14, pp. 431–438 (2001)
Kleinberg, J.: Complex networks and decentralized search algorithms. In: Proceedings of the International Congress of Mathematicians (ICM) (2006)
Lattanzi, S., Panconesi, A., Sivakumar, D.: Milgram-routing in social networks. In: Proceedings of the 20th ACM International Conference on World Wide Web (WWW), pp. 725–734 (2011)
Lebhar, E., Schabanel, N.: Almost optimal decentralized routing in long-range contact networks. In: Proceedings of the 31st International Colloquium on Automata, Languages, and Programming (ICALP), pp. 894–905 (2004)
Liben-Nowell, D., Novak, J., Kumar, R., Raghavan, P., Tomkins, A.: Geographic routing in social networks. Proc. Natl. Acad. Sci. USA 102(33), 11623–11628 (2005)
Manku, G.S., Naor, M., Wieder, U.: Know thy neighbor’s neighbor: the power of lookahead in randomized P2P networks. In: Proceedings of the 36th ACM Symposium on Theory of Computing (STOC), pp. 54–63 (2004)
Martel, C., Nguyen, V.: Analyzing Kleinberg’s (and other) small-world models. In: Proceedings of the 23rd ACM Symposium on Principles of Distributed Computing (PODC), pp. 179–188 (2004)
Martel, C., Nguyen, V.: Analyzing and characterizing small-world graphs. In: Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 311–320 (2005)
Milgram, S.: The small world problem. Psychol. Today 67(1), 60–67 (1967)
Newman, M.E.J.: The structure and function of complex networks. SIAM Rev. 45(2), 167–256 (2003)
Sarshar, N., Boykin, P.O., Roychowdhury, V.P.: Percolation search in power law networks: Making unstructured peer-to-peer networks scalable. In: Proceedings of the 4th IEEE International Conference on Peer-to-Peer, Computing (P2P), pp. 2–9 (2004)
Simsek, Ö., Jensen, D.: Decentralized search in networks using homophily and degree disparity. In: Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI), pp. 304–310 (2005)
Slivkins, A.: Distance estimation and object location via rings of neighbors. In: Proceedings of the 24th ACM Symposium on Principles of Distributed Computing (PODC), pp. 41–50 (2005)
Watts, D.J., Strogatz, S.H.: Collective dynamics of ‘small-world’ networks. Nature 393, 440–442 (1998)
Acknowledgments
We thank Vassos Hadzilacos and Philipp Woelfel for helpful discussions. We also thank the anonymous reviewers for their helpful feedback.
Author information
Authors and Affiliations
Corresponding author
Additional information
This paper was originally invited to the special issue of Distributed Computing based on selected papers presented at PODC 2009. It appears separately due to publication delays.
Rights and permissions
About this article
Cite this article
Fraigniaud, P., Giakkoupis, G. Greedy routing in small-world networks with power-law degrees. Distrib. Comput. 27, 231–253 (2014). https://doi.org/10.1007/s00446-014-0210-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00446-014-0210-y