Browse > Article

Design and Evaluation of a Buffering Patching Technique for VOD Systems  

하숙정 (경북대학교 전자전기컴퓨터학부)
배인한 (대구가톨릭대학교 컴퓨터정보통신공학부)
Publication Information
Journal of KIISE:Computer Systems and Theory / v.30, no.10, 2003 , pp. 523-532 More about this Journal
Abstract
Video on Demand(VOD) services cause high resource consumption in a video seuer, because multimedia are characterized by continuous playback, a high bandwidth requirement, and long playback duration. Patching has been proposed to save the network I/O bandwidth of a video server. To achieve true VOD, patching uses multicasting to share video streams, thereby providing immediate VOD services to users without any service latency. A communication channel is used to either multicast the entire video as a regular channel or multicast only the leading portion of a video as a Patching channel. This paper Proposes a buffering patching technique that divides regular channels, as used in patching, into sub-regular channels and regular channels to shorten the holding time of the channels. In the proposed technique, the last portion of video data, corresponding to the size of the buffering window, is not transferred by sub-regular channels, but rather downloaded and buffered in the user buffer from the latest regular channel. When simulations were performed to compare the performance of the proposed technique with that of conventional patching, the results indicated that the proposed technique was superior in terms of the defection rate, average service latency, and fairness, although the amount of video data buffered at each user station was higher than that with patching.
Keywords
Video-on-Demand service; Patching; Multicast; Regular channel; Sub-regular channel; Buffering; Buffering window;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Relating Turing's Formula and Zipf's Law /
[ Christer Samuelesson ] / Proceedings of the Fourth Workshop on Very Large Corpora
2 Y. Cai, K. Hua, and K. ve. 'Optimizing Patching Performance,' In Proc. SPIE/ACM Conference on Multimedia Computing and Networking, pp. 204215, 1999   DOI
3 A. Dan, D. Sitaram, and P. Shahabuddin, 'Scheduling Polices for an On-Demand Video Server with Batching,' In Proc. of the 2nd ACM Multimedia Conference. pp. 25-32. 1994   DOI
4 Jani Huoponen and Thorsten Wagner, 'Video on Demand A Survey,' telecommunication Networks Project, 1, http://fiddle.vise.vt.edu/courses/ee49841 ProjectsI996/huoponen_wagner/huoponen_wagner.html, 1996
5 Christer Samuelesson, 'Relating Turing's Formula and Zipf's Law,' Proceedings of the Fourth Workshop on Very Large Corpora, 1996
6 L. Golubchik, J. Lui, and R. Muntz, 'Adaptive Piggybacking: Anival Technique for Data Sharing in Video-on-Demand Service.' ACM Multimeda Systems, Vol.4, No.3, pp.140-155, 1996   DOI
7 C. C. Aggarwal, J. L. Wolf, and P. S. Yu, 'On Optimal Piggyback Merging Policies for VideoOn-Demand Systems.' In Proc. 1996 ACM SIGM-ETRICS Conf. on Measurement and Modeling qf Computer Systems, pp. 200-209. 1996   DOI
8 K. Hua, Y. Cai, and S. Sheu, 'Patching: A Multicast Technique for True Video-an-Demand Services.' In Proc. ACM Multimedia, pp. 191-200. 1998   DOI
9 A.Chervenak, D. Patterson, and R. Katz, 'Choosing the Best Storage System for Video Service,' In Proc. of ACM Multimedia 95, pp. 109-119, Aug. 1995   DOI