Know thy neighbor's neighbor: The power of lookahead in randomized P2P networks

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2004, Pages 54-63

  Manku, Gurmeet Singh ^a   Naor, Moni ^b   Wieder, Udi ^b  

^a STANFORD UNIVERSITY   (United States)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Greedy Routing; Peer to Peer Networks; Random Structures

Indexed keywords

ALGORITHMS; COMPUTER NETWORKS; DECISION MAKING; GRAPH THEORY; PERCOLATION (COMPUTER STORAGE); PROBABILITY DISTRIBUTIONS; PROBLEM SOLVING; RANDOM PROCESSES; ROUTERS; TELECOMMUNICATION NETWORKS;

GREEDY ROUTING; PEER TO PEER NETWORKS; PERCOLATION NETWORKS; RANDOM STRUCTURES;

COMPUTATIONAL COMPLEXITY;

EID: 4544382316     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (37)

1. I. Abraham, B. Awerbuch, Y. Azar. Y. Bartal, D. Malkhi, and E. Pavlov. A generic scheme for building overlay networks in adversarial scenarios. In Proc. Intl. Parallel and Distributed Processing Symposium (IPDPS 2003), Apr. 2003.
2. 2 percolation models. Communications in Mathematical Physics, 107:611-647, 1986.
3. J. Aspnes, Z. Diamadi, and G. Shah. Fault-tolerant routing in peer-to-peer systems. In Proc. 21st ACM Symp. on Principles of Distributed Computing (PODC 2002), pages 223-232, July 2002.
4. J. Aspnes and G. Shah. Skip graphs. In Proc. 14th ACM-SIAM Symp. on Discrete Algorithms (SODA 2003), pages 384-393, Jan. 2003.
5. A. L. Barabási. Linked: The New Science of Networks. Perseus Publishing. 2002.
6. L. Barrière, P. Fraigniaud, E. Kranakis, and D. Krizanc. Efficient routing in networks with long range contacts. In Proc. 15th Intl. Symp. on Distributed Computing (DISC 2001), pages 270-284, Oct. 2001.
7. I. Benjamini and N. Berger. The diameter of a longe-range percolation clusters on finite cycles. Random Structures and Algorithms, 19(2):102-111, 2001.
8. M. Castro, P. Druschel, Y. C. Hu, and A. I. T. Rowstron. Topology-aware routing in structured peer-to-peer overlay networks. In Proc. Intl. Workshop on Future Directions in Distrib. Computing (FuDiCo 2003), pages 103-107, 2003.
9. H. Chernoff. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Annals of Mathmernatical Statistics, 23:493-509, 1952.
10. D. Coppersmith. D. Gamarnik, and M. Sviridenko. The diameter of a longe-range percolation graph. Random Structures and Algorithms, 21(1):1-13, 2002.
11. P. S. Dodds, M. Roby, and D. J. Watts. An experimental study of search in global social networks. Science, 301:827-829, 2003.
12. P. Fraigniaud and P. Gauron. (brief announcement) An overview of the content-addressable network D2B. In Proc 22nd ACM Symposium on Principles of Distributed Computing (PODC 2003), pages 151-151, July 2003.
13. P. Fraigniaud, C. Gavoille, and C. Paul. Eclecticism shrinks the world. Technical Report LRI-1376, University Paris-Sud, November 2003.
14. P. Gariesan and G. S. Manku. Optimal routing in Chord. In Proc. 15th ACM-SIAM Symp. on Discrete Algorithms (SODA 2004), pages 169-178, Jan. 2004.
15. K. P. Gummadi, R. Gummadi, S. D. Gribble, S. Ratnasamy, S. Shenker, and I. Stoica. The impact of DHT routing geometry on resilience and proximity. In Proc. ACM SIGCOMM 2003, pages 381-394, 2003.
16. N. Harvey and J. I. Munro. (brief announcement) deterministic Skipnet. In Proc 22nd ACM Symposium on Principles of Distributed Computing (PODC 2003), pages 152-153, 2003.
17. N. J. A. Harvey, M. Jones, S. Saroiu, M. Theimer, and A. Wolman. Skipnet: A scalable overlay network with practical locality properties. In Proc. 4th USENIX Symposium on Internet Technologies and Systems (USITS 2003), 2003.
18. M. F. Kaashoek and D. R. Karger. Koorde: A simple degree-optimal hash table. In Proc. 2nd Intl. Workshop on Peer-to-Peer Systems (IPTPS 2003), pages 98-107, 2003.
19. J. Kleinberg. The small-world phenomenon: An algorithmic perspective. In Proc. Send ACM Symposium on Theory of Computing (STOC 2000), pages 163-170, 2000.
20. D. Loguinov, A. Kumar, V. Rai, and S. Ganesh, Graph-theoretic analysis of structured peer-to-peer systems: Routing distance and fault resilience. In Proc. ACM SIGCOMM 2003, pages 395-406, 2003.
21. D. Malkhi, M. Naor, and D. Ratajczak. Viceroy: A scalable and dynamic emulation of the butterfly. In Proc 21st ACM Symposium on Principles of Distributed Computing (PODC 2002), pages 183-192, 2002.
22. G. S. Manku. Routing networks for distributed hash tables. In Proc. 22nd ACM Symp. on Principles of Distributed Computing (PODC 2003), pages 133-142, July 2003.
23. G. S. Manku, M. Bawa, and P. Raghavan. Symphony: Distributed hashing in a small world. In Proc. 4th USENIX Symposium on Internet Technologies and Systems (USITS 2003), pages 127-140, 2003.
24. S. Milgram. The small world problem. Psychology Today, 67(1):60-67, May 1967.
25. M. Naor and U. Wieder. Novel architectures for P2P applications: The continuous-discrete approach. In Proc. 15th ACM Symp. on Parallelism in Algorithms and Architectures (SPAA 2003), pages 50-59, June 2003.
26. M. Naor and U. Wieder. Know thy neighbor's neighbor: Better routing for skip-graphs and small worlds. In The Third International Workshop on Peer-to-Peer Systems (IPTPS), 2004.
27. s percolation models: The existence of a transition for s ≤ 2. Communications in Mathematical Physics, 180:483-504, 1986.
28. M. E. J. Newman, D. J. Watts, and S. H. Strogatz, Random graph models of social networks. Proc. National Academy of Science, USA, 99 (suppl 1):2566-2572, 2002.
29. I. Pool and M. Kochen. Contacts and influence. Social Networks, 1:1-48, 1978.
30. W. Pugh. Skip lists: A probabilistic alternative to balanced trees. Communications of the ACM, 33(6):668-676. June 1990.
31. S. Ratnasamy, P. Francis, M. Handley, and R. M. Karp. A scalable Content-Addressable Network. In Proc. ACM SIGCOMM 2001, pages 161-172, 2001.
32. A. I. T. Rowstron and P. Druschel. Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In IFIP/ACM International Conference on Distributed Systems Platforms (Middleware 2001), pages 329-350, 2001.
33. L. S. Schulman. Long range percolation in one dimension. Journal of Physics A, 16(17):L639-L641, 1983.
34. I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Proc. ACM SIGCOMM 2001, pages 149-160, 2001.
35. D. Watts and S. Strogatz. Collective dynamics of small-world networks. Nature, pages 440-442, 1998.
36. H. Zhang, A. Goel, and R. Govindan. Incrementally improving lookup latency in distributed hash table systems. In ACM BIOMETRICS 2003, pages 114-125, June 2003.
37. B. Y. Zhao, L. Huang, J. Stribling, S. C. Rhea, A. D. Joseph, and J. D. Kubiatowicz. Tapestry: A resilient global-scale overlay for service deployment. IEEE Journal on Selected Areas in Communications, 22(1), Jan. 2004.