|
|
Digital Library of the
European Council for Modelling and Simulation |
|
Title: |
Ant Routing VS. Q-Routing In Telecommunication Networks |
|
Authors: |
Andrzej Pacut, Malgorzata Gadomska, Andrzej Igielski |
|
Published in:
|
(2006).ECMS 2006 Proceedings
edited by: W. Borutzky, A. Orsoni, R. Zobel. European Council for Modeling
and Simulation. doi:10.7148/2006 ISBN:
0-9553018-0-7 20th
European Conference on Modelling and Simulation, Bonn,
May 28-31, 2006 |
|
Citation
format: |
Pacut, A., Gadomska, M., &
Igielski, A. (2006). Ant Routing VS. Q-Routing In Telecommunication Networks.
ECMS 2006 Proceedings edited by: W. Borutzky, A. Orsoni, R. Zobel (pp.
67-72). European Council for Modeling and Simulation. doi:10.7148/2006-0067 |
|
DOI: |
http://dx.doi.org/10.7148/2006-0067 |
|
Abstract: |
In our
simulations we analyzed two classes of adaptive routing algorithms: Q-routing
algorithms based on reinforcement learning techniques, and ant-routing based
on swarm intelligence. We use a simulation environment to compare the
performance of adaptive routing algorithms. Performance of adaptive
algorithms was tested under a constant load, and also under various
non-stationary loads, to find out how load time dynamics might interfere with
learning dynamics. We tested step load changes and periodic load changes. We
also tested an influence of non-homogeneous loads on the behavior of routing
algorithms, motivated by DoS and DDoS
network attacks. We investigate robustness to parameter changes, and
adaptiveness to dynamically changing load levels and traffic patterns. We
demonstrated that both classes of adaptive routing algorithms adapt well to
occasional changes of the load and perform very well under periodic load
level changes. |
|
Full
text: |
|
