A Statistical Admission Control Scheme for Continuous Media Servers Using Caching

In continuous media servers, disk load can be reduced by using buffer cache. In order to utilize the saved disk bandwidth by caching, a continuous media server must employ an admission control scheme to decide whether a new client can be admitted for service without violating the requirements of clients already being serviced. A scheme providing deterministic QoS guarantees in servers using caching has already been proposed. Since, however, deterministic admission control is based on the worst case assumption, it causes the wastage of the system resources. If we can exactly predict the future available disk bandwidth, both high disk utilization and hiccup-free service are achievable. However, as the caching effect is not analytically determined, it is difficult to predict the disk load without substantial computation overhead. In this paper, we propose a statistical admission control scheme for continuous media servers where caching is used to reduce disk load. This scheme improves disk utilization and allows more streams to be serviced while maintaining near-deterministic service. The scheme, called Shortsighted Prediction Admission Control (SPAC), combines exact prediction through on-line simulation and statistical estimation using a probabilistic model of future disk load in order to reduce computation overhead. It thereby exploits the variation in disk load induced by VBR-encoded objects and the decrease in client load by caching. Through trace-driven simulations, it is demonstrated that the scheme provides near-deterministic QoS and keeps disk utilization high.

[1]  Asit Dan,et al.  Buffering and caching in large-scale video servers , 1995, Digest of Papers. COMPCON'95. Technologies for the Information Superhighway.

[2]  Nicholas Carriero,et al.  Adaptive Parallelism and Piranha , 1995, Computer.

[3]  Sreenivas Gollapudi,et al.  Buffer management in multimedia database systems , 1996, Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems.

[4]  Heon Young Yeom,et al.  Exploiting caching for realtime multimedia systems , 1999, Proceedings IEEE International Conference on Multimedia Computing and Systems.

[5]  Stavros Christodoulakis,et al.  Principles of delay-sensitive multimedia data storage retrieval , 1992, TOIS.

[6]  M. Kendall Probability and Statistical Inference , 1956, Nature.

[7]  Sandy Irani,et al.  Cost-Aware WWW Proxy Caching Algorithms , 1997, USENIX Symposium on Internet Technologies and Systems.

[8]  P. Venkat Rangan,et al.  Designing a Multiuser HDTV Storage Server , 1993, IEEE J. Sel. Areas Commun..

[9]  P. J. Green,et al.  Probability and Statistical Inference , 1978 .

[10]  Edward W. Knightly,et al.  Traffic characterization and switch utilization using a deterministic bounding interval dependent traffic model , 1995, Proceedings of INFOCOM'95.

[11]  Raymond Ng,et al.  Statistical Modeling and Buffer Allocation for Mpeg Streams , 1996 .

[12]  Ramesh Govindan,et al.  A file system for continuous media , 1992, TOCS.

[13]  P. Venkat Rangan,et al.  Multimedia Storage Servers: A Tutorial and Survey , 1995 .

[14]  David A. Patterson,et al.  Computer Architecture: A Quantitative Approach , 1969 .

[15]  Banu Özden,et al.  Buffer replacement algorithms for multimedia storage systems , 1996, Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems.

[16]  Harrick M. Vin,et al.  A statistical admission control algorithm for multimedia servers , 1994, MULTIMEDIA '94.

[17]  P. Venkat Rangan,et al.  Multimedia Storage Servers: A Tutorial , 1995, Computer.