Design and Implementation of High-Speed Input-Queued Switches Based on a Fair Scheduling Algorithm
スポンサーリンク
概要
- 論文の詳細を見る
To increase both the capacity and the processing speed for input-queued (IQ) switches, we proposed a fair scalable scheduling architecture (FSSA). By employing FSSA comprised of several cascaded sub-schedulers, a large-scale high performance switches or routers can be realized without the capacity limitation of monolithic device. In this paper, we present a fair scheduling algorithm named FSSA_DI based on an improved FSSA where a distributed iteration scheme is employed, the scheduler performance can be improved and the processing time can be reduced as well. Simulation results show that FSSA_DI achieves better performance on average delay and throughput under heavy loads compared to other existing algorithms. Moreover, a practical 64 × 64 FSSA using FSSA_DI algorithm is implemented by four Xilinx Vertex-4 FPGAs. Measurement results show that the data rates of our solution can be up to 800Mbps and the tradeoff between performance and hardware complexity has been solved peacefully.
- (社)電子情報通信学会の論文
- 2010-03-01
著者
-
HU Qingsheng
Institute of RF- & OE-ICs, Southeast University
-
ZHAO Hua-An
Dept. of Computer Science and Eletrical Engineering, Kumamoto University
-
Hu Qingsheng
Institute Of Rf- & Oe-ics Southeast University
-
Zhao Hua-an
Dept. Of Computer Science And Eletrical Engineering Kumamoto University
関連論文
- Design and Implementation of High-Speed Input-Queued Switches Based on a Fair Scheduling Algorithm
- Design and Implementation of High-Speed Input-Queued Switches Based on a Fair Scheduling Algorithm
- Diagonal Block Orthogonal Algebraic Space-Time Block Codes(Communications and Wireless Systems, Recent Advances in Circuits and Systems-Part 1)