Dynamic batching policies for an on-demand video server
Multimedia Systems
Patching: a multicast technique for true video-on-demand services
MULTIMEDIA '98 Proceedings of the sixth ACM international conference on Multimedia
Optimal and efficient merging schedules for video-on-demand servers
MULTIMEDIA '99 Proceedings of the seventh ACM international conference on Multimedia (Part 1)
Minimizing Bandwidth Requirements for On-Demand Data Delivery
IEEE Transactions on Knowledge and Data Engineering
Long Term Resource Allocation in Video Delivery Systems
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Tailored Transmissions for Efficient Near-Video-On-Demand Service
ICMCS '99 Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2
Simulations on batching in video-on-demand transmissions
ICCS'03 Proceedings of the 2003 international conference on Computational science
Convergence of periodic broadcasting and video-on-demand
Computer Communications
An effective batching scheme utilizing the segment interval time for wireless IPTV
CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
| Hi-index | 0.00 |
In this paper we detail an algorithm for the transmission of video-on-demand, which allows transmissions to be advanced dynamically when there is enough bandwidth. The effect is a transmission speed-up and consequently the freeing of bandwidth reservations in the future. This freed bandwidth can therefore be used by other transmissions. We evaluate two basic criteria for producing these advancements, and also detail how this scheme can be combined with other existing on-demand transmission methods. in our experiments we have combined it with an implementation of patching. We compare the performance of our algorithm with this model, and also with a system without merging taken ad a reference.We demonstrate that, during the high audience period, delays resulting from our approach are about 44% lower than without advancements, and we also state the importance of the criteria used for these advancements.