A heuristic ant algorithm for solving QoS multicast routing problem

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

doi:10.1109/CEC.2002.1004486

A heuristic ant algorithm for solving QoS multicast routing problem

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

College of Information Sciences and Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

50 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 language	English (US)
Title of host publication	Proceedings of the 2002 Congress on Evolutionary Computation, CEC 2002
Publisher	IEEE Computer Society
Pages	1630-1635
Number of pages	6
ISBN (Print)	0780372824, 9780780372825
DOIs	https://doi.org/10.1109/CEC.2002.1004486
State	Published - Jan 1 2002
Event	2002 Congress on Evolutionary Computation, CEC 2002 - Honolulu, HI, United States Duration: May 12 2002 → May 17 2002

Publication series

Name	Proceedings of the 2002 Congress on Evolutionary Computation, CEC 2002
Volume	2

Other

Other	2002 Congress on Evolutionary Computation, CEC 2002
Country/Territory	United States
City	Honolulu, HI
Period	5/12/02 → 5/17/02

All Science Journal Classification (ASJC) codes

Software

Access to Document

10.1109/CEC.2002.1004486

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). Article 1004486 (Proceedings of the 2002 Congress on Evolutionary Computation, CEC 2002; Vol. 2). IEEE Computer Society. https://doi.org/10.1109/CEC.2002.1004486

@inproceedings{bac11131a97340048d6f06c19e996465,

title = "A heuristic ant algorithm for solving QoS multicast routing problem",

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.",

author = "Chu, {Chao Hsien} and Junhua Gu and Hou, {Xiang Dan} and Qijun Gu",

year = "2002",

month = jan,

day = "1",

doi = "10.1109/CEC.2002.1004486",

language = "English (US)",

isbn = "0780372824",

series = "Proceedings of the 2002 Congress on Evolutionary Computation, CEC 2002",

publisher = "IEEE Computer Society",

pages = "1630--1635",

booktitle = "Proceedings of the 2002 Congress on Evolutionary Computation, CEC 2002",

address = "United States",

note = "2002 Congress on Evolutionary Computation, CEC 2002 ; Conference date: 12-05-2002 Through 17-05-2002",

}

Chu, CH, Gu, J, Hou, XD & Gu, Q 2002, A heuristic ant algorithm for solving QoS multicast routing problem. in Proceedings of the 2002 Congress on Evolutionary Computation, CEC 2002., 1004486, Proceedings of the 2002 Congress on Evolutionary Computation, CEC 2002, vol. 2, IEEE Computer Society, pp. 1630-1635, 2002 Congress on Evolutionary Computation, CEC 2002, Honolulu, HI, United States, 5/12/02. https://doi.org/10.1109/CEC.2002.1004486

A heuristic ant algorithm for solving QoS multicast routing problem. / Chu, Chao Hsien; Gu, Junhua; Hou, Xiang Dan et al.
Proceedings of the 2002 Congress on Evolutionary Computation, CEC 2002. IEEE Computer Society, 2002. p. 1630-1635 1004486 (Proceedings of the 2002 Congress on Evolutionary Computation, CEC 2002; Vol. 2).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - A heuristic ant algorithm for solving QoS multicast routing problem

AU - Chu, Chao Hsien

AU - Gu, Junhua

AU - Hou, Xiang Dan

AU - Gu, Qijun

PY - 2002/1/1

Y1 - 2002/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=35048818730&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=35048818730&partnerID=8YFLogxK

U2 - 10.1109/CEC.2002.1004486

DO - 10.1109/CEC.2002.1004486

M3 - Conference contribution

AN - SCOPUS:35048818730

SN - 0780372824

SN - 9780780372825

T3 - Proceedings of the 2002 Congress on Evolutionary Computation, CEC 2002

SP - 1630

EP - 1635

BT - Proceedings of the 2002 Congress on Evolutionary Computation, CEC 2002

PB - IEEE Computer Society

T2 - 2002 Congress on Evolutionary Computation, CEC 2002

Y2 - 12 May 2002 through 17 May 2002

ER -

A heuristic ant algorithm for solving QoS multicast routing problem

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this