Optimal Routing in Chord

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 169-178

  Ganesan, Prasanna ^a   Manku, Gurmeet Singh ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SCIENCE; CONFORMAL MAPPING; ENCODING (SYMBOLS); INTEGER PROGRAMMING; MATHEMATICAL MODELS; NETWORK COMPONENTS; PROBABILITY; THEOREM PROVING;

CHORD TOPOLOGY; COMBINATORIAL STRUCTURES;

GRAPH THEORY;

EID: 1842473618     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (2)

1. I. Stoica, R. Morris, D. Liben-Lowell, D. R. Karger, M. F. Kaashoek, F. Dabek and H. Balakrishnan, Chord: A Scalable Peer-to-peer Lookup Protocol for Internet Applications, IEEE/ACM Transactions on Networking, Vol. 11, No. 1 (2003), pp. 17-32.
2. J. E. Hopcroft, R. Motwani and J. D. Ullman, Introduction to Automata Theory, Languages and Computation (2nd Ed.), Pearson Addison Wesley, (2000), pp. 1-521.