An observation-based admission control algorithm for multimedia servers
- 1 January 1994
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 234-243
- https://doi.org/10.1109/mmcs.1994.292458
Abstract
Proposes a novel observation-based admission control algorithm, in which a client is admitted for service by a multimedia server only if the predicted extrapolation from the status quo measurements of the storage server utilization indicate that the service requirements of all the clients can be met satisfactorily. The performance of the admission control algorithm, and hence, the number of clients admitted and serviced simultaneously are maximized by employing a disk scheduling algorithm that minimizes both seek and rotational latency incurred while accessing a sequence of media blocks from disk. The effectiveness of the observation-based admission control algorithm is demonstrated through extensive simulations.< >Keywords
This publication has 12 references indexed in Scilit:
- Designing a multiuser HDTV storage serverIEEE Journal on Selected Areas in Communications, 1993
- Streaming RAIDPublished by Association for Computing Machinery (ACM) ,1993
- Design and analysis of a grouped sweeping scheme for multimedia storage managementPublished by Springer Nature ,1993
- An admission control algorithm for predictive real-time service (extended abstract)Lecture Notes in Computer Science, 1993
- Principles of delay-sensitive multimedia data storage retrievalACM Transactions on Information Systems, 1992
- Supporting real-time applications in an Integrated Services Packet NetworkPublished by Association for Computing Machinery (ACM) ,1992
- A fast file system for UNIXACM Transactions on Computer Systems, 1984
- Disk schedulingCommunications of the ACM, 1980
- Minimizing Expected Head Movement in One-Dimensional and Two-Dimensional Mass Storage SystemsACM Computing Surveys, 1980
- A comparative analysis of disk scheduling policiesCommunications of the ACM, 1972