Hierarchical video patching with optimal server bandwidth
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
Distributed streaming for video on demand
PCM'07 Proceedings of the multimedia 8th Pacific Rim conference on Advances in multimedia information processing
| Hi-index | 0.00 |
Among many different multicast approaches, batchingand patching are two commonly used policies. In this paper,we propose two hybrid multicast algorithms inspiredby the Maximum Factored Queue Length (MFQL) batchingscheme -used to decide which video queue will be servicedwith a multicast session- and by a Threshold-based patchingscheme -applied to control the partial streams transmissionbefore a threshold is reached during an ongoing multicastsession. The novelty is that our algorithms have beendesigned to efficiently handle the requests in a distributedVoD system while optimizing the usage of the sever/networkresources. Precisely, one key issue in the optimization ofthese resources is the computation of the threshold. We showin this paper how that threshold is derived to deliver a service. In addition, we conduct some simulation experimentsthat provides us some insightful information about the impactthat our threshold based multicast algorithms have inthe average waiting time in a distributed VoD system.