QOAG: An efficient queueing policy for input-buffered packet switches

Abstract

An efficient self-adaptive packet queueing policy, called Queueing with Output Address Grouping (QOAG), is proposed for optimizing the performance of an input buffered packet switch. Each input port of the N×N switch under consideration has Q queues and each queue has B packet buffers, where I<Q<N. Using QOAG, a packet arrived at an input port is assigned to the queue which has some backlog packets with the same output address as that of the new packet. If the output address of the new packet is different from all current buffered packets in all queues, it is assigned to the shortest queue. The performance of QOAG is compared with Odd-Even queueing policy in [1] by simulations. Zipf distribution version II is used to model the non-uniform packet output distributions. We found that for a 16×16 switch with B = 20 buffers at each queue and input load p = 0.7, the mean packet delays are 58.1 and 91.2 time slots and the mean throughputs are 0.474 and 0.355 for using QOAG and Odd-Even queueing respectively. This represents a 57% cut in mean packet delay and 25% increase in throughput when QOAG is used.