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

@misc{citeulike:2638226, 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.}, author = {Viennot, Laurent and Boufkhad, Yacine and Mathieu, Fabien and De Montgolfier, Fabien and Perino, Diego }, citeulike-article-id = {2638226}, eprint = {0804.0743}, keywords = {algorithms, content, distribution, multimedia}, month = {Apr}, posted-at = {2008-04-07 17:54:25}, priority = {2}, title = {Scalable Distributed Video-on-Demand: Theoretical Bounds and Practical Algorithms}, url = {http://arxiv.org/abs/0804.0743}, year = {2008} }

TY - ELEC ID - citeulike:2638226 L3 - citeulike-article-id:2638226 TI - Scalable Distributed Video-on-Demand: Theoretical Bounds and Practical Algorithms N2 - 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. KW - algorithms KW - content KW - distribution KW - multimedia AU - Viennot, Laurent AU - Boufkhad, Yacine AU - Mathieu, Fabien AU - De Montgolfier, Fabien AU - Perino, Diego PY - 2008/Apr/04/ UR - http://arxiv.org/abs/0804.0743 ER -