A Combined Fair Scheduling Algorithm for Combined-Input-Crosspoint-Queued Switch

Author

Xu, Ning ; Yu, Shaohua ; Wang, Xueshun

Author_Institution

Departmant of Comput. Sci., Huazhong Univ. of Sci. & Technol., Wuhan, China

fYear

2009

fDate

24-26 Sept. 2009

Firstpage

1

Lastpage

4

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.

Keywords

minimax techniques; packet switching; quality of service; queueing theory; scheduling; telecommunication traffic; QoS; combined-input-crosspoint-queued switch; max-min fair scheduling algorithm; nonuniform traffic pattern; Algorithm design and analysis; Communication switching; Integrated circuit technology; Job shop scheduling; Optical switches; Packet switching; Scheduling algorithm; Throughput; Traffic control; Very large scale integration;

fLanguage

English

Publisher

ieee

Conference_Titel

Wireless Communications, Networking and Mobile Computing, 2009. WiCom '09. 5th International Conference on

Conference_Location

Beijing

Print_ISBN

978-1-4244-3692-7

Electronic_ISBN

978-1-4244-3693-4

Type

conf

DOI

10.1109/WICOM.2009.5301803

Filename

5301803