Throughput analysis of multiple input-queuing in ATM switches

In this paper we investigate various schemes of input-queueing ATM switching systems. We first give a brief description of the Odd-Even switch model which is followed by an approximate analysis for evaluating its throughput. We then introduce an extension of the Odd-Even model which employs a Multiple Input-Queueing strategy, where an input port is expanded into m queues. In fact, we consider two policies as far as arbitration among the input queues is concerned and we show how thoughput can increase as m gets larger. We also comment on the special case where m = N, for an N x N switch, and show that the achieved throughput is actually 100%. We call this last scheme Virtual Output-Queueing. The models under examination assume a uniform output destination distribution and a Bernoulli process for the cell arrivals.