Abstract
The number of video streams that can be serviced concurrently is highly constrained by the required real-time and high-rate transfers of multimedia data. Resource sharing techniques, such as Batching, Patching, and Earliest Reachable Merge Target (ERMT), can be used to address this problem by utilizing the multicast facility, which allows multiple requests to share the same set of server and network resources. They assume, however, that all clients have the same available download bandwidth and buffer space. We study how to efficiently support clients with varying available download bandwidth and buffer space, while delivering data in a client-pull fashion using enhanced resource sharing. In particular, we propose three hybrid solutions to address the variability in the download bandwidth among clients: Simple Hybrid Solution (SHS), Adaptive Hybrid Solution (AHS), and Enhanced Hybrid Solution (EHS). SHS simply combines Batching with either Patching or ERMT, leading to two alternatives: SHS-P and SHS-E, respectively. Batching is used for clients with bandwidth lower than double the video playback rate, and Patching/ERMT is used for the rest. In contrast, AHS and EHS classify clients into multiple bandwidth classes and service them accordingly. AHS employs a new stream type, called adaptive stream, and EHS employs an enhanced adaptive stream type to serve clients with bandwidth capacities ranging between the video playback rate and double that rate. AHS and EHS employ adaptive streams or enhanced adaptive streams in conjunction with Batching and Patching or ERMT, leading to four possible schemes: AHS-P, AHS-E, EHS-P, and EHS-E. Moreover, we consider the variability of the available buffer space among clients. Furthermore, we study how the waiting playback requests for different videos can be scheduled for service in the heterogeneous environment, capturing the variations in both the client bandwidth and buffer space. We evaluate the effectiveness of the proposed solutions and analyze various scheduling policies through extensive simulation.
- Aggarwal, C. C., Wolf, J. L., and Yu, P. S. 2001. The maximum factor queue length batching scheme for Video-on-Demand systems. IEEE Trans. Comput. 50, 2, 97--110. Google Scholar
Digital Library
- Alsmirat, M., Al-Hadrusi, M., and Sarhan, N. J. 2007. Analysis of waiting-time predictability in scalable media streaming. In Proceedings of the ACM Multimedia Conference. 791--794. Google Scholar
Digital Library
- Bagouet, O., Hua, K. A., and Oger, D. 2003. A periodic broadcast protocol for heterogeneous receivers. In Proceedings of the Multimedia Computing and Networking Conference (MMCN).Google Scholar
- BroadBandReports. 2006. http://broadbandreports.com/,.Google Scholar
- Cai, Y. and Hua, K. A. 1999. An efficient bandwidth-sharing technique for true video on demand systems. In Proceedings of the ACM Multimedia Conference. 211--214. Google Scholar
Digital Library
- Dan, A., Sitaram, D., and Shahabuddin, P. 1994. Scheduling policies for an on-demand video server with batching. In Proceedings of the ACM Multimedia. 391--398. Google Scholar
Digital Library
- Eager, D. L., Vernon, M. K., and Zahorjan, J. 1999. Optimal and efficient merging schedules for Video-on-Demand servers. In Proceedings of the ACM Multimedia. 199--202. Google Scholar
Digital Library
- Eager, D. L., Vernon, M. K., and Zahorjan, J. 2000. Bandwidth skimming: A technique for cost-effective Video-on-Demand. In Proceedings of the Multimedia Computing and Networking Conference (MMCN). 206--215.Google Scholar
- Eager, D. L., Vernon, M. K., and Zahorjan, J. 2001. Minimizing bandwidth requirements for on-demand data delivery. IEEE Trans. Knowled. Data Engine. 13, 5, 742--757. Google Scholar
Digital Library
- Hua, K. A., Cai, Y., and Sheu, S. 1998. Patching: A multicast technique for true Video-on-Demand services. In Proceedings of the ACM Multimedia. 191--200. Google Scholar
Digital Library
- Juhn, L. and Tseng, L. 1997. Harmonic broadcasting for Video-on-Demand service. IEEE Trans. Broadcast. 43, 3, 268--271.Google Scholar
Cross Ref
- Pâris, J.-F. 2001. A fixed-delay broadcasting protocol for Video-on-Demand. In Proceedings of the International Conference on Computer Communications and Networks. 418--423.Google Scholar
Cross Ref
- Qudah, B. and Sarhan, N. J. 2006a. Analysis of resource sharing and cache management techniques in scalable video-on-demand. In Proceedings of the 14th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS). 327--334. Google Scholar
Digital Library
- Qudah, B. and Sarhan, N. J. 2006b. Towards scalable delivery of video streams to heterogeneous receivers. In Proceedings of the ACM Multimedia. 347--356. Google Scholar
Digital Library
- Sarhan, N. J. and Das, C. R. 2004. A new class of scheduling policies for providing time of service guarantees in Video-On-Demand servers. In Proceedings of the 7th IFIP/IEEE Int'l Conf. on Management of Multimedia Networks and Services. 127--139.Google Scholar
- Sarhan, N. J. and Qudah, B. 2007. Efficient cost-based scheduling for scalable media streaming. In Proceedings of the Multimedia Computing and Networking Conference (MMCN). Vol. 6504. 65040C.Google Scholar
- Sessini, P., Shi, L., Mahanti, A., Li, Z., and Eager, D. L. 2006. Scalable streaming for heterogeneous clients. In Proceedings of the ACM Multimedia. 337--346. Google Scholar
Digital Library
- Tantaoui, M. A., Hua, K. A., and Do, T. T. 2004. Broadcatch: A periodic broadcast technique for heterogeneous Video-on-Demand. IEEE Trans. Broadcast. 50, 3, 289--301.Google Scholar
Cross Ref
- Tsiolis, A. K. and Vernon, M. K. 1997. Group-guaranteed channel capacity in multimedia storage servers. In Proceedings of the ACM SIGMETRICS. 285--297. Google Scholar
Digital Library
Index Terms
Efficient delivery of on-demand video streams to heterogeneous receivers
Recommendations
Towards scalable delivery of video streams to heterogeneous receivers
MM '06: Proceedings of the 14th ACM international conference on MultimediaThe required real-time and high-rate transfers for multimedia data severely limit the number of requests that can be serviced concurrently by Video-on-Demand (VOD) servers. Resource sharing techniques can be used to address this problem. We study how ...
Assessing the efficiency of stream reuse techniques in P2P video-on-demand systems
Many works have reported simulated performance benefits of stream reuse techniques such as batching, chaining, and patching to the scalability of VoD systems. However, the relative contribution of such techniques has been rarely evaluated in practical ...
Multicast Video-on-Demand services
The server's storage I/O and network I/O bandwidths are the main bottleneck of VoD service. Multicast offers an efficient means of distributing a video program to multiple clients, thus greatly improving the VoD performance. However, there are many ...






Comments