The small-world phenomenon: an algorithmic perspective
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Viceroy: a scalable and dynamic emulation of the butterfly
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Fault-tolerant routing in peer-to-peer systems
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
Efficient Routing in Networks with Long Range Contacts
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Novel architectures for P2P applications: the continuous-discrete approach
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Incrementally improving lookup latency in distributed hash table systems
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
The impact of DHT routing geometry on resilience and proximity
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Routing networks for distributed hash tables
Proceedings of the twenty-second annual symposium on Principles of distributed computing
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
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
Symphony: distributed hashing in a small world
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
Asymptotically optimal solutions for small world graphs
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Polylogarithmic network navigability using compact metrics with small stretch
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Tight lower bounds for greedy routing in uniform small world rings
Proceedings of the forty-first annual ACM symposium on Theory of computing
Brief announcement: tight lower bounds for greedy routing in uniform small world rings
Proceedings of the 28th ACM symposium on Principles of distributed computing
Structured overlay for heterogeneous environments: Design and evaluation of oscar
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Small worlds as navigable augmented networks: model, analysis, and validation
ESA'07 Proceedings of the 15th annual European conference on Algorithms
| Hi-index | 0.00 |
We investigate the complexity of greedy routing in uniform ring-based random graphs, a general model that captures many topologies that have been proposed for peer-to-peer and social networks. In this model the nodes form a ring; for each node u we independently draw the set of distances along the ring from u to its "long-range contacts" from a fixed distribution P (the same for all and connect u to the corresponding nodes as well as its ring successor. We prove that, for any distribution P, in a graph with n nodes and an expected number of long-range contacts per node constructed in this fashion, the expected number of steps for greedy routing is Ω((log2n)/lalog*n), for some constant a 1. This improves an earlier lower bound of Ω((log2n)/llog log n) by Aspnes et al. and is very close to the upper bound of O((log2n)/l) achieved by greedy routing in Kleinberg's (one-dimensional) "small-world" networks, a particular instance of uniform ring-based random graphs.