Analysis of the evolution of peer-to-peer systems

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2002, Pages 233-242

  Liben Nowell, David ^a   Balakrishnan, Hari ^a   Karger, David ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL MODELS; NETWORK PROTOCOLS; PERFORMANCE; SERVERS; SYSTEMS ANALYSIS; THEOREM PROVING;

LOGARITHMIC FACTOR; PEER TO PEER SYSTEMS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0036957999     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/571860.571863     Document Type: Conference Paper

References (14)

1. Dabek, F., Brunskill, E., Kaashoek, M. F., Karger, D., Morris, R., Stoica, I., and Balakrishnan, H. Building peer-to-peer systems with Chord, a distributed location service. In Proc. IEEE Workshop on Hot Topics in Operating Systems (HotOS-VIII) (2001).
2. Dabek, F., Kaashoek, M. F., Karger, D., Morris, R., and Stoica, I. Wide-area cooperative storage with CFS. In Proc. SOSP (2001).
3. Druschel, P., and Rowstron, A. Past: Persistent and anonymous storage in a peer-to-peer networking environment. In Proceedings of the 8th IEEE Workshop on Hot Topics in Operating Systems (HotOS-VIII) (2001), pp. 65-70.
4. Fiat, A., and Saia, J. Censorship resistant peer-to-peer content addressable networks. In Proc. SODA (2002).
5. Karger, D., Lehman, E., Leighton, F., Levine, M., Lewin, D., and Panigrahy, R. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web. In Proc. STOC (1997).
6. Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., Wells, C., and Zhao, B. OceanStore: An architecture for global-scale persistent storage. In Proc. ASPLOS (2000).
7. Lewin, D. Consistent hashing and random trees: Algorithms for caching in distributed networks. Master's thesis, Department of EECS, MIT, 1998. Available at the MIT Library, http://thesis.mit.edu/.
8. Pandurangan, G., Raghavan, P., and Upfal, E. Building low-diameter P2P networks. In Proc. FOCS (2001).
9. Plaxton, C., Rajaraman, R., and Richa, A. Accessing nearby copies of replicated objects in a distributed environment. In Proc. SPAA (1997).
10. Ratnasamy, S., Francis, P., Handley, M., Karp, R., and Shenker, S. A scalable content-addressable network. In Proc. SIGCOMM (2001).
11. Saia, J., Fiat, A., Gribble, S., Karlin, A. R., and Saroiu, S. Dynamically fault-tolerant content addressable networks. In Proc. IPTPS (2002).
12. Stoica, I., Morris, R., Karger, D., Kaashoek, M. F., and Balakrishnan, H. Chord: A scalable peer-to-peer lookup service for internet applications. In Proc. SIGCOMM (2001).
13. Stoica, I., Morris, R., Liben-Nowell, D., Karger, D., Kaashoek, M. F., Dabek, F., and Balakrishnan, H. Chord: A scalable peer-to-peer lookup service for internet applications. Tech. Rep TR-819, MIT LCS, 2001. http://www.pdos.lcs.mit.edu/chord/papers/.
14. Zhao, B., Kubiatowicz, J., and Joseph, A. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Tech. Rep. UCB/CSD-01-1141, Computer Science Division, U. C. Berkeley, Apr. 2001.