An Ant Algorithm for Solving QoS Multicast Routing Problem

International Journal of Computer Science and Security

Ahmed Younes Hamed¹ 

[1] $$

关键词: Multimedia Communication;    Multicast Routing;    Multicast Tree;    Ant Colony Algorithms;    Bandwidth;    Delay and Cost.;   

DOI  :  

来源: Computer Science and Security

【 摘 要 】

Abstract: Many applications require send information from a source to multiple destinations through a communication network. To support these applications, it is necessary to determine a multicast tree of minimal cost to connect the source node to the destination nodes subject to delay constraints. Based on the Ant System algorithm, we present an ant algorithm to find the multicast tree that minimizes the total cost. In the proposed algorithm, the k shortest paths from the source node to the destination nodes are used for genotype representation. The expermintal results show that the algorithm can find optimal solution quickly and has a good scalability.

【 授权许可】

Unknown