Performance comparison of genetic algorithm and particle swarm optimization on QoS multicast routing problem

被引：0

作者：

Qin, Jie ^{[1
]}

Liu, Jing ^{[1
]}

Xu, Wenbo ^{[1
]}

机构：

[1] So Yangtze Univ, Sch Informat Technol, Wuxi 214122, Jiangsu, Peoples R China

来源：

DCABES 2006 PROCEEDINGS, VOLS 1 AND 2 | 2006年

关键词：

multicast routing; QoS; routing optimization; Particle swarm optimization algorithms; PSO;

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

QoS multicast routing in networks is a very important research issues in the areas of networks and distributed systems. This is also a challenging and hard problem for the next generation Internet a high-performance networks. Because of its NP-completeness, many heuristics such as Genetic Algorithms are employed solve the problem. This paper proposes an Improved PSO (IPSO) and present how to solve QoS multicast routing problem by IPSO. The proposed algorithm converts the QoS multicast routing problem into an integer-programming problem. We test IPSO-base routing algorithm on a network model. For performance comparison, we also test Particle Swarm Optimization (PSO) algorithm and GA. The experiment results show the availability and efficiency of IPSO on the problem and its superiority to PSO and GA.

引用

页码：1140 / 1143

页数：4

共 7 条

[1]

Clerc M., 2002, Proceedings of the 1999 Congress on Evolutionary Computation, DOI DOI 10.1109/CEC.1999.785513

[2] QoS routing in networks with inaccurate information:: Theory and algorithms [J].

Guérin, RA ;

Orda, A .

IEEE-ACM TRANSACTIONS ON NETWORKING, 1999, 7 (03) :350-364

[3]

Kennedy J, 1995, 1995 IEEE INTERNATIONAL CONFERENCE ON NEURAL NETWORKS PROCEEDINGS, VOLS 1-6, P1942, DOI 10.1109/icnn.1995.488968

[4]

LI LY, 1998, J COMPUTERS, V11, P137

[5]

MOSES C, 2000, P IEEE INFOCOM, P1518

[6]

SHI Y, P 1998 IEEE INT C EV, P1945

[7] ROUTING OF MULTIPOINT CONNECTIONS [J].

WAXMAN, BM .

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1988, 6 (09) :1617-1622

← 1 →