An analysis of space priority queueing in ATM switches

Abstract

High-speed packet switched networks such as B-ISDN require algorithms to manage the flow of traffic into and through the network. End-to-end congestion control algorithms will do much to ensure that overload periods are minimized, but intelligent buffering decisions at internal nodes may aid in managing congestion by shifting cell loss to lower priority traffic. The authors describe a simulation study of three space priority queueing algorithms under realistic traffic models, and show that the performance of these algorithms depends on the shape and type of the traffic. The results of this research suggest that space priority algorithms, when combined with other congestion control algorithms, can aid in supporting acceptable quality of service for the users of the network.<>