Scheduling policies for an on-demand video server with batching
MULTIMEDIA '94 Proceedings of the second ACM international conference on Multimedia
The Maximum Factor Queue Length Batching Scheme for Video-on-Demand Systems
IEEE Transactions on Computers
An Adaptive Hybrid Technique for Video Multicast
IC3N '98 Proceedings of the International Conference on Computer Communications and Networks
Supplying Instantaneous Video-on-Demand Services Using Controlled Multicast
ICMCS '99 Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02
| Hi-index | 0.00 |
As streaming video and audio over the Internet become popular, the deployment of a large-scale multimedia streaming application requires an enormous amount of server and network resources. In a Video-on-Demand (VoD) environment, batching of video requests are often used to reduce I/O demand and improve throughput. Since users may leave if they experience long waits, a good video scheduling policy needs to consider not only the batch size but also the user defection probabilities and waiting times. Besides, a practical VoD resource sharing scheme should try its best to provide some free stream to serve a high priority client's request immediately because the high priority clients might pay for the requested video. To tackle the above problems, this work proposes a hybrid resource sharing model which combines controlled multicasting and batching scheme. A bandwidth borrowing and reserving scheme is adopted in our hybrid model to give high priority clients prompt service whereas provide low priority clients comparable service as given by the representative scheduling policies in the literature. The experimental results demonstrate that our proposed resource sharing scheme is effective and feasible when blocking probability of high priority clients and defection probability of low priority users are used as the performance metrics.