By Topic

A high-speed fair scalable scheduling architecture

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

3 Author(s)
Qingsheng Hu ; Southeast Univ., Nanjing ; Chen Liu ; Hua-An Zhao

This paper proposes a high-speed fair scalable scheduling architecture (FSSA) based on input queued switches, which can be implemented on a 64 x 64 scheduler. Compare with the ordinary SSA, the FSSA evenly distributes the starts of new scheduling rounds to different cell times in guarantee of a more balanced scheduling pattern. The simulation results show that the FSSA has a better performance in latency than SSA especially under low traffic load and the synthesis and post simulation results indicate that the data rate of each channel can be up to 800 Mbps. Therefore, the implementation of FSSA is applicable to high-speed scalable switches.

Published in:

Intelligent Signal Processing and Communication Systems, 2007. ISPACS 2007. International Symposium on

Date of Conference:

Nov. 28 2007-Dec. 1 2007