2 search results - page 1 / 1 » Know Thy Neighbor's Neighbor: Better Routing for Skip-Graphs... |
IPTPS
2004
Springer
13 years 10 months ago
2004
Springer
We 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 routi...
STOC
2004
ACM
13 years 10 months ago
2004
ACM
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 const...