Design of a real-time call admission controller for ATM networks
Tsern‐Huei Lee, Kuen-Chu Lai, Shii-Tyng Duann · IEEE/ACM Transactions on Networking · 1996
In this paper, we present a real-time computation algorithm based on the bufferless fluid flow model [Jabbari and Yegenolu, 1992] for call admission control (CAC) on one link of an asynchronous transfer mode (ATM) network with heterogeneous bursty traffic. Cell loss probability is adopted as the measure of quality-of-service (QoS). Our computation algorithm requires a constant memory size and needs only two multiplications and one division to determine whether a connection request can be accepted or not. It is known [Murase et al., 1991], that due to the interference between different types of traffic the individual cell loss probability may not meet the requirement even though the global one does. In this paper, we provide a close upper-bound for individual cell loss probability which can easily be obtained with our computation algorithm. Numerical examples using typical traffic parameters are studied to corroborate the upper-bound. We also compare the performance of the investigated CAC scheme with that of the effective bandwidth technique [Elwalid and Mitra, 1993].