Achieving 100% throughput in an input-queued switch

N. McKeown, A. Mekkittikul, V. Anantharam, J. Walrand
1999 IEEE Transactions on Communications  
It is well known that head-of-line blocking limits the throughput of an input-queued switch with first-in-first-out (FIFO) queues. Under certain conditions, the throughput can be shown to be limited to approximately 58.6%. It is also known that if non-FIFO queueing policies are used, the throughput can be increased. However, it has not been previously shown that if a suitable queueing policy and scheduling algorithm are used, then it is possible to achieve 100% throughput for all independent
more » ... all independent arrival processes. In this paper we prove this to be the case using a simple linear programming argument and quadratic Lyapunov function. In particular, we assume that each input maintains a separate FIFO queue for each output and that the switch is scheduled using a maximum weight bipartite matching algorithm. We introduce two maximum weight matching algorithms: longest queue first (LQF) and oldest cell first (OCF). Both algorithms achieve 100% throughput for all independent arrival processes. LQF favors queues with larger occupancy, ensuring that larger queues will eventually be served. However, we find that LQF can lead to the permanent starvation of short queues. OCF overcomes this limitation by favoring cells with large waiting times. Index Terms-Arbitration, ATM, input-queued switch, inputqueueing, packet switch, queueing networks, scheduling algorithm. N. McKeown is with the
doi:10.1109/26.780463 fatcat:dm6ozypbnjh6jdw34g2papu75m