By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
N. H. Liu ; Dept. of Electron. Eng., City Univ. of Hong Kong, China ; K. L. Yeung

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 1<Q<N. Using QOAG, a packet arriving 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 the Odd-Even queueing policy of Kolias and Kleinrock (see Proceedings of IEEE ICC '96, p.1674-79, 1996) by simulations. The 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

Published in:

Communications, 2000. ICC 2000. 2000 IEEE International Conference on  (Volume:3 )

Date of Conference: