MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Know thy Neighbor's Neighbor: the Power of Lookahead in Randomized P2P Networks (2004) [58 citations — 5 self]

by Gurmeet Singh Manku ,  Moni Naor ,  Udi Wieder
In Proceedings of the 36th ACM Symposium on Theory of Computing (STOC
Add To MetaCart

Abstract:

Several peer-to-peer networks are based upon randomized graph topologies that permit e#cient 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.

Citations

2394 Chord: A scalable peer-to-peer lookup service for Internet applications – Stoica, Morris, et al. - 2001
1950 A scalable Content-Addressable Network – Ratnasamy, Francis, et al. - 2001
855 Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems – Rowstron, Druschel - 2001
463 A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations – Chernoff - 1952
401 The Small World Problem – Milgram - 1967
337 The small world phenomenon: an algorithmic perspective – Kleinberg - 1999
313 Collective dynamics of small-world networks. Nature, 393:440–442 – Watts, Strogatz - 1998
279 Tapestry: A resilient global-scale overlay for service deployment – Zhao, Huang, et al. - 2004
232 Viceroy: A scalable and dynamic emulation of the butterfly – Malkhi, Naor, et al. - 2002
221 Topologyaware routing in structured peer-to-peer overlay networks – Castro, Druschel, et al. - 2002
218 Skip Lists: A Probabilistic Alternative to Balanced Trees – Pugh - 1989
203 SkipNet: A scalable overlay network with practical locality properties – Harvey, Jones, et al. - 2003
182 The impact of DHT routing geometry on resilience and proximity – Gummadi, Gummadi, et al. - 2003
175 Linked: A New Science of Networks – Barabasi - 2002
158 Skip graphs – Aspnes, Shah - 2003
119 Symphony: Distributed hashing in a small world – Manku, Bawa, et al. - 2003
119 Novel architectures for P2P applications: The continuous-discrete approach – Naor, Wieder - 2003
77 Koorde: A simple degree-optimal hash table – Kaashoek, Karger - 2003
75 Graph-theoretic analysis of structured peer-to-peer systems: Routing distance and fault resilience – Loguinov, Kumar, et al. - 2003
61 Random graph models of social networks – Newman, Watts, et al.
57 Efficient routing in networks with long range contacts – Barriere, Fraigniaud, et al. - 2001
41 Fault-Tolerant Routing in Peer-to-Peer Systems – Aspnes, Dimadi, et al. - 2002
41 An experimental study of search in global social networks – Dodds, Muhamad, et al. - 2003
39 A generic scheme for building overlay networks in adversarial scenarios – Abraham, Awerbuch, et al. - 2003
37 Routing networks for distributed hash tables – Manku - 2003
31 Contacts and Influence – Pool, Kochen - 1978
27 Incrementally improving lookup latency in distributed hash table systems – Zhang, Goel, et al. - 2003
21 Optimal routing in Chord – Ganesan, Manku - 2004
13 Know thy neighbor’s neighbor: Better routing in skip-graphs and small worlds – Naor, Wieder - 2004
10 C.M: "Discontinuity of the Percolation Density in One Dimensional 1=(x \Gamma y)2 Percolation Models – Aizenman, Newman - 1986
9 One dimensional 1/|j − i| s percolation models: The existence of a transition for s ≤ 2 – Newman, Schulman - 1986
6 Eclecticism shrinks the world – Fraigniaud, Gavoille, et al. - 2003
6 Long-range percolation in one dimension – Schulman - 1983
4 Brief announcement: an overview of the content-addressable network D2B – Fraigniaud, Gauron - 2003
4 Brief Announcement: Deterministic SkipNet – Harvey, Munro - 2003
1 The diameter of a longe-range percolation clusters on finite cycles. Random Structures and Algorithms – Benjamini, Berger - 2001
1 The diameter of a longe-range percolation graph. Random Structures and Algorithms – Coppersmith, Gamarnik, et al.
View or Download | Add to My Collection | Correct Errors