The Community for Technology Leaders
Parallel and Distributed Processing Symposium, International (2009)
Rome, Italy
May 23, 2009 to May 29, 2009
ISBN: 978-1-4244-3751-1
pp: 1-10
Yacine Boufkhad , Paris Diderot University, LIAFA, France
Fabien Mathieu , Orange Labs, Issy-les-Moulineaux, France
Fabien de Montgolfier , Paris Diderot University, LIAFA, France
Diego Perino , Orange Labs, Issy-les-Moulineaux, France
Laurent Viennot , INRIA Project-Team ¿GANG¿ between INRIA and LIAFA, France
ABSTRACT
We consider the fully distributed Video-on-Demand problem, where n nodes called boxes store a large set of videos and collaborate to serve simultaneously n videos or less between them. It is said to be scalable when Ω(n) videos can be distributively stored under the condition that any sequence of demands for these videos can always be satisfied. Our main result consists in establishing a threshold on the average upload bandwidth of a box, above which the system becomes scalable. We are thus interested in the normalized upload capacity u = upload bandwidth/video bitrate of a box. The number m of distinct videos stored in the system is called its catalog size. We show an upload capacity threshold of 1 for scalability in a homogeneous system, where all boxes have the same upload capacity. More precisely, a system with u ≪ 1 has constant catalog size m = O(1) (every box must store some data of every video). On the other hand, for u ≫ 1, an homogeneous system where all boxes have same upload capacity at least u admits a static allocation of m = Ω(n) videos into the boxes such that any adversarial sequence of video demands can be satisfied. Moreover, such an allocation can be obtained randomly with high probability. This result is generalized to a system of boxes that have heterogeneous upload capacities under some balancing conditions.
INDEX TERMS
CITATION
Yacine Boufkhad, Fabien Mathieu, Fabien de Montgolfier, Diego Perino, Laurent Viennot, "An upload bandwidth threshold for peer-to-peer Video-on-Demand scalability", Parallel and Distributed Processing Symposium, International, vol. 00, no. , pp. 1-10, 2009, doi:10.1109/IPDPS.2009.5161047
82 ms
(Ver 3.3 (11022016))