FIRM

A class of distributed scheduling algorithms for high-speed ATM switches with multiple input queues

D. N. Serpanos, P. I. Antoniadis

Research output: Chapter in Book/Report/Conference proceedingConference contribution

107 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationProceedings - IEEE INFOCOM
PublisherIEEE
Pages548-555
Number of pages8
Volume2
Publication statusPublished - 2000
Externally publishedYes
Event19th Annual Joint Conference of the IEEE Computer and Communications Societies - IEEE INFOCOM2000: 'Reaching the Promised Land of Communications' - Tel Aviv, Isr
Duration: 26 Mar 200030 Mar 2000

Other

Other19th Annual Joint Conference of the IEEE Computer and Communications Societies - IEEE INFOCOM2000: 'Reaching the Promised Land of Communications'
CityTel Aviv, Isr
Period26/3/0030/3/00

Fingerprint

Automatic teller machines
Scheduling algorithms
Parallel algorithms
Switches
Throughput
Costs

ASJC Scopus subject areas

  • Hardware and Architecture
  • Electrical and Electronic Engineering

Cite this

Serpanos, D. N., & Antoniadis, P. I. (2000). FIRM: A class of distributed scheduling algorithms for high-speed ATM switches with multiple input queues. In Proceedings - IEEE INFOCOM (Vol. 2, pp. 548-555). IEEE.

FIRM : A class of distributed scheduling algorithms for high-speed ATM switches with multiple input queues. / Serpanos, D. N.; Antoniadis, P. I.

Proceedings - IEEE INFOCOM. Vol. 2 IEEE, 2000. p. 548-555.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Serpanos, DN & Antoniadis, PI 2000, FIRM: A class of distributed scheduling algorithms for high-speed ATM switches with multiple input queues. in Proceedings - IEEE INFOCOM. vol. 2, IEEE, pp. 548-555, 19th Annual Joint Conference of the IEEE Computer and Communications Societies - IEEE INFOCOM2000: 'Reaching the Promised Land of Communications', Tel Aviv, Isr, 26/3/00.
Serpanos DN, Antoniadis PI. FIRM: A class of distributed scheduling algorithms for high-speed ATM switches with multiple input queues. In Proceedings - IEEE INFOCOM. Vol. 2. IEEE. 2000. p. 548-555
Serpanos, D. N. ; Antoniadis, P. I. / FIRM : A class of distributed scheduling algorithms for high-speed ATM switches with multiple input queues. Proceedings - IEEE INFOCOM. Vol. 2 IEEE, 2000. pp. 548-555
@inproceedings{2f4e940d35a240a499e81ed26e478851,
title = "FIRM: A class of distributed scheduling algorithms for high-speed ATM switches with multiple input queues",
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.",
author = "Serpanos, {D. N.} and Antoniadis, {P. I.}",
year = "2000",
language = "English",
volume = "2",
pages = "548--555",
booktitle = "Proceedings - IEEE INFOCOM",
publisher = "IEEE",

}

TY - GEN

T1 - FIRM

T2 - A class of distributed scheduling algorithms for high-speed ATM switches with multiple input queues

AU - Serpanos, D. N.

AU - Antoniadis, P. I.

PY - 2000

Y1 - 2000

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0033902392&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0033902392&partnerID=8YFLogxK

M3 - Conference contribution

VL - 2

SP - 548

EP - 555

BT - Proceedings - IEEE INFOCOM

PB - IEEE

ER -