On QoS Anycast Routing Algorithm based on Particle Swarm Optimization

被引：0

作者：

Li, Taoshen ^{[1
,2
]}

Yang, Ming ^{[1
]}

Chen, Songqiao ^{[2
]}

Zhao, Zhigang ^{[1
]}

Ge, Zhihui ^{[1
]}

机构：

[1] Guangxi Univ, Sch Comp Elect & Informat, Nanning 530004, Peoples R China

[2] Cent South Univ, Sch Informat Sci & Engn, Changsha 410083, Peoples R China

来源：

PROCEEDINGS OF THE 9TH INTERNATIONAL CONFERENCE FOR YOUNG COMPUTER SCIENTISTS, VOLS 1-5 | 2008年

基金：

美国国家科学基金会; 中国国家自然科学基金;

关键词：

anycast; QoS; routing; particle swam optimization; fitness function;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Anycast is a new "one-to-one-of-many " communication method in IPv6 networks. QoS anycast routing problem is a nonlinear combination optimization problem, which is proved to be a NP complete problem. Based on improved particle swarm optimization algorithm, an anycast routing algorithm with multiple. QoS constraints is proposed. This algorithm uses a special add operator to make the worst path learning from the better path in order to approach to global optimal path. To guarantee the diversity of particles and improve the algorithm's ability to skip out of local optimum, a random mutation operator is designed to mutate global optima randomly. The experimental results show that the algorithm is feasible and effective, and can satisfy the need of the user for bandwidth and delay on the basic of resource reservation.

引用

页码：386 / +

页数：3

共 19 条

[1]

Blackwell Tim., 2007, Particle swarm optimization, encyclopedia of machine learning, V1, P33, DOI DOI 10.4018/IJMFMP.2015010104

[2]

Deering S., 1998, INTERNET PROTOCOL VE

[3]

Eberhart R., 1995, MHS 95 P 6 INT S MIC, DOI DOI 10.1109/MHS.1995.494215

[4]

Eberhart RC, 2001, IEEE C EVOL COMPUTAT, P81, DOI 10.1109/CEC.2001.934374

[5]

Guerin RA, 1997, GLOB TELECOMM CONF, P1903, DOI 10.1109/GLOCOM.1997.644603

[6]

HAO F, 2002, IEEE COMMUNITION JUN, P46

[7] Distributed admission control for anycast flows [J].

Jia, WJ ;

Xuan, D ;

Tu, WQ ;

Lin, LD ;

Zhao, W .

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2004, 15 (08) :673-686

[8] Integrated routing algorithms for anycast messages [J].

Jia, WJ ;

Xuan, D ;

Zhao, W .

IEEE COMMUNICATIONS MAGAZINE, 2000, 38 (01) :48-53

[9]

LI TS, 2008, J COMPUTATIONAL INFO, V4, P731

[10]

LI TS, 2007, 2 INT C COMP SCI ED, P820

← 1 2 →