Scheduling policies for an on-demand video server with batching
MULTIMEDIA '94 Proceedings of the second ACM international conference on Multimedia
Metropolitan area video-on-demand service using pyramid broadcasting
Multimedia Systems
Skyscraper broadcasting: a new broadcasting scheme for metropolitan video-on-demand systems
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Patching: a multicast technique for true video-on-demand services
MULTIMEDIA '98 Proceedings of the sixth ACM international conference on Multimedia
A Permutation-Based Pyramid Broadcasting Scheme for Video-on-Demand Systems
ICMCS '96 Proceedings of the 1996 International Conference on Multimedia Computing and Systems
Optimal proxy management for multimedia streaming in content distribution networks
NOSSDAV '02 Proceedings of the 12th international workshop on Network and operating systems support for digital audio and video
Journal of Parallel and Distributed Computing
The batch patching method using dynamic cache of proxy cache for streaming media
GCC'05 Proceedings of the 4th international conference on Grid and Cooperative Computing
The dynamic cache algorithm of proxy for streaming media
ICIC'05 Proceedings of the 2005 international conference on Advances in Intelligent Computing - Volume Part I
Joint server scheduling and proxy caching for video delivery
Computer Communications
Efficient Support of Streaming Videos through Patching Proxies in the Cloud
International Journal of Grid and High Performance Computing
Efficient Support of Streaming Videos through Patching Proxies in the Cloud
International Journal of Grid and High Performance Computing
| Hi-index | 0.00 |
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.