Performance of bus allocation policies for an ATM switch under bursty arrivals and correlated destinations

Studies, via simulation, the performance of different bus allocation policies for a generic shared-medium ATM switch with input and output queueing. The policies differ in the amount of information used by the bus arbitrator to decide which input queue to serve next. Classical polling systems (e.g. Round-Robin) consider only the state of the input queues. This may waste bus bandwidth on cells that are destined to output queues which are full. The present authors consider a range of bus service policies that are based on the state of the input queues, or the state of both the input and the output queues. The performance of the switch is analyzed under realistic system characteristics such as bursty traffic, limited buffer size, asymmetric load conditions, and nonuniform destinations. Input traffic is modelled by an interrupted Bernoulli process (IBP). Furthermore, it is assumed that the destinations of the arriving cells within the same burst are correlated. Two types of destination correlations are introduced and their effect on the performance of the switch is analyzed. The performance measures considered are: cell loss probability, and mean cell delay.<
>