Priority analysis of a shared-buffer ATM switch with imbalanced bursty traffic

In this paper, we apply an aggregation method to analyze a shared-buffer ATM switch with priorities with two traffic classes. Each input port of the switch is assumed to be bursty and is modeled by an interrupted Bernoulli process. Both traffic classes share a common buffer of size M cells. High priority cells are served before low-priority cells. As an example, the analysis shows that a 4×4 switch with traffic rate of 0.2 per input lines requires a buffer size of 30 cells to achieve cell loss rate less than 10^-9