# 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.
Type de document :
Communication dans un congrès
Proceedings of the 7th Internnational Workshop on Peer-to-Peer Systems (IPTPS), Feb 2008, Tampa Bay, United States. pp.1-6, 2008
Domaine :

Littérature citée [7 références]

https://hal.inria.fr/inria-00471724
Contributeur : Laurent Viennot <>
Soumis le : jeudi 8 avril 2010 - 17:53:11
Dernière modification le : mardi 17 avril 2018 - 11:27:14
Document(s) archivé(s) le : vendredi 19 octobre 2012 - 11:26:40

### Fichier

iptps2008.pdf
Fichiers produits par l'(les) auteur(s)

### Identifiants

• 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, 2008. 〈inria-00471724〉

### Métriques

Consultations de la notice

## 268

Téléchargements de fichiers