QoS multicast routing using a quantum-behaved particle swarm optimization algorithm

被引：47

作者：

Sun, Jun ^{[1
]}

Fang, Wei ^{[1
]}

Wu, Xiaojun ^{[1
]}

Xie, Zhenping ^{[2
]}

Xu, Wenbo ^{[1
]}

机构：

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

[2] Jiangnan Univ, Sch Digital Media, Wuxi 214122, Jiangsu, Peoples R China

来源：

ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE | 2011年 / 24卷 / 01期

关键词：

Heuristic methods; Integer programming; Multicast routing; Multicast tree; Particle swarm optimization; Quality of service; TREE;

D O I：

10.1016/j.engappai.2010.08.001

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

QoS multicast routing in networks is a very important research issue in networks and distributed systems. It is also a challenging and hard problem for high-performance networks of the next generation. Due to its NP-completeness, many heuristic methods have been employed to solve the problem. This paper proposes the modified quantum-behaved particle swarm optimization (QPSO) method for QoS multicast routing. In the proposed method, QoS multicast routing is converted into an integer programming problem with QoS constraints and is solved by the QPSO algorithm combined with loop deletion operation. The QPSO-based routing method, along with the routing algorithms based on particle swarm optimization (PSO) and genetic algorithm (GA), is tested on randomly generated network topologies for the purpose of performance evaluation. The simulation results show the efficiency of the proposed method on QoS the routing problem and its superiority to the methods based on PSO and GA. (C) 2010 Elsevier Ltd. All rights reserved.

引用

页码：123 / 131

页数：9

共 30 条

[1] Delay-constrained, low-cost multicast routing in multimedia networks [J].

Alrabiah, T ;

Znati, T .

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2001, 61 (09) :1307-1336

[2]

Angeline P., 1998, Seventh Annual Conference on Evolutionary Programming, San Diego, USA, 25 -27 Mar 1998, P601, DOI DOI 10.1007/BFB0040753

[3]

Changbing Li, 2007, 2007 IEEE International Conference on Control and Automation, ICCA 2007, P2355, DOI 10.1109/ICCA.2007.4376782

[4] Resource optimization in QoS multicast routing of real-time multimedia [J].

Charikar, M ;

Naor, J ;

Schieber, B .

IEEE-ACM TRANSACTIONS ON NETWORKING, 2004, 12 (02) :340-348

[5] The particle swarm - Explosion, stability, and convergence in a multidimensional complex space [J].

Clerc, M ;

Kennedy, J .

IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (01) :58-73

[6]

Clerc M, 1999, P C EV COMP, DOI [10.1109/CEC.1999.785513, DOI 10.1109/CEC.1999.785513]

[7] Global optimization of electromagnetic devices using an exponential quantum-behaved particle swarm optimizer [J].

Coelho, Leandro dos Santos ;

Alotto, Piergiorgio .

IEEE TRANSACTIONS ON MAGNETICS, 2008, 44 (06) :1074-1077

[8] On approximation algorithms for the terminal Steiner tree problem [J].

Drake, DE ;

Hougardy, S .

INFORMATION PROCESSING LETTERS, 2004, 89 (01) :15-18

[9] Convergence analysis of quantum-behaved particle swarm optimization algorithm and study on its control parameter [J].

Fang Wei ;

Sun Jun ;

Xie Zhen-Ping ;

Xi Wen-Bo .

ACTA PHYSICA SINICA, 2010, 59 (06) :3686-3694

[10]

FENG X, 1999, COMPUT COMMUN, V22, P1392

← 1 2 3 →