Fibonacci Based Chunks Distribution (FBCD) Scheme For Efficient P2P Interactive VOD Streaming
DOI:
https://doi.org/10.51983/ajcst-2013.2.1.1711Keywords:
Fibonacci, Middleware, Chunks distribution, Video on demandAbstract
One of the problems faced frequently by users in Video-on-Demand (VoD) streaming is long waiting time for voice and video files to load. This paper focuses on Fibonacci Based Chunks Distribution (FBCD) scheme to efficiently handle interactive VoD operations in peer-to-peer systems. In FBCD, videos are divided into number of chunks and stored at peers’ local storage in a distributed manner. The chunk size is progressively increased to reduce delay and improve performance. The appropriate performance aspects are analyzed with respect to both user-responsiveness and provider system efficiency. In most existing methods, a new client must search for parent peers containing specific segments. However, FBCD uses the properties of middleware server to cache equivalent chunk in peers. A peer can discover and access a neighbor quickly through the middleware. So the client can pick any server without additional searches, since the middleware can monitor the distribution of server loads and client request. This eliminates direct communication between Client and server and therefore Server offline problems are also managed effectively. The proposed scheme achieves quick video display to the end user without any delay and requires fewer server resources for data storage.
References
Yung-Cheng Kao, Chung-Nan Lee, Peng-Jung Wu, and Hui-Hsiang Kao - “A Network Coding Equivalent Content Distribution Scheme for Efficient Peer-to-Peer Interactive VoD Streaming”, International Journal of Computer Applications Vol.23, No. 6, JUNE 2012.
A.Shanmugam, L.M.Nithya, “A New Grid Architecture using JMF for Video-on-Demand Applications” International Journal of Computer Applications (0975 – 8887) Vol. 10, No.9, November 2010.
Dario Bruneo, Giuseppe Iellamo, Giuseppe Minutoli, Antonio Puliafito, University of Messina, Messina – “ A Practical Example of Nonscientific Application on the Grid”, International Journal of Computer Applications Vol. 21, no. 5, May 2009.
C. Xu, G.M. Muntean, E. Fallon, and A. Hanley, “A Balanced Tree - Based Strategy for Unstructured Media Distribution in P2P Networks,” Proc. IEEE Int’l Conf. Comm. (ICC ’08), pp. 1797-1801, May 2008.
W.P.K. Yiu, X. Jin, and S.H.G. Chan, “VMesh: Distributed Segment Storage for Peer-to-Peer Interactive Video Streaming,” IEEE J. Selected Areas in Comm., Vol. 25, no. 9, pp. 1717-1731, Dec. 2007.
H.V. Jagadish, B.C. Ooi, and Q.H. Vu, “BATON: A Balanced Tree Structure for Peer-to-Peer Networks,” Proc. Int’l Conf. Very Large Data Bases (VLDB ’05), pp. 661-672, Aug. 2005.
C. Zheng, G. Shen, and S. Li, “Distributed Prefetching Scheme for Random Seek Support in Peer-to-Peer Streaming Applications,” Proc. ACM Workshop Advances in Peer-to-Peer Multimedia Streaming, pp. 29-38, Nov. 2005.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2013 The Research Publication
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.