Title :
A heuristic ant algorithm for solving QoS multicast routing problem
Author :
Chu, Chao-Hsien ; Gu, Junhua ; Hou, Xiang Dan ; Gu, Qijun
Author_Institution :
Sch. of Inf. Sci. & Tech., Pennsylvania State Univ., University Park, PA, USA
fDate :
6/24/1905 12:00:00 AM
Abstract :
In this paper, we present an ant colony-based heuristic to solve QoS (quality of service) constrained multicast routing problems. Our algorithm considers multiple QoS metrics, such as bandwidth, delay, delay jitter and packet loss rate, to find the multicast tree that minimizes the total cost. We also explore the scalability of the ant algorithm. Our tests show that the algorithm can find optimal (or near-optimal) solutions quickly and that it has good scalability
Keywords :
artificial life; constraint theory; heuristic programming; minimisation; multicast communication; problem solving; quality of service; scaling phenomena; telecommunication computing; telecommunication network routing; timing jitter; trees (mathematics); QoS constrained multicast routing problems; QoS metrics; ant colony-based heuristic; bandwidth; cost minimization; delay jitter; heuristic ant algorithm; multicast tree; optimal solution; packet loss rate; problem solving; scalability; Bandwidth; Costs; Delay; Heuristic algorithms; Jitter; Multicast algorithms; Quality of service; Routing; Scalability; Testing;
Conference_Titel :
Evolutionary Computation, 2002. CEC '02. Proceedings of the 2002 Congress on
Conference_Location :
Honolulu, HI
Print_ISBN :
0-7803-7282-4
DOI :
10.1109/CEC.2002.1004486