A quasi-static retrieval scheme for interactive VOD servers

  • Authors:

  • Senthil Sengodan;Victor O. K. Li

  • Affiliations:

  • Communication Sciences Institute, Department of Electrical Engineering-systems, University of Southern California, Los Angeles, CA 90089-2565, USA;Communication Sciences Institute, Department of Electrical Engineering-systems, University of Southern California, Los Angeles, CA 90089-2565, USA

  • Venue:
  • Computer Communications
  • Year:
  • 1997

Quantified Score

Hi-index 0.24

Visualization

Abstract

Video-on-demand (VOD) servers need to be efficiently designed in order to support a large number of users viewing the same or different videos at different rates. In this paper, we propose a simple quasi-static retrieval scheme that may be used for this purpose when interactive disk-array based video servers are used. We assume presence of no buffer at the server and hence, all retrieved segments are immediately transmitted to the appropriate users. Such a retrieval scheme employs a macro-slot assigner and a disk scheduler. Macro-slots define a duration of time in a service round within which one video segment needs to be retrieved for a user. Having assigned macro-slots to users, the disk scheduler uses the non-preemptive earliest deadline first (N-EDF) algorithm to determine a valid schedule for segment retrieval. In order to increase the number of users that can be served by the system, the number of disk seeks in a service round needs to be decreased. This is done in the Scan-N-EDF algorithm by appropriately grouping retrievals and using the scan algorithm within each group. For a given video segment size, the amount of buffer required at each user's set-top box is reduced to two video segments. Guarantees are provided for the avoidance of video starvation as well as buffer overflow at each user's set-top box.