Browse > Article

Determination of Reserved Channel Capacity for Popular Videos in Video-on-Demand Systems  

하숙정 (경북대학교 전자전기컴퓨터학부)
배인한 (대구가톨릭대학교 컴퓨터정보통신공학부)
Abstract
Video-on-Demand (VOD) service needs high resource consumption because of high bandwidth and long playback duration which are characteristics of multimedia. Various techniques such as Patching and Channel-Reserving Patching have been proposed to reduce the demand on the network-I/O bandwidth. Patching allows new clients to join an existing multicast for realization of true VOD, and Channel-Reserving Patching reserves the part of total channel capacity of video server in order to serve the requests for popular videos on which requests of users concentrate. To improve the performance of Channel-Reserving Patching, we propose the method that determines the reserved channel capacity of video server for the popular videos in this paper. The performance of our method is evaluated in terms of average servile latency, defection ratio and fairness through simulation, and is compared with those of Patching and another Channel-Reserving Patching.
Keywords
True VOD; Multimedia; Multicast; Skew; Reserved Channel Capacity; Popular Video; Patching; Patching Window; True VOD;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 Y. Cai, K. Hua, and K. Vu, 'Optimizing Patching Performance', In Proc. SPIE/ACM Conference on Multimedia Computing and Networking, pp. 204-215, 1999
2 Jani Huoponen and Thorsten Wagner, 'Video on Demand A Survey', telecommunication Networks Project, 1, http://fiddle.visc.vt.edu/courses/ee4984 /Projectsl996/huoponen_wagner/huoponen_wagner.html, 1996
3 K. Hua, Y. Cai, and S. Sheu, 'Patching: A Multicast Technique for True Video-on-Demand Services', In Proc ACM Multimedia, pp. 191-200, 1998
4 C. C. Aggarwal, J. L. Wolf, and P. S. Yu, 'On Optimal Piggyback Merging Policies for Video-On-Demand Systems', In Proc. 1996 ACM SIGMETRICS Corf. on Measurement and Modeling of Computer Systems, pp. 200-209, 1996   DOI
5 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
6 D. L. Eager, M. K. Vernon, and J. Zahorjan, 'Optimal and Efficient Merging Schedules for Video-on-Demand Servers', In Proc. of the 7-th ACM International Multimedia Conference, pp. 199-203, 1999   DOI
7 이주영, 이경숙, 오선진, 배인한, 'True VOD 시스 템을 위한 자원 예약 기반 패칭 방법', 인터넷정보학회 학술발표논문집, 제2권 2호, pp. 212-216, 2001
8 이주영, 하숙정, 배인한, 'True VOD 시스템을 위한 채널 예약 패칭 방법의 설계 및 평가', 정보처리학회논문지, 제9-B권, 제6호, pp. 835-844, 2002   과학기술학회마을   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
10 Christer Samuelesson, 'Relating Turing's Formula and Zipf's Law', Proceedings of the Fourth Workshop on Very Large Corpora, 1996
11 K. Hua and S. Sheu, 'Skyscraper broadcasting: A New Broadcasting Scheme for Metropolitan Video-on-Demand Systems', In Proc. ACM SIGCOMM, pp. 89-100, 1997   DOI