An Ant Colony System Algorithm for the Multicast Routing Problem

Authors:
Yuan Zhang;Huachun Cai;Ying Lin;Jing Xiao;Jun Zhang
Affiliations:
Sun Yat-sen University, China;Sun Yat-sen University, China;Sun Yat-sen University, China;Sun Yat-sen University, China;Sun Yat-sen University, China
Venue:
ICNC '07 Proceedings of the Third International Conference on Natural Computation - Volume 04
Year:
2007

Citing 0
Cited 1

An ant colony optimization algorithm for the time-varying workflow scheduling problem in grids

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation

Quantified Score

Hi-index	0.02

Visualization

Abstract

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.