Exact admission control for networks with a bounded delay service
IEEE/ACM Transactions on Networking (TON)
Real-time communications in atm networks
Real-time communications in atm networks
Admission control for hard real-time connections in ATM LANs
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Providing end-to-end performance guarantees using non-work-conserving disciplines
Computer Communications
Quality of service guarantees in virtual circuit switched networks
IEEE Journal on Selected Areas in Communications
ICN '01 Proceedings of the First International Conference on Networking-Part 2
IEEE/ACM Transactions on Networking (TON)
Schedulability criterion and performance analysis of coordinated schedulers
IEEE/ACM Transactions on Networking (TON)
New Strategies and Extensions in Kruskal's Algorithm in Multicast Routing
International Journal of Business Data Communications and Networking
| Hi-index | 0.00 |
In this paper, 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 FCFS scheduling policy. We then study networks with 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 ring has been a ``benchmark" architecture to study the stability problem. For example, Gallager and Parekh claimed that the ring with size 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 total utilization of the links is less than or equal to 73\%.