Graduate School and Research Center in Digital Sciences

Seed scheduling for peer-to-peer networks

Esposito, Flavio; Matta,Ibrahim; Michiardi, Pietro; Nobuyuki, Mitsutake; Carra, Damiano

NCA 2009, 8th IEEE International Symposium on Network Computing and Applications, July 9-11, 2009, Cambridge, MA USA

The initial phase in a content distribution (file sharing) 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 [1]. In dynamic overlays, our solution improves by up to 25% the average downloading time of a standard protocol ala BitTorrent.

Document Doi Bibtex

Title:Seed scheduling for peer-to-peer networks
Department:Data Science
Eurecom ref:2736
Copyright: © 2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Bibtex: @inproceedings{EURECOM+2736, doi = { }, year = {2009}, title = {{S}eed scheduling for peer-to-peer networks}, author = {{E}sposito, {F}lavio and {M}atta,{I}brahim and {M}ichiardi, {P}ietro and {N}obuyuki, {M}itsutake and {C}arra, {D}amiano}, booktitle = {{NCA} 2009, 8th {IEEE} {I}nternational {S}ymposium on {N}etwork {C}omputing and {A}pplications, {J}uly 9-11, 2009, {C}ambridge, {MA} {USA}}, address = {{C}ambridge, {UNITED} {STATES}}, month = {07}, url = {} }
See also: