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

Simple item page
dc.creatorViennot, Laurent
dc.creatorBoufkhad, Yacine
dc.creatorMathieu, Fabien
dc.creatorDe Montgolfier, Fabien
dc.creatorPerino, Diego
dc.date2008-04-04
dc.date2008-04-08
dc.date.accessioned2026-07-07T12:18:08Z
dc.date.available2026-07-07T12:18:08Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/0804.0743
dc.identifierhttp://arxiv.org/abs/0804.0743
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/212304
dc.subjectNetworking and Internet Architecture
dc.subjectData Structures and Algorithms
dc.titleScalable Distributed Video-on-Demand: Theoretical Bounds and Practical Algorithms
dc.typetext

Files

Collections

arXiv