By Topic

A Fair Request-Grant Matching Algorithm for Fabric Scheduling in 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
$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)
Rostami, M.J. ; Bahonar Univ., Kermanjran ; Khodaparast, A.A. ; Khorsandi, S.

Request-Grant (RG) matching algorithms are now widely used for scheduling in high-speed packet switches. An RG algorithm is iterated for a few iteration cycles in a time-slot to achieve a higher matching size. In RG algorithms, each input sends request to all/some of the outputs at each iteration cycle. Then each output sends grant to one of its requesting inputs according to an input priority sequence. In this paper, we analyze the existing RG matching algorithms showing that they have fairness and convergence problem under a range of input load distributions. Our analysis and simulation show that our proposed algorithm called TRGA is a high throughput matching algorithm that presents an optimal fairness and convergence under all load distributions.

Published in:

Computers and Communications, 2007. ISCC 2007. 12th IEEE Symposium on

Date of Conference:

1-4 July 2007