Towards efficient decision rules for admission control based on the many sources asymptotics

Authors:
Gergely Seres;Árpád Szlávik;János Zátonyi;József Bíró
Affiliations:
Traffic Analysis and Network Performance Laboratory, Ericsson Research Hungary, P.O. Box 107, H-1300 Budapest, Hungary;Traffic Analysis and Network Performance Laboratory, Ericsson Research Hungary, P.O. Box 107, H-1300 Budapest, Hungary;High Speed Networks Laboratory, Department of Telecommunications and Telematics, Budapest University of Technology and Economics, P.O. Box 91, H-1521 Budapest, Hungary;High Speed Networks Laboratory, Department of Telecommunications and Telematics, Budapest University of Technology and Economics, P.O. Box 91, H-1521 Budapest, Hungary
Venue:
Performance Evaluation
Year:
2003

Citing 2
Cited 0

Meta-Heuristics: Theory and Applications

Meta-Heuristics: Theory and Applications
On the relevance of time scales in performance oriented traffic characterizations

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces new admission criteria that enable the use of algorithms based on the many sources asymptotics in real-life applications. This is achieved by a significant reduction in the computational requirements and by moving the computationally intensive tasks away from the timing-sensitive decision instant. It is shown that the traditional overflow probability type admission control method can be reformulated into a bandwidth requirement type and into a buffer requirement type method and that these methods are equivalent when used for admission control. The original and the two proposed methods are compared through the example of fractional Brownian motion (fBm) traffic.