arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0804.0743cs.NIcs.DS
收藏

可扩展的分布式视频点播:理论界与实用算法

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

Laurent Viennot, Yacine Boufkhad, Fabien Mathieu, Fabien De Montgolfier, Diego Perino

摘要:

我们分析了一个分布式系统,其中n个节点称为盒子存储了大量的视频和合作,同时服务n个视频或更少。我们探索在何种条件下,这样的系统可以扩展,同时服务于任何序列的需求。我们通过两个算法的组合模型这个问题:视频分配算法和连接调度算法。后者与逐渐提出视频请求的对手对抗。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑