Fair and smooth scheduling for virtual output queuing switches achieving 100% throughput

Min Song; Sachin Shetty; Wu Li

doi:10.1007/11534310_44

Fair and smooth scheduling for virtual output queuing switches achieving 100% throughput

Min Song
, Sachin Shetty
, Wu Li

Department of Electrical and Computer Engineering

Old Dominion University
NASA Langley Research Center

Research output: Contribution to journal › Conference article › peer-review

Abstract

Cell scheduling has received extensive attention. Most recent studies, however, focus on achieving a 100% switch throughput under the uniform arrivals. As the demand for quality of service increases, two important goals are to provide predictive cell latency and to reduce the output burstiness. This paper presents a new scheduling algorithm, Worst-case Iterative Longest Port First (W/LPF), which improves the performance of the well-known scheduler Iterative Longest Port First (iLPF) such that both cell latency and output burstiness are well controlled. Simulation results are provided to verify how WiLPF outperforms iLPF.

Original language	English
Pages (from-to)	405-413
Number of pages	9
Journal	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	3619
DOIs	https://doi.org/10.1007/11534310_44
State	Published - 2005
Event	Third International Conference on Computer Network and Mobile Computing, ICCNMC 2005 - Zhangjiajie, China Duration: 2 Aug 2005 → 4 Aug 2005

Access to Document

10.1007/11534310_44

Cite this

@article{c27adaf5719043e2853da9a69e2fcbe8,

title = "Fair and smooth scheduling for virtual output queuing switches achieving 100\% throughput",

abstract = "Cell scheduling has received extensive attention. Most recent studies, however, focus on achieving a 100\% switch throughput under the uniform arrivals. As the demand for quality of service increases, two important goals are to provide predictive cell latency and to reduce the output burstiness. This paper presents a new scheduling algorithm, Worst-case Iterative Longest Port First (W/LPF), which improves the performance of the well-known scheduler Iterative Longest Port First (iLPF) such that both cell latency and output burstiness are well controlled. Simulation results are provided to verify how WiLPF outperforms iLPF.",

author = "Min Song and Sachin Shetty and Wu Li",

year = "2005",

doi = "10.1007/11534310\_44",

language = "English",

volume = "3619",

pages = "405--413",

note = "Third International Conference on Computer Network and Mobile Computing, ICCNMC 2005 ; Conference date: 02-08-2005 Through 04-08-2005",

}

Fair and smooth scheduling for virtual output queuing switches achieving 100% throughput. / Song, Min; Shetty, Sachin; Li, Wu.
In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 3619, 2005, p. 405-413.

Research output: Contribution to journal › Conference article › peer-review

TY - JOUR

T1 - Fair and smooth scheduling for virtual output queuing switches achieving 100% throughput

AU - Song, Min

AU - Shetty, Sachin

AU - Li, Wu

PY - 2005

Y1 - 2005

N2 - Cell scheduling has received extensive attention. Most recent studies, however, focus on achieving a 100% switch throughput under the uniform arrivals. As the demand for quality of service increases, two important goals are to provide predictive cell latency and to reduce the output burstiness. This paper presents a new scheduling algorithm, Worst-case Iterative Longest Port First (W/LPF), which improves the performance of the well-known scheduler Iterative Longest Port First (iLPF) such that both cell latency and output burstiness are well controlled. Simulation results are provided to verify how WiLPF outperforms iLPF.

AB - Cell scheduling has received extensive attention. Most recent studies, however, focus on achieving a 100% switch throughput under the uniform arrivals. As the demand for quality of service increases, two important goals are to provide predictive cell latency and to reduce the output burstiness. This paper presents a new scheduling algorithm, Worst-case Iterative Longest Port First (W/LPF), which improves the performance of the well-known scheduler Iterative Longest Port First (iLPF) such that both cell latency and output burstiness are well controlled. Simulation results are provided to verify how WiLPF outperforms iLPF.

UR - https://www.scopus.com/pages/publications/26444546824

UR - https://www.scopus.com/pages/publications/26444546824#tab=citedBy

U2 - 10.1007/11534310_44

DO - 10.1007/11534310_44

M3 - Conference article

AN - SCOPUS:26444546824

SN - 0302-9743

VL - 3619

SP - 405

EP - 413

JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

T2 - Third International Conference on Computer Network and Mobile Computing, ICCNMC 2005

Y2 - 2 August 2005 through 4 August 2005

ER -

Fair and smooth scheduling for virtual output queuing switches achieving 100% throughput

Abstract

Access to Document

Other files and links

Fingerprint

Cite this