By Topic

A High-Speed Scheduling Algorithm for Combined Input-Crosspoint-Queued (CICQ) Switches

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Peng Yi ; Nat. Digital Switching Syst. Eng. & Technol. R&D Center ; Yufeng Li ; Hongchao Hu ; Binqiang Wang

With the development of ASIC technology, buffered crossbar is very popular for building switch architecture nowadays. This makes the combined input-crosspoint-queued (CICQ) switch a more attractive solution than the traditional input-queued (IQ) switch because of the simplicity of the CICQ switch scheduling. Recently, many distributed scheduling policies have been proposed based on this architecture. However, the existing schemes still require quite a bit of hardware or timing complexity to obtain good performance. In this paper, we propose an earliest state-reversed buffer first (ESRBF) scheme, and prove that it achieves 100% throughput for any admissible traffic that satisfies the strong law of large numbers (SLLN). The ESRBF algorithm is based only on the state information of the crosspoint buffer and has a time complexity of O(log N). The simulation results also verify a good performance of the ESRBF scheme

Published in:

Communications and Networking in China, 2006. ChinaCom '06. First International Conference on

Date of Conference:

25-27 Oct. 2006