Skip to main content

Automated Network Resilience Optimization Using Computational Intelligence Methods

  • Conference paper
  • First Online:
Intelligent Distributed Computing IX

Part of the book series: Studies in Computational Intelligence ((SCI,volume 616))

  • 769 Accesses

Abstract

This paper presents an automated optimization framework able to provide network administrators with resilient routing configurations for link-state protocols, such as OSPF or IS-IS. In order to deal with the formulated NP-hard optimization problems, the devised framework is underpinned by the use of computational intelligence optimization engines, such as Multi-objective Evolutionary Algorithms (MOEAs). With the objective of demonstrating the framework capabilities, two illustrative Traffic Engineering methods are described, allowing to attain routing configurations robust to changes in the traffic demands and maintaining the network stable even in the presence of link failure events. The presented illustrative results clearly corroborate the usefulness of the proposed automated framework along with the devised optimization methods.

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 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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

Similar content being viewed by others

Notes

  1. 1.

    When a solution is dominated by another one, it means that it is worse than the second in at least one of the objectives and it is not better in none.

References

  1. Altin, A., Fortz, B., Thorup, M., Umit, H.: Intra-domain traffic engineering with shortest path routing protocols. Ann. Oper. Res. 204(1), 56–95 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  2. Fortz, B., Thorup, M.: Optimizing OSPF/IS-IS weights in a changing world. IEEE J. Sel. Areas Commun. 20(4), 756–767 (2002)

    Article  Google Scholar 

  3. Rocha, M., Sousa, P., Cortez, P., Rio, M.: Quality of service constrained routing optimization using evolutionary computation. Appl. Soft Comput. 11(1), 356–364 (2011)

    Article  Google Scholar 

  4. Sousa, P., Rocha, M., Rio, M., Cortez, P.: Efficient OSPF weight allocation for intra-domain QoS optimization. In: Parr, G., Malone, D., Foghl, M. (eds.) IPOM 2006—6th IEEE International Workshop on IP Operations and Management, Dublin, Ireland, LNCS 4268, October 2006, pp. 37–48. Springer (2006)

    Google Scholar 

  5. Pereira, V., Rocha, M., Cortez, P., Rio, M., Sousa, P.: A framework for robust traffic engineering using evolutionary computation. In: 7th International Conference on Autonomous Infrastructure, Management and Security (AIMS 2013), Barcelona, Spain, LNCS 7943, pp. 2–13. Springer (2013)

    Google Scholar 

  6. Lee, K., Lim, F., Ong, B.: Building Resilient IP Networks. Cisco Press (2012)

    Google Scholar 

  7. Moy, J.: OSPF Version 2. RFC 2328 (Standard), April (1998). Updated by RFC 5709

    Google Scholar 

  8. Cariden Technologies, Building Traffic Matrices: Introduction to MATE Flow Collection. White Paper—Version 2. October (2012)

    Google Scholar 

  9. Tune, P., Roughan, M.: Network design sensitivity analysis. In: The 2014 ACM International Conference on Measurement and Modeling of Computer Systems, SIGMETRICS 14, pp. 449–461. ACM (2014)

    Google Scholar 

  10. Dijkstra, E.: A note on two problems in connexion with graphs. Numerische Mathematik 1(1), 269–271 (1959)

    Article  MathSciNet  MATH  Google Scholar 

  11. Evangelista, P., Maia, P., Rocha, M.: Implementing metaheuristic optimization algorithms with jecoli. In: Proceedings of the 2009 9th International Conference on Intelligent Systems Design and Applications, ISDA’09, Washington, pp. 505–510 (2009)

    Google Scholar 

  12. Zitzler, E., Laumanns, M., Thiele, L.: Spea2: Improving the strength pareto evolutionary algorithm. Technical report (2001)

    Google Scholar 

  13. Deb, K., Agrawal, S., Pratap, A., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evolut. Comput. 6(2), 182–197 (2002)

    Article  Google Scholar 

  14. Fortz, B.: Internet traffic engineering by optimizing OSPF Weights. In: Proceedings of IEEE INFOCOM, pp. 519–528 (2000)

    Google Scholar 

  15. Coello, C.: A comprehensive survey of evolutionary-based multiobjective optimization techniques. Knowl. Inf. Syst. 1(3), 129–156 (1999)

    Google Scholar 

Download references

Acknowledgments

This work has been partially supported by FCT - Fundação para a Ciência e Tecnologia Portugal in the scope of the project: UID/CEC/00319/2013.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Vitor Pereira .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Pereira, V., Rocha, M., Sousa, P. (2016). Automated Network Resilience Optimization Using Computational Intelligence Methods. In: Novais, P., Camacho, D., Analide, C., El Fallah Seghrouchni, A., Badica, C. (eds) Intelligent Distributed Computing IX. Studies in Computational Intelligence, vol 616. Springer, Cham. https://doi.org/10.1007/978-3-319-25017-5_46

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-25017-5_46

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-25015-1

  • Online ISBN: 978-3-319-25017-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics