Scheduling continuous media in a video-on-demand server

Deepak R. Kenchammana-Hosekote, Jaideep Srivastava

Research output: Chapter in Book/Report/Conference proceedingConference contribution

32 Citations (Scopus)

Abstract

Advances in storage, compression, and network technology are making support for Video-On-Demand applications feasible. Continuous and real time data needs of this application require resource management and scheduling of storage devices. This paper discusses a model for scheduling storage devices to guarantee rate requirements for continuous media. We present an analysis of this class of schedulers and derive a feasibility condition and its buffer requirements. The condition is used for admission control of new requests, operations on existing requests, and to configure block sizes and main memory requirements. The analysis presented here yields solutions in the continuous domain. However, due to the discrete nature of the disk scheduler a solution from this analysis cannot be implemented. We discuss transformations of the derived solution into one in the discrete domain while ensuring guaranteed data rate.

Original languageEnglish
Title of host publicationProceedings of the International Conference on Multimedia Computing and Systems
Editors Anon
Place of PublicationLos Alamitos, CA, United States
PublisherPubl by IEEE
Pages19-28
Number of pages10
ISBN (Print)0818655305
Publication statusPublished - 1994
Externally publishedYes
EventProceedings of the International Conference on Multimedia Computing and Systems - Boston, MA, USA
Duration: 14 May 199419 May 1994

Other

OtherProceedings of the International Conference on Multimedia Computing and Systems
CityBoston, MA, USA
Period14/5/9419/5/94

Fingerprint

Video on demand
Servers
Scheduling
Access control
Data storage equipment

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Kenchammana-Hosekote, D. R., & Srivastava, J. (1994). Scheduling continuous media in a video-on-demand server. In Anon (Ed.), Proceedings of the International Conference on Multimedia Computing and Systems (pp. 19-28). Los Alamitos, CA, United States: Publ by IEEE.

Scheduling continuous media in a video-on-demand server. / Kenchammana-Hosekote, Deepak R.; Srivastava, Jaideep.

Proceedings of the International Conference on Multimedia Computing and Systems. ed. / Anon. Los Alamitos, CA, United States : Publ by IEEE, 1994. p. 19-28.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kenchammana-Hosekote, DR & Srivastava, J 1994, Scheduling continuous media in a video-on-demand server. in Anon (ed.), Proceedings of the International Conference on Multimedia Computing and Systems. Publ by IEEE, Los Alamitos, CA, United States, pp. 19-28, Proceedings of the International Conference on Multimedia Computing and Systems, Boston, MA, USA, 14/5/94.
Kenchammana-Hosekote DR, Srivastava J. Scheduling continuous media in a video-on-demand server. In Anon, editor, Proceedings of the International Conference on Multimedia Computing and Systems. Los Alamitos, CA, United States: Publ by IEEE. 1994. p. 19-28
Kenchammana-Hosekote, Deepak R. ; Srivastava, Jaideep. / Scheduling continuous media in a video-on-demand server. Proceedings of the International Conference on Multimedia Computing and Systems. editor / Anon. Los Alamitos, CA, United States : Publ by IEEE, 1994. pp. 19-28
@inproceedings{eff51b2b015e49b9b89146e1211db9cf,
title = "Scheduling continuous media in a video-on-demand server",
abstract = "Advances in storage, compression, and network technology are making support for Video-On-Demand applications feasible. Continuous and real time data needs of this application require resource management and scheduling of storage devices. This paper discusses a model for scheduling storage devices to guarantee rate requirements for continuous media. We present an analysis of this class of schedulers and derive a feasibility condition and its buffer requirements. The condition is used for admission control of new requests, operations on existing requests, and to configure block sizes and main memory requirements. The analysis presented here yields solutions in the continuous domain. However, due to the discrete nature of the disk scheduler a solution from this analysis cannot be implemented. We discuss transformations of the derived solution into one in the discrete domain while ensuring guaranteed data rate.",
author = "Kenchammana-Hosekote, {Deepak R.} and Jaideep Srivastava",
year = "1994",
language = "English",
isbn = "0818655305",
pages = "19--28",
editor = "Anon",
booktitle = "Proceedings of the International Conference on Multimedia Computing and Systems",
publisher = "Publ by IEEE",

}

TY - GEN

T1 - Scheduling continuous media in a video-on-demand server

AU - Kenchammana-Hosekote, Deepak R.

AU - Srivastava, Jaideep

PY - 1994

Y1 - 1994

N2 - Advances in storage, compression, and network technology are making support for Video-On-Demand applications feasible. Continuous and real time data needs of this application require resource management and scheduling of storage devices. This paper discusses a model for scheduling storage devices to guarantee rate requirements for continuous media. We present an analysis of this class of schedulers and derive a feasibility condition and its buffer requirements. The condition is used for admission control of new requests, operations on existing requests, and to configure block sizes and main memory requirements. The analysis presented here yields solutions in the continuous domain. However, due to the discrete nature of the disk scheduler a solution from this analysis cannot be implemented. We discuss transformations of the derived solution into one in the discrete domain while ensuring guaranteed data rate.

AB - Advances in storage, compression, and network technology are making support for Video-On-Demand applications feasible. Continuous and real time data needs of this application require resource management and scheduling of storage devices. This paper discusses a model for scheduling storage devices to guarantee rate requirements for continuous media. We present an analysis of this class of schedulers and derive a feasibility condition and its buffer requirements. The condition is used for admission control of new requests, operations on existing requests, and to configure block sizes and main memory requirements. The analysis presented here yields solutions in the continuous domain. However, due to the discrete nature of the disk scheduler a solution from this analysis cannot be implemented. We discuss transformations of the derived solution into one in the discrete domain while ensuring guaranteed data rate.

UR - http://www.scopus.com/inward/record.url?scp=0027986109&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0027986109&partnerID=8YFLogxK

M3 - Conference contribution

SN - 0818655305

SP - 19

EP - 28

BT - Proceedings of the International Conference on Multimedia Computing and Systems

A2 - Anon, null

PB - Publ by IEEE

CY - Los Alamitos, CA, United States

ER -