[1]ZHANG Chong-yang,SHEN Jin-yuan,LIU Run-jie,et al.A study on scheduling algorithms for high-speed switching networks based on input-queuing[J].CAAI Transactions on Intelligent Systems,2008,3(3):265-269.
Copy
CAAI Transactions on Intelligent Systems[ISSN 1673-4785/CN 23-1538/TP] Volume:
3
Number of periods:
2008 3
Page number:
265-269
Column:
学术论文—智能系统
Public date:
2008-06-25
- Title:
-
A study on scheduling algorithms for high-speed switching networks based on input-queuing
- Author(s):
-
ZHANG Chong-yang; SHEN Jin-yuan; LIU Run-jie; ZHANG Wen-ying; MU Wei-xin
-
Institute of Information Engineering; Zhengzhou University; Zhengzhou 450052; China
-
- Keywords:
-
input-queuing; virtual output queuing; bipartite graph matching; scheduling algorithm
- CLC:
-
TP18
- DOI:
-
-
- Abstract:
-
Most high2speed switching networks adop t a switching fabric with fixed2length cells, and their perform2 ance depends heavily upon queuing strategies and the cell scheduling algorithm. Onlywhen the input2queuing strat2 egy is combined with a p roper switching algorithm can throughput and time delay for the switching fabric be op ti2 mized. This paper mainly discusses virtual output queuing (VOQ) 2based algorithms, among them the maximum numbermatching algorithm, the maximum weightmatching algorithm, the stable combination matching algorithm, and the Hopfield neural network (HNN) scheduling algorithm. The mechanisms, performance and imp lementation2 al comp lexity of these algorithms are compared and analyzed. The working modes of distributed and centralized scheduling algorithms are analyzed. Finally, from the findings in our research, it is concluded that the HNN algo2 rithm can realize other algorithms by defining a p riority functi