Scalable Distributed Video-on-Demand: Theoretical Bounds and Practical Algorithms
Networking and Internet Architecture
2008-12-18 v2 Data Structures and 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.
Cite
@article{arxiv.0804.0743,
title = {Scalable Distributed Video-on-Demand: Theoretical Bounds and Practical Algorithms},
author = {Laurent Viennot and Yacine Boufkhad and Fabien Mathieu and Fabien De Montgolfier and Diego Perino},
journal= {arXiv preprint arXiv:0804.0743},
year = {2008}
}