Abstract.
A multicast Video-on-Demand (VoD) system allows clients to share a server stream by batching their requests, and hence, improves channel utilization. However, it is very difficult to equip such a VoD system with full support for interactive VCR functions which are important to a growing number of Internet applications. In order to eliminate service (admission) latency, patching was proposed to enable an existing multicast session to dynamically add new clients, and requests can be served without delay if patching channels are available. A true VoD (TVoD) service should support not only zero-delay client admission but also continuous VCR-like interactivity. However, the conventional patching is only suitable for admission control. We propose a new patching scheme, called Best-Effort Patching (BEP), that offers a TVoD service in terms of both request admission and VCR interactivity. Moreover, by using a novel dynamic merging algorithm, BEP significantly improves the efficiency of TVoD interactivity, especially for popular videos. We also model and evaluate the efficiency of the dynamic merging algorithm. It is shown that BEP outperforms the conventional TVoD interaction protocols.
Similar content being viewed by others
References
E.L. Abram-Profeta “Support for service scalability in video-on-demand end systems,” Ph.D. Thesis, Department of Electrical Engineering and Computer Science, the University of Michigan, Ann Arbor, MI, May 1998.
E.L. Abram-Profeta and Kang G. Shin “Providing unrestricted VCR capability in multicast video-on-demand systems,” in Proc. of IEEE Int’l. Conference on Multimedia Computing and Systems’98, June–July 1998.
C.C. Aggarwal, J.L. Wolf, and P.S. Yu “A permutation-based pyramid broadcasting scheme for video-on-demand systems,” in Proc. IEEE Int’l. Conf. on Multimedia Computing and Systems’96, 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 J. Select. Areas Commun., Vol. 14, No. 6, pp. 1110–1122, 1996.
M.K. Bradshaw, B. Wang, S. Sen, L. Gao, J. Kurose, P. Shenoy, and D. Towsley “Periodic broadcast and patching services—implementation, measurement, and analysis in an internet streaming video testbed,” in Proc. ACM Multimedia’2001, Ottawa, Canada.
Ying Cai and K.A. Hua “Optimizing patching performance,” in Proc. of SPIE’s Conference on Multimedia Computing and Networking (MMCN’99), San Jose, Jan. 1999, pp. 204–215
Ying Cai and K.A. Hua “An efficient bandwidth-sharing technique for true video on demand systems,” in Proc. ACM Multimedia’99, Orlando, Nov. 1999, pp. 211–214.
A. Dan, D. Sitaram, and P. Shahabuddin “Scheduling policies for an on-demand video server with batching,” in Proc. of ACM Multimedia’94, San Francisco, Oct. 1994, pp. 15–23.
J.K. Dey-Sircar, J.D. Salehi, J.F. Kurose, and D. Towsley “Providing VCR capabilities in large-scale video servers,” in Proc. of ACM Multimedia’94, San Francisco, Oct. 1994, pp. 25–32.
D.L. Eager and M.K. Vernon “Dynamic skyscraper broadcasts for Video-on-Demand,” in Proc. Multimedia Information System (MIS’98), Istanbul, Turkey, Sept. 1998, pp. 18–32,.
D.L. Eager, M.K. Vernon, and J. Zahorjan “Optimal and efficient merging schedules for video-on-demand servers,” in Proc. ACM multimedia’99, Orlando, Nov. 1999, pp. 199–202.
D.L. Eager, M.K. Vernon, and J. Zahorjan “Bandwidth skimming: A technique for cost-effective video-on-demand,” in Proc. MMCN’2000, San Jose, Jan. 2000.
D.L. Eager, M.K. Vernon, and J. Zahorjan “Minimizing bandwidth requirements for on-demand data delivery,” IEEE Trans. on Knowledge and Data Engineering, Vol. 13, No. 5, pp. 742–757, 2001.
L. Gao, J. Kurose, and D. Towsley “Efficient schemes for broadcasting popular videos,” in Proc. NOSSDAV, Cambridge, UK, July 1998.
L. Gao and D. Towsley “Supplying instantaneous video-on-demand services using controlled multicast,” in Proc. IEEE Multimedia Computing and Systems, Florence, Italy, June 1999, pp. 117–121.
K. A. Hua, Y. Cai, and S. Sheu “Patching: A multicast technique for true video-on-demand services,” in Proc. of ACM Multimedia’98, Bristol, UK, Sept. 1998, pp. 191–200
K.A. Hua and S. Sheu “Skyscraper broadcasting: A new broadcasting scheme for metropolitan video-on-demand systems,” in Proc. ACM SIGCOMM’97, Cannes, France, Sept. 1997, pp. 89–100.
L. Golubchik, J. Lui, and R. Muntz “Adaptive piggybacking: A novel technique for data sharing in video-on-demand storage servers,” Multimedia Systems, Vol. 4, No. 3, 1996.
V.O.K. Li, W. Liao, X. Qiu, and E.W.M. Wong “Performance model of interactive video-on-demand systems,” IEEE JSAC, Vol. 14, No. 6, pp. 1099–1109, Aug. 1996.
W. Liao and V.O.K. Li “The split and merge protocol for interactive video-on-demand,” IEEE Multimedia, pp. 51–62, Oct.–Dec.1997
T.D.C. Little and Dinesh Venkatesh “Prospects for interactive video-on-demand,” IEEE Multimedia, Vol. 1, No. 3, pp. 14–24, 1994.
Huadong Ma and Kang G. Shin “A new scheduling scheme for multicast true VoD service,” Lecture Notes in Computer Science (Proc. PCM2001). Springer, Oct. 2001, Vol. 2195, pp. 708–715.
Huadong Ma and Kang G. Shin “Multicast video-on-demand services,” ACM Computer Communication Review, ACM Press, Vol. 32, No. 1, pp. 31–43, 2002
Huadong Ma and Kang G. Shin “Hybrid broadcast for video-on-demand service,” Journal of Computer Science and Technology, Science Press, Vol. 17, No. 4, pp. 397–410, 2002.
S. Sen, L. Gao, J. Rexford, and D. Towsley “Optimal patching schemes for efficient multimedia streaming,” in Proc. NOSSDAV’99, Basking Ridge, NJ, June 1999
H. Tan, D.L. Eager, M.K. Vernon, and H. Guo “Quality of service evaluations of multicast streaming protocols”, in Proc. ACM SIGMETRICS 2002, Marina del Rey, CA, June 2002.
S. Viswanathan and T. Imielinski, “Metropolitan area video-on-demand service using pyramid broadcasting,” Multimedia Systems, Vol. 4, No. 4, pp. 197–208, 1996.
Author information
Authors and Affiliations
Corresponding author
Additional information
Huadong Ma received the B.S. degree in Mathematics from Henan Normal University in 1984, the M.S. degree in Computer Science from Shenyang Institute of Computing Technology, Chinese Academy of Science (CAS) in 1990 and the Ph.D. degree in Computer Science from Institute of Computing Technology, CAS, in 1995.
He is a Professor with the School of Computer Science & Technology, Beijing University of Posts and Telecommunications, China. He visited UNU/IIST as research fellow in 1998 and 1999, respectively. From 1999 to 2000, he held a visiting position in the Real-Time Computing Laboratory in the Department of Electrical Engineering and Computer Science, The University of Michigan, Ann Arbor. His current research focuses on multimedia, networking, e-commerce and computergraphics, and he has published over 70
papers and 3 books on these fields. He is member of IEEE and ACM.
Kang G. Shin received the B.S. degree in Electronics Engineering from Seoul National University, Korea, in 1970, and both the M.S. and Ph.D. degrees in Electrical Engineering from Cornell University, Ithaca, New York in 1976 and 1978, respectively.
He is the Kevin and Nancy O’Connor Professor of Computer Scienceand Founding Director of the Real-Time Computing Laboratory in the Department of Electrical Engineering and Computer Science, The University of Michigan, Ann Arbor. His current research focuses on QoS-sensitive networking and computing as well as on embedded real-time OS, middleware and applications, all with emphasis on timeliness and dependability. He has supervised the completion of 49 Ph.D. theses, and authored/coauthored over 600 technical papers and numerous book chapters in the areas of distributed real-time computing and control, computer networking, fault-tolerant computing, and intelligent manufacturing. Dr. Shin is Fellow of IEEE and ACM, and member of the Korean Academy of Engineering.
Weibiao Wu received the Ph.D. degree in statistics from the University of Michigan, Ann Arbor in 2001. He is currently an Assistant professor of statistics at the University of Chicago. His research interests include probabilistic network modelling and simulation, data-base compression, asymptotic theory and statistical inference of stochastic processes.
Rights and permissions
About this article
Cite this article
Ma, H., Shin, G.K. & Wu, W. Best-Effort Patching for Multicast True VoD Service. Multimed Tools Appl 26, 101–122 (2005). https://doi.org/10.1007/s11042-005-6851-x
Issue Date:
DOI: https://doi.org/10.1007/s11042-005-6851-x