Third International Conference on Natural Computation (ICNC 2007) (2007)
Haikou, Hainan, China
Aug. 24, 2007 to Aug. 27, 2007
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICNC.2007.177
Yuan Zhang , Sun Yat-sen University, China
Huachun Cai , Sun Yat-sen University, China
Ying Lin , Sun Yat-sen University, China
Jing Xiao , Sun Yat-sen University, China
Jun Zhang , Sun Yat-sen University, China
With the rapid development in network services, multicast has recently became a hot spot in communication technology. The multicast routing is the key to multicast implementation. A modified ant colony system is presented in this paper to do the single-origin-multi-destination routing without constraints. This algorithm first transforms the connective network into the corresponding distance complete graph, and then develops a Prim?s-algorithm-like route construction process with an inclination factor towards the multicast vertexes. Simulations on a set of benchmark instances prove that the proposed algorithm is a worthy attempt for the multicast routing problem.
H. Cai, J. Xiao, Y. Lin, Y. Zhang and J. Zhang, "An Ant Colony System Algorithm for the Multicast Routing Problem," Third International Conference on Natural Computation (ICNC 2007)(ICNC), Haikou, Hainan, China, 2007, pp. 756-760.