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

https://hal.inria.fr/inria-00270406
Contributor : Fabien Mathieu <>
Submitted on : Friday, April 4, 2008 - 3:56:04 PM
Last modification on : Friday, January 4, 2019 - 5:33:21 PM
Long-term archiving on : Friday, May 21, 2010 - 1:21:41 AM

Files

podc-rr.pdf
Files produced by the author(s)

Identifiers

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

Collections

Citation

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

Share

Metrics

Record views

4

Files downloads

58