DocumentCode :
3004687
Title :
RR-LQD: A novel scheduling algorithm for CICQ switching fabrics
Author :
Yun, Zi ; Peng, Laixian ; Zhao, Wendong ; Tian, Chang
Author_Institution :
Inst. of Commun. Eng., PLA Univ. of Sci. & Technol., Nanjing, China
fYear :
2009
fDate :
8-10 Oct. 2009
Firstpage :
846
Lastpage :
849
Abstract :
CICQ(Combined Input-Crosspoint Queued) is a switch fabric with buffers in crosspoints, which brings its nice distributed parallel scheduling property with no internal speedup required. In order to adjust to the nonuniform traffic in the network environment, a novel round-robin scheduling algorithm by using the longest queue detecting (RR-LQD) is proposed. The simulation results show that the RR-LQD can achieve 100% throughput and delay performance close to LQF-RR under various uniform and non-uniform traffics. In addition, the time complexity of RR-LQD is O(1) for hardware implementation. The implementation feasibility of RR-LQD is shown by an FPGA-based design in this paper.
Keywords :
computational complexity; queueing theory; scheduling; telecommunication switching; CICQ switching fabrics; FPGA-based design; RR-LQD; combined input-crosspoint queued; distributed parallel scheduling algorithm; longest queue detecting; nonuniform traffic; round-robin scheduling algorithm; time complexity; Communication switching; Delay; Fabrics; Programmable logic arrays; Round robin; Scheduling algorithm; Switches; Telecommunication traffic; Throughput; Traffic control; CICQ; complexity; longest queue detecting; scheduling;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communications, 2009. APCC 2009. 15th Asia-Pacific Conference on
Conference_Location :
Shanghai
Print_ISBN :
978-1-4244-4784-8
Electronic_ISBN :
978-1-4244-4785-5
Type :
conf
DOI :
10.1109/APCC.2009.5375470
Filename :
5375470
Link To Document :
بازگشت