Abstract
This paper introduces the Reactive ASR-FA algorithm which is a novel ant routing algorithm that utilizes statistical models of packet delay to detect changes in the network conditions. The algorithm is able to quickly react to various load level changes by temporarily modifying the learning parameter’s settings. We show in a set of experiments that using the Reactive ASR-FA significantly speeds up the adaptation process of ant routing algorithms and assures lower values of the mean packet delay. It can be also employed in DoS and DDoS attacks detection.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Almhana, J., Liu, Z., Choulakian, V., Mcgorman, R.: A recursive algorithm for gamma mixture models. In: IEEE International Conference on Communications 2006, ICC ’06, vol. 1, pp. 197–202 (2006)
Baran, B., Sosa, R.: Antnet: routing algorithm for data networks based on mobile agents. Intel. Artif. 5(12), 75–84 (2001)
Blum, C., Merkle, D.: Swarm Intelligence: Introduction and Applications. Springer, Heidelberg (2008)
Boyan, J.A., Littman, M.L.: Packet routing in dynamically changing networks: a reinforcement learning approach. In: Cowan, J.D., Tesauro, G., Alspector, J. (eds.) Advances in Neural Information Processing Systems, vol. 6, pp. 671–678. Morgan Kaufmann, San Mateo (1994)
Choi, S., Yeung, D.: Predictive q-routing: a memory-based reinforcement learning approach to adaptive traffic control. In: Touretzky, D., Mozer, M.C., Hasselmo, M.E. (eds.) Advances in Neural Information Processing Systems 8 (NIPS8), pp. 945–951. MIT Press, Cambridge (1996)
Daigle, J.N.: Queuing Theory with Applications to Packet Telecommunication. Springer, New York (2004)
Di Caro, G.A., Dorigo, M.: Ant colonies for adaptive routing in packet-switched communications networks. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol. 1498, p. 673. Springer, Heidelberg (1998)
Di Caro, G., Dorigo, M.: Antnet: distributed stigmergetic control for communications networks. J. Artif. Intell. Res. 9, 317–365 (1998)
Di Caro, G., Dorigo, M.: Two ant colony algorithms for best-effort routing in datagram networks. In: Proceedings of the Tenth IASTED International Conference, PDCS98, pp. 541–546. IASTED/ACTA Press (1998)
Dijkstra, M., Roelofsen, H., Vonk, R.J., Jansen, R.C.: Peak quantification in surface-enhanced laser desorption/ionization by using mixture models. Proteomics 6, 5106–5116 (2006)
Dorigo, M., Maniezzo, V., Colorni, A.: Positive feedback as a search strategy. Technical report, Tech. Rep. 91–016, Politecnico di Milano, Dipartimento di Elettronica (1991)
Doyle, J.: Routing TCP/IP, vol. I and II. CCIE Professional Development (1998)
Ducatelle, F., Di Caro, G., Gambardella, L.: Principles and applications of swarm intelligence for adaptive routing in telecommunications networks. Swarm Intell. 4, 173–198 (2010)
Gadomska, M.: Wykorzystanie algorytmow mrowkowych do problemu adaptacyjnego rutingu w sieciach (in polish). M. Sc thesis, Warsaw University of Technology (2005)
Gadomska, M., Pacut, A.: Performance of ant routing algorithms when using TCP. In: Giacobini, M. (ed.) EvoWorkshops 2007. LNCS, vol. 4448, pp. 1–10. Springer, Heidelberg (2007)
Gadomska, M., Pacut, A., Igielski, A.: Ant-routing vs. q-routing in telecommunication networks. In: Proceedings of the 20-th ECMS Conference, pp. 67–72 (2006)
Kudelska, M.: Ant algorithms for adaptive routing in telecommunication networks. Ph.D. thesis, Warsaw University of Technology (2011)
Menth, M., Henjes, R., Zepfel, C., Tran-Gia, P.: Gamma-approximation for the waiting time distribution function of the m/g/1-/spl infin/ queue. In: Proceedings of the 2nd Conference on Next Generation Internet Design and Engineering, NGI ’06, pp. 123–130 (2006)
Yong, L., Guang-zhou, Z., Fan-jun, S.: Adaptive swarm-based routing in communication networks. J. Zhejiang Univ. Sci. A 5, 867–872 (2004)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Gadomska-Kudelska, M., Pacut, A., Kudelski, M. (2014). The Reactive ASR-FA – An Ant Routing Algorithm That Detects Changes in the Network by Employing Statistical Delay Models. In: Di Caro, G., Theraulaz, G. (eds) Bio-Inspired Models of Network, Information, and Computing Systems. BIONETICS 2012. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 134. Springer, Cham. https://doi.org/10.1007/978-3-319-06944-9_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-06944-9_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-06943-2
Online ISBN: 978-3-319-06944-9
eBook Packages: Computer ScienceComputer Science (R0)