Tight lower bounds for greedy routing in uniform small world rings
Open Access
- 31 May 2009
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 591-600
Abstract
No abstract availableKeywords
All Related Versions
This publication has 11 references indexed in Scilit:
- On the complexity of greedy routing in ring-based peer-to-peer networks2007
- Universal augmentation schemes for network navigability2007
- Algorithmic analysis of a basic evolutionary algorithm for continuous optimizationTheoretical Computer Science, 2007
- Asymptotically Optimal Solutions for Small World GraphsLecture Notes in Computer Science, 2005
- On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks2004
- The impact of DHT routing geometry on resilience and proximity2003
- Chord: a scalable peer-to-peer lookup protocol for internet applicationsIEEE/ACM Transactions on Networking, 2003
- Fault-tolerant routing in peer-to-peer systems2002
- Navigation in a small worldNature, 2000
- Collective dynamics of ‘small-world’ networksNature, 1998