An efficient randomized algorithm for input-queued switchscheduling
Devavrat Shah
Giaccone, P.
Balaji Prabhakar
Dept. of Comput. Sci., Stanford Univ., CA;
This paper appears in: Hot Interconnects 9, 2001.
Publication Date: 2001
On page(s): 3-8
Meeting Date: 08/22/2001 - 08/24/2001
Location: Stanford, CA, USA
ISBN: 0-7695-1357-3
References Cited: 19
INSPEC Accession Number: 7075057
Digital Object Identifier: 10.1109/HIS.2001.946686
Current Version Published: 2002-08-07
Abstract
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
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
