A heuristic ant algorithm for solving QoS multicast routing problem

  • Authors:
  • Chao-Hsien Chu;JunHua Gu;Qijun Gu

  • Affiliations:
  • Sch. of Inf. Sci. & Tech., Pennsylvania State Univ., University Park, PA, USA;Dept. of Manage. Inf. Syst., Nat. Pingtung Univ. of Sci. & Technol., Taiwan;Dipt. di Automatica e Informatica, Politecnico di Torino, Italy

  • Venue:
  • CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

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.