DOI QR코드

DOI QR Code

An Expanded Patching Technique using Four Types of Streams for True VoD Services

  • Ha, Sook-Jeong (Department of Computer Engineering, Kyungpook National University) ;
  • Bae, Ihn-Han (School of Computer and Information Engineering, Catholic University of Daegu) ;
  • Kim, Jin-Gyu (School of Electrical Engineering, Kyungpook National University) ;
  • Park, Young-Ho (School of Electrical Engineering, Kyungpook National University) ;
  • Oh, Sun-Jin (School of Computer and Communication System, Semyung University)
  • 발행 : 2009.10.30

초록

In this paper, we propose an expanded patching technique in order to reduce the server network bandwidth requirements to support true VoD services in VoD Systems. Double Patching, which is a typical multicast technique, ensures that a long patching stream delivers not only essential video data for the current client but also extra video data for future clients. Since the extra data may include useless data, it results in server network bandwidth wastage. In order to prevent a server from transmitting useless data, the proposed patching technique uses a new kind of stream called a linking stream. A linking stream is transmitted to clients that have received short patching streams, and it plays a linking role between a patching stream and a regular stream. The linking stream enables a server to avoid transmitting unnecessary data delivered by a long patching stream in Double Patching, so the server never wastes its network bandwidth. Mathematical analysis shows that the proposed technique requires less server network bandwidth to support true VoD services than Double Patching. Moreover, simulation results show that it has better average service latency and client defection rate compared with Double Patching.

키워드

참고문헌

  1. K. Hua, Y. Cai, and S. Sheu, “Patching: A Multicast Technique for True Video-on- Demand Services,” Proc. of ACM Multimedia, pp. 191-200, 1998.
  2. Ying Cai, Wallapak Tavanapong, and Kien A. Hua, “A Double Patching Technique for Efficient Bandwidth Sharing in Video-on-Demand Systems,” Journal of Multimedia Applications and Tools, Vol. 32, No. 1, pp. 115-136, 2007.
  3. C. C. Aggarwal, J. L. Wolf, and P. S. Yu, “A permutation-based Pyramid Broadcasting Scheme for Video-on-Demand systems,” Proc. of International Conference on Multimedia Computing and Systems, pp. 118-126, 1996.
  4. K. A. Hua and S. Sheu, “Skyscraper Broadcasting: A New Broadcasting Scheme for Metropolitan Video-On-Demand Systems,” Proc. of the ACM SIGCOMM’97, pp. 89-100. 1997.
  5. J. F. Paris, S. W. Carter, and D. D. E. Long, “Efficient Broadcasting Protocols for Video on Demand,” Proc. of SPIE’s Conference on Multimedia Computing and Networking (MMCN’99), pp. 317-326, 1999.
  6. A. Dan, D. Sitaram, and P. Shahabuddin, “Scheduling Polices for an On-Demand Video Server with Batching,” Proc. of the 2nd ACM Multimedia Conference, pp. 25-32, 1994.
  7. L. Golubchik, J. Lui, and R. Muntz, “Adaptive Piggybacking: Arrival Technique for Data Sharing in Video-on-Demand Service,” ACM Multimedia Systems, Vol. 4, No. 3, pp.140-155, 1996. https://doi.org/10.1007/s005300050019
  8. Y. Cai, K. Hua, and K. Vu, “Optimizing Patching Performance,” Proc. SPIE/ACM Conference on Multimedia Computing and Networking, pp. 204-215, 1999.
  9. H.-Y. Lee, S.-J. Oh, S.-J. Ha, and I.-H. Bae, “Design and Evaluation of a Scaling Patching Technique for VOD Servers,” LNAI 3214, pp. 219-226, 2004.
  10. S.-J. Ha and I.-H. Bae, “Determination of Reserved Channel Capacity for Popular Video in Video-on-Demand Systems,” Journal of KISS: Computer Systems and Theory, Vol. 30, No. 5-6, pp. 223-231, 2003.