Analysis of AntNet routing scheme by using queueing model

被引:3
作者
Park, Kyungmin [1 ]
Kim, Youngyong
机构
[1] Yonsei Univ, Dept Elect, Wireless & Internet Lab, Seoul 120749, South Korea
关键词
AntNet routing; queueing model; optimal routing;
D O I
10.1016/j.comcom.2008.04.003
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We analyzed the AntNet routing scheme's performance by using the network queueing model, and derived the optimal routing strategies to minimize the average time and variance of the end-to-end packet delay. In contrast to existing research, this paper provides the theoretical analytic methods for the AntNet scheme. Moreover we added the link failure case for AntNet to the queueing model. At first, by adapting the AntNet queueing model to a simple two paths network, we showed the performance of AntNet routing scheme to minimize the average time and variance of the end-to-end packet delay. Then we extended it to the large network, and compared the AntNet routing scheme to the shortest path routing scheme and the optimal routing strategies. The AntNet scheme's load-balancing effect gives it a smaller delay than the shortest path routing scheme in high intensity network environments. which have heavy traffic. However, the AntNet scheme does not match the performance of the routing strategy that minimize the end-to-end delay. Moreover although the AntNet scheme provides the minimum delay variance at a simple two paths network, it does not guarantee that in the large sized network. (C) 2008 Elsevier B.V. All rights reserved.
引用
收藏
页码:2951 / 2958
页数:8
相关论文
共 10 条
[1]  
BARAN B, 2000, NEW APPROACH ANTNET
[2]   Inspiration for optimization from social insect behaviour [J].
Bonabeau, E ;
Dorigo, M ;
Theraulaz, G .
NATURE, 2000, 406 (6791) :39-42
[3]   Performance analysis of the AntNet algorithm [J].
Dhillon, S. S. ;
Van Mieghem, P. .
COMPUTER NETWORKS, 2007, 51 (08) :2104-2125
[4]   AntNet: Distributed stigmergetic control for communications networks [J].
Di Caro, G ;
Dorigo, M .
JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 1998, 9 :317-365
[5]   Ant algorithms for discrete optimization [J].
Dorigo, M ;
Di Caro, G ;
Gambardella, LM .
ARTIFICIAL LIFE, 1999, 5 (02) :137-172
[6]   Ant algorithms and stigmergy [J].
Dorigo, M ;
Bonabeau, E ;
Theraulaz, G .
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2000, 16 (08) :851-871
[7]  
GARCIA AL, 1994, PROBABILITY RANDOM P
[8]  
Luenberger DG., 1997, Optimization by Vector Space Methods
[9]  
PARK K, 2007, AS PAC C COMM
[10]   Ant colony optimization for routing and load-balancing: Survey and new directions [J].
Sim, KM ;
Sun, WH .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART A-SYSTEMS AND HUMANS, 2003, 33 (05) :560-572