Relying on randomness PlanetLab experiments with distributed file-sharing protocols

In this paper we present and evaluate a fully distributed file-sharing system architecture. Initially, a seeder node splits a large file into moderate-sized chunks and offers it for download. The seeder and all peers interested in downloading the file join a Chord-based overlay and contact each other randomly for chunk transfers. We report and discuss PlanetLab tests on this system as well as on our modified Chord implementation which it is based on. We give an algorithm for finding uniformly random peers in the overlay and another for estimating the distribution of chunk copies. Both algorithms turn out to have a significant effect on the performance, the first one in particular.

[1]  John Kubiatowicz,et al.  Handling churn in a DHT , 2004 .

[2]  Gideon Weiss,et al.  Analysis of peer-to-peer file dissemination , 2006, PERV.

[3]  David E. Culler,et al.  PlanetLab: an overlay testbed for broad-coverage services , 2003, CCRV.

[4]  Charles P. Fry,et al.  Really Truly Trackerless BitTorrent , 2006 .

[5]  Laurent Massoulié,et al.  Coupon replication systems , 2008, TNET.

[6]  R. Srikant,et al.  Modeling and performance analysis of BitTorrent-like peer-to-peer networks , 2004, SIGCOMM '04.

[7]  Paul Francis,et al.  On Heterogeneous Overlay Construction and Random Node Selection in Unstructured P2P Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[8]  Venkata N. Padmanabhan,et al.  Analyzing and Improving a BitTorrent Networks Performance Mechanisms , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[9]  Dirk Staehle,et al.  On the stability of chord-based P2P systems , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..

[10]  Rodrigo Rodrigues,et al.  High Availability in DHTs: Erasure Coding vs. Replication , 2005, IPTPS.

[11]  A. Binzenhofer,et al.  Analyzing and modifying Chord's stabilization algorithm to handle high churn rates , 2005, 2005 13th IEEE International Conference on Networks Jointly held with the 2005 IEEE 7th Malaysia International Conf on Communic.

[12]  Keith W. Ross,et al.  Multiclass P2P networks: Static resource allocation for service differentiation and bandwidth diversity , 2005, Perform. Evaluation.

[13]  Pascal Felber,et al.  Cooperative Content Distribution: Scalability Through Self-Organization , 2005, Self-star Properties in Complex Information Systems.

[14]  I. Norros,et al.  Flash crowd in a file sharing system based on random encounters , 2006 .

[15]  David R. Karger,et al.  Chord: a scalable peer-to-peer lookup protocol for internet applications , 2003, TNET.

[16]  Dejan Kostic,et al.  Scalability and accuracy in a large-scale network emulator , 2002, CCRV.

[17]  Christos Gkantsidis,et al.  Network coding for large scale content distribution , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[18]  John Kubiatowicz,et al.  ChunkCast: An Anycast Service for Large Content Distribution , 2006, IPTPS.

[19]  Gerald Kunzmann,et al.  A scalable algorithm to monitor chord-based P2P systems at runtime , 2006, IPDPS.

[20]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[21]  Ben Y. Zhao,et al.  OceanStore: an architecture for global-scale persistent storage , 2000, SIGP.

[22]  Ilkka Norros,et al.  On Uncoordinated File Distribution with Non-altruistic Downloaders , 2007, International Teletraffic Congress.

[23]  Brighten Godfrey,et al.  OpenDHT: a public DHT service and its uses , 2005, SIGCOMM '05.

[24]  Kyung-Yong Chwa,et al.  Multiple message broadcasting in communication networks , 1995, Networks.