Know Thy Neighbor's Neighbor: Better Routing for Skip-Graphs and Small Worlds

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 routing in skip graphs and small worlds. Furthermore we show that a simple variation of Chord is degree optimal. Our algorithm is implemented on top of the conventional greedy algorithms, thus it maintains the good properties of greedy routing. Implementing it may only improve the performance of the system.

• Type: Conference
• Year: 2004
• Where: IPTPS
• Authors: Moni Naor, Udi Wieder
• Keywords: Conventional Greedy Algorithms, IPTPS 2004, Neighbor-of-neighbor Greedy, Routing