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

1 GANG - Networks, Graphs and Algorithms
LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications, Inria Paris-Rocquencourt
Abstract : 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.
Document type :
Conference papers
Domain :

Cited literature [7 references]

https://hal.inria.fr/inria-00471724
Contributor : Laurent Viennot <>
Submitted on : Thursday, April 8, 2010 - 5:53:11 PM
Last modification on : Friday, January 4, 2019 - 5:33:21 PM
Long-term archiving on : Friday, October 19, 2012 - 11:26:40 AM

### File

iptps2008.pdf
Files produced by the author(s)

### Identifiers

• HAL Id : inria-00471724, version 1

### Citation

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⟩

Record views