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

Min Song, Sachin Shetty, Wu Li

Research output: Contribution to journalConference articlepeer-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 languageEnglish
Pages (from-to)405-413
Number of pages9
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3619
DOIs
StatePublished - 2005
EventThird International Conference on Computer Network and Mobile Computing, ICCNMC 2005 - Zhangjiajie, China
Duration: 2 Aug 20054 Aug 2005

Fingerprint

Dive into the research topics of 'Fair and smooth scheduling for virtual output queuing switches achieving 100% throughput'. Together they form a unique fingerprint.

Cite this