Scalable Distributed Video-on-Demand: Theoretical Bounds and Practical Algorithms

Abstract : 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.
Complete list of metadatas

Cited literature [28 references]  Display  Hide  Download

https://hal.inria.fr/inria-00270406
Contributor : Rapport de Recherche Inria <>
Submitted on : Tuesday, April 8, 2008 - 8:59:00 AM
Last modification on : Friday, January 4, 2019 - 5:33:21 PM
Long-term archiving on : Tuesday, September 21, 2010 - 3:57:41 PM

Files

RR-6496.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00270406, version 2
  • ARXIV : 0804.0743

Citation

Laurent Viennot, Yacine Boufkhad, Fabien Mathieu, Fabien de Montgolfier, Diego Perino. Scalable Distributed Video-on-Demand: Theoretical Bounds and Practical Algorithms. [Research Report] RR-6496, INRIA. 2008, pp.19. ⟨inria-00270406v2⟩

Share

Metrics

Record views

361

Files downloads

239