Dimensioning of an ATM switch with shared buffer and threshold priority

The performance of a shared-buffer switching element with a threshold priority mechanism is evaluated. The evaluation uses a discrete-time, finite-state Markov chain model of the switch with its source traffic and the steady state probabilities are approximated. Then, the loss probabilities are used to solve the dimensioning problem of the buffer capacity and threshold level such that each cell type has maximum cell loss probabilities.