By Topic

Admission control for hard real-time connections in ATM LANs

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 $31
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

4 Author(s)
Raha, A. ; Fujitsu Software Corp., San Jose, CA, USA ; Zhao, W. ; Kamat, S. ; Jia, W.

A connection admission control (CAC) algorithm must efficiently determine if a new connection can be admitted by verifying that its QoS requirements can be met without violating those of previously admitted connections. In hard real-time systems, the QoS requirements are specified in terms of end-to-end cell deadlines and no cell loss due to buffer overflow. To achieve these objectives a CAC algorithm must account for the traffic characteristics of connections, Furthermore, the arbitrary topology of the network may lead to cyclic dependencies among various connections. An efficient CAC algorithm is presented that addresses these issues. The algorithm uses a traffic descriptor called the `maximum traffic rate function' to effectively compute bounds on end-to-end delays of connections and buffer requirements within the network. The work differs from most previous work in that it does not require traffic restoration inside the network

Published in:

Communications, IEE Proceedings-  (Volume:148 ,  Issue: 4 )