Fault-tolerant routing in peer-to-peer systems

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2002, Pages 223-232

  Aspnes, James ^a   Diamadi, Zoë ^a   Shah, Gauri ^a  

^a YALE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; FAULT TOLERANT COMPUTER SYSTEMS; FUNCTIONS; MARKOV PROCESSES; PERFORMANCE; PROBABILITY; THEOREM PROVING;

FAULT TOLERANT ROUTING; PEER TO PEER SYSTEMS; RANDOM GRAPH; ROUTING MECHANISM;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0036957187     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/571860.571862     Document Type: Conference Paper

References (13)

1. GNUTELLA. http://gnutella.wego.com.
2. A. D. Joseph, J. Kubiatowicz, and B. Y. Zhao. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report UCB/CSD-01-1141, University of California, Berkeley, Apr 2001.
3. R. M. Karp, E. Upfa, and A. Wigderson. The complexity of parallel search. Journal of Computer and System Sciences, 36(2):225-253, 1988.
4. D. Kempe, J. M. Kleinberg, and A. J. Demers, Spatial gossip and resource location protocols. In Proceedings of 33rd Annual ACM Symposium on Theory of Computing, pages 163-172, 2001.
5. J. Kleinberg. The small-world phenomenon:an algorithmic perspective. Technical Report 99-1776, Cornell University, Oct. 1999.
6. J. Kleinberg. Small-world phenomena and the dynamics of information. 2001.
7. MORPHEUS. http://www.musiccity.com.
8. NAPSTER. http://www.napster.com.
9. G. Panduragan, P. Raghavan, and E. Upfal. Building low-diameter P2P networks. In Proceedings of 42nd Annual IEEE Symposium on the Foundations of Computer Science (FOCS), 2001.
10. C. Plaxton, R. Rajaram, and A. W. Richa. Accessing nearby copies of replicated objects in a distributed environment. In Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), June 1997.
11. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable content-addressable network. In Proceedings of the ACM SIGCOMM, pages 161-170, 2001.
12. I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishna. Chord: A scalable peer-to-peer lookup service for internet applications. In Proceedings of SIGCOMM 2001, pages 149-160, 2001.
13. L. Valiant. A scheme for fast parallel communication. SIAM Journal on Computing, 11:350-361, 1982.