Performance study of peer-to-peer video streaming on complex networks

In this paper we study the video streaming bandwidth of peer-to-peer streaming networks where the underlying topology is a complex network. We focus on the maximal streaming rate and how it depends on the type of network. We consider networks such as small world networks, scale free networks, locally connected networks and random networks. The experimental results indicate that a more connected graph does not necessarily imply a higher streaming rate, whereas properties such as the existence of a Hamiltonian path from the source do.

[1]  Yong Liu,et al.  iPASS: Incentivized Peer-Assisted System for Asynchronous Streaming , 2009, IEEE INFOCOM 2009.

[2]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[3]  C. Wu Perturbation of coupling matrices and its effect on the synchronizability in arrays of coupled chaotic systems , 2003, nlin/0307052.

[4]  Nikhil Bansal,et al.  Additive Guarantees for Degree-Bounded Directed Network Design , 2009, SIAM J. Comput..

[5]  D. R. Fulkerson,et al.  On edge-disjoint branchings , 1976, Networks.

[6]  Bo Li,et al.  Opportunities and Challenges of Peer-to-Peer Internet Video Broadcast , 2008, Proceedings of the IEEE.

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

[8]  Béla Bollobás,et al.  Random Graphs , 1985 .

[9]  Béla Bollobás,et al.  Random Graphs: Notation , 2001 .

[10]  V. Roychowdhury,et al.  Scale-free and stable structures in complex ad hoc networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[11]  L. Pósa,et al.  Hamiltonian circuits in random graphs , 1976, Discret. Math..

[12]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[13]  Rakesh Kumar,et al.  Stochastic Fluid Theory for P2P Streaming Systems , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.