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

Authors:
Min Song;Sachin Shetty;Wu Li
Affiliations:
Electrical and Computer Engineering Department, Old Dominion University, Norfolk, VA;Electrical and Computer Engineering Department, Old Dominion University, Norfolk, VA;Multidisciplinary Optimization Branch, NASA Langley Research Center, Hampton, VA
Venue:
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
Year:
2005

Citing 6
Cited 0

High-speed switch scheduling for local-area networks

ACM Transactions on Computer Systems (TOCS)
Efficient network QoS provisioning based on per node traffic shaping

IEEE/ACM Transactions on Networking (TON)
Rate-proportional servers: a design methodology for fair queueing algorithms

IEEE/ACM Transactions on Networking (TON)
Using Traffic Regulation to Meet End-to-End Deadlines in ATM Networks

IEEE Transactions on Computers
Matching output queueing with a combined input/output-queued switch

IEEE Journal on Selected Areas in Communications
Linear-complexity algorithms for QoS support in input-queued switches with no speedup

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

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 (WiLPF), 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.