Inter-class resource sharing using statistical service envelopes

J.-Y. Qiu, E.W. Knightly
1999 IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320)  
Networks that support multiple services through "linksharing" must address the fundamental conflicting requirement between isolation among service classes to satisfy each class' quality of service requirements, and statistical sharing of resources for efficient network utilization. While a number of service disciplines have been devised which provide mechanisms to both isolate flows and fairly share excess capacity, admission control algorithms are needed which exploit the effects of
more » ... resource sharing. In this paper, we develop a framework of using statistical service envelopes to study inter-class statistical resource sharing. We show how this service envelope enables a class to over-book resources beyond its deterministically guaranteed capacity by statistically characterizing the excess service available due to fluctuating demands of other service classes. We apply our techniques to several multi-class schedulers, including Generalized Processor Sharing, and design new admission control algorithms for multi-class link-sharing environments. We quantify the utilization gains of our approach with a set of experiments using long traces of compressed video.
doi:10.1109/infcom.1999.752160 dblp:conf/infocom/QiuK99 fatcat:bwwqi7d2s5g5jp2hkow6xcygga