Restoration Performance vs. Overhead in a Swarm Intelligence Path Management System

  • Poul E. Heegaard
  • Otto J. Wittner
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4150)


CE-ants is a distributed, robust and adaptive swarm intelligence strategy for dealing with path management in communication networks. This paper focuses on various 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 ant generation rate that controls the number ants traversing the network. The link state events considered are failure and restoration events. A simulation scenario compares restoration performance of rate adaptation in the source node with rate adaptation in the intermediate nodes close to the link state events. Implicit detection of failure events through monitoring ant parameters are considered. Results indicate that an implicit adjustment in the source node is a promising approach with respect to restoration time and the number of ants required.


Source Node Mobile Agent Swarm Intelligence Convergence Time Lower Node 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Ball, M.O.: Handbooks in Operation Research and Management Science, Network Models, vol. 7. North Holland, Amsterdam (1995)Google Scholar
  2. 2.
    Pioro, M., Medhi, D.: Routing, Flow and Capacity Design in Communication and Computer Networks. Morgan Kaufmann Publishers, San Francisco (2004)MATHGoogle Scholar
  3. 3.
    Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by Simulated Annealing. Science 220, 671–680 (1983)CrossRefMathSciNetGoogle Scholar
  4. 4.
    Glover, F., Laguna, M.: Tabu Search. Kluwer Academic, Dordrecht (1997)MATHGoogle Scholar
  5. 5.
    Goldberg, D.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison Wesley, Reading (1998)Google Scholar
  6. 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. 7.
    Schoonderwoerd, R., Holland, O., Bruten, J., Rothkrantz, L.: Ant-based Load Balancing in Telecommunications Networks. Adaptive Behavior 5(2), 169–207 (1997)CrossRefGoogle Scholar
  8. 8.
    Bonabeau, E., Dorigo, M., Theraulaz, G.: Swarm Intelligence: From Natural to Artifical Systems. Oxford University Press, Oxford (1999)Google Scholar
  9. 9.
    Di Caro, G., Dorigo, M.: AntNet: Distributed Stigmergetic Control for Communications Networks. Journal of Artificial Intelligence Research 9, 317–365 (1998)MATHGoogle Scholar
  10. 10.
    Wittner, O., Helvik, B.E.: Distributed soft policy enforcement by swarm intelligence; application to load sharing and protection. Annals of Telecommunications 59(1-2), 10–24 (2004)Google Scholar
  11. 11.
    Wittner, O.: Emergent Behavior Based Implements for Distributed Network Management. Ph.D thesis, Norwegian University of Science and Technology, NTNU, Department of Telematics (2003)Google Scholar
  12. 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)CrossRefGoogle Scholar
  13. 13.
    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)CrossRefGoogle Scholar
  14. 14.
    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 (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Poul E. Heegaard
    • 1
  • Otto J. Wittner
    • 2
  1. 1.Telenor R&D and Department of TelematicsNorwegian University of Science and TechnologyNorway
  2. 2.Centre for Quantifiable Quality of Service in Communication SystemsNorwegian University of Science and TechnologyTrondheimNorway

Personalised recommendations