Queueing analysis of data block synchronization mechanism in        peer-to-peer based video streaming system

Sho Nanao; Hiroyuki Masuyama; Shoji Kasahara; Yutaka Takahashi

doi:10.3934/jimo.2011.7.699

Article Contents

2011, Volume 7, Issue 3: 699-716. Doi: 10.3934/jimo.2011.7.699

This issue Previous Article Analysis of globally gated Markovian limited cyclic polling model and its application to uplink traffic in the IEEE 802.16 network Next Article Performance evaluation of a power saving mechanism in IEEE 802.16 wireless MANs with bi-directional traffic

Queueing analysis of data block synchronization mechanism in peer-to-peer based video streaming system

1.
Graduate School of Informatics, Kyoto University, Yoshida Honmachi, Sakyo-ku, Kyoto 606-8501
2.
Graduate School of Informatics, Kyoto University, Yoshida-Honmachi, Sakyo-ku, Kyoto 606-8501

Received: September 2010

Revised: May 2011

Published: July 2011

Abstract / Introduction Related Papers Cited by

Abstract

In a Peer-to-Peer (P2P) based video streaming system such as Coolstreaming, a single video stream is decomposed into multiple sub-streams. A client-peer node receives the sub-streams from multiple parent-peer nodes, combining them into the original video stream. Each client-peer node has a synchronization buffer and a cache buffer. Data blocks are stored in the synchronization buffer in a sub-stream basis, and then forwarded into the cache buffer according to their sequence numbers. In this buffering system, data-block synchronization plays a crucial role to guarantee video quality. In this paper, we consider the performance of data-block synchronization scheme with which data blocks are simultaneously forwarded just after all the data blocks composing a macro data block arrive at the synchronization buffer. We model the synchronization buffer as a multiple-buffer queueing system with homogeneous Poisson arrival processes, deriving the mean forwarding interval. We also consider the frame loss probability for multiple-path video streaming, investigating how the number of sub-streams decreases the frame loss probability. Numerical examples show that increasing the number of sub-streams makes the average forwarding interval large, while the frame loss probability at the bottleneck router is improved. It is also shown that increasing the synchronization buffer decreases the average forwarding interval.

Keywords:

Mathematics Subject Classification: Primary: 58F15, 58F17; Secondary: 53C35.

Citation:

Related Papers

Cited by

References

[1]	M. Castro, P. Druschel, A.-M. Kermarrec, A. Nandi, A. Rowstron and A. Singh, "SplitStream: High-Bandwidth Content Distribution in Cooperative Environments," Proceedings of SOSP, (2003), 292-303.
[2]	D. Jurca, J. Chakareski, J.-P. Wagner and P. Frossard, Enabling adaptive video streaming in P2P systems, IEEE Communications Magazine, 45 (2007), 108-114.doi: 10.1109/MCOM.2007.374427.
[3]	K. Kirihara, H. Masuyama, S. Kasahara and Y. Takahashi, "Performance Analysis of a Decentralized Content Delivery System with FEC Recovery," Advances in Queueing Theory and Network Applications, Springer New York, (2009), 265-279.
[4]	B. Li, S. Xie, G. Y. Keung and X. Zhang, Coolstreaming: Design, theory, and practice, IEEE Transactions on Multimedia, 9 (2007), 1661-1671.doi: 10.1109/TMM.2007.907469.
[5]	B. Li, S. Xie, Y. Qu, G. Y. Keung, C. Lin, J. Liu and X. Zhang, "Inside the New Coolstreaming: Principles, Measurements and Performance Implications," Proceedings of IEEE INFOCOM, (2008), 1031-1039.doi: 10.1109/INFOCOM.2008.157.
[6]	B. Li and H. Yin, Peer-to-peer live video streaming on the internet: Issues, existing approaches, and challenges, IEEE Communications Magazine, 45 (2007), 94-99.doi: 10.1109/MCOM.2007.374425.
[7]	V. N. Padmanabhan, H. J. Wang, P. A. Chou and K. Sripanidkulchai, "Distributing Streaming Media Content Using Cooperative Networking," Proceedings of NOSSDAV, (2002), 177-186.
[8]	PPlive, http://www.pplive.com.
[9]	Sopcast, http://www.sopcast.org.