Abstract
Multicast Video-on-Demand (VoD) has excellent performance, but it is very difficult to equip such a system with full support for interactive VCR functions. In this paper, we propose a new scheme, called the Best-Effort Patching (BEP), that offers a TVoD service in terms of both request admission and VCR interaction for multicast VoD system. Moreover, by using a novel dynamic merging algorithm, BEP significantly improves the efficiency of TVoD interactivity, especially for popular videos. Our extensive simulation results show that BEP outperforms the conventional multicast TVoD interaction protocols.
The work reported in this paper is partly supported by the US NSF under Grant EIA-9806280 and the NNSF of China under Grant 69873006. The work was done when Huadong Ma visited EECS Depart., the University of Michigan.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
E. L. Abram-Profeta and Kang G. Shin, Providing unrestricted VCR capability in multicast video-on-demand systems, Proc. of IEEE ICMCS’98, Austin, June 1998.
C.C. Aggarwal, J.L. Wolf, and P.S. Yu, A permutation-based pyramid broadcasting scheme for video-on-demand systems, Proc. of IEEE ICMCS'96, pp.118–126, Hiroshima, Japan, June 1996.
K.C. Almeroth and M.H. Ammar, The use of multicast delivery to provide a scalable and interactive video-on-demand service, IEEE Journal of Selected Areas in Communications, Vol.14, No.6, pp. 1110–1122, Aug.1996.
Ying Cai and K.A. Hua, Optimizing patching performance, Proc. of SPIE Conf. on Multimedia Computing and Networking, pp.204–216, San Jose, Jan. 1999.
Ying Cai and K. A. Hua, An efficient bandwidth-sharing technique for true video on demand systems, Proc. of ACM Multimedia’99, pp.211–214, Orlando, Nov.1999.
D.L. Eager, et al., Optimal and efficient merging schedules for video-on-demand servers, Proc. of ACM multimedia’99, pp.199–202, Orlando, Nov.1999.
L. Gao and D. Towsley, Supplying instantaneous video-on-demand services using controlled multicast, Proc. of IEEE ICMCS’99, pp.117–121, Florence, June 1999.
K. A. Hua, Y. Cai, and S. Sheu, Patching: A multicast technique for true video-ondemand services, Proc. of ACM Multimedia’98, pp. 191–200, Bristol, U.K., Sept. 1998.
K. A. Hua and S. Sheu, Skyscraper broadcasting: A new broadcasting scheme for metropolitan video-on-demand systems, Proc. of ACM SIGCOMM'97, pp.89–100, Sept. 1997.
W. Liao and V. O. K. Li, The split and merge protocol forinteractive video-ondemand, IEEE Multimedia, Oct.-Dec. 1997, pp.51–62.
S. Sen, L. Gao, J. Rexford, D. Towsley, Optimal patching schemes for efficient multimedia streaming, Proc. of IEEE NOSSDAV’99, Basking Ridge, NJ, June 1999.
S. Viswanathan and T. Imielinski, Pyramid broadcasting for video on demand service, Proc. of SPIE MMCN'95, Volume 2417, pp.66–77, San Jose, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ma, H., Shin, K.G. (2001). A New Scheduling Scheme for Multicast True VoD Service. In: Shum, HY., Liao, M., Chang, SF. (eds) Advances in Multimedia Information Processing — PCM 2001. PCM 2001. Lecture Notes in Computer Science, vol 2195. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45453-5_91
Download citation
DOI: https://doi.org/10.1007/3-540-45453-5_91
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42680-6
Online ISBN: 978-3-540-45453-3
eBook Packages: Springer Book Archive