An approximate solution for queuing network models of a burst-level traffic control scheme in ATM WAN

Abstract

This paper proposes a closed queuing network model for a burst-level traffic control scheme in ATM WAN environments, and explores solution techniques for this model. An approximate solution technique is developed to solve the closed queuing networks with multiple chains, chain-dependent service times, MSFIFO (multiple servers first-in first-out) queues, and simultaneous resource possession. Results of this study show that, with respect to the subnetwork algorithm of Souza e Silva and Muntz [Approximate solution for a class of non-product form queuing network models, Performance Evaluation (7) (1987) 221–242], our algorithm is advantageous, because (1) it is applicable to queuing network models with nested first-allocated/first-released passive resources; (2) it greatly reduces the complexity of the subnetwork algorithm by not decomposing the network and representing the complements; (3) it achieves higher accuracy and provides more reliable conservative estimates; and (4) it is easy to understand due to its straightforward interpretation.