Seed Scheduling for Peer-to-Peer Networks

The initial phase in a content distribution (filesharing) scenario is delicate due to the lack of global knowledge and the dynamics of the overlay. An unwise distribution of the pieces in this phase can cause delays in reaching steady state, thus increasing file download times. We devise a scheduling algorithm at the seed (source peer with full content), based on a proportional fair approach, and we implement it on a real file sharing client. In dynamic overlays, our solution improves by up to 25% the average downloading time of a standard protocol ala BitTorrent.

[1]  Gustavo de Veciana,et al.  Service capacity of peer to peer networks , 2004, IEEE INFOCOM 2004.

[2]  Philip A. Whiting,et al.  Convergence of proportional-fair sharing algorithms under general conditions , 2004, IEEE Transactions on Wireless Communications.

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

[4]  William Chan,et al.  Improving Traffic Locality in BitTorrent via Biased Neighbor Selection , 2006, 26th IEEE International Conference on Distributed Computing Systems (ICDCS'06).

[5]  Arun Venkataramani,et al.  Do incentives build robustness in bit torrent , 2007 .

[6]  Gustavo de Veciana,et al.  Performance of peer-to-peer networks: Service capacity and role of resource sharing policies , 2006, Perform. Evaluation.

[7]  Biplab Sikdar,et al.  Modeling Seed Scheduling Strategies in BitTorrent , 2007, Networking.

[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]  Bobby Bhattacharjee,et al.  Bittorrent is an auction: analyzing and improving bittorrent's incentives , 2008, SIGCOMM '08.

[10]  Fabien Mathieu,et al.  Missing Piece Issue and Upload Strategies in Flashcrowds and P2P-assisted Filesharing , 2006, Advanced Int'l Conference on Telecommunications and Int'l Conference on Internet and Web Applications and Services (AICT-ICIW'06).

[11]  Nael B. Abu-Ghazaleh,et al.  GPS: a general peer-to-peer simulator and its use for modeling BitTorrent , 2005, 13th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems.

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

[13]  H. Burkill,et al.  A second course in mathematical analysis , 1970 .

[14]  Gideon Weiss,et al.  Optimal scheduling of peer-to-peer file dissemination , 2006, J. Sched..

[15]  Brighten Godfrey,et al.  Minimizing churn in distributed systems , 2006, SIGCOMM.

[16]  B. Cohen,et al.  Incentives Build Robustness in Bit-Torrent , 2003 .

[17]  Mikel Izal,et al.  Dissecting BitTorrent: Five Months in a Torrent's Lifetime , 2004, PAM.

[18]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[19]  Pietro Michiardi,et al.  On the Impact of Greedy Strategies in BitTorrent Networks: The Case of BitTyrant , 2008, 2008 Eighth International Conference on Peer-to-Peer Computing.

[20]  Klaus Dohmen.  Improved Bonferroni inequalities via abstract tubes , 2003 .