Abstract
Network bandwidth is the key performance bottleneck for a video-on-demand (VoD) server. It controls the number of clients the server can support simultaneously. Previous works have shown some strategies, such as the batching strategy and the stream merging strategy, that use one multicast stream to serve different clients requesting the same video object at the same time. They improve the performance of server bandwidth effectively. But the batching strategy results in long start-up latency and the traditional stream merging strategy also wastes lots of server bandwidth. In this paper, we propose a dynamically grouped multi-multicast stream scheduling strategy, called DGMM, and analyze its performance in two factors: the start-up latency and the average bandwidth consumption.
This paper is supported by Wuhan Key Hi-Tech Project under grant 20011001001.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
C. C. Aggarwal, J. L. Wolf, and P. S. Yu, “The Maximum Factor Queue Length Batching Scheme for Video-on-Demand Systems”, IEEE Transactions on Computers, Vol.50, No.2, pp.97–110, Feb. 2001.
S. W. Cater and D. D. E. Long, “Improving video-on-demand server efficiency through stream tapping”, Proc. of ICCCN, Las Vegas, NV, Sept. 1997, pp.200–207.
S. W. Cater and D. D. E. Long, “Improving bandwidth efficiency on video-on-demand servers”, Computer Networks, Vol30, No. 1–2, pp.99–111, Jan. 1999.
S.-H. G. Chan and E. Chang, “Providing scalable on-demand interactive video services by means of client buffering”, Proc. IEEE ICC, Helsinki, Finland, June 2001.
J.-K. Chen and J.-L. C. Wu, “Heuristic batching policies for video-on-demand services”, Computer Communications, Vol.22, pp.1198–1205, 1999.
A. Dan, D. Sitaram, and P. Shahabuddin, “Dynamic batching policies for an on-demand video server”, Multimedia Systems, Vol.4, pp.112–121, June 1996.
D. Eager and J. Z. M. Vernon, “Bandwidth Skimming: A Technique for Cost-Effective Video-on-Demand”, Proc. Multimedia Computing and Networking 2000, San Jose, CA, January 2000.
L. Gao and D. Towsely, “Threshold-based multicast for continuous media delivery”, IEEE Transactions on Multimedia, Vol.3, No. 4, pp.405–414, December 2001.
S.-H. G. Chan and F. Tobagi, “Tradeoff between System Profit and User Delay/Loss in Providing Near Video-on-Demand Service”, IEEE Transactions on Circuits and Systems for Video Technology, Vol.11, No. 8, Aug. 2001.
K. A. Hua, Y. Cai, and S. Sheu, “Patching: A multicast technique for true video-on-demand services”, Proc. of ACM Multimedia, Sept. 1998.
H. Shachnai and P. Yu, “Exploring Wait Tolerance in Effective Batching for Video-on-Demand Scheduling”, Multimedia Systems, Vol.6, No. 6, pp.382–394, 1998.
S. Viswanathan and T. I. Metropolitan, “Video-on-demand service using pyramid broadcasting”, Multimedia Systems, Vol.4, No. 4, pp.197–208, Aug. 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Deng, D., Jin, H., Han, Z. (2003). A Dynamically Grouped Multi-multicast Stream Scheduling Strategy for Video-on-Demand Systems. In: Sloot, P.M.A., Abramson, D., Bogdanov, A.V., Gorbachev, Y.E., Dongarra, J.J., Zomaya, A.Y. (eds) Computational Science — ICCS 2003. ICCS 2003. Lecture Notes in Computer Science, vol 2658. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44862-4_89
Download citation
DOI: https://doi.org/10.1007/3-540-44862-4_89
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40195-7
Online ISBN: 978-3-540-44862-4
eBook Packages: Springer Book Archive