Observations on the dynamic evolution of peer-to-peer networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2429, Issue , 2002, Pages 22-33

  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

BANDWIDTH; DISTRIBUTED COMPUTER SYSTEMS;

CHORD PEER TO PEER PROTOCOL; CONCURRENT NODES; DYNAMIC EVOLUTION; INFINITE TIME; INITIAL CONDITIONS; NEAR-OPTIMAL; PEER-TO-PEER SYSTEM; PERFORMANCE MEASURE;

PEER TO PEER NETWORKS;

EID: 47949110777     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45748-8_2     Document Type: Conference Paper

References (8)

1. BALAKRISHNAN, H., KARGER, D. R., AND LIBEN-NOWELL, D. Analysis of the evolution of peer-to-peer systems. In Proc. PODC 2002. To appear.
2. FIAT, A., AND SAIA, J. Censorship resistant peer-to-peer content addressable networks. In Proc. SODA 2001.
3. PANDURANGAN, G., RAGHAVAN, P., AND UPFAL, E. Building low-diameter peerto-peer networks. In Proc. FOCS 2001.
4. RATNASAMY, S., FRANCIS, P., HANDLEY, M., KARP, R., AND SHENKER, S. A scalable content-addressable network. In Proc. SIGCOMM 2001.
5. ROWSTRON, A., AND DRUSCHEL, P. Pastry: Scalable, distributed object location and routing for large-s cale peer-to-peer systems. In Proc. Middleware 2001.
6. SAIA, J., FIAT, A., GRIBBLE, S., KARLIN, A. R., AND SAROIU, S. Dynamically fault-tolerant content addressable networks. This volume.
7. 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.
8. 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.