The Management of Play Buffer and Arithmetic of Nodes Selecting in P2P Streaming Media

Abstract:

This article mainly discussed the management of play buffer in streaming multimedia system. Based on this problem, this article raised one idea: dynamic suly:demand , besides this,also raised that the newly joined nodes should request data whose number is near , n stands for the lowest block number in play buffers of the newly joined node's all partner nodes , m stands for the highest number. These two ideas are used to assign the data blocks that have been played with covering priorities, the higher the priority is, the more possibly it will be covered . Lots of experiments proved that through using ideas this article raised, the success rate of requesting data from partners is increased in each node in the condition of not affect playing quality.

• Periodical: Applied Mechanics and Materials (Volumes 58-60)
• Pages: 1614-1617
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.58-60.1614
• Online since: June 2011
• Authors: Yan Kong, Yi Xiao Sun, Zhuang Lei
• Keywords: Covering Strategy, Dynamic Priority, P2P Streaming Media, Play Buffer, Success Rate

References

[1] D. Tran, K. Hua, and S. Sheu, Zigzag: An Efficient Peer-To-Peer Scheme for Media Streaming, in Proceedings of IEEEINFOCOM, (2003).

[2] Susu Xie, Bo Li, Senior Member, IEEE, Gabriel Y. Keung, and XinyanZhang, StudentMember, Coolstreaming: Design, Theory, and Practice, DigitalObject Identifier: 10. 1109/TMM. 2007. 907469, Publication Year: 2007 , Page(s): 1661 - 1671.

DOI: 10.1109/tmm.2007.907469

[3] Xiaofei Liao, Hai Jin, *Yunhao Liu, *Lionel M. Ni, and Dafu Deng AnySee: Peer-to-Peer Live Streaming, ，infocom 2006. 25th IEEE International Conference on Computer Communications, Proceedings.

DOI: 10.1109/infocom.2006.288

[4] Wang Wenbo. Research on the Caching & Scheduling Strategy for P2P Streaming Syste, Information science and technology of XiBei university, (2009).