Engineering Evolutionary Algorithm to Solve Multi-objective OSPF Weight Setting Problem

  • Sadiq M. Sait
  • Mohammed H. Sqalli
  • Mohammed Aijaz Mohiuddin
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4304)


Setting weights for Open Shortest Path First (OSPF) routing protocol is an NP-hard problem. Optimizing these weights leads to less congestion in the network while utilizing link capacities efficiently. In this paper, Simulated Evolution (SimE), a non-deterministic iterative heuristic, is engineered to solve this problem. A cost function that depends on the utilization and the extra load caused by congested links in the network is used. A goodness measure which is a prerequisite of SimE is designed to solve this problem. The proposed SimE algorithm is compared with Simulated Annealing. Results show that SimE explores search space intelligently due to its goodness function feature and reaches near optimal solutions very quickly.


Cost Function Maximum Utilization Route Protocol Simulated Evolution Open Short Path First 
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.
    Thomas II, T.M.: OSPF Network Design Solutions. Cisco Press (1998)Google Scholar
  2. 2.
    Black, U.: IP Routing Protocols. Prentice Hall Series (2000)Google Scholar
  3. 3.
    Moy, J.T.: OSPF: Anatomy of an Internet Routing Protocol. Addison-Wesley, Reading (1999)Google Scholar
  4. 4.
    Fortz, B., Thorup, M.: Internet traffic engineering by optimizing OSPF weights. In: IEEE Conference on Computer Communications (INFOCOM), pp. 519–528 (2000)Google Scholar
  5. 5.
    Sait, S.M., Youssef, H.: Iterative Computer Algorithms and their Application to Engineering. IEEE Computer Society Press, Los Alamitos (1999)Google Scholar
  6. 6.
    Frigioni, D., Loffreda, M., Nanni, U., Pasqualone, G.: Experimental analysis of dynamic algorithms for the single source shortest paths problem. ACM Journal of Experimental Algorithms (1998)Google Scholar
  7. 7.
    Ericsson, M.R., Pardalos, P.: A genetic algorithm for the weight setting problem in OSPF routing. In: J. Combinatorial Optimisation Conference (2002)Google Scholar
  8. 8.
    Rodrigues, M., Ramakrishnan, K.G.: Optimal routing in data networks. In: Presentation at International Telecommunication Symposium (ITS) (1994)Google Scholar
  9. 9.
    Feldmann, A., Greenberg, A., Lund, C., Reigold, N., Rexford, J., True, F.: Deriving traffic demands for operational ip networks: Methodology and experience. IEEE/ACM Transactions on Networking 9(3) (2001)Google Scholar
  10. 10.
    Srivastava, S., Agrawal, G., Pioro, M., Medhi, D.: Determining link weight system under various objectives for OSPF networks using a lagrangian relaxation-based approach. IEEE Transactions on Network and Service Management 2(1), 9–18 Third quarter (2005)CrossRefGoogle Scholar
  11. 11.
    Sridharan, A., Guerin, R., Diot, C.: Achieving near-optimal traffic engineering solutions for current OSPF/IS-IS networks. IEEE INFOCOM (2003)Google Scholar
  12. 12.
    Sqalli, M.H., Sait, S.M., Mohiuddin, M.A.: An enhanced estimator to multi-objective OSPF weight setting problem. In: Proceedings of 10th IEEE/IFIP Network Operations & Management Symposium (NOMS 2006) (April 2006)Google Scholar
  13. 13.
    Fortz, B., Thorup, M.: Increasing internet capacity using local search. Technical Report IS-MG (2000)Google Scholar
  14. 14.
    Kling, R.M., Banerjee, P.: ESP: Placement by Simulated Evolution. IEEE Transactions on CAD Vol. 8(3), 245–256 (1989)Google Scholar
  15. 15.
    Sait, S.M., Youssef, H., Hussain, A.: Fuzzy simulated evolution algorithm for multiobjective optimization of VLSI placement. In: IEEE Congress on Evolutionary Computation, Washington, D.C., U.S.A., pp. 91–97 (July 1999)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Sadiq M. Sait
    • 1
  • Mohammed H. Sqalli
    • 1
  • Mohammed Aijaz Mohiuddin
    • 1
  1. 1.Computer Engineering DepartmentKing Fahd University of Petroleum & MineralsDhahranSaudi Arabia

Personalised recommendations