Art

J-GLOBAL ID：201402271904455771   Reference number：14A0618741

An Artificial Fish Swarm Algorithm for the Multicast Routing Problem

マルチキャストルーティング問題のための人工魚群アルゴリズム

Author (5)： LIU Qing (Univ. of Fukui) ,  ODAKA Tomohiro (Univ. of Fukui) ,  KUROIWA Jousuke (Univ. of Fukui) ,  SHIRAI Haruhiko (Univ. of Fukui) ,  OGURA Hisakazu (Univ. of Fukui)
Material： IEICE Transactions on Communications (Web)  (IEICE Trans Commun (Web))
Volume： E97.B  Issue： 5  Page： 996-1011 (J-STAGE)  Publication year： 2014 
JST Material Number： U0467A  ISSN： 1745-1345  Document type： Article
Article type： 原著論文  Country of issue： Japan (JPN)  Language： ENGLISH (EN)

Thesaurus term： *routing ,  graph ,  Steiner tree ,  subgraph ,  coding(signal) ,  decoding ,  transfer ,  tracking ,  behavior ,  computer simulation ,  *optimization ,  *communication operation
Semi thesaurus term： *Multicast routing ,  predation ,  *particle swarm optimization algorithm

JST classification (2)： Exchange and switching systems  (ND11020E) ,  Communication network  (ND07030A)

Reference (42)：

• [1] S.E. Drefus and R.A. Wagner, “The Steiner problem in graphs,” Networks, vol.1, no.3, pp.195-207, 1971.
• [2] A.J. Levin, “Algorithm for the shortest connection of a group of graph vertices,” Soviet Math. Dokladi, vol.12, pp.1477-1481, 1971.
• [3] D. Molle, S. Richter, and P. Rossmanith, “A faster algorithm for the Steiner tree problem,” Proc. 23rd International Symposium on Theoretical Aspects of Computer Science, pp.561-570, Marseille, France, 2006.
• [4] L.R. Foulds and P.B. Gibbons, “A branch and bound approach to the Steiner tree problem in graphs,” Proc. 14th Annual Conference of the Operational Research Society of New Zealand, New Zealand, pp.61-70, 1978.
• [5] M.L. Shore, L.R. Foulds, and P.B. Gibbons, “An algorithm for the Steiner tree problem in graphs,” Networks, vol.12, no.3, pp.323-333, 1982.

Terms in the title (4)： マルチキャストルーティング ,  問題 ,  人工 ,  アルゴリズム