Achievable Catalog Size in Peer-to-Peer Video-on-Demand Systems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2008

Achievable Catalog Size in Peer-to-Peer Video-on-Demand Systems


We analyze a system where $n$ set-top boxes with same upload and storage capacities collaborate to serve $r$ videos simultaneously (a typical value is $r=n$). We give upper and lower bounds on the catalog size of the system, i.e. the maximal number of distinct videos that can be stored in such a system so that any demand of at most $r$ videos can be served. Besides $r/n$, the catalog size is constrained by the storage capacity, the upload capacity, and the maximum number of simultaneous connections a box can open. We show that the achievable catalog size drastically increases when the upload capacity of the boxes becomes strictly greater than the playback rate of videos.
Fichier principal
Vignette du fichier
iptps2008.pdf (103.86 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00471724 , version 1 (08-04-2010)


  • HAL Id : inria-00471724 , version 1


Yacine Boufkhad, Fabien Mathieu, Fabien de Montgolfier, Diego Perino, Laurent Viennot. Achievable Catalog Size in Peer-to-Peer Video-on-Demand Systems. Proceedings of the 7th Internnational Workshop on Peer-to-Peer Systems (IPTPS), Feb 2008, Tampa Bay, United States. pp.1-6. ⟨inria-00471724⟩
149 View
95 Download


Gmail Facebook Twitter LinkedIn More