Gurmeet Singh Manku
Moni Naor
ABSTRACT
Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e. g., randomized hypercubes, randomized Chord, skip-graphs and constructions based upon small-world percolation networks. In each of these networks, a node has out-degree Θ(log n), where n denotes the total number of nodes, and greedy routing is known to take O(log n) hops on average. We establish lower-bounds for greedy routing for these networks, and analyze Neighbor-of-Neighbor (NoN)-greedy routing. The idea behind NoN, as the name suggests, is to take a neighbor's neighbors into account for making better routing decisions.The following picture emerges: Deterministic routing networks like hypercubes and Chord have diameter Θ(log n) and greedy routing is optimal. Randomized routing networks like randomized hypercubes, randomized Chord, and constructions based on small-world percolation networks, have diameter Θ(log n / log log n) with high probability. The expected diameter of Skip graphs is also Θ(log n / log log n). In all of these networks, greedy routing fails to find short routes, requiring Ω(log n) hops with high probability. Surprisingly, the NoN-greedy routing algorithm is able to diminish route-lengths to Θ(log n / log log n) hops, which is asymptotically optimal.
- 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. Google Scholar
Digital Library
- M. Aizenman and C. M. Newman. Discontinuity of the percolation density in one dimensional 1/|x-y|2 percolation models. Communications in Mathematical Physics, 107:611--647, 1986.Google Scholar
- 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. Google ScholarDigital Library
- J. Aspnes and G. Shah. Skip graphs. In Proc. 14th ACM-SIAM Symp. on Discrete Algorithms (SODA 2003), pages 384--393, Jan. 2003. Google ScholarDigital Library
- A. L. Barabasi. Linked: The New Science of Networks. Perseus Publishing, 2002. Google ScholarDigital Library
- L. Barriere, 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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.Google ScholarCross Ref
- H. Chernoff. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Annals of Mathmematical Statistics, 23:493--509, 1952.Google ScholarCross Ref
- D. Coppersmith, D. Gamarnik, and M. Sviridenko. The diameter of a longe-range percolation graph. Random Structures and Algorithms, 21(1):1--13, 2002. Google ScholarDigital Library
- P. S. Dodds, M. Roby, and D. J. Watts. An experimental study of search in global social networks. Science, 301:827--829, 2003.Google ScholarCross Ref
- 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. Google ScholarDigital Library
- P. Fraigniaud, C. Gavoille, and C. Paul. Eclecticism shrinks the world. Technical Report LRI-1376, University Paris-Sud, November 2003.Google Scholar
- P. Ganesan and G. S. Manku. Optimal routing in Chord. In Proc. 15th ACM-SIAM Symp. on Discrete Algorithms (SODA 2004), pages 169--178, Jan. 2004. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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.Google ScholarCross Ref
- J. Kleinberg. The small-world phenomenon: An algorithmic perspective. In Proc. 32nd ACM Symposium on Theory of Computing (STOC 2000), pages 163--170, 2000. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- S. Milgram. The small world problem. Psychology Today, 67(1):60--67, May 1967.Google Scholar
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- C. M. Newman and L. S. Schulman. One dimensional 1/|j-i|s percolation models: The existence of a transition for $sleq 2$. Communications in Mathematical Physics, 180:483--504, 1986.Google Scholar
- 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.Google ScholarCross Ref
- I. Pool and M. Kochen. Contacts and influence. Social Networks, 1:1--48, 1978.Google ScholarCross Ref
- W. Pugh. Skip lists: A probabilistic alternative to balanced trees. Communications of the ACM, 33(6):668--676, June 1990. Google ScholarDigital Library
- S. Ratnasamy, P. Francis, M. Handley, and R. M. Karp. A scalable Content-Addressable Network. In Proc. ACM SIGCOMM 2001, pages 161--172, 2001. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- L. S. Schulman. Long range percolation in one dimension. Journal of Physics A, 16(17):L639--L641, 1983.Google ScholarCross Ref
- 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. Google ScholarDigital Library
- D. Watts and S. Strogatz. Collective dynamics of small-world networks. Nature, pages 440--442, 1998.Google Scholar
- H. Zhang, A. Goel, and R. Govindan. Incrementally improving lookup latency in distributed hash table systems. In ACM SIGMETRICS 2003, pages 114--125, June 2003. Google ScholarDigital Library
- 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. Google ScholarDigital Library
Index Terms
- Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks
Recommendations
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 SystemsWe investigate an approach for routing in p2p networks called neighbor-of-neighbor greedy. We show that this approach may reduce significantly the number of hops used, when routing in skip graphs and small worlds. Furthermore we show that a simple ...
Randomized Approximate Nearest Neighbor Search with Limited Adaptivity
Special Issue on SPAA 2016We study the complexity of parallel data structures for approximate nearest neighbor search in d-dimensional Hamming space {0,1}d. A classic model for static data structures is the cell-probe model [27]. We consider a cell-probe model with limited ...
Randomized Approximate Nearest Neighbor Search with Limited Adaptivity
SPAA '16: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and ArchitecturesWe study the problem of approximate nearest neighbor search in $d$-dimensional Hamming space {0,1}d. We study the complexity of the problem in the famous cell-probe model, a classic model for data structures. We consider algorithms in the cell-probe ...
Comments