By Topic

iSKIP: a fair and efficient scheduling algorithm for input-queued crossbar 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
$31 $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

3 Author(s)

Cell-based input-queued crossbars are widely used in networking equipments. A number of crossbar scheduling algorithms have been proposed to provide high performance scheduling. It is critical for a crossbar scheduling algorithm to be fair and efficient in real world conditions, which include the presence of over-subscribed ingress ports and the possible flow control from the egress ports. Several commonly deployed algorithms are not fair when there are ingress congestions due to over-subscription. Furthermore, these algorithms lose fairness and can even cause starvation when there is flow control or backpressure from the egress ports. We illustrate the problems in detail using the well-known iSLIP algorithm. In this paper, we present a new algorithm, iSKIP, which performs as efficiently as iSLIP in a benign environment but remains fair and starvation-free in the cases of ingress congestion and egress backpressure. The iSKIP algorithm can be implemented in fast and simple hardware. Simulation results are presented to illustrate the advantages of the iSKIP algorithm.

Published in:

Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE  (Volume:3 )

Date of Conference:

17-21 Nov. 2002