Detailed Information
Cited 0 time in 
Cited 0 time in 
Cited 0 time in
Metadata Downloads
An ant colony system algorithm for the multicast routing problem
- Authors
- Zhang, Yuan; Cai, Huachun; Lin, Ying; Xiao, Jing; Zhang, Jun
- Issue Date
- Aug-2007
- Publisher
- IEEE
- Citation
- Third International Conference on Natural Computation (ICNC 2007), v.4, pp 756 - 760
- Pages
- 5
- Indexed
- SCI
SCOPUS
- Journal Title
- Third International Conference on Natural Computation (ICNC 2007)
- Volume
- 4
- Start Page
- 756
- End Page
- 760
- 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. © 2007 IEEE.
- Files in This Item
- Go to Link
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
Related Researcher
- ZHANG, Jun
- ERICA 공학대학 (SCHOOL OF ELECTRICAL ENGINEERING)