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

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

2008-04-04

arxiv.org/abs/0804.0743v2

Computer Science

Networking and Internet Architecture

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Scalable Distributed Video-on-Demand: Theoretical Bounds and Practical Algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Scalable Distributed Video-on-Demand: Theoretical Bounds and Practical Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Scalable Distributed Video-on-Demand: Theoretical Bounds and Practical Algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-191059