Randomized algorithms
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
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Efficient Routing in Networks with Long Range Contacts
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Brief announcement: an overview of the content-addressable network D2B
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Compact and localized distributed data structures
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Navigating nets: simple algorithms for proximity search
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Deformable spanners and applications
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Compact name-independent routing with minimum stretch
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Journal of the ACM (JACM)
Fast construction of nets in low dimensional metrics, and their applications
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Distance estimation and object location via rings of neighbors
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Name independent routing for growth bounded networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Meridian: a lightweight network location service without virtual coordinates
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Could any graph be turned into a small-world?
Theoretical Computer Science - Complex networks
Greedy routing in tree-decomposed graphs
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Could any graph be turned into a small-world?
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Universal augmentation schemes for network navigability: overcoming the √n-barrier
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Towards fast decentralized construction of locality-aware overlay networks
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Polylogarithmic network navigability using compact metrics with small stretch
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Recovering the Long-Range Links in Augmented Graphs
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
BlåtAnt: Bounding Networks' Diameter with a Collaborative Distributed Algorithm
ANTS '08 Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence
Graph Augmentation via Metric Embedding
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Universal augmentation schemes for network navigability
Theoretical Computer Science
Unsupervised creation of small world networks for the preservation of digital objects
Proceedings of the 9th ACM/IEEE-CS joint conference on Digital libraries
Recovering the long-range links in augmented graphs
Theoretical Computer Science
Small worlds as navigable augmented networks: model, analysis, and validation
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Depth of field and cautious-greedy routing in social networks
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Non-searchability of random power-law graphs
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Biased selection for building small-world networks
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
| Hi-index | 0.00 |
We investigate the problem of optimizing the routing performance of a virtual network by adding extra random links. Our asynchronous and distributed algorithm ensures, by adding a single extra link per node, that the resulting network is a navigable small world, i.e., in which greedy routing, using the distance in the original network, computes paths of polylogarithmic length between any pair of nodes with probability 1-O(1/n). Previously known small world augmentation processes require the global knowledge of the network and centralized computations, which is unrealistic for large decentralized networks. Our algorithm, based on a careful multi-layer sampling of the nodes and the construction of a light overlay network, bypasses these limitations. For bounded growth graphs, i.e., graphs where, for any node u and any radius r the number of nodes within distance 2r from u is at most a constant times the number of nodes within distance r, our augmentation process proceeds with high probability in O(log n log D) communication rounds, with O(log n log D) messages of size O(log n) bits sent per node and requiring only O(log n log D) bit space in each node, where n is the number of nodes, and D the diameter. In particular, with the only knowledge of original distances, greedy routing computes, between any pair of nodes in the augmented network, a path of length at most O(log2 n log2 D) with probability 1 - O(1/n), and of expected length O(log n log2 D). Hence, we provide a distributed scheme to augment any bounded growth graph into a small world with high probability in polylogarithmic time while requiring polylogarithmic memory. We consider that the existence of such a lightweight process might be a first step towards the definition of a more general construction process that would validate Kleinberg's model as a plausible explanation for the small world phenomenon in large real interaction networks.