Efficient switch schedulers with random decisions

Dimitrios Serpanos

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

Abstract

Appropriate use of randomness in the development of scheduling algorithms is a powerful tool, because it leads to systems that are theoretically efficient and fair, while feasible to analyze and obtain concrete performance bounds. However, randomness is hard to implement, due to the high complexity and long delay of efficient random number generators. Thus, deterministic schedulers for high-speed switches have been developed. In this paper, we introduce high-speed schedulers for packet switches, which employ randomness and provide high performance at low cost. The schedulers implement variations of an existing, optimal on-line bipartite graph matching algorithm and achieve fair service and improved performance over PIM at a significantly lower cost; PIM is the main alternative algorithm with random decisions and has been used as the basis for a wide range of deterministic algorithms

Original languageEnglish
Title of host publicationProceedings - 2005 International Symposium on Autonomous Decentralized Systems, ISADS 2005
Pages489-494
Number of pages6
Volume2005
DOIs
Publication statusPublished - 1 Dec 2005
Externally publishedYes
Event2005 International Symposium on Autonomous Decentralized Systems, ISADS 2005 - Chengdu, Jiuzhaigou, China
Duration: 4 Apr 20058 Apr 2005

Other

Other2005 International Symposium on Autonomous Decentralized Systems, ISADS 2005
CountryChina
CityChengdu, Jiuzhaigou
Period4/4/058/4/05

Fingerprint

Switches
Scheduling algorithms
Costs
Concretes

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Serpanos, D. (2005). Efficient switch schedulers with random decisions. In Proceedings - 2005 International Symposium on Autonomous Decentralized Systems, ISADS 2005 (Vol. 2005, pp. 489-494). [1452118] https://doi.org/10.1109/ISADS.2005.1452118

Efficient switch schedulers with random decisions. / Serpanos, Dimitrios.

Proceedings - 2005 International Symposium on Autonomous Decentralized Systems, ISADS 2005. Vol. 2005 2005. p. 489-494 1452118.

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

Serpanos, D 2005, Efficient switch schedulers with random decisions. in Proceedings - 2005 International Symposium on Autonomous Decentralized Systems, ISADS 2005. vol. 2005, 1452118, pp. 489-494, 2005 International Symposium on Autonomous Decentralized Systems, ISADS 2005, Chengdu, Jiuzhaigou, China, 4/4/05. https://doi.org/10.1109/ISADS.2005.1452118
Serpanos D. Efficient switch schedulers with random decisions. In Proceedings - 2005 International Symposium on Autonomous Decentralized Systems, ISADS 2005. Vol. 2005. 2005. p. 489-494. 1452118 https://doi.org/10.1109/ISADS.2005.1452118
Serpanos, Dimitrios. / Efficient switch schedulers with random decisions. Proceedings - 2005 International Symposium on Autonomous Decentralized Systems, ISADS 2005. Vol. 2005 2005. pp. 489-494
@inproceedings{625cd86433574868a43210b82c643223,
title = "Efficient switch schedulers with random decisions",
abstract = "Appropriate use of randomness in the development of scheduling algorithms is a powerful tool, because it leads to systems that are theoretically efficient and fair, while feasible to analyze and obtain concrete performance bounds. However, randomness is hard to implement, due to the high complexity and long delay of efficient random number generators. Thus, deterministic schedulers for high-speed switches have been developed. In this paper, we introduce high-speed schedulers for packet switches, which employ randomness and provide high performance at low cost. The schedulers implement variations of an existing, optimal on-line bipartite graph matching algorithm and achieve fair service and improved performance over PIM at a significantly lower cost; PIM is the main alternative algorithm with random decisions and has been used as the basis for a wide range of deterministic algorithms",
author = "Dimitrios Serpanos",
year = "2005",
month = "12",
day = "1",
doi = "10.1109/ISADS.2005.1452118",
language = "English",
volume = "2005",
pages = "489--494",
booktitle = "Proceedings - 2005 International Symposium on Autonomous Decentralized Systems, ISADS 2005",

}

TY - GEN

T1 - Efficient switch schedulers with random decisions

AU - Serpanos, Dimitrios

PY - 2005/12/1

Y1 - 2005/12/1

N2 - Appropriate use of randomness in the development of scheduling algorithms is a powerful tool, because it leads to systems that are theoretically efficient and fair, while feasible to analyze and obtain concrete performance bounds. However, randomness is hard to implement, due to the high complexity and long delay of efficient random number generators. Thus, deterministic schedulers for high-speed switches have been developed. In this paper, we introduce high-speed schedulers for packet switches, which employ randomness and provide high performance at low cost. The schedulers implement variations of an existing, optimal on-line bipartite graph matching algorithm and achieve fair service and improved performance over PIM at a significantly lower cost; PIM is the main alternative algorithm with random decisions and has been used as the basis for a wide range of deterministic algorithms

AB - Appropriate use of randomness in the development of scheduling algorithms is a powerful tool, because it leads to systems that are theoretically efficient and fair, while feasible to analyze and obtain concrete performance bounds. However, randomness is hard to implement, due to the high complexity and long delay of efficient random number generators. Thus, deterministic schedulers for high-speed switches have been developed. In this paper, we introduce high-speed schedulers for packet switches, which employ randomness and provide high performance at low cost. The schedulers implement variations of an existing, optimal on-line bipartite graph matching algorithm and achieve fair service and improved performance over PIM at a significantly lower cost; PIM is the main alternative algorithm with random decisions and has been used as the basis for a wide range of deterministic algorithms

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

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

U2 - 10.1109/ISADS.2005.1452118

DO - 10.1109/ISADS.2005.1452118

M3 - Conference contribution

VL - 2005

SP - 489

EP - 494

BT - Proceedings - 2005 International Symposium on Autonomous Decentralized Systems, ISADS 2005

ER -