Robust Optimization of Intradomain Routing Using Evolutionary Algorithms

  • Vitor Pereira
  • Pedro Sousa
  • Paulo Cortez
  • Miguel Rio
  • Miguel Rocha
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 217)

Abstract

Open Shortest Path First (OSPF) is a widely used routing protocol that depends on weights assigned to each link to make routing decisions. If traffic demands are known, the OSPF weight setting (OSPFWS) problem can be defined to seek a set of weights that optimize network performance, typically by minimizing a congestion measure. The OSPFWS problem is NP-hard and, thus, meta-heuristics such as Evolutionary Algorithms (EAs) have been used in previous work to obtain near optimal solutions. However, the dynamic nature of this problem leads to the necessity of addressing these problems in a more robust manner that can deal with changes in the conditions of the network. Here, we present EAs for two of those tasks, defining objective functions that take into account, on the one hand, changes in the traffic demand matrices and, on the other, single link failures. Those functions use weighting schemes to provide trade-offs between the behaviour of the network in distinct conditions, thus providing robust sets of OSPF weights.The algorithms are implemented in the open-source software NetOpt framework.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Cortez, P., Rio, M., Rocha, M., Sousa, P.: Multiscale internet traffic forecasting using neural networks and time series methods. Expert Systems 29(2), 143–155 (2012)Google Scholar
  2. 2.
    Dijkstra, E.: A note on two problems in connexion with graphs. Numerische Mathematik 1(1), 269–271 (1959)CrossRefMATHMathSciNetGoogle Scholar
  3. 3.
    Ericsson, M., Resende, M., Pardalos, P.: A Genetic Algorithm for the Weight Setting Problem in OSPF Routing. Journal of Combinatorial Optimization 6, 299–333 (2002)CrossRefMATHMathSciNetGoogle Scholar
  4. 4.
    Feldmann, A., Greenberg, A., Lund, C., Reingold, N., Rexford, J., True, F.: Deriving traffic demands for operational ip networks: methodology and experience. IEEE/ACM Transactions on Networking 9(3), 265–280 (2001)CrossRefGoogle Scholar
  5. 5.
    Fortz, B.: Internet traffic engineering by optimizing ospf weights. In: Proceedings of IEEE INFOCOM, pp. 519–528 (2000)Google Scholar
  6. 6.
    Fortz, B., Thorup, M.: Optimizing ospf/is-is weights in a changing world. IEEE Journal on Selected Areas in Communications 20(4), 756–767 (2002)CrossRefGoogle Scholar
  7. 7.
    Fortz, B., Thorup, M.: Robust optimization of OSPF/IS-IS weights. In: Proceedings of the International Network Optimization Conference, pp. 225–230 (2003)Google Scholar
  8. 8.
    Medina, A., Lakhina, A., Matta, I., Byers, J.: BRITE: universal topology generation from a user’s perspective. Technical report 2001-003 (January 2001), http://citeseer.ist.psu.edu/article/medina01brite.html
  9. 9.
    Moy, J.: OSPF Version 2. RFC 2328 (Standard), Updated by RFC 5709 (April 1998)Google Scholar
  10. 10.
    Rocha, M., Sousa, P., Cortez, P., Rio, M.: Quality of Service Constrained Routing Optimization Using Evolutionary Computation. Applied Soft Computing 11(1), 356–364 (2011)CrossRefGoogle Scholar
  11. 11.
    Sqalli, M., Sait, S., Asadullah, S.: Ospf weight setting optimization for single link failures. International Journal of Computer Networks & Communications 3(1), 168–183 (2011)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2013

Authors and Affiliations

  • Vitor Pereira
    • 1
  • Pedro Sousa
    • 2
  • Paulo Cortez
    • 2
  • Miguel Rio
    • 3
  • Miguel Rocha
    • 1
  1. 1.CCTC, School of EngineeringUniversity of MinhoBragaPortugal
  2. 2.Algoritmi Center, School of EngineeringUniversity of MinhoBragaPortugal
  3. 3.Dept. Electrical EngineeringUniversity College LondonLondonUK

Personalised recommendations