Implementation and evaluation of AntNet, a distributed shortest-path algorithm

被引：0

作者：

Strobbe, M ^{[1
]}

Verstraete, V ^{[1
]}

Van Breusegem, E ^{[1
]}

Coppens, J ^{[1
]}

Pickavet, M ^{[1
]}

Demeester, P ^{[1
]}

机构：

[1] State Univ Ghent, Dept Informat Technol, IMEC, B-9000 Ghent, Belgium

来源：

Telecommunications 2005, Proceedings | 2005年

关键词：

D O I：

暂无

中图分类号：

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

学科分类号：

0809 ;

摘要：

In the last decade, the OSPF routing protocol has proven its robustness, but it also has some major drawbacks. It reacts quite slowly to network changes, and load balancing is limited to paths with equal cost (ECMP). In this paper we present our implementation and evaluation of an alternative: AntNet [1]. AntNet is a distributed shortest-path algorithm based on the principles of Ant Colony Optimization that takes care of load balancing in a very natural way.

引用

页码：320 / 325

页数：6

共 50 条

[31] SHORTEST-PATH MOTION
PAPADIMITRIOU, CH
LECTURE NOTES IN COMPUTER SCIENCE, 1986, 241 : 144 - 153
[32] A REOPTIMIZATION ALGORITHM FOR THE SHORTEST-PATH PROBLEM WITH TIME WINDOWS
DESROCHERS, M
SOUMIS, F
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1988, 35 (02) : 242 - 254
[33] A SINGLE SOURCE SHORTEST-PATH ALGORITHM FOR GRAPHS WITH SEPARATORS
MEHLHORN, K
SCHMIDT, BH
LECTURE NOTES IN COMPUTER SCIENCE, 1983, 158 : 302 - 309
[34] Shortest-path routing based on ant-algorithm
Min, LY
Yang, JY
DCABES 2004, Proceedings, Vols, 1 and 2, 2004, : 228 - 230
[35] Adaptive shortest-path on-line routing algorithm
Lab de Recherche en Informatique URA, CNRS, Orsay, France
Conf Rec IEEE Global Telecommun Conf, (1664-1669):
[36] Routing Military Aircraft With A Constrained Shortest-Path Algorithm
Royset, Johannes O.
Carlyle, W. Matthew
Wood, R. Kevin
MILITARY OPERATIONS RESEARCH, 2009, 14 (03) : 31 - 52
[37] An adaptive shortest-path on-line routing algorithm
Chich, T
GLOBECOM 98: IEEE GLOBECOM 1998 - CONFERENCE RECORD, VOLS 1-6: THE BRIDGE TO GLOBAL INTEGRATION, 1998, : 1664 - 1669
[38] A LOCAL ALGORITHM FOR THE SHORTEST-PATH PROBLEM WITH A SINGLE SOURCE
ANISIMOV, AV
CYBERNETICS, 1986, 22 (03): : 327 - 332
[39] A THEOREM ON THE EXPECTED COMPLEXITY OF DIJKSTRA SHORTEST-PATH ALGORITHM
NOSHITA, K
JOURNAL OF ALGORITHMS, 1985, 6 (03) : 400 - 408
[40] Distributed shortest-path protocols for time-dependent networks
Orda, A
Rom, R
DISTRIBUTED COMPUTING, 1996, 10 (01) : 49 - 62

← 1 2 3 4 5 →