Cart (Loading....) | Create Account
Close category search window
 

An efficient randomized algorithm for input-queued switch scheduling

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)
Shah, D. ; Dept. of Comput. Sci., Stanford Univ., CA, USA ; Giaccone, P. ; Prabhakar, B.

The essential problem in the design of high-performance schedulers for input-queued switches is the determination, in each time slot of a good matching between inputs and outputs for the transfer of packets. The rapid increase of line rates is making this very difficult: finding good matchings takes time, and there is very little time at the highest line speeds. A similar difficulty arises when designing schedulers for switches with a large number of ports. Randomized algorithms have proved particularly effective in providing good scalable solutions to problems where decisions need to be made within a limited amount of time and/or with little information. The main idea of randomized algorithms is simply stated: Basing decisions on a few randomly chosen samples is often a good surrogate for basing decisions with complete knowledge of the state. This paper is about the design of randomized algorithms for switch scheduling. We begin by examining the difficulty of implementing well known deterministic solutions like the maximum weight matching algorithm, discuss a simple randomized proposed by L. Tassiulas (1998), develop a suite of novel randomized algorithms, and discuss their theory and performance

Published in:

Hot Interconnects 9, 2001.

Date of Conference:

2001

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.