A discrete-time queueing model of a shared buffer ATM switch architecture with bursty arrivals

A product-form approximation, based on the principle of maximum entropy (ME), is characterized for a general discrete-time queueing model of a shared buffer ATM (asynchronous transfer mode) switch architecture with departures first (DF) buffer management policy. The arrival process at each output port of the ATM switch is assumed to be bursty and it is modelled by a bulk Bernoulli process (BBP) with geometrically distributed bulk sizes. The forms of the joint and marginal state probabilities as well as the cell-loss probability are analytically established at equilibrium via efficient recursive expressions of low computational cost. Validation tests against simulation show that the ME approximation is credible with a very good error level