Title :
Stability in ATM networks
Author :
Li, Chengzhi ; Raba, A. ; Zhao, Wei
Author_Institution :
Dept. of Comput. Sci., Texas A&M Univ., College Station, TX, USA
Abstract :
We address the issues of stability in ATM networks. A network is stable if and only if all the packets have a bounded delay. We first consider ATM networks with an FCFS scheduling policy. We then study networks with a priority driven scheduling policy. For each network, we develop criteria for testing the stability of an ATM network and methods of deriving delay bounds in a stable network. In previous work, the Cruz-Gallager-Parekh (1991, 1992) ring has been a “benchmark” architecture to study the stability problem. For example, Gallager and Parerkh (1993) claimed that the ring with a size of no more than four switches is stable when the total utilization of the links is less than 100%. We validated this result. Furthermore, we find that a ring with large number of switches is stable if the utilization of each link is less than or equal to 73%
Keywords :
asynchronous transfer mode; delays; network topology; packet switching; queueing theory; scheduling; stability; telecommunication networks; ATM network stability; Cruz-Gallager-Parekh ring; FCFS scheduling policy; benchmark architecture; bounded delay packets; delay bounds; link utilization; priority driven scheduling; stability testing; switches; Asynchronous transfer mode; Communication networks; Communication switching; Intelligent networks; Processor scheduling; Quality of service; Stability criteria; Switches; Testing; Thermal stability;
Conference_Titel :
INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution., Proceedings IEEE
Conference_Location :
Kobe
Print_ISBN :
0-8186-7780-5
DOI :
10.1109/INFCOM.1997.635126
