Skip to main content

Self-Management of Virtual Paths in Dynamic Networks

  • Conference paper
Self-star Properties in Complex Information Systems (SELF-STAR 2004)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3460))

Included in the following conference series:

Abstract

Virtual path management in dynamic networks poses a number of challenges related to combinatorial optimisation, fault and traffic handling. Ideally such management should react immediately on changes in the operational conditions, and be autonomous, inherently robust and distributed to ensure operational simplicity and network resilience. Swarm intelligence based self management is a candidate potentially able to fulfil these requirements. Swarm intelligence achieved by cross entropy (CE) ants is introduced, and two CE ants based path management approaches are presented. A case study of a nation wide communication infrastructure is performed to demonstrate their abilities to handle change in network traffic as well as failures and restoration of links.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Google Scholar 

  2. Pióro, M., Medhi, D.: Routing, Flow and Capacity Design in Communication and Computer Networks. Morgan Kaufmann Publishers, San Francisco (2004); ISBN 0125571895

    MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  4. Glover, F.: Tabu Search. Kluwer, Dordrecht (1996)

    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. In: Methodology and Computing in Applied Probability, pp. 127–190 (1999)

    Google Scholar 

  7. ITU-T G.841 (10/98), Types and characteristics of SDH network protection architectures (1998)

    Google Scholar 

  8. ITU-T I.630 (02/99), ATM protection switching (1999)

    Google Scholar 

  9. Huitema, C.: Routing in the Internet, 2nd edn. Prentice Hall PTR, Englewood Cliffs (1999)

    Google Scholar 

  10. 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 

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

    Google Scholar 

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

    MATH  Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  15. Rosen, E., Viswanathan, A., Callon, R.: RFC3031: Multiprotocol Label Switching Architecture. IEFT (January 2001)

    Google Scholar 

  16. Helvik, B.E., Wittner, O.: 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 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Heegaard, P.E., Wittner, O., Helvik, B.E. (2005). Self-Management of Virtual Paths in Dynamic Networks. In: Babaoglu, O., et al. Self-star Properties in Complex Information Systems. SELF-STAR 2004. Lecture Notes in Computer Science, vol 3460. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11428589_27

Download citation

  • DOI: https://doi.org/10.1007/11428589_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-26009-7

  • Online ISBN: 978-3-540-32013-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics