A performance model for ATM switches with general packet length distributions

The maximum throughput of an ATM switch is investigated in the presence of an offered load of multicell packets. For the case of input queueing coupled with a round-robin policy for transferring cells from inputs to outputs, the system is approximated by a product form queueing network. Under the assumption that packet lengths are described by random variables with discrete Coxian distributions, it is shown that the balance equations describing the behavior of the ATM switch approach those for a product form queueing network and that the steady-state probabilities of such an ATM switch approach the product-form solution as the cell length tends to zero. Last, a numerical investigation shows that the approximation yields good results, even when the packet lengths are not well described by Coxian distributions