1st International ICST Conference on Communications and Networking in China

Research Article

A New Practical Scheduling Algorithm for Buffered Crossbar Switches

  • @INPROCEEDINGS{10.1109/CHINACOM.2006.344800,
        author={Hongchao  Hu and Peng  Yi and  Yunfei  Guo},
        title={A New Practical Scheduling Algorithm for Buffered Crossbar Switches},
        proceedings={1st International ICST Conference on Communications and Networking in China},
        publisher={IEEE},
        proceedings_a={CHINACOM},
        year={2007},
        month={4},
        keywords={CICQ quantitative switching scheduling},
        doi={10.1109/CHINACOM.2006.344800}
    }
    
  • Hongchao Hu
    Peng Yi
    Yunfei Guo
    Year: 2007
    A New Practical Scheduling Algorithm for Buffered Crossbar Switches
    CHINACOM
    IEEE
    DOI: 10.1109/CHINACOM.2006.344800
Hongchao Hu1,2,*, Peng Yi1,2,*, Yunfei Guo1,2,*
  • 1: National Digital Switching System Engineering & Technology R&D Center (NDSC)
  • 2: No.7 Jianxue St., Wenhua Rd., Zhengzhou, China
*Contact email: huhongchao@gmail.com, yp@mail.ndsc.com.cn, gyf@mail.ndsc.com.cn

Abstract

Recently, buffered-crossbar (CICQ) switch is becoming more and more attractive to high performance router builders than bufferless schemes, because it can achieve throughput, rate and delay guarantees. In this article, we propose a practical scheduling scheme called the weighted quantitative queue longest and least scheduled first, shorted by WQ2L2SF. The main features of this scheduling algorithm are in its easier implementation in hardware, as the time complexities is only O(logN), and fewer hardware resources are needed than existing schemes. We proved that under a speedup factor of 2, our algorithm can achieve 100% throughput. Finally, Simulation results show that our scheduling scheme can achieve good delay and stability performances