Title: Effective VCR operations using efficient tree mechanism and scheduling for video streams in peer to peer networks

Authors: Arockia Xavier Annie Rayan; Yogesh Palanichamy

Addresses: Department of Computer Science and Engineering, Anna University, Chennai – 600025, India ' Department of Information Science and Technology, Anna University, Chennai – 600025, India

Abstract: Video-on-Demand (VOD), a popular streaming application is omnipresent. An active solution to solve the problem of VCR operations in VOD is laid out. There is the need to provide media streams with at most no delay which is achieved by combining the static full stream scheduling (SFSS) with the data management using earliest reachable merge tree (ERMT). This is done in a peer to peer multicast environment where the clients register to a media stream server (MSS) for requests. The new-movie request and the interactive playback are handled for scheduling at the request schedule server (RSS) which is between the peer to peer clients and the MSS. There is a great deal in subduing the force of delay in much larger scale with this set up. The simulation result endorses the validity of the inclusion of a separate schedule server.

Keywords: video on demand; VoD; VCR operations; video streaming; peer-to-peer; P2P networks; distributed systems; seek operations; earliest reachable merge tree; scheduling; data management; simulation.

DOI: 10.1504/IJCNDS.2014.063989

International Journal of Communication Networks and Distributed Systems, 2014 Vol.13 No.1, pp.106 - 118

Accepted: 05 Nov 2013
Published online: 28 Jul 2014 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article