• DocumentCode
    575011
  • Title

    SBF-GWF scheduling for Combined Input-Crosspoint-Queued (CICQ) switches

  • Author

    Gao, Zhijiang ; Zeng, Huaxin ; Xia, Yu ; Shen, Zhijun

  • Author_Institution
    Sch. of Inf. Sci. & Technol., Southwest Jiaotong Univ., Chengdu, China
  • fYear
    2011
  • fDate
    Nov. 29 2011-Dec. 1 2011
  • Firstpage
    404
  • Lastpage
    408
  • Abstract
    Combined Input-Crosspoint-Queued (CICQ) crossbar switches are advantageous in performance over input-queued (IQ) switches. As a result, many scheduling schemes have been developed for CICQ switches to further improve their performance. This paper presents a new scheduling scheme called SBF-GWF (the Shortest buffer First and the Greatest Weigh buffer First). It takes the advantage of the SBF algorithm used in MCBF input arbiters with an additional feature that uses VOQ lengths as weights, which will in turn be used for privileged output with the fluid model, we have proved that SBF-GWF algorithm can achieve 100% throughput for any admissible traffic without the need of speed-up for crossbars. Our simulation results have also shown that SBF-GWF algorithm exhibits good delay performance under any admissible traffic compared with existing scheduling schemes.
  • Keywords
    packet switching; queueing theory; scheduling; switches; CICQ Switches; MCBF input arbiters; SBF-GWF algorithm; SBF-GWF scheduling; VOQ; combined input-crosspoint-queued switches; crossbars; shortest buffer first and the greatest weigh buffer first algorithm; virtual output queues; Delay; Fabrics; Fluids; Scheduling; Scheduling algorithms; Switches; Throughput; 100% throughput; CICQ switch fabric; scheduling scheme;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Sciences and Convergence Information Technology (ICCIT), 2011 6th International Conference on
  • Conference_Location
    Seogwipo
  • Print_ISBN
    978-1-4577-0472-7
  • Type

    conf

  • Filename
    6316647