IEICE Transactions on Communications
Online ISSN : 1745-1345
Print ISSN : 0916-8516
Regular Section
An Artificial Fish Swarm Algorithm for the Multicast Routing Problem
Qing LIUTomohiro ODAKAJousuke KUROIWAHaruhiko SHIRAIHisakazu OGURA
Author information
JOURNALS RESTRICTED ACCESS

2014 Volume E97.B Issue 5 Pages 996-1011

Details
Abstract

This paper presents an artificial fish swarm algorithm (AFSA) to solve the multicast routing problem, which is abstracted as a Steiner tree problem in graphs. AFSA adopts a 0-1 encoding scheme to represent the artificial fish (AF), which are then subgraphs in the original graph. For evaluating each AF individual, we decode the subgraph into a Steiner tree. Based on the adopted representation of the AF, we design three AF behaviors: randomly moving, preying, and following. These behaviors are organized by a strategy that guides AF individuals to perform certain behaviors according to certain conditions and circumstances. In order to investigate the performance of our algorithm, we implement exhaustive simulation experiments. The results from the experiments indicate that the proposed algorithm outperforms other intelligence algorithms and can obtain the least-cost multicast routing tree in most cases.

Information related to the author
© 2014 The Institute of Electronics, Information and Communication Engineers
Previous article Next article
feedback
Top