Full Text:
<2548>
CLC number: TN915.11
On-line Access:
Received: 2003-07-30
Revision Accepted: 2003-09-11
Crosschecked: 0000-00-00
Cited: 3
Clicked: 5677
Adaptive swarm-based routing in communication networks
| |||||||||||||
LÜ Yong, ZHAO Guang-zhou, SU Fan-jun, LI Xiao-run. Adaptive swarm-based routing in communication networks[J]. Journal of Zhejiang University Science A, 2004, 5(7): 867-872.
@article{title="Adaptive swarm-based routing in communication networks",
author="LÜ Yong, ZHAO Guang-zhou, SU Fan-jun, LI Xiao-run",
journal="Journal of Zhejiang University Science A",
volume="5",
number="7",
pages="867-872",
year="2004",
publisher="Zhejiang University Press & Springer",
doi="10.1631/jzus.2004.0867"
}
%0 Journal Article
%T Adaptive swarm-based routing in communication networks
%A LÜ
%A Yong
%A ZHAO Guang-zhou
%A SU Fan-jun
%A LI Xiao-run
%J Journal of Zhejiang University SCIENCE A
%V 5
%N 7
%P 867-872
%@ 1869-1951
%D 2004
%I Zhejiang University Press & Springer
%DOI 10.1631/jzus.2004.0867
TY - JOUR
T1 - Adaptive swarm-based routing in communication networks
A1 - LÜ
A1 - Yong
A1 - ZHAO Guang-zhou
A1 - SU Fan-jun
A1 - LI Xiao-run
J0 - Journal of Zhejiang University Science A
VL - 5
IS - 7
SP - 867
EP - 872
%@ 1869-1951
Y1 - 2004
PB - Zhejiang University Press & Springer
ER -
DOI - 10.1631/jzus.2004.0867
Abstract: Swarm intelligence inspired by the social behavior of ants boasts a number of attractive features, including adaptation, robustness and distributed, decentralized nature, which are well suited for routing in modern communication networks. This paper describes an adaptive swarm-based routing algorithm that increases convergence speed, reduces routing instabilities and oscillations by using a novel variation of reinforcement learning and a technique called momentum. Experiment on the dynamic network showed that adaptive swarm-based routing learns the optimum routing in terms of convergence speed and average packet latency.
[1] Barán, B., Sosa, R., 2001. AntNet routing algorithm for data networks based on mobile agents.Inteligencia Artificial, Revista Iberoamericana de Inteligencia Artificial,12:75-84.
[2] Beckers, R., Deneubourg, J.L., 1992. Trails and U-turns in the selection of the shortest path by the ant Lasius Niger.Journal of Theoretical Biology,159:397-415.
[3] Di Caro, G., Dorigo, M., 1997. AntNet: A Mobile Agents Approach to Adaptive Routing. Tech. Rep. IRIDIA/97-12, IRIDIA, Universite Libre de Bruxelles, Belgium.
[4] Di Caro, G., Dorigo, M., 1998. AntNet: distributed stigmergetic control for communication networks.Journal of Artificial Intelligence Research,9:317-365.
[5] Goss, S., Aron, S., Deneubourg, J.L., Pasteels, J.M., 1989. Self-organized shortcuts in the Argentine ant.Naturwissenschaften,76:579-581.
[6] Heusse, M., Snyers, D., Guérin, S., Kuntz, P., 1998. Adaptive Agent-driven Routing and Load Balancing in Communication Network. Proc. ANTS'98, First International Workshop on Ant Colony Optimization, Brussels, Belgium, p.15-16.
[7] Schoonderwoerd, R., Holland, O., Bruten, J., Rothkrantz, L., 1996. Ant-based load balancing in telecommunication networks.Adaptive Behavior,5(2):169-207.
Open peer comments: Debate/Discuss/Question/Opinion
<1>