Abstract
In this paper we identify a set of the requirements for an efficient admission control algorithm and propose new algorithms. These methods need only aggregate traffic measurements, work with simple FIFO scheduling and take only minimal assumptions on the pattern of the traffic. The requirements define a family of measurement based admission control algorithms of which three key members are discussed. We give effective bandwidth formulae for buffered and bufferless systems with token bucket and peak rate limited sources. It is also shown how the utilization can be improved by measuring the variance of the traffic rate while avoiding the limitations of MBAC methods based on the Central-limit theorem.
The theoretical background of this work is the effective bandwidth definition introduced by Gibbens and Kelly which has its roots in the Chernoff bounds.
Chapter PDF
Similar content being viewed by others
Keywords
References
F. Brichet, A. Simonian, “Conservative Gaussian models applied to Measurement-based Admission Control”, submitted to IEEE INFOCOM ‘88, San Francisco, March. 1998
C. Casetti, J. Kurose, D. Towsley, “A New Algorithm for Measurement-based Admission Control in Integrated Services Packet Networks”, emphProtocols for High Speed Networks ‘86, INRIA, Sophia Antipolis, Oct. 1996
S. Floyd, “Comments on Measurement-based Admissions Control for Controlled-Load Service”, unpublished,available at ftp://ftp.ee.lbl.gov/papers/admit.ps.Z
R. Guerin, H. Ahmadi, M. Naghshineh, “Equivalent capacity and its application to bandwidth allocation in high-spped networks”, IEEE Jurnal on Selected Areas in Communications, 9 (7), pp. 968–981, Sep. 1991
F. P. Kelly, “Notes on Effective Bandwidths”, In F. P. Kelly, S. Zachary and I. B. Ziedins, Stochastic Networks: Theory and Applications, Royal Statistical Society, Lecture Note Series 4, p 141–168, Oxford Univ. Press
R. J. Gibbens, F. P. Kelly, “Measurement-Based Connection Admission Control”, International Teletraffic Congress 15, Jun. 1997
M. Grossglauser, D. Tse, “Towards a Framework for Robust Measurement-based Admission Control”, SIGCOM ‘87, Cannes, September 1997.
S. Jamin, S. Shenker, “Measurement-based Admission Control Algorithms for Controlled-load Service: A Structural Examination”, Internal report, Apr. 1997
S. Jamin, P. Danzig, J. Shenker, L. Zhang, “A Measurement-Based Admission Control Algorithm for Integrated Service Packet Networks”, IEEE/A CM Transactions on Networking, vol. 5. no. 1. Feb. 1997
S. Jamin, C. Jin, L. Breslau, “A Measurement Based Admission Control Algorithm for Controlled-Load Service with a Reference Implementation Framework”, Internet draft, Nov. 1997
E. Knightly, H. Zhang, “Traffic Characterization and Switch Utilization using a Deterministic Bounding Interval Dependent Traffic Model”, in Proc. IEEE INFOCOM ‘85, Boston, April 1995
ZhaKni94] H. Zhang, E. Knightly, “Providing end-to-end statistical performance guarantee with bounding interval dependent stochastic models”, Proc. ACM SIGMETRICS ‘84,pp. 211–220.
G. Kesidis, J. Walrand, C. Chang, “Effective Bandwidths for Multiclass Markov Fluids and Other ATM Sources”, IEEE Trans. Networking, Vol. 1, No. 4, pp. 424–428, Aug. 1993.
A. Parekh, R. Gallager, “A generalized processor sharing approach to flow control in integrates services networks: The multiple node case”, Proc. INFOCOM’93, San Francisco, CA, Mar. 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Turányi, Z., Veres, A., Oláh, A. (1998). A family of measurement-based admission control algorithms. In: Körner, U., Nilsson, A.A. (eds) Performance of Information and Communication Systems. IFIP — The International Federation for Information Processing. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35355-5_12
Download citation
DOI: https://doi.org/10.1007/978-0-387-35355-5_12
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-6166-5
Online ISBN: 978-0-387-35355-5
eBook Packages: Springer Book Archive