A heuristic ant algorithm for solving QoS multicast routing problem

Chao Hsien Chu, Junhua Gu, Xiang Dan Hou, Qijun Gu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

37 Scopus citations

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.

Original languageEnglish (US)
Title of host publicationProceedings of the 2002 Congress on Evolutionary Computation, CEC 2002
PublisherIEEE Computer Society
Pages1630-1635
Number of pages6
ISBN (Print)0780372824, 9780780372825
DOIs
StatePublished - Jan 1 2002
Event2002 Congress on Evolutionary Computation, CEC 2002 - Honolulu, HI, United States
Duration: May 12 2002May 17 2002

Publication series

NameProceedings of the 2002 Congress on Evolutionary Computation, CEC 2002
Volume2

Other

Other2002 Congress on Evolutionary Computation, CEC 2002
CountryUnited States
CityHonolulu, HI
Period5/12/025/17/02

All Science Journal Classification (ASJC) codes

  • Software

Fingerprint Dive into the research topics of 'A heuristic ant algorithm for solving QoS multicast routing problem'. Together they form a unique fingerprint.

  • Cite this

    Chu, C. H., Gu, J., Hou, X. D., & Gu, Q. (2002). A heuristic ant algorithm for solving QoS multicast routing problem. In Proceedings of the 2002 Congress on Evolutionary Computation, CEC 2002 (pp. 1630-1635). [1004486] (Proceedings of the 2002 Congress on Evolutionary Computation, CEC 2002; Vol. 2). IEEE Computer Society. https://doi.org/10.1109/CEC.2002.1004486