Effective VCR operations using efficient tree mechanism and scheduling for video streams in peer to peer networks
by Arockia Xavier Annie Rayan; Yogesh Palanichamy
International Journal of Communication Networks and Distributed Systems (IJCNDS), Vol. 13, No. 1, 2014

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.

Online publication date: Sat, 30-Aug-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Communication Networks and Distributed Systems (IJCNDS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com