Randomized scheduling algorithms for high-aggregate bandwidth switches
Authors:
- P. GiacconePGP. Giaccone
- B. PrabhakarBPB. Prabhakar
- Devavrat ShahDSDevavrat Shah
- 7 May 2003
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 21 (4) , 546-559
Abstract
The aggregate bandwidth of a switch is its port count multiplied by its operating line rate. We consider switches with high-aggregate bandwidths; for example, a 30-port switch operating at 40 Gb/s or a 1000-port switch operating at 1 Gb/s. Designing high-performance schedulers for such switches with input queues is a challenging problem for the following reasons: (1) high performance requires finding good matchings; (2) good matchings take time to find; and (3) in high-aggregate bandwidth switches there is either too little time (due to high line rates) or there is too much work to do (due to a high port count). We exploit the following features of the switching problem to devise simple-to-implement, high-performance schedulers for high-aggregate bandwidth switches: (1) the state of the switch (carried in the lengths of its queues) changes slowly with time, implying that heavy matchings will likely stay heavy over a period of time and (2) observing arriving packets will convey useful information about the state of the switch. The above features are exploited using hardware parallelism and randomization to yield three scheduling algorithms - APSARA, LAURA, and SERENA. These algorithms are shown to achieve 100% throughput and simulations show that their delay performance is quite close to that of the maximum weight matching, even when the traffic is correlated. We also consider the stability property of these algorithms under generic admissible traffic using the fluid-model technique. The main contribution of this paper is a suite of simple to implement, high-performance scheduling algorithms for input-queued switches. We exploit a novel operation, called MERGE, which combines the edges of two matchings to produce a heavier match, and study of the properties of this operation via simulations and theory. The stability proof of the randomized algorithms we present involves a derandomization procedure and uses methods which may have wider applicability.Keywords
This publication has 23 references indexed in Scilit:
- Achieving 100% throughput in an input-queued switch2002
- A practical scheduling algorithm to achieve 100% throughput in input-queued switches2002
- Making parallel packet switches practical2002
- Scheduling algorithms for input-queued switches: randomized techniques and experimental evaluation2002
- Bounds on average delays and queue size averages and variances in input-queued cell-based switches2001
- Matching output queueing with a combined input/output-queued switchIEEE Journal on Selected Areas in Communications, 1999
- On the speedup required for work-conserving crossbar switchesIEEE Journal on Selected Areas in Communications, 1999
- The iSLIP scheduling algorithm for input-queued switchesIEEE/ACM Transactions on Networking, 1999
- Issues and trends in router designIEEE Communications Magazine, 1998
- Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networksIEEE Transactions on Automatic Control, 1992