On the effectiveness of the many-sources asymptotic for admission control

• Published in: Computer communications Vol. 26; no. 12; pp. 1376 - 1391
• Main Authors: Fernández-Veiga, M., López-Garcı́a, C., López-Ardao, J.C., Suárez-González, A., Sousa-Vieira, M.E.
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 21.07.2003
• Subjects: Access control; Admission control; Fluid traffic models; Many sources asymptotic; Network simulation; Networks; Network simulation; Many sources asymptotic; Admission control; Fluid traffic models
• ISSN: 0140-3664; 1873-703X
• DOI: 10.1016/S0140-3664(02)00260-8

In this paper we analyze the performance of a dynamic admission control algorithm in a network of aggregate traffic. The algorithm is designed for statistical quality of service guarantees and its theoretical foundation stems from the application of the many sources asymptotic, a large deviation result whose general validity and accuracy are specially useful to cope with admissions both to buffered and unbuffered resources making minimal assumptions about the statistical properties of the traffic. We describe an implementation of the method, discuss some practical tradeoffs and illustrate its robustness against traffic with complex (e.g. long-range dependent) behavior. Our numerical results show that the computational effort needed by the algorithm is reasonable and that the multiplexing gain is nearly optimal in systems of realistic size.