A distributed QoS multicast routing algorithm based on ACS

被引：0

作者：

Yang Yun ^{[1
]}

Xu Jia ^{[1
]}

Tao Bi Lei ^{[1
]}

Lu Lu ^{[1
]}

Liu Feng Yu ^{[1
]}

机构：

[1] Nanjing Univ Sci & Technol, Dept Comp Sci, Nanjing 210000, Peoples R China

来源：

2005 INTERNATIONAL SYMPOSIUM ON COMPUTER SCIENCE AND TECHNOLOGY, PROCEEDINGS | 2005年

关键词：

distributed routing; multicast routing; QoS; constraints; ACS;

D O I：

暂无

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

In accordance with multiple constrained QoS multicast routing problem, a new algorithm DQMRA-ACS (Distributed QoS Multicast Routing Algorithm based on ACS) was proposed based on natural parallel of ACO. DQMRA-ACS exchanged and transmitted routing information to obtain local optimum route and avoid cycle during the ant meeting. According to the routing table of pheromone, DQMRA-ACS took advantage of the cooperation of different ant groups to find the multicast routing that satisfied the QoS constraint. The flexible routing switching and locking guaranteed a successful routing connection. The experimental results indicated the feasibility and efficiency of DQMRA-ACS.

引用

页码：250 / 261

页数：12

共 16 条

[1]

Colorni A., 1994, JORBEL BELGIAN J OPE, V34, P39

[2]

Colorni A, 1991, P 1 EUR C ART LIF, DOI DOI 10.1109/MHS.1995.494215

[3]

Dorigo M., 1997, IEEE Transactions on Evolutionary Computation, V1, P53, DOI 10.1109/4235.585892

[4]

DORTGO M, 1996, IEEE T SYST MAN CY B, V26, P29

[5]

FALOUTSOS M, 1998, P SIGCOMM 98

[6] Solving symmetric and asymmetric TSPs by Ant Colonies [J].

Gambardella, LM ;

Dorigo, M .

1996 IEEE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION (ICEC '96), PROCEEDINGS OF, 1996, :622-627

[7]

GAMBARDELLA LM, 1997, INSIA9711

[8]

Li La-Yuan, 2004, Journal of Software, V15, P286

[9]

LI LY, 2003, ROUTING PROTOCOL ACT, V40, P211

[10] Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem [J].

Maniezzo, V .

INFORMS JOURNAL ON COMPUTING, 1999, 11 (04) :358-369

← 1 2 →