The Management of Play Buffer and Arithmetic of Nodes Selecting in P2P Streaming Media
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.
Y. Kong et al., "The Management of Play Buffer and Arithmetic of Nodes Selecting in P2P Streaming Media", Applied Mechanics and Materials, Vols. 58-60, pp. 1614-1617, 2011