In this paper we present a new technique called Optimised Batch Patching with Classes of Service(OBP with CoS) which can be used to leverage the benefits of multicast within the context of 'near' video-on-demand systems in IP networks. OBP with CoS builds on an earlier scheme, known as Optimised Patching, but is different in two respects. Firstly, in OBP with CoS, the server artificially delays requests in order to increase the probability of accumulating duplicates, thereby allowing greater exploitation of multicast compared to Optimised Patching albeit at the expense of higher latency until commencement of service. Secondly, the client is able to request a latency class of service which reflects how long the client is prepared to wait until playout of the video. The server scheduling algorithm attempts to minimise network bandwidth consumption within the constraints imposed by the class of each request. We present analysis and simulations of our scheme in order to validate its effectiveness.
[1]
Kien A. Hua,et al.
Skyscraper broadcasting: a new broadcasting scheme for metropolitan video-on-demand systems
,
1997,
SIGCOMM '97.
[2]
Tim Morris BSc.
Multimedia Systems
,
2000,
Applied Computing.
[3]
Tomasz Imielinski,et al.
Metropolitan area video-on-demand service using pyramid broadcasting
,
1996,
Multimedia Systems.
[4]
Ying Cai,et al.
Optimizing patching performance
,
1998,
Electronic Imaging.
[5]
Asit Dan,et al.
Scheduling policies for an on-demand video server with batching
,
1994,
MULTIMEDIA '94.
[6]
Philip S. Yu,et al.
A permutation-based pyramid broadcasting scheme for video-on-demand systems
,
1996,
Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems.
[7]
David Thaler,et al.
Protocol Independent Multicast-Sparse Mode (PIM-SM): Protocol Specification
,
1997,
RFC.