The small-world phenomenon: an algorithmic perspective
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Fault-tolerant routing in peer-to-peer systems
Proceedings of the twenty-first annual symposium on Principles of distributed computing
The diameter of a long-range percolation graph
Random Structures & Algorithms
Efficient Routing in Networks with Long Range Contacts
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Eclecticism shrinks even small worlds
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Analyzing Kleinberg's (and other) small-world Models
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Analyzing and characterizing small-world graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Meridian: a lightweight network location service without virtual coordinates
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Close to optimal decentralized routing in long-range contact networks
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Could any graph be turned into a small-world?
Theoretical Computer Science - Complex networks
Symphony: distributed hashing in a small world
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
On the searchability of small-world networks with arbitrary underlying structure
Proceedings of the forty-second ACM symposium on Theory of computing
The power of local information in social networks
WINE'12 Proceedings of the 8th international conference on Internet and Network Economics
| Hi-index | 0.00 |
We consider Kleinberg's celebrated small-world model (2000). This model is based on a d-dimensional grid graph of n nodes, augmented by a constant number of "long-range links" per node. It is known that this graph has diameter O(log n), and that a simple greedy search algorithm visits an expected number of O(log2 n) nodes, which is asymptotically optimal over all decentralized search algorithms. Besides the number of nodes visited, a relevant measure is the length of the path constructed by the search algorithm. A decentralized algorithm by Lebhar and Schabanel (2003) constructs paths of expected length O(log n (loglog n)2) by visiting the same number of nodes as greedy search. A natural question, posed by Kleinberg (2006), is whether there are decentralized algorithms that construct paths of length O(log n) while visiting only a poly-logarithmic number of nodes. In this paper we resolve this question. For grid dimension d=1, we answer the question in the negative, by showing that any decentralized algorithm that visits a poly-logarithmic number of nodes constructs paths of expected length O(log n loglog n). Further we show that this bound is tight; a simple variant of the algorithm by Lebhar and Schabanel matches this bound. For dimension de2, however, we answer the question in the affirmative; the bound is achieved by essentially the same algorithm we used for d=1. This is the first time that such a dichotomy, based on the dimension d, has been observed for an aspect of this model. Our results may be applicable to the design of peer-to-peer networks, where the length of the path along which data are transferred is critical for the network's performance.