Art

J-GLOBAL ID：201302259205966534   Reference number：13A1826642

Solving the Crossbar Switching Problem Using n-state Ant Colony Algorithm

N-状態蟻コロニーアルゴリズム用いたクロスバースイッチング問題を解く

Author (2)： ZHAO Li-qing (Graduate school of Engineering, Univ. of Fukui) ,  WANG Rong-long (Graduate school of Engineering, Univ. of Fukui)
Material： 電気学会論文誌 C  (IEEJ Transactions on Electronics, Information and Systems)
Volume： 133  Issue： 6  Page： 1242-1250 (J-STAGE)  Publication year： 2013 
JST Material Number： S0810A  ISSN： 0385-4221  Document type： Article
Article type： 原著論文  Country of issue： Japan (JPN)  Language： ENGLISH (EN)

Thesaurus term： algorithm ,  *communication exchanging ,  heuristics ,  *simulation ,  *crossbar switching
Semi thesaurus term： heuristic ,  *ant colony algorithm

JST classification (1)： Computer software in general  (JD01010K)

Reference (27)：

• TAMIR, Y. Symmetric crossbar arbiters for VLSI communication switches. IEEE Trans. on parallel and distributed systems. 1993, 4, 1
• INUKAI, T. An efficient SS/TDM time slot assignment algorithm. IEEE Trans. on Communication. 1979, 27, 1449-1455
• ROSE, C. Rapid optimal scheduling for time-multiplex switches using a cellular automaton. IEEE Trans. on Commun. 1989, 37, 500-509
• CHEN, W. Traffic routing algorithm for serial superchip system customisation. IEE Proc., Pt. E. 1990, 137, 1
• MARRAKCHI, A. A neural net arbitrator for large crossbar packet-switches. IEEE Trans. Circuit Syst. 1989, 36, 1039-1041

Terms in the title (3)： 蟻コロニーアルゴリズム ,  クロスバー ,  スイッチング