DocumentCode
3566879
Title
FIRM: a class of distributed scheduling algorithms for high-speed ATM switches with multiple input queues
Author
Serpanos, D.N. ; Antoniadis, P.I.
Author_Institution
Dept. of Comput. Sci., Crete Univ., Heraklion, Greece
Volume
2
fYear
2000
fDate
6/22/1905 12:00:00 AM
Firstpage
548
Abstract
Advanced input queuing is an attractive, promising architecture for high-speed ATM switches, because it combines the low cost of input queuing with the high performance of output queuing. The need for scalable schedulers for advanced input queuing switch architectures has led to the development of efficient distributed scheduling algorithms. We introduce a new distributed scheduling algorithm, FIRM, which provides improved performance characteristics over alternative distributed algorithms. FIRM achieves saturation throughput 1 with lower delay than the most efficient alternative (up to 50% at high load). Furthermore, it provides improved fairness (it approximates FCFS) and tighter service guarantee than others. FIRM provides a basis for a class of distributed scheduling algorithms, many of which provide even more improved performance characteristics
Keywords
asynchronous transfer mode; distributed algorithms; queueing theory; scheduling; FIRM; advanced input queuing; distributed scheduling algorithms; efficient distributed scheduling algorithms; high-speed ATM switches; multiple input queues; output queuing; saturation throughput; scalable schedulers; service guarantee; Asynchronous transfer mode; Communication switching; Computer science; Costs; Electronic mail; Processor scheduling; Scalability; Scheduling algorithm; Switches; Throughput;
fLanguage
English
Publisher
ieee
Conference_Titel
INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE
ISSN
0743-166X
Print_ISBN
0-7803-5880-5
Type
conf
DOI
10.1109/INFCOM.2000.832228
Filename
832228
Link To Document