Tree dynamics for peer-to-peer streaming

This paper presents an asynchronous distributed algorithm to manage multiple trees for peer-to-peer streaming in a flow level model. It is assumed that videos are cut into substreams, with or without source coding, to be distributed to all nodes. The algorithm guarantees that each node receives sufficiently many substreams within delay logarithmic in the number of peers. The algorithm works by constantly updating the topology so that each substream is distributed through trees to as many nodes as possible without interference. Competition among trees for limited upload capacity is managed so that both coverage and balance are achieved. The algorithm is robust in that it efficiently eliminates cycles and maintains tree structures in a distributed way. The algorithm favors nodes with higher degree, so it not only works for live streaming and video on demand, but also in the case a few nodes with large degree act as servers and other nodes act as clients. A proof of convergence of the algorithm is given assuming instantaneous update of depth information, and for the case of a single tree it is shown that the convergence time is stochastically tightly bounded by a small constant times the log of the number of nodes. These theoretical results are complemented by simulations showing that the algorithm works well even when most assumptions for the theoretical tractability do not hold.

[1]  Bo Li,et al.  CoolStreaming/DONet: a data-driven overlay network for peer-to-peer live media streaming , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[2]  B. Cohen,et al.  Incentives Build Robustness in Bit-Torrent , 2003 .

[3]  Joohwan Kim,et al.  Peer-to-peer streaming over dynamic random Hamilton cycles , 2012, 2012 Information Theory and Applications Workshop.

[4]  Frank Eliassen,et al.  Chameleon: Adaptive Peer-to-Peer Streaming with Network Coding , 2010, 2010 Proceedings IEEE INFOCOM.

[5]  John C. S. Lui,et al.  A Simple Model for Analyzing P2P Streaming Protocols , 2007, 2007 IEEE International Conference on Network Protocols.

[6]  Kien A. Hua,et al.  ZIGZAG: an efficient peer-to-peer scheme for media streaming , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[7]  Chuan Wu,et al.  UUSee: Large-Scale Operational On-Demand Streaming with Random Network Coding , 2010, 2010 Proceedings IEEE INFOCOM.

[8]  Ilkka Norros,et al.  On the stability of two-chunk file-sharing systems , 2009, Queueing Syst. Theory Appl..

[9]  Jonathan S. Turner,et al.  Routing in overlay multicast networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[10]  Bruce E. Hajek,et al.  Stability of a Peer-to-Peer Communication System , 2012, IEEE Transactions on Information Theory.

[11]  Yuval Shavitt,et al.  Approximation and heuristic algorithms for minimum delay application-layer multicast trees , 2004, INFOCOM 2004.

[12]  Helen J. Wang,et al.  Resilient peer-to-peer streaming , 2003, 11th IEEE International Conference on Network Protocols, 2003. Proceedings..

[13]  Keith W. Ross,et al.  Queuing Network Models for Multi-Channel P2P Live Streaming Systems , 2009, IEEE INFOCOM 2009.

[14]  Jörg Widmer,et al.  Rate allocation for layered multicast streaming with inter-layer network coding , 2012, 2012 Proceedings IEEE INFOCOM.

[15]  Pierre A. Humblet,et al.  A Distributed Algorithm for Minimum-Weight Spanning Trees , 1983, TOPL.

[16]  Donald F. Towsley,et al.  Reciprocity and Barter in Peer-to-Peer Systems , 2010, 2010 Proceedings IEEE INFOCOM.

[17]  Vivek K. Goyal,et al.  Multiple description coding: compression meets the network , 2001, IEEE Signal Process. Mag..

[18]  Kianoosh Mokhtarian,et al.  Minimum-delay overlay multicast , 2013, 2013 Proceedings IEEE INFOCOM.

[19]  Stratis Ioannidis,et al.  Stable and scalable universal swarms , 2013, PODC '13.

[20]  Qinghua Zheng,et al.  An overlay multicast protocol for live streaming and delay-guaranteed interactive media , 2012, J. Netw. Comput. Appl..

[21]  Laurent Massoulié,et al.  Coupon replication systems , 2008, TNET.

[22]  Laurent Massoulié,et al.  Flow Control for Cost-Efficient Peer-to-Peer Streaming , 2010, 2010 Proceedings IEEE INFOCOM.

[23]  Miguel Castro,et al.  SplitStream: high-bandwidth multicast in cooperative environments , 2003, SOSP '03.

[24]  Bruce E. Hajek,et al.  The missing piece syndrome in peer-to-peer communication , 2010, 2010 IEEE International Symposium on Information Theory.

[25]  Reza Rejaie,et al.  PRIME: peer-to-peer receiver-driven mesh-based streaming , 2009, TNET.

[26]  Ilkka Norros,et al.  Stable, distributed P2P protocols based on random peer sampling , 2012, Allerton Conference.

[27]  Amin Vahdat,et al.  Bullet: high bandwidth data dissemination using an overlay mesh , 2003, SOSP '03.