By Topic

Bifurcated queueing for throughput enhancement in input-queued 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

1 Author(s)
G. Thomas ; Dept. of Electr. & Comput. Eng., Southwestern Louisiana Univ., Lafayette, LA, USA

We propose a bifurcated queueing approach to breaking the well-known 0.586 barrier for the throughput of input queued switches with head-of-line blocking. Each input line maintains a small number k of parallel queues, one for each of a set of k mutually exclusive subsets of the set of output-port addresses. We generalize the analysis of Karol et al. (1987) and show that the upper bound on throughput is (1+k)-/spl radic/1+k/sup 2/, k=1, 2, 3, .... We point out that even for k=2, there is a significant improvement in throughput and that as k increases, the throughput approaches one.

Published in:

IEEE Communications Letters  (Volume:1 ,  Issue: 2 )