Algorithms for designing multimedia servers

In this paper, we propose a novel adaptive admission control algorithm, in which a client is admitted for service by a multimedia server only if the extrapolation from the past measurements of the storage server performance characteristics indicates that the service requirements of all the clients c...

Full description

Saved in:
Bibliographic Details
Published in:Computer communications 1995-03, Vol.18 (3), p.192-203
Main Authors: Vin, Harrick M, Goyal, Alok, Goyal, Pawan
Format: Article
Language:English
Subjects:
admission control algorithm
disk scheduling algorithm
Multimedia
multimedia servers
quality of service
Servers
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we propose a novel adaptive admission control algorithm, in which a client is admitted for service by a multimedia server only if the extrapolation from the past measurements of the storage server performance characteristics indicates that the service requirements of all the clients can be met satisfactorily. Each client may request the retrieval of a variable bit rate (VBR) encoded media stream, and may require a different quality of service. We also present a disk scheduling algorithm that minimizes both seek time and rotational latency incurred while accessing a sequence of media blocks from disk. We examine the effects of a finite read-ahead on the quality of service provided to each admitted client. The effectiveness of the admission control and disk scheduling algorithms is demonstrated through extensive simulations.
ISSN:0140-3664
1873-703X
DOI:10.1016/0140-3664(95)98542-D