A combined fair scheduling algorithm for combined-input-crosspoint-queued switch

Authors:
Ning Xu;Shaohua Yu;Xueshun Wang
Affiliations:
Departmant of Computer Science, Huazhong University of Science and Technology and State Key Laboratory for New Optical Communication Technology and Networks, Wuhan, China;Departmant of Computer Science, Huazhong University of Science and Technology and State Key Laboratory for New Optical Communication Technology and Networks, Wuhan, China;Departmant of Computer Science, Huazhong University of Science and Technology and State Key Laboratory for New Optical Communication Technology and Networks, Wuhan, China
Venue:
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Year:
2009

Citing 4
Cited 0

The iSLIP scheduling algorithm for input-queued switches

IEEE/ACM Transactions on Networking (TON)
Max-Min Fair Scheduling in Input-Queued Switches

IEEE Transactions on Parallel and Distributed Systems
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
Output-queued switch emulation by fabrics with limited memory

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we discuss that both high performance and max-min fair scheduling is necessary for a QoS-awared scheduling algorithm for Combined Input-Crosspoint-Queued switch and present a new scheduling algorithm called Combined Max-Min Fair Scheduling (CMMFS) scheme. Simulation shows that this algorithm can achieve high performance under the uniform and non-uniform traffic pattern and Fairness of scheduling is also verified. The results shows that our algorithm is better than many typical scheduling schemes.