Packet-based scheduling algorithm for CIOQ switches with multiple traffic classes

Authors:
Tsern-Huei Lee;Ying-Che Kuo
Affiliations:
Networking Technology Laboratory, Institute of Communication Engineering, National Chiao Tung University, No. 1001, Ta Hsueh Road, Hsinchu 30050, Taiwan, ROC;Networking Technology Laboratory, Institute of Communication Engineering, National Chiao Tung University, No. 1001, Ta Hsueh Road, Hsinchu 30050, Taiwan, ROC
Venue:
Computer Communications
Year:
2005

Citing 7
Cited 0

A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
High-speed switch scheduling for local-area networks

ACM Transactions on Computer Systems (TOCS)
The iSLIP scheduling algorithm for input-queued switches

IEEE/ACM Transactions on Networking (TON)
WF2Q: worst-case fair weighted fair queueing

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Achieving 100% throughput in an input-queued switch

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Matching output queueing with a combined input/output-queued switch

IEEE Journal on Selected Areas in Communications
A scheme for real-time channel establishment in wide-area networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.24

Visualization

Abstract

A packet-based least cushion first/most urgent first (PB-LCF/MUF) maximal matching algorithm is presented in this paper for combined input and output queued (CIOQ) switches with multiple traffic classes. The main benefit of using a CIOQ switch is to alleviate memory bandwidth requirement while providing quality of service (QoS) guarantee. It was proved that, with a speedup factor of 2, a CIOQ switch which adopts the LCF/MUF scheduling algorithm can exactly emulate an output queued (OQ) switch for any service discipline under fixed-length packets assumption. However, in current Internet environment, packets are transported with different lengths. Therefore, it is necessary to modify the LCF/MUF scheduling algorithm for variable-length packet traffic. For ease of implementation, the proposed algorithm calculates approximate cushions and does not perform re-ordering at output ports. We found, via computer simulations, that the performance of a CIOQ switch with a speedup factor of 5 that adopts the proposed single-iteration PB-LCF/MUF algorithm is close to that of an OQ switch under the weighted round robin service discipline for offered traffic load up to 0.9. In addition, the packet departure order can be maintained under the single-iteration algorithm.