Back to Search Start Over

Diffusion épidémique de chunks en quasi-direct : la taille compte

Diffusion épidémique de chunks en quasi-direct : la taille compte

Authors :
Hegde, Nidhi
Mathieu, Fabien
Perino, Diego
Orange Labs [Issy les Moulineaux]
France Télécom
Networks, Graphs and Algorithms (GANG)
Laboratoire d'informatique Algorithmique : Fondements et Applications (LIAFA)
Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS)-Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS)-Inria Paris-Rocquencourt
Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)
Chaintreau
Augustin and Magnien
Clemence
Source :
Algotel, Algotel, 2009, Carry-Le-Rouet, France
Publication Year :
2009
Publisher :
HAL CCSD, 2009.

Abstract

International audience; Peer-to-peer (P2P) applications, including P2P live streaming, have become very popular in the past few years. A key issue for live streaming concerns whether the delay and quality requirements can be met by a P2P protocol. In most cases, a live streaming algorithm splits the stream into atomic units of data called chunks. We investigate the impact of parameters like the chunk size, receiver buffer size, number of peers to probe, etc. We show that there exists a suitable range of chunk sizes, where the specific choice of the chunk size ultimately depends on the desired delay/loss trade-off. A fine tuning of the number of peers to probe and the number of simultaneous chunks can also increase the performance.

Details

Language :
English
Database :
OpenAIRE
Journal :
Algotel, Algotel, 2009, Carry-Le-Rouet, France
Accession number :
edsair.dedup.wf.001..2e34f4e94db77ffabfbb9a91a805421b