Achievable catalog size in peer-to-peer video-on-demand systems

We analyze a system where n set-top boxes with same upload and storage capacities collaborate to serve r videos simultaneously (a typical value is r = n). We give upper and lower bounds on the catalog size of the system, i.e. the maximal number of distinct videos that can be stored in such a system so that any demand of at most r videos can be served. Besides r/n, the catalog size is constrained by the storage capacity, the upload capacity, and the maximum number of simultaneous connections a box can open. We show that the achievable catalog size drastically increases when the upload capacity of the boxes becomes strictly greater than the playback rate of videos.

[1]  Zhen Liu,et al.  Fixed Point Methods for the Simulation of the Sharing of a Local Loop by a Large Number of Interacting TCP Connections , 2001 .

[2]  N. Linial,et al.  Expander Graphs and their Applications , 2006 .

[3]  Siddhartha Annapureddy,et al.  Exploring VoD in P2P Swarming Systems , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[4]  Laurent Massoulié,et al.  Push-to-Peer Video-on-Demand System: Design and Evaluation , 2007, IEEE Journal on Selected Areas in Communications.

[5]  Hai Jin,et al.  A Measurement Study of a Peer-to-Peer Video-on-Demand System , 2007, IPTPS.

[6]  Cheng Huang,et al.  Can internet video-on-demand be profitable? , 2007, SIGCOMM '07.

[7]  Ben Y. Zhao,et al.  Deploying Video-on-Demand Services on Cable Networks , 2007, 27th International Conference on Distributed Computing Systems (ICDCS '07).