Know thy neighbor's neighbor: Better routing for skip-graphs and small worlds

Lecture Notes in Computer Science

Volumn 3279, Issue , 2004, Pages 269-277

  Naor, Moni ^a   Wieder, Udi ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMMUNICATION SYSTEMS; COMPUTER GRAPHICS;

GREEDY ALGORITHMS; GREEDY ROUTING; NEIGHBOR-OF-NEIGHBOR GREEDY; SKIP-GRAPHS;

ROUTERS;

EID: 23944472654     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. James Aspnes, Zoe Diamadi, and Gauri Shah. Fault-tolerant routing in peer-to-peer systems. In Proceedings of the twenty-first symposium on Principles of distributed computing (PODC), pages 223-232, 2002.
2. James Aspnes and Gauri Shah. Skip graphs. In fourteenth ACM SIAM Symposium on Discrete Algorithms (SODA), pages 384-393, 2003.
3. Don Coppersmith, David Gamarnik, and Maxim Sviridenko. The diameter of a long-range percolation graph. Random Structures and Algorithms, 21(1):1-13, 2002.
4. Pierre Fraigniaud and Philippe Gauron. The content-addressable network d2b. Technical Report LRI 1349, Univ. Paris-Sud, 2003.
5. Prasanna Ganesan and Gurmeet Singh Manku. Optimal routing in chord. In fifteenth ACM SIAM Symposium on Discrete Algorithms (SODA), 2004.
6. Nicholas Harvey, John Dunagan, Michael B. Jones, Stefan Saroiu, Marvin Theimer, and Alec Wolman. Skipnet: A scalable overlay network with practical locality properties. In 4th USENIX Symposium on Internet Technologies and Systems, (USITS), 2003.
7. Nicholas Harvey and J. Ian Munro. Deterministic skipnet. In Twenty Second Annual ACM Syposium on Priciples of Distributed Computing (PODC), pages 152-153, 2003.
8. Frans Kaashoek and David R. Karger. Koorde: A simple degree-optimal distributed hash table. In Second International Workshop on Peer-to-peer Systems IPTPS, 2003.
9. Jon Kleinberg. The Small-World phenomenon: An algorithmic perspective. In Proceedings of the 32nd ACM Symposium on Theory of Computing (STOC), 2000.
10. Gurmeet Singh Manku, Mayank Bawa, and Prabhakar Raghavan. Symphony: Distributed hashing in a small world. In 4th USENIX Symposium on Internet Technologies and Systems, (USITS), 2003.
11. Gurmeet Singh Manku, Moni Naor, and Udi Wieder. Know thy neighbor's neighbor: the power of lookahead in randomized p2p networks. In STOC, 2004.
12. Yaron Minsky and Ari Trachtenberg. Practical set reconciliation. Technical Report 2002-03., Boston University, 2002.
13. Moni Naor and Udi Wieder. Novel architectures for p2p applications: the continuous-discrete approach. In Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures SPAA, pages 50-59, 2003.
14. Antony Rowstron and Peter Druschel. Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. Lecture Notes in Computer Science, 2218:329-350, 2001.
15. Ion Stoica, Robert Morris, David Karger, Frans Kaashoek, and Frank Dabek Hari Balakrishnan. Chord: A scalable Peer-To-Peer lookup service for internet applications. Technical Report TR-819, MIT LCS, 2001.
16. Ben Y. Zhao, John D. Kubiatowicz, and Anthony D. Joseph. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report UCB/CSD-01-1141, UC Berkeley, April 2001.