The effect of peer selection and buffering strategies on the performance of peer-to-peer file sharing systems

Proceedings - IEEE Computer Society's Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, MASCOTS

Volumn 2002-January, Issue , 2002, Pages 63-70

  Zou, Li ^a   Zegura, E W ^a   Ammar, M H ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; ELECTRONIC DOCUMENT EXCHANGE; INFORMATION RETRIEVAL; NETWORK LAYERS; OVERLAY NETWORKS; ROUTERS;

APPLICATION LAYER OVERLAY; CONTENT DISCOVERIES; DISTRIBUTED APPLICATIONS; INTERNET APPLICATION; PEER-TO-PEER FILE SHARING; PEER-TO-PEER FILE SHARING SYSTEMS; PEER-TO-PEER FILE-SHARING APPLICATIONS; PEER-TO-PEER SYSTEM;

PEER TO PEER NETWORKS;

EID: 70349658944     PISSN: 15267539     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/MASCOT.2002.1167061     Document Type: Conference Paper

References (15)

1. Napster. http://www.napster.com.
2. Gnutella. http://gnutella.wego.com.
3. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, "A scalable content-addressable network," in Proceedings of the ACM SIGCOMM 2001 Conference, August 2001.
4. I. Stoica, R. Morris, D. Karger, M. Kaashoek, and H. Balakrishnan, "Chord: A scalable peer-to-peer lookup service for Internet applications," in Proceedings of the ACM SIGCOMM 2001 Conference, August 2001.
5. B. Y. Zhao, J. D. Kubiatowicz, and A. D. Joseph, "Tapestry: An infrastructure for fault-tolerant wide-area location and routing," Tech. Rep. UCB//CSD-01-1141, U. C. Berkeley, April 2000.
6. A. Rowstron and P. Druschel, "Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems," Lecture Notes in Computer Science, vol. 2218, p. 329, 2001.
7. C. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker, "Search and replication in unstructured peer-to-peer networks," in Proceedings of the 16th ACM International Conference on Supercomputing, June 2002.
8. R. L. Carter and M. E. Crovella, "Dynamic server selection using bandwidth probing in wide-area networks," in Proceedings of the IEEE INFOCOM 1997 Conference, March 1997.
9. A. Myers, P. Dinda, and H. Zhang, "Performance characteristics of mirror servers on the Internet," in Proceedings of the IEEE INFOCOM 1999 Conference, March 1999.
10. D. Bertsekas and R. Gallager, Data Networks. Prentice Hall, second ed., 1992.
11. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms. The MIT Press, 1990.
12. L. Zou, E. Zegura, and M. Ammar, "The effect of peer selection and buffering strategies on the performance of peer-to-peer file sharing systems," tech. rep., Georgia Institute of Technology, 2002.
13. S. Saroiu, P. K. Gummadi, and S. D. Gribble, "A measurement study of peer-to-peer file sharing systems," Tech. Rep. UW-CSE-01-06-02, University of Washington, 2002.
14. K. Calvert, M. Doar, and E. W. Zegura, "Modeling Internet topology," IEEE Communications Magazine, June 1997.
15. L. Breslau, P. Cao, L. Fan, G. Phillips, and S. Shenker, "Web caching and zipf-like distributions: Evidence and implications," in Proceedings of the IEEE INFOCOM 1999 Conference, pp. 126-134, 1999.