Skip to Main content Skip to Navigation
Conference papers

Live seeding: Performance bounds of seeders for P2P live streaming

Fabien Mathieu 1, 2
1 GANG - Networks, Graphs and Algorithms
LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications, Inria Paris-Rocquencourt
Abstract : Seeders (peers that do not request anything hut contribute to the system) allow to leverage the capacities of a P2P system. While seeding is a natural idea for fllesharing or Video-on-Demand applications, it seems somehow counter-intuitive in the context of live streaming. This paper aims at describing the feasibility and performance of P2P live seeding. After a formal definition of "live seeding" and efficiency, we consider the theoretical performance of systems where the overhead is neglected. We then propose a realistic overhead model and extend the results for this model. The performance of a single seeder and a set of seeders are considered, as it is not always possible to perfectly aggregate individual efficiencies. In details, we provide an explicit upper bound of seeders' achievable efficiency in a P2P system with linear overhead. We also propose and study two simple mechanisms that allow to deploy a live seeding architecture while handling seeders aggregation, providing near-optimal seeding.
Document type :
Conference papers
Complete list of metadata

Cited literature [6 references]  Display  Hide  Download
Contributor : Fabien Mathieu Connect in order to contact the contributor
Submitted on : Tuesday, February 7, 2012 - 4:25:20 PM
Last modification on : Friday, January 21, 2022 - 3:14:02 AM
Long-term archiving on: : Tuesday, May 8, 2012 - 2:37:44 AM


Files produced by the author(s)



Fabien Mathieu. Live seeding: Performance bounds of seeders for P2P live streaming. P2P'11 - International Conference on Peer-to-Peer Computing, Aug 2011, Kyoto, Japan. pp.172 -181, ⟨10.1109/P2P.2011.6038733⟩. ⟨hal-00667457⟩



Les métriques sont temporairement indisponibles