DOI QR코드

DOI QR Code

Design and Evaluation of a Channel Reservation Patching Method for True VOD Systems

True VOD 시스템을 위한 채널 예약 패칭 방법의 설계 및 평가

  • 이주영 (엠비즈 네트워크) ;
  • 하숙정 (경북대학교 전자전기컴퓨터학부) ;
  • 배인한 (대구가톨릭대학교 컴퓨터정보통신공학부)
  • Published : 2002.12.01

Abstract

The number of channels available to a video server is limited since the number of channels a video server can support is determined by its communication bandwidth. Several approaches such as batching, piggybacking and patching have been proposed to reduce I/O demand on the video server by sharing multicast data. Patching has been shown to be efficient in the matter of the cost for VOD systems. Unlike conventional multicast techniques, patching is a dynamic multicast scheme which enables a new request to join an ongoing multicast. In addition, true VOD can be achieved since a new request can be served immediately without having to wait for the next multicast. In this paper. we propose two types of channel reservation patching algorithm : a fixed channel reservation patching and a variable channel reservation patching. To immediately schedule the requests for popular videos, these algorithms reserve the channels of video server for the fixed number of popular videos or for the variable number of popular videos which is determined dynamically according to the load of video server. The performance of the proposed algorithms is evaluated through simulations, and compared with that of simple patching. Our performance measures are average defection rate, average latency, service fairness and the amount of buffered data according to video server loads. Simulation results show that the proposed channel reservation patching algorithms provide better performance compared to simple patching algorithm.

비디오 서버가 제공할 수 있는 채널의 개수는 서버의 통신 대역폭에 의해 결정되므로 비디오 서버의 가용 채널 수는 제한되어 있다. 멀티캐스트 데이터를 공유함으로써 비디오 서버에 대한 I/O 요구를 절감시키기 위하여 일괄처리, 피기백킹 그리고 패칭과 같은 여러 방법들이 제안되었다. 특히 패칭은 VOD 시스템을 위한 비용에 있어서 효율적인 것으로 보여지고 있다. 패칭은 일반적인 멀티캐스트 기법과 달리 새로운 요청을 진행중인 멀디캐스트에 합병할 수 있게 하는 동적 멀티캐스트 방법이다. 더욱이, 새로운 요청은 다음 멀티캐스트를 기다리지 않고 즉시 서비스될 수 있으므로 true VOD를 이룰 수 있다. 본 논문에서, 우리는 고정 채널 예약 패칭과 가변 채널 예약 피칭이라는 두 가지 채널 예약 패칭 알고리즘을 제안한다. 인기 비디오에 대한 용청들을 즉시 스케줄하기 위하여, 제안하는 알고리즘들은 고정된 개수의 인기 비디오 또는 서버의 부하에 따라 동적으로 결정되는 가변 개수의 인기 비디오를 위하여 비디오 서버의 채널들을 예약한다. 제안하는 알고리즘들의 성능은 시뮬레이션을 통하여 평가되었고, 단순 패칭의 성능과 비교하였다. 사용된 성능 척도는 비디오 서버 부하에 다른 평균 이탈율, 평균 대기 시간, 서비스 공평성 그리고 버퍼량이다. 시뮬레이션 결과는 우리가 제안하는 채널 예약 패칭 알고리즘들이 단순 패칭보다 성능이 더 나음을 보였다.

Keywords

References

  1. Jani Huoponen and Thorsten Wagner, 'Video on Demand A Survey,' telecommunication Networks Project, 1, http://fiddle.visc.vt.edu/courses/ee4984/Projects1996/huoponen_wagner/huoponen_wagner.html, 1996
  2. Christer Samuelesson, 'Relating Turing's Formula and Zipf's Law,' Proceedings of the Fourth Workshop on Very Large Corpora, 1996
  3. 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 https://doi.org/10.1145/290747.290771
  4. S. Sen, L. Gao, J. Rexford, and D. Towsley, 'Optimal Patching Schemes for Efficient Multimedia Streaming,' Tech. Rep. 99-2, Department of Computer Science, University of Massachusetts Amherst, p.18, 1999
  5. Y. Cai, K. Hua, and K. Vu, 'Optimizing Patching Performance,' In Proc. SPIE/ACM Conference on Multimedia Computing and Networking, pp.204-215, 1999
  6. D. L. Eager, M. K. Vernon, and]. Zahorjan, 'Optimal and Efficient Merging Schedules for Video-on-Demand Servers,' In Proceedings ACM Multimedia 99, pp.199-202, 1999 https://doi.org/10.1145/319463.319601
  7. T. Little and D. Venkatesh, 'Prospect for Interactive Videoon-Demand,' IEEE Multimedia Magazine, pp.14-24, 1994 https://doi.org/10.1109/MMUL.1994.318978
  8. D. Deloddere, W. Verbiest, and H. Verhile, 'Interactive Video On Demand,' IEEE Communication Magazine, pp.82-88, 1994 https://doi.org/10.1109/35.281582
  9. DA VIC Specification 1.0, http://www.davic.org
  10. F. A Tobagi et al., 'Streaming RAID: A Disk Storage System for Video and Audio Files,' In Proc. ACM Multimedia 93, pp.393-400, 1993 https://doi.org/10.1145/166266.168435
  11. Dan, A, Sitaram, D., and Shahabuddin, P., 'Scheduling Polices for an On-Demand Video Server with Batching,' In Proc. of the 2nd ACM Multimedia Conference, pp.25-32, 1994 https://doi.org/10.1145/192593.192614
  12. D. L. Eager, M. K. Vernon, and]. Zahorian, 'Optimal and Efficient Merging Schedules for Video-on-Demand Servers,' In Proc. of the 7-th ACM International Multimedia Conference, pp.199-203, 1999 https://doi.org/10.1145/319463.319601
  13. 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 Con! on Measurement and Modeling of Computer Systems, pp.200-209, 1996 https://doi.org/10.1145/233013.233044
  14. L. Golubchik, J. Lui, and R. Muntz, 'Adaptive Piggybacking: Arrival Technique for Data Sharing in Video-on-Demand Service,' ACM Multimeda Systems, Vol.4, No.3, pp.140-155, 1996 https://doi.org/10.1007/s005300050019
  15. 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 https://doi.org/10.1145/263105.263144
  16. D. Eager and M. Vernon, 'Dynamic Skyscraper Broadcasts for Video-on-Demand,' In Proc. 4th Int. Workshop on Advances in Multimedia Information Systems, pp.18-32, 1998
  17. J. Korst, 'Random Duplicated Assignment: An Alternative to Striping in Video Servers,' In Proc. of ACM Int'l Multimedia Conference, pp.219-226, 1997
  18. M. S. Chen and D. D. Kandlur, 'Stream conversion to support interactive video playout,' IEEE Multimedia magazine, Vol.3, No.2, pp.51-58, 1996 https://doi.org/10.1109/93.502294
  19. W. Feng, F. Jahanian, and S. Sechrest, 'Providing VCR Functionality in a Constant Quality Video-on-Demand Transportation Service,' In Proc. of the IEEE Int'l Conf. on Multimedia Systems'96, pp.25-32, 1996 https://doi.org/10.1109/MMCS.1996.534964
  20. 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 https://doi.org/10.1145/217279.215256
  21. A, Dan and D. Sitaram, 'A Generalized Caching Policy for Mixed Interactive and Long Video Wrokloads,' IBM Research Report, RC 20206, Yorktown Heights, NY, 1995