Sciweavers

SODA
2004
ACM

Optimal routing in Chord

13 years 5 months ago
Optimal routing in Chord
We propose optimal routing algorithms for Chord [1], a popular topology for routing in peer-to-peer networks. Chord is an undirected graph on 2b nodes arranged in a circle, with edges connecting pairs of nodes that are 2k positions apart for any k 0. The standard Chord routing algorithm uses edges in only one direction. Our algorithms exploit the bidirectionality of edges for optimality. At the heart of the new protocols lie algorithms for writing a positive integer d as the difference of two non-negative integers d and d such that the total number of 1-bits in the binary representation of d and d is minimized. Given that Chord is a variant of the hypercube, the optimal routes possess a surprising combinatorial structure.
Prasanna Ganesan, Gurmeet Singh Manku
Added 31 Oct 2010
Updated 31 Oct 2010
Type Conference
Year 2004
Where SODA
Authors Prasanna Ganesan, Gurmeet Singh Manku
Comments (0)