The complexity of parallel search
Journal of Computer and System Sciences - 17th Annual ACM Symposium in the Theory of Computing, May 6-8, 1985
Accessing nearby copies of replicated objects in a distributed environment
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Spatial gossip and resource location protocols
STOC '01 Proceedings of the thirty-third 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
The Small-World Phenomenon: An Algorithmic Perspective
The Small-World Phenomenon: An Algorithmic Perspective
Building Low-Diameter P2P Networks
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience
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
On zone-balancing of peer-to-peer networks: analysis of random node join
Proceedings of the joint international conference on Measurement and modeling of computer systems
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
Compact routing on euclidian metrics
Proceedings of the twenty-third annual ACM symposium on Principles of distributed 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
On lifetime-based node failure and stochastic resilience of decentralized peer-to-peer networks
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Analyzing and characterizing small-world graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience
IEEE/ACM Transactions on Networking (TON)
Close to optimal decentralized routing in long-range contact networks
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Eclecticism shrinks even small worlds
Distributed Computing - Special issue: PODC 04
Universal augmentation schemes for network navigability: overcoming the √n-barrier
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
A doubling dimension threshold θ(loglogn) for augmented graph navigability
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
On the complexity of greedy routing in ring-based peer-to-peer networks
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
ACM Transactions on Algorithms (TALG)
On lifetime-based node failure and stochastic resilience of decentralized peer-to-peer networks
IEEE/ACM Transactions on Networking (TON)
Load-balancing performance of consistent hashing: asymptotic analysis of random node join
IEEE/ACM Transactions on Networking (TON)
Stochastic maintenance of overlays in structured P2P systems
Computer Communications
Polylogarithmic network navigability using compact metrics with small stretch
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Improving peer connectivity in wide-area overlays of virtual workstations
HPDC '08 Proceedings of the 17th international symposium on High performance distributed computing
Designing less-structured P2P systems for the expected high churn
IEEE/ACM Transactions on Networking (TON)
Recovering the Long-Range Links in Augmented Graphs
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
An analytical study of a structured overlay in the presence of dynamic membership
IEEE/ACM Transactions on Networking (TON)
P2P Networking and Applications
P2P Networking and Applications
Universal augmentation schemes for network navigability
Theoretical Computer Science
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)
Fault tolerance in distributed genetic algorithms with tree topologies
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
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
Improving the dependability of prefix-based routing in DHTs
OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems: CoopIS, DOA, ODBASE, GADA, and IS - Volume Part I
Tight bounds for blind search on the integers and the reals
Combinatorics, Probability and Computing
HyPeer: Structured overlay with flexible-choice routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
A Lower Bound for Network Navigability
SIAM Journal on Discrete Mathematics
Optimal path search in small worlds: dimension matters
Proceedings of the forty-third annual ACM symposium on Theory of computing
Near optimal routing in a small-world network with augmented local awareness
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
Greedy routing in tree-decomposed graphs
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Survive under high churn in structured P2P systems: evaluation and strategy
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part IV
A statistical theory of chord under churn
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
Know thy neighbor’s neighbor: better routing for skip-graphs and small worlds
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
Asymptotically optimal solutions for small world graphs
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Resilience and reliability analysis of P2P network systems
Operations Research Letters
Transparent VPN failure recovery with virtualization
Future Generation Computer Systems
| Hi-index | 0.00 |
We consider the problem of designing an overlay network and routing mechanism that permits finding resources efficiently in a peer-to-peer system. We argue that many existing approaches to this problem can be modeled as the construction of a random graph embedded in a metric space whose points represent resource identifiers, where the probability of a connection between two nodes depends only on the distance between them in the metric space. We study the performance of a peer-to-peer system where nodes are embedded at grid points in a simple metric space: a one-dimensional real line. We prove upper and lower bounds on the message complexity of locating particular resources in such a system, under a variety of assumptions about failures of either nodes or the connections between them. Our lower bounds in particular show that the use of inverse power-law distributions in routing, as suggested by Kleinberg [5], is close to optimal. We also give heuristics to efficiently maintain a network supporting efficient routing as nodes enter and leave the system. Finally, we give some experimental results that suggest promising directions for future work.