An observation-based admission control algorithm for multimedia servers

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