On the performance of input-queued cell-based switches with two priority classes

Authors:
Yiping Gong;Bin Liu;Wenjie Li
Affiliations:
Department of Computer Science and Technology, Tsinghua University, Beijing, 100084, China;Department of Computer Science and Technology, Tsinghua University, Beijing, 100084, China;Department of Computer Science and Technology, Tsinghua University, Beijing, 100084, China
Venue:
ICCC '02 Proceedings of the 15th international conference on Computer communication
Year:
2002

Citing 5
Cited 0

Scheduling algorithms for input-queued cell switches

Scheduling algorithms for input-queued cell switches
A quantitive comparision of iterative scheduling algoithm for input-queued switches

Computer Networks and ISDN Systems
The iSLIP scheduling algorithm for input-queued switches

IEEE/ACM Transactions on Networking (TON)
Jitter control in QoS networks

IEEE/ACM Transactions on Networking (TON)
Symmetric Crossbar Arbiters for VLSI Communication Switches

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given the diversity of user applications and the ever-growing bandwidth demands, high performance switches which focus on the transfer of data units between different line interfaces must improve their ability to provide the quality-of-service (QoS). In modern switches, the most important components to guarantee different types of QoS are the queuing and scheduling strategies. In this paper, based on the crossbar fabric, we propose a simple novel cell scheduling algorithm named ReqGrant algorithm which can provide different QoS to various priority traffic. Through extensive simulations we show that, in the case of cell-based switches, this priority scheduling mechanism can achieve better performance than the noted prioritized iSLIP algorithm.