An approximate analysis of a shared buffer ATM switch using input process aggregation technique

A discrete time queueing model of an N×d shared buffer ATM switch is considered, which is loaded with unbalanced and correlated bursty traffic. We first propose an efficient input process aggregation algorithm and then, the maximum entropy method is applied to obtain the steady-state probability distribution of the queueing system. From the steady-state probabilities, we can derive some performance measures such as cell loss probability in the switching system. Numerical examples of the proposed approximation method are given, which are compared with simulation results