Cost effective analytic solutions for queueing models of ATM networks

In the field of ATM technology analytic solutions of proposed queueing models are often hindered by the generation of large state spaces requiring further approximations and a considerable (or even prohibitive) amount of computation. Thus, there is a need to consider alternative methodologies leading to both credible and cost effective performance modelling and evaluation of ATM networks. In the paper closed form solutions, based on entropy maximisation and classical queueing theory, are presented by focusing on the cell loss probabilities of GGeo-type independent buffer and shared buffer queueing models. These results are applied to study the performance of an ATM "leaky bucket" policing mechanism, an ATM switch buffer with push-out space priority and also to model an ATM shared buffer switch architecture. Furthermore, these solutions are used, in conjunction with appropriate flow formulae, as building blocks in the decomposition of shared buffer ATM networks into individual ATM switches. Numerical examples involving the leaky bucket mechanism, an ATM switch buffer with space priorities and shared buffer ATM switches are included.