A QoS routing algorithm based on ant algorithm

被引：0

作者：

Zhang, SB ^{[1
]}

Liu, ZM ^{[1
]}

机构：

[1] Beijing Univ Posts & Telecommun, Beijing 100876, Peoples R China

来源：

2001 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-10, CONFERENCE RECORD | 2001年

关键词：

D O I：

暂无

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

In this paper, the requirements of routing due to multimedia applications are briefly discussed. In order to solve the QoS constrained routing effectively and efficiently, we construct a globally optimizing ant algorithm, which is based on the ability of ants to find the shortest path between their nest and the food source during their looking for food. Simulation results show that the proposed approach can realize QoS routing effectively and efficiently.

引用

页码：1581 / 1585

页数：5

共 12 条

[1]

[Anonymous], 1994, BELGIAN J OPERATIONS

[2]

[Anonymous], NEW IDEAS OPTIMIZATI

[3] AntNet: Distributed stigmergetic control for communications networks [J].

Di Caro, G ;

Dorigo, M .

JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 1998, 9 :317-365

[4]

DICARO G, P 10 IASTED INT C PA, P541

[5]

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

[6]

GAMBARDELLA LM, 1999, NEW IDEAS OPTIMIZATI, P33

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

Maniezzo, V .

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

[8] Ant-based load balancing in telecommunications networks [J].

Schoonderwoerd, R ;

Bruten, JL ;

Holland, OE ;

Rothkrantz, LJM .

ADAPTIVE BEHAVIOR, 1996, 5 (02) :169-207

[9]

SCHOONDERWOERD R, P 1 INT C AUT AG MAR, P209

[10] MAX-MIN Ant System and local search for the traveling salesman problem [J].

Stutzle, T ;

Hoos, H .

PROCEEDINGS OF 1997 IEEE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION (ICEC '97), 1997, :309-314

← 1 2 →