inria-00270406, version 2
Scalable Distributed Video-on-Demand: Theoretical Bounds and Practical Algorithms
N° RR-6496 (2008)
Résumé : We analyze a distributed system where n nodes called boxes store a large set of videos and collaborate to serve simultaneously n videos or less. We explore under which conditions such a system can be scalable while serving any sequence of demands. We model this problem through a combination of two algorithms: a video allocation algorithm and a connection scheduling algorithm. The latter plays against an adversary that incrementally proposes video requests.
- a – France Telecom R&D - Orange Labs
- 1 :
- CNRS : UMR7089 – INRIA – Université Paris VII - Paris Diderot
- 2 :
- CNRS : UMR7089 – Université Paris VII - Paris Diderot
- 3 :
- France Télécom
- Domaine : Informatique/Algorithme et structure de données
Informatique/Réseaux et télécommunications - Mots-clés : video-on-demand – scalability – peer-to-peer
- Référence interne : RR-6496
- Versions disponibles : v1 (04-04-2008) v2 (08-04-2008)
- inria-00270406, version 2
- http://hal.inria.fr/inria-00270406
- oai:hal.inria.fr:inria-00270406
- Contributeur :
- Soumis le : Mardi 8 Avril 2008, 08:59:00
- Dernière modification le : Mardi 8 Avril 2008, 09:16:44





Documents associés

Exporter