Skip to main content

Self-tuned Refresh Rate in a Swarm Intelligence Path Management System

  • Conference paper
Self-Organizing Systems (EuroNGI 2006, IWSOS 2006)

Abstract

CE-ants (Cross Entropy ants) is a distributed, robust and adaptive swarm intelligence system for dealing with path management in communication networks. This paper focuses on strategies for adjusting the overhead generated by the CE-ants as the state of the network changes. The overhead is in terms of number of management packets (ants) generated, and the adjustments are done by controlling the generation rate of ants traversing the network. The self-tuned strategies proposed in this paper detect state changes implicitly by monitoring parameters and ant rates in the management system. Rate adaptation is done both in the network nodes and in the peering points of the virtual paths. The results are promising, and compared to fixed rate strategies the self-tuned strategies show a significant saving (70-85%) in number of packets, and has similar (even slightly better) data packet delay and service availability. The rate adaptation in network nodes provides fast restoration with short path detection times and hence also high service availability. The implicit self-tuned ant rate in the path endpoints improves the convergence time on link state events without flooding the network with management packets in steady state when these are not required.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Ball, M.O.: Handbooks in Operation Research and Management Science, Network Models, vol. 7. North Holland, Amsterdam (1995)

    Google Scholar 

  2. Pioro, M., Medhi, D.: Routing, Flow and Capacity Design in Communication and Computer Networks. Morgan Kaufmann Publishers, San Francisco (2004)

    MATH  Google Scholar 

  3. Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by Simulated Annealing. Science 220, 671–680 (1983)

    Google Scholar 

  4. Glover, F., Laguna, M.: Tabu Search. Kluwer Academic, Dordrecht (1997)

    MATH  Google Scholar 

  5. Goldberg, D.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison Wesley, Reading (1998)

    Google Scholar 

  6. Rubinstein, R.Y.: The Cross-Entropy Method for Combinatorial and Continuous Optimization. Methodology and Computing in Applied Probability, 127–190 (1999)

    Google Scholar 

  7. Schoonderwoerd, R., Holland, O., Bruten, J., Rothkrantz, L.: Ant-based Load Balancing in Telecommunications Networks. Adaptive Behavior 5(2), 169–207 (1997)

    Article  Google Scholar 

  8. Bonabeau, E., Dorigo, M., Theraulaz, G.: Swarm Intelligence: From Natural to Artifical Systems. Oxford University Press, Oxford (1999)

    Google Scholar 

  9. Di Caro, G., Dorigo, M.: AntNet: Distributed Stigmergetic Control for Communications Networks. Journal of Artificial Intelligence Research 9, 317–365 (1998)

    MATH  Google Scholar 

  10. Wittner, O., Helvik, B.E.: Distributed soft policy enforcement by swarm intelligence; application to load sharing and protection. Annals of Telecommunications 59, 10–24 (2004)

    Google Scholar 

  11. Wittner, O.: Emergent Behavior Based Implements for Distributed Network Management. Ph.D thesis, Norwegian University of Science and Technology, NTNU, Department of Telematics (November 2003)

    Google Scholar 

  12. Heegaard, P.E., Wittner, O.J., Helvik, B.E.: Self-management of virtual paths in dynamic networks. In: BabaoÄŸlu, Ö., Jelasity, M., Montresor, A., Fetzer, C., Leonardi, S., van Moorsel, A., van Steen, M. (eds.) SELF-STAR 2004. LNCS, vol. 3460, pp. 417–432. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  13. Heegaard, P.E., Wittner, O.J.: Restoration performance vs. Overhead in a swarm intelligence path management system. In: Dorigo, M., Gambardella, L.M., Birattari, M., Martinoli, A., Poli, R., Stützle, T. (eds.) ANTS 2006. LNCS, vol. 4150, pp. 282–293. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  14. Helvik, B.E., Wittner, O.J.: Using the Cross-Entropy Method to Guide/Govern Mobile Agentïs Path Finding in Networks. In: Pierre, S., Glitho, R.H. (eds.) MATA 2001. LNCS, vol. 2164, p. 255. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  15. Heegaard, P.E., Wittner, O., Nicola, V.F., Helvik, B.E.: Distributed asynchronous algorithm for cross-entropy-based combinatorial optimization. In: Rare Event Simulation and Combinatorial Optimization (RESIM/COP 2004), Budapest, Hungary, September 7-8 (2004)

    Google Scholar 

  16. Ganguly, N., Brusch, L., Deutsch, A.: Design and analysis of a bio-inspired search algorithm for peer to peer networks. In: BabaoÄŸlu, Ö., Jelasity, M., Montresor, A., Fetzer, C., Leonardi, S., van Moorsel, A., van Steen, M. (eds.) SELF-STAR 2004. LNCS, vol. 3460, pp. 358–372. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  17. Shannon, C.E.: A mathematical theory of communication. Bell System Technical Journal 27, 379–423 (1948)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Heegaard, P.E., Wittner, O.J. (2006). Self-tuned Refresh Rate in a Swarm Intelligence Path Management System. In: de Meer, H., Sterbenz, J.P.G. (eds) Self-Organizing Systems. EuroNGI IWSOS 2006 2006. Lecture Notes in Computer Science, vol 4124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11822035_13

Download citation

  • DOI: https://doi.org/10.1007/11822035_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-37658-3

  • Online ISBN: 978-3-540-37669-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics