Admission control for hard real-time connections in ATM LANs

Citation
A. Raha et al., Admission control for hard real-time connections in ATM LANs, IEE P-COMM, 148(4), 2001, pp. 217-228
Citations number
22
Language
INGLESE
art.tipo
Article
Categorie Soggetti
Eletrical & Eletronics Engineeing
Journal title
IEE PROCEEDINGS-COMMUNICATIONS
ISSN journal
1350-2425 → ACNP
Volume
148
Issue
4
Year of publication
2001
Pages
217 - 228
Database
ISI
SICI code
1350-2425(200108)148:4<217:ACFHRC>2.0.ZU;2-A
Abstract
A connection admission control (CAC) algorithm must efficiently determine i f a new connection can be admitted by verifying that its QoS requirements c an be met without violating those of previously admitted connections. In ha rd 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 the se objectives a CAC algorithm must account for the traffic characteristics of connections. Furthermore, 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 desc riptor called the 'maximum traffic rate function' to effectively compute bo unds 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 requ ire traffic restoration inside the network.