Scalable Distributed Video-on-Demand: Theoretical Bounds and Practical Algorithms - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2008

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.
Fichier principal
Vignette du fichier
RR-6496.pdf (350.59 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00270406 , version 1 (04-04-2008)
inria-00270406 , version 2 (08-04-2008)

Identifiers

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

Cite

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⟩
165 View
138 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More