By Topic

Design of a real-time call admission controller for ATM networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Tsern-Huei Lee ; Dept. of Commun. Eng., Nat. Chiao Tung Univ., Hsinchu, Taiwan ; Kuen-Chu Lai ; Shii-Tyng Duann

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]

Published in:

Networking, IEEE/ACM Transactions on  (Volume:4 ,  Issue: 5 )