Patching-based broadcasting scheme for video services

  • Authors:

  • Satish Chand;Bijendra Kumar;Hari Om

  • Affiliations:

  • Computer Engineering Division, Netaji Subhas Institute of Technology, Sector-3, Dwarka, New Delhi, India;Computer Engineering Division, Netaji Subhas Institute of Technology, Sector-3, Dwarka, New Delhi, India;Department of Computer Science and Engineering, Indian School of Mines, Dhanbad, India

  • Venue:
  • Computer Communications
  • Year:
  • 2008

Quantified Score

Hi-index 0.24

Visualization

Abstract

In two-level patching scheme [D. Guan, Y. Songyu, A two-level patching scheme for video-on-demand delivery, IEEE Transactions on Broadcasting 50(1) (2004) 11-15], the video duration is divided into periods and the periods are divided into time-windows. The first request in a period initiates a zero-level channel and the first request in a period, which is the first end of a time-window, initiates a one-level channel. The other requests in a time-window initiate their own two-level channels. In a time-window, the size of the consumed video has been estimated. This scheme suffers from two problems. (i) The consumed video data transmitted by a two-level channel in a time-window has been taken half of its size, which is less accurate. It is because, since both ends of the video data provided by a two-level channel are random, and in that case, it should be one third of the time-window size, not the half. (ii) The probability of zero requests has been taken non-zero, which is also less accurate because, using bandwidth for no-request, the bandwidth is wasted. The probability of zero requests should be zero as there must be at least one request to view the video, if bandwidth is used, so that the bandwidth can be utilized. In this paper, we propose the patching based broadcasting scheme for video services in which both the issues are addressed, making the scheme more versatile. In this scheme, the users are provided immediate services using different level channels.