Multicast Routing Based on the Ant System 1
Lin Huang, Haishan Han, Jian Hou · 2007
Based on the Ant System algorithm,we propose an efficient algo-rithm for generating a low-cost multicast routing subject to delay con-straints(ASDLMA).The algorithm first construct a backup-paths-set from the source node to each destination nodes using Dijkstra Kth short-est path algorithm.Then transformed the formed procedure of the mul-ticast tree to the Graph.When a ant on the Graph moves from a node to other node depend on the corresponding probabilities function, and update the pheromone on Graph when every iteration finished. Sim-ulation results show our algorithm has features of well performance of cost, fast convergence and stable delay.