The Community for Technology Leaders
Green Image
Issue No. 06 - June (2012 vol. 23)
ISSN: 1045-9219
pp: 985-994
Yung-Cheng Kao , National Sun Yat-Sen University, Kaohisung and Industrial Technology Research Institute, Hsinchu
Chung-Nan Lee , National Sun Yat-Sen University, Kaohisung
Peng-Jung Wu , National Sun Yat-Sen University, Kaohisung and Industrial Technology Research Institute, Hsinchu
Hui-Hsiang Kao , National Sun Yat-Sen University, Kaohisung
Although random access operations are desirable for on-demand video streaming in peer-to-peer systems, they are difficult to efficiently achieve due to the asynchronous interactive behaviors of users and the dynamic nature of peers. In this paper, we propose a network coding equivalent content distribution (NCECD) scheme to efficiently handle interactive video-on-demand (VoD) operations in peer-to-peer systems. In NCECD, videos are divided into segments that are then further divided into blocks. These blocks are encoded into independent blocks that are distributed to different peers for local storage. With NCECD, a new client only needs to connect to a sufficient number of parent peers to be able to view the whole video and rarely needs to find new parents when performing random access operations. In most existing methods, a new client must search for parent peers containing specific segments; however, NCECD uses the properties of network coding to cache equivalent content in peers, so that one can pick any parent without additional searches. Experimental results show that the proposed scheme achieves low startup and jump searching delays and requires fewer server resources. In addition, we present the analysis of system parameters to achieve reasonable block loss rates for the proposed scheme.
Peer-to-peer, network coding, interactive operations, video-on-demand.

P. Wu, H. Kao, C. Lee and Y. Kao, "A Network Coding Equivalent Content Distribution Scheme for Efficient Peer-to-Peer Interactive VoD Streaming," in IEEE Transactions on Parallel & Distributed Systems, vol. 23, no. , pp. 985-994, 2011.
90 ms
(Ver 3.3 (11022016))