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.
Type:
Conférence
City:
Cambridge
Date:
2009-07-09
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.
See also:
