Know thy Neighbor's Neighbor: the Power of Lookahead in Randomized P2P Networks (2004)
Cached
Download Links
- [www.wisdom.weizmann.ac.il]
- [www.wisdom.weizmann.ac.il]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proceedings of the 36th ACM Symposium on Theory of Computing (STOC |
| Citations: | 71 - 5 self |
BibTeX
@INPROCEEDINGS{Manku04knowthy,
author = {Gurmeet Singh Manku and Moni Naor and Udi Wieder},
title = {Know thy Neighbor's Neighbor: the Power of Lookahead in Randomized P2P Networks},
booktitle = {In Proceedings of the 36th ACM Symposium on Theory of Computing (STOC},
year = {2004},
pages = {54--63}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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.
