DocumentCode
1993159
Title
Application of Improved Ant Colony Algorithm to the QoS Multicast Routing
Author
Li, Kewen ; Tian, Jing
Author_Institution
Sch. of Manage., Tianj in Univ., Tianjin
Volume
2
fYear
2008
fDate
21-22 Dec. 2008
Firstpage
780
Lastpage
784
Abstract
For the search of the optimal path and the establishment of the multicast tree which meets QoS constraints in multicast routing, an improved ant colony algorithm is proposed in the paper. In the searching process, two group ants carry out searching separately and alternate information after one search to avoid stagnation. And the optimal one is selected from the two paths combining multi-constrained QoS. At the same time, in the choice of the next node, the probability of previous search on the path is introduced to speed up the search speed. Experiments show that the algorithm has a better performance than the other routing algorithm and establish the multicast tree quickly.
Keywords
multicast communication; optimisation; quality of service; telecommunication network routing; trees (mathematics); QoS multicast routing; ant colony algorithm; multicast tree; Ant colony optimization; Computer science education; Costs; Delay; Educational technology; Jitter; Management training; Multicast algorithms; NP-complete problem; Routing;
fLanguage
English
Publisher
ieee
Conference_Titel
Education Technology and Training, 2008. and 2008 International Workshop on Geoscience and Remote Sensing. ETT and GRS 2008. International Workshop on
Conference_Location
Shanghai
Print_ISBN
978-0-7695-3563-0
Type
conf
DOI
10.1109/ETTandGRS.2008.359
Filename
5070477
Link To Document