Abstract
Based on the principle of ant colony algorithm this paper proposes a new ant colony algorithm based on trees, and applies it to the solution of multi-constraints QoS network multicast routing. An ant moves constantly on the network to find a multicast tree including source nodes and destination nodes. This action is operated repetitively and pheromones are updated regularly, and an optimal multicast tree satisfying different QoS constraints can finally be found. Simulation results indicate that in solving multicast routing problems the convergence speed of the tree-based ant colony algorithm is much higher than that of conventional ant colony algorithm. And the performance of the best solution found by the new algorithm is not worse.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
