By Topic

Efficient switch schedulers with random decisions

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

1 Author(s)
Serpanos, D. ; Dept. of Electr. & Comput. Eng., Patras Univ, Greece

Appropriate use of randomness in the development of scheduling algorithms is a powerful tool, because it leads to systems that are theoretically efficient and fair, while feasible to analyze and obtain concrete performance bounds. However, randomness is hard to implement, due to the high complexity and long delay of efficient random number generators. Thus, deterministic schedulers for high-speed switches have been developed. In this paper, we introduce high-speed schedulers for packet switches, which employ randomness and provide high performance at low cost. The schedulers implement variations of an existing, optimal on-line bipartite graph matching algorithm and achieve fair service and improved performance over PIM at a significantly lower cost; PIM is the main alternative algorithm with random decisions and has been used as the basis for a wide range of deterministic algorithms.

Published in:

Autonomous Decentralized Systems, 2005. ISADS 2005. Proceedings

Date of Conference:

4-8 April 2005