SATURATION THROUGHPUT ANALYSIS OF AN INPUT QUEUING ATM SWITCH WITH MULTICLASS BURSTY TRAFFIC

In this paper we consider an N x N non-blocking, space division ATM sw itch with input cell queueing. At each input, the cell arrival process comprises geometrically distributed bursts of consecutive cells for t he various outputs. Motivated by the fact that some input links may be connected to metropolitan area networks, and others directly to B-ISD N terminals, we study the situation where there are two classes of inp uts with different values of mean burst length. We show that when inpu ts contend for an output, giving priority to an input with smaller exp ected burst length yields a saturation throughput larger than if the r everse priority is given. Further, giving priority to less bursty traf fic can give better throughput than if all the inputs were occupied by this less bursty traffic. We derive the asymptotic (as N --> infinity ) saturation throughputs for each priority class.