Randomized On-Line Matching (ROLM)

Randomized scheduling algorithms for high-speed cell-based switches

D. N. Serpanos, M. Gamvrili

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

1 Citation (Scopus)

Abstract

Scheduling algorithms for Virtual Output Queuing (VOQ) switches aim to provide high performance (low latency and high throughput), fairness as well as easy and low cost implementation. These goals have led to the development of a wide range of schedulers that are characterized by deterministic decision making. Randomness in decision making enables high performance scheduling as well as fair treatment of requests, when used appropriately. However, it has been proven to be costly in switching environments, which require high speed decisions, as the experience with the first randomized algorithm, namely PIM, showed. In this paper, we introduce a class of practical scheduling algorithms that employ randomness in a fashion that leads to fast, low cost implementations. The class of algorithms, named Random On-Line Matching (ROLM), employs randomness effectively, calculating maximal matchings and thus, leading to high performance schedulers with optimal mean service time that outperform significantly the competitive deterministic schedulers; furthermore, it employs randomness efficiently, resulting to schedulers that can accomodate effectively high-speed links.

Original languageEnglish
Title of host publicationProceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology
Pages239-244
Number of pages6
Volume2005
DOIs
Publication statusPublished - 1 Dec 2005
Externally publishedYes
Event5th IEEE International Symposium on Signal Processing and Information Technology - Athens, Greece
Duration: 18 Dec 200521 Dec 2005

Other

Other5th IEEE International Symposium on Signal Processing and Information Technology
CountryGreece
CityAthens
Period18/12/0521/12/05

Fingerprint

Scheduling algorithms
Decision making
Switches
Costs
Scheduling
Throughput

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Serpanos, D. N., & Gamvrili, M. (2005). Randomized On-Line Matching (ROLM): Randomized scheduling algorithms for high-speed cell-based switches. In Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology (Vol. 2005, pp. 239-244). [1577102] https://doi.org/10.1109/ISSPIT.2005.1577102

Randomized On-Line Matching (ROLM) : Randomized scheduling algorithms for high-speed cell-based switches. / Serpanos, D. N.; Gamvrili, M.

Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology. Vol. 2005 2005. p. 239-244 1577102.

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

Serpanos, DN & Gamvrili, M 2005, Randomized On-Line Matching (ROLM): Randomized scheduling algorithms for high-speed cell-based switches. in Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology. vol. 2005, 1577102, pp. 239-244, 5th IEEE International Symposium on Signal Processing and Information Technology, Athens, Greece, 18/12/05. https://doi.org/10.1109/ISSPIT.2005.1577102
Serpanos DN, Gamvrili M. Randomized On-Line Matching (ROLM): Randomized scheduling algorithms for high-speed cell-based switches. In Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology. Vol. 2005. 2005. p. 239-244. 1577102 https://doi.org/10.1109/ISSPIT.2005.1577102
Serpanos, D. N. ; Gamvrili, M. / Randomized On-Line Matching (ROLM) : Randomized scheduling algorithms for high-speed cell-based switches. Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology. Vol. 2005 2005. pp. 239-244
@inproceedings{1b3e070631394bec9a12979e7f3938c8,
title = "Randomized On-Line Matching (ROLM): Randomized scheduling algorithms for high-speed cell-based switches",
abstract = "Scheduling algorithms for Virtual Output Queuing (VOQ) switches aim to provide high performance (low latency and high throughput), fairness as well as easy and low cost implementation. These goals have led to the development of a wide range of schedulers that are characterized by deterministic decision making. Randomness in decision making enables high performance scheduling as well as fair treatment of requests, when used appropriately. However, it has been proven to be costly in switching environments, which require high speed decisions, as the experience with the first randomized algorithm, namely PIM, showed. In this paper, we introduce a class of practical scheduling algorithms that employ randomness in a fashion that leads to fast, low cost implementations. The class of algorithms, named Random On-Line Matching (ROLM), employs randomness effectively, calculating maximal matchings and thus, leading to high performance schedulers with optimal mean service time that outperform significantly the competitive deterministic schedulers; furthermore, it employs randomness efficiently, resulting to schedulers that can accomodate effectively high-speed links.",
author = "Serpanos, {D. N.} and M. Gamvrili",
year = "2005",
month = "12",
day = "1",
doi = "10.1109/ISSPIT.2005.1577102",
language = "English",
volume = "2005",
pages = "239--244",
booktitle = "Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology",

}

TY - GEN

T1 - Randomized On-Line Matching (ROLM)

T2 - Randomized scheduling algorithms for high-speed cell-based switches

AU - Serpanos, D. N.

AU - Gamvrili, M.

PY - 2005/12/1

Y1 - 2005/12/1

N2 - Scheduling algorithms for Virtual Output Queuing (VOQ) switches aim to provide high performance (low latency and high throughput), fairness as well as easy and low cost implementation. These goals have led to the development of a wide range of schedulers that are characterized by deterministic decision making. Randomness in decision making enables high performance scheduling as well as fair treatment of requests, when used appropriately. However, it has been proven to be costly in switching environments, which require high speed decisions, as the experience with the first randomized algorithm, namely PIM, showed. In this paper, we introduce a class of practical scheduling algorithms that employ randomness in a fashion that leads to fast, low cost implementations. The class of algorithms, named Random On-Line Matching (ROLM), employs randomness effectively, calculating maximal matchings and thus, leading to high performance schedulers with optimal mean service time that outperform significantly the competitive deterministic schedulers; furthermore, it employs randomness efficiently, resulting to schedulers that can accomodate effectively high-speed links.

AB - Scheduling algorithms for Virtual Output Queuing (VOQ) switches aim to provide high performance (low latency and high throughput), fairness as well as easy and low cost implementation. These goals have led to the development of a wide range of schedulers that are characterized by deterministic decision making. Randomness in decision making enables high performance scheduling as well as fair treatment of requests, when used appropriately. However, it has been proven to be costly in switching environments, which require high speed decisions, as the experience with the first randomized algorithm, namely PIM, showed. In this paper, we introduce a class of practical scheduling algorithms that employ randomness in a fashion that leads to fast, low cost implementations. The class of algorithms, named Random On-Line Matching (ROLM), employs randomness effectively, calculating maximal matchings and thus, leading to high performance schedulers with optimal mean service time that outperform significantly the competitive deterministic schedulers; furthermore, it employs randomness efficiently, resulting to schedulers that can accomodate effectively high-speed links.

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

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

U2 - 10.1109/ISSPIT.2005.1577102

DO - 10.1109/ISSPIT.2005.1577102

M3 - Conference contribution

VL - 2005

SP - 239

EP - 244

BT - Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology

ER -