Skip to main content
SpringerLink
Log in

Optimization of OSPF Routing in IP Networks

  • Chapter
  • First Online:
Graphs and Algorithms in Communication Networks

Part of the book series: Texts in Theoretical Computer Science. An EATCS Series ((TTCS))

Abstract

The Internet is a huge world-wide packet switching network comprised of more than 13,000 distinct subnetworks, referred to as Autonomous Systems (ASs) . They all rely on the Internet Protocol (IP) for transport of packets across the network. And most of them use shortest path routing protocols , such as OSPF or IS-IS, to control the routing of IP packets within an AS. The idea of the routing is extremely simple — every packet is forwarded on IP links along the shortest route between its source and destination nodes of the AS. The AS network administrator can manage the routing of packets in the AS by supplying the so-called administrative weights of IP links, which specify the link lengths that are used by the routing protocols for their shortest path computations. The main advantage of the shortest path routing policy is its simplicity, allowing for little administrative overhead. From the network engineering perspective, however, shortest path routing can pose problems in achieving satisfactory traffic handling efficiency. As all routing paths depend on the same routing metric , it is not possible to configure the routing paths for the communication demands between different pairs of nodes explicitly or individually; the routing can be controlled only indirectly and only as a whole by modifying the routing metric. Thus, one of the main tasks when planning such networks is to find administrative link weights that induce a globally efficient traffic routing configuration of an AS. It turns out that this task leads to very difficult mathematical optimization problems. In this chapter, we discuss and describe exact integer programming models and solution approaches as well as practically efficient smart heuristics for such shortest path routing problems .

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Algorithmic Solutions Software GmbH, Schuetzenstrasse 3–5, D-66123 Saarbruecken, Germany: LEDA—Library of Efficient Data types and Algorithms (2000–2007). URL http://www.algorithmic-solutions.com/leda

  2. atesio GmbH, Sophie-Taeuber-Arp-Weg 27, D-12205 Berlin, Germany: DISCNET – Network optimization software library (2000–2007). URL http://www.atesio.de

  3. Awduche, D.: MPLS and traffic engineering in IP networks. IEEE Communications Magazine 37, 42–47 (1999)

    Article  Google Scholar 

  4. Bean, J.: Genetic algorithms and random keys for sequencing and optimization. ORSA J. on Computing 6, 154–160 (1994)

    MATH  Google Scholar 

  5. Ben-Ameur, W.: Multi-hour design of survivable classical IP networks. International Journal of Communication Systems 15, 553–572 (2002)

    Article  MATH  Google Scholar 

  6. Ben-Ameur, W., Gourdin, E.: Internet routing and related topology issues. SIAM Journal on Discrete Mathematics 17(1), 18–49 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  7. Ben-Ameur, W., Gourdin, E., Liau, B., Michel, N.: Dimensioning of Internet networks. In: Proceedings of the 2nd International Workshop on the Design of Reliable Communication Networks (DRCN 2000), Munich, Germany (2000)

    Google Scholar 

  8. Ben-Ameur, W., Gourdin, E., Liau, B., Michel, N.: Optimizing administrative weights for efficient single-path routing. In: Proceedings of Networks 2000 (2000)

    Google Scholar 

  9. Bley, A.: A Lagrangian approach for integrated network design and routing in IP networks. In: Proceedings of the 1st International Network Optimization Conference (INOC 2003), Paris, France, pp. 107–113 (2003)

    Google Scholar 

  10. Bley, A.: Finding small administrative lengths for shortest path routing. In: Proceedings of the 2nd International Network Optimization Conference (INOC 2005), Lisbon, Portugal, vol. 1, pp. 121–128 (2005)

    Google Scholar 

  11. Bley, A.: On the approximability of the minimum congestion unsplittable shortest path routing problem. In: Proceedings of the 11th Conference on Integer Programming and Combinatorial Optimization (IPCO 2005), Berlin, Germany, pp. 97–110 (2005)

    Google Scholar 

  12. Bley, A.: Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths. Networks 50(1), 29–36 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  13. Bley, A.: Routing and capacity optimization for IP networks. Ph.D. thesis, Technische Univertität Berlin (2007)

    Google Scholar 

  14. Bley, A.: An integer programming algorithm for routing optimization in IP networks. In: Proceedings of the 16th Annual European Symposium on Algorithms (ESA 2008), Karlsruhe, Germany, pp. 198–209 (2008)

    Google Scholar 

  15. Bley, A.: Approximability of unsplittable shortest path routing problems. Networks 54(1), 23–46 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  16. Bley, A., Grötschel, M., Wessäly, R.: Design of broadband virtual private networks: Model and heuristics for the B-WiN. In: N. Dean, D. Hsu, R. Ravi (eds.) Robust Communication Networks: Interconnection and Survivability, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 53, pp. 1–16. American Mathematical Society (1998)

    Google Scholar 

  17. Bley, A., Koch, T.: Optimierung des G-WiN. DFN-Mitteilungen 54, 13–15 (2000)

    Google Scholar 

  18. Bley, A., Koch, T.: Integer programming approaches to access and backbone IP-network planning. In: Modeling, Simulation and Optimization of Complex Processes: Proceedings of the 3rd International Conference on High Performance Scientific Computing, pp. 87–110. Hanoi, Vietnam (2006)

    Google Scholar 

  19. Bley, A., Pattloch, M.: Modellierung und Optimierung der X-WiN Plattform. DFN-Mitteilungen 67, 4–7 (2005)

    Google Scholar 

  20. Bourquia, N., Ben-Ameur, W., Gourdin, E., Tolla, P.: Optimal shortest path routing for Internet networks. In: Proceedings of the 1st International Network Optimization Conference (INOC 2003), Paris, France, pp. 119–125 (2003)

    Google Scholar 

  21. Broström, P.: Optimization models and methods for telecommunication networks using OSPF. PhD dissertation, Linköping University, Sweden (2006). Linköping Studies in Science and Technology. Dissertation no. 1032

    Google Scholar 

  22. Broström, P., Holmberg, K.: Determining the non-existence of compatibel OSPF weights. In: D. Yuan (ed.) Nordic MPS 2004, no. 14 in Linköping Electronic Conference Proceedings, pp. 7–21. Linköping University Electronic Press (2004)

    Google Scholar 

  23. Broström, P., Holmberg, K.: Design of IP/OSPF networks using a Lagrangean heuristic on an in-graph based model. In: L. Gouveia, C. Mourao (eds.) INOC 2005, pp. 702–709. University of Lisbon, Lisbon, Portugal (2005)

    Google Scholar 

  24. Broström, P., Holmberg, K.: Determining the non-existance of a compatible OSPF metric. In: L. Gouveia, C. Mourao (eds.) INOC 2005, pp. 702–709. University of Lisbon, Lisbon, Portugal (2005)

    Google Scholar 

  25. Broström, P., Holmberg, K.: Multiobjective design of survivable IP networks. Annals of Operations Research 147 (2006)

    Google Scholar 

  26. Broström, P., Holmberg, K.: Design of OSPF networks using subpath consistent routing patterns. Research Report LiTH-MAT-R-2007-05, Department of Mathematics, Linköping Institute of Technology, Sweden (2007). Under revision for publication.

    Google Scholar 

  27. Broström, P., Holmberg, K.: On the extremal structure of an OSPF related cone. Vietnam Journal on Mathematics 35(4), 507–522 (2007)

    MATH  Google Scholar 

  28. Broström, P., Holmberg, K.: Valid cycles: A source of infeasibility in OSPF routing. Networks 52(4), 206–215 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  29. Broström, P., Holmberg, K.: Compatible weights and valid cycles in non-spanning OSPF routing patterns. Algorithmic Operations Research 4, 19–35 (2009)

    MathSciNet  Google Scholar 

  30. Buriol, L. S., Resende, M. G. C., Ribeiro, C. C., Thorup, M.: A hybrid genetic algorithm for the weight setting problem in OSPF/IS-IS routing. Networks 46(1), 36–56 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  31. Buriol, L. S., Resende, M. G. C., Thorup, M.: Speeding Up Dynamic Shortest-Path Algorithms. INFORMS Journal On Computing 20(2), 191–204 (2008)

    Article  MathSciNet  Google Scholar 

  32. Burton, D.: On the inverse shortest path problem. Ph.D. thesis, Department of Mathematics, Facultés Universitaires ND de la Paix, Namur, Belgium (1993)

    Google Scholar 

  33. Burton, D., Toint, P.: On an instance of the inverse shortest paths problem. Mathematical Programming 53, 45–61 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  34. Dzida, M., Petterson, M., Duelli, M., Zagożdżon, M., Pióro, M., Menth, M., Żotkiewicz, M.: Three methods for optimizing single-shortest path routing. In: NGI 2008 Conference on Next Generation Internet Networks, Cracow, Poland (2008)

    Google Scholar 

  35. Dzida, M., Zagożdżon, M., Pióro, M.: Optimization of resilient weight systems for shortest-path routing in IP networks. In: 6th International Workshop on Design and Reliable Communication Networks. La Rochelle, France (2007)

    Google Scholar 

  36. Eremin, A., Ajili, F., Rodosek, R.: A set-based approach to the optimal IGP weight setting problem. In: Proceedings of the 2nd International Network Optimization Conference (INOC 2005), Lisbon, Portugal, vol. 1, pp. 386–392 (2005)

    Google Scholar 

  37. Ericsson, M., Resende, M. G. C., P. M., P.: A genetic algorithm for the weight setting problem in OSPF routing. J. of Combinatorial Optimization 6, 299–333 (2002)

    Google Scholar 

  38. Farago, A., Szentesi, A., Szviatovszki, B.: Allocation of administrative weights in PNNI. In: Proceedings of Networks ’98, Sorrento, Italy, pp. 621–625 (1998)

    Google Scholar 

  39. Farago, A., Szentesi, A., Szviatovszki, B.: Inverse optimization in high-speed networks. Discrete Applied Mathematics 129, 83–98 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  40. Fekete, S., Hochstättler, W., Kromberg, S., Moll, C.: The complexity of an inverse shortest path problem. In: R. Graham, J. Kratochvíl, J. Nesetril, F. Roberts (eds.) Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, vol. 49, pp. 113–127. AMS (1999)

    Google Scholar 

  41. Feldmann, A., Greenberg, A., Lund, C., Reingold, N., Rexford, J.: NetScope: Traffic engineering for IP networks. IEEE Transactions on Networking 14, 11–19 (2000)

    Google Scholar 

  42. Fortz, B., Thorup, M.: Internet traffic engineering by optimizing OSPF weights. In: Proceedings of IEEE INFOCOM’00, pp. 519–528 (2000)

    Google Scholar 

  43. 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)

    Article  Google Scholar 

  44. Fortz, B., Thorup, M.: Robust optimization of OSPF/IS-IS weights. In: W. Ben-Ameur, A. Petrowski (eds.) Proc. INOC 2003, pp. 225–230 (2003)

    Google Scholar 

  45. Fortz, B., Thorup, M.: Increasing Internet capacity using local search. Computational Optimization and Applications 29(1), 13–48 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  46. Gajowniczek, P., Pióro, M., Szentesi, A., Harmatos, J., Jüttner, A.: Solving an OSPF routing problem with simulated allocation. In: Proceedings of 1st Polish-German Teletraffic Symposium, pp. 177–184. Dresden, Germany (2000)

    Google Scholar 

  47. Gerla, M., Kleinrock, L.: Communication nets: stochastic message flow and delay 25(1), 48–60 (1977)

    MathSciNet  Google Scholar 

  48. de Giovanni, L., Fortz, B., Labbé, M.: A lower bound for the Internet protocol network design problem. In: Proceedings of the 2nd International Network Optimization Conference (INOC 2005), Lisbon, Portugal, vol. 1, pp. 402–408 (2005)

    Google Scholar 

  49. Gourdin, E.: Optimizing internet networks. ORMS Today 28(2), 46–49 (2001)

    Google Scholar 

  50. Gourdin, E., Klopfenstein, O.: Comparison of different QoS-oriented objectives for multicommodity flow routing optimization. In: Proceedings of the International Conference on Telecommunications (ICT 2006) (2006)

    Google Scholar 

  51. Holmberg, K., Yuan, D.: A Lagrangian heuristic based branch-and-bound approach for the capacitated network design problem. Operations Research 48, 461–481 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  52. Holmberg, K., Yuan, D.: Optimization of Internet protocol network design and routing. Networks 43(1), 39–53 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  53. ILOG CPLEX Division, 889 Alder Avenue, Suite 200, Incline Village, NV 89451, USA: CPLEX 11.0 Reference Manual (2007). URL http://www.cplex.com

  54. Jüttner A. Szentesi, A., Harmatos, J., Pióro, M.: On solvability of an OSPF routing problem. In: Proc. 15th Nordic Teletraffic Seminar (2000)

    Google Scholar 

  55. Karas, P., Pióro, M.: Optimization problems related to the assignment of administrative weights in the IP networks routing protocols. In: Proceedings of the 1st Polish-German Teletraffic Symposium PGTS’2000, pp. 185–192 (2000)

    Google Scholar 

  56. Klopfenstein, O., Mamy, S.: Choosing weights for IP network dimensioning optimization. In: Proc. of the International Symposium on Computers and Communications (ISCC 2006), pp. 994–999 (2006)

    Google Scholar 

  57. Leduc, G., Abrahamsson, H., Balon, S., Bessler, S., D’Arienzo, M., Delcourt, O., Domingo-Pascual, J., Cerav-Erbas, S., Gojmerac, I., Masip, X., Pescaph, A., Quoitin, B., Romano, S., Salvatori, E., Skivée, F., Tran, H., Uhlig, S., Ümit, H.: An open source traffic engineering toolbox. Computer Communications, 29(5), 593–610 (2006)

    Article  Google Scholar 

  58. Lin, F., Wang, J.: Minimax open shortest path first routing algorithms in networks suporting the SMDS service. In: Proceedings of the IEEE International Conference on Communications 1993 (ICC’93), Geneva, Suisse, vol. 2, pp. 666–670 (1993)

    Google Scholar 

  59. Menth, M., Hartmann, M., Martin, R.: Robust IP link costs for multilayer resilience. In: Networking. Atlanta, GA, USA (2007)

    Google Scholar 

  60. Milbrandt, J.: Possibilities of routing optimization in IP networks. Master’s thesis, Department of Computer Science, University of Würzburg (2001)

    Google Scholar 

  61. Moy, J.: OSPF: Anatomy of an Internet Routing Protocol. Addison-Wesley (1998)

    Google Scholar 

  62. Mulyana, E., Killat, U.: An alternative genetic algorithm to optimize OSPF weights. In: Internet Traffic Engineering and Traffic Management, 15th ITC Specialist Seminar, pp. 186–192 (July 2002). Würzburg, Germany

    Google Scholar 

  63. Nemhauser, G., Wolsey, L.: Integer and Combinatorial Optimization. John Wiley & Sons (1988)

    Google Scholar 

  64. Nucci, A., Schroeder, B., Bhattacharyya, S., Taft, N., Diot, C.: IGP link weight assignment for transient link failures. In: Proceedings of 18th International Teletraffic Congress, pp. 321–330 (2003)

    Google Scholar 

  65. Oran, D.: OSI IS-IS intra-domain routing protocol. Internet RFC 1142 (1990). http://www.ietf.org/rfc/rfc1142.txt

  66. Orlowski, S., Pióro, M., Tomaszewski, A., Wessäly, R.: SNDlib 1.0–Survivable Network Design Library. In: Proceedings of the 3rd International Network Optimization Conference (INOC 2007), Spa, Belgium (2007). http://sndlib.zib.de

  67. Parmar, A., Ahmed, S., Sokol, J.: An integer programming approach to the OSPF weight setting problem. Optimization Online (2005)

    Google Scholar 

  68. Pióro, M., Medhi, D.: Routing, Flow, and Capacity Design in Communication and Computer Networks. Morgan Kaufman (2004)

    Google Scholar 

  69. Pióro, M., Szentesi, A., Harmatos, J., Jüttner, A.: On OSPF related network optimization problems. In: 8th IFIP Workshop on Performance Modelling and Evaluation of ATM & IP Networks, pp. 70/1–70/14. Ilkley, UK (2000)

    Google Scholar 

  70. Pióro, M., Szentesi, A., Harmatos, J., Jüttner, A., Gajowniczek, P., Kozdrowski, S.: On OSPF related network optimization problems. Performance Evaluation 48, 201–223 (2002). (A preliminary version of this paper appeared in the proc. IFIP ATM IP 2000, Ilkley, England, July 2000)

    Article  MATH  Google Scholar 

  71. Pióro, M., Tomaszewski, A.: Feasibility issues in shortest-path routing with traffic flow split. In: Proceedings of the 3rd International Network Optimization Conference (INOC 2007), Spa, Belgium (2007)

    Google Scholar 

  72. Pióro, M., Tomaszewski, A., Dzida, M., Mycek, M., Zagożdżon, M.: Literature survey, models, polyhedral results, and exact and heuristic methods for shortest-path routing problems. Technical report, Institute of Telecommunications, Warsaw University of Technology (2007)

    Google Scholar 

  73. Prytz, M.: On optimization in design of telecommunications networks with multicast and unicast traffic. Ph.D. thesis, Royal Institute of Technology, Stockholm, Sweden (2002)

    Google Scholar 

  74. Ramalingam, G., Reps, T.: An incremental algorithm for a generalization of the shortest-path problem. Jounal of Algorithms 21(2), 267–305 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  75. Rexford, J.: Handbook of Optimization in Telecommunications, chap. Route optimization in IP networks (2006)

    Google Scholar 

  76. Srivastava, S., Agrawal, G., Pióro, M., Medhi, D.: Determining link weight system under various objectives for OSPF networks using a lagrangean relaxation-based approach. IEEE e-Transactions on Network and Service Management 2(1), 9–18 (2005)

    Article  Google Scholar 

  77. Staehle, D., Köhler, S., Kohlhaas, U.: Towards an optimization of the routing parameters for IP networks. Technical Report TR 258, Department of Computer Science, University of Würzburg (2000)

    Google Scholar 

  78. Tomaszewski, A., Pióro, M., Dzida, M., Mycek, M., Zagożdżon, M.: Valid inequalities for a shortest-path routing optimization problem. In: Proceedings of the 3rd International Network Optimization Conference (INOC 2007), Spa, Belgium (2007)

    Google Scholar 

  79. Tomaszewski, A., Pióro, M., Dzida, M., Zagożdżon, M.: Optimization of administrative weights in IP networks using the branch-and-cut approach. In: Proceedings of the 2nd International Network Optimization Conference (INOC 2005), Lisbon, Portugal, vol. 2, pp. 393–400 (2005)

    Google Scholar 

  80. Tong, C., Lam, K.: An embedded connectionist approach for the inverse shortest paths problem. Technical report, Department of Systems Engineering and Engineering Management, The Chinese University of Hong Kong (1996)

    Google Scholar 

  81. Ümit, H., Fortz, B.: Fast heuristic techniques for intra-domain routing metric optimization. In: Proc. INOC 2007 (2007)

    Google Scholar 

  82. Wang, Y., Wang, Z., Zhang, L.: Interenet traffic engineering without full mesh overlaying. In: Proc. INFOCOM’2001 (2001). New York, USA

    Google Scholar 

  83. Wolsey, L.: Integer Programming. John Wiley & Sons (1998)

    Google Scholar 

  84. Xiao, X., Hannan, A., Bailey, B., Ni, L.: Traffic engineering with MPLS in the Internet. IEEE Network 14, 28–33 (2000)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Mathematics, Technical University Berlin, Str. des 17. Juni 136, D-10623, Berlin, Germany

    Andreas Bley

  2. Départment d’Informatique, Faculté des Sciences, Université Libre de Bruxelles (ULB), Brussels, Belgium

    Bernard Fortz

  3. CORE, Université catholique de Louvain, Louvain-la-Neuve, Belgium

    Bernard Fortz & Hakan Ümit

  4. France Telecom, Orange Labs R&D, Paris, France

    Eric Gourdin & Olivier Klopfenstein

  5. Linköping Institute of Technology, SE-581 83, Linköping, Sweden

    Kaj Holmberg

  6. Institute of Telecommunications, Warsaw University of Technology, ul. Nowowiejska 15/19, 00-665, Warsaw, Poland

    Michał Pióro & Artur Tomaszewski

  7. Department of Electrical and Information Technology, Lund University, Box 118, SE-221 00, Lund, Sweden

    Michał Pióro

  8. Louvain Management School, Louvain-la-Neuve, Belgium

    Hakan Ümit

Authors
  1. Andreas Bley
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bernard Fortz
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Eric Gourdin
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Kaj Holmberg
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Olivier Klopfenstein
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Michał Pióro
    View author publications

    You can also search for this author in PubMed Google Scholar

  7. Artur Tomaszewski
    View author publications

    You can also search for this author in PubMed Google Scholar

  8. Hakan Ümit
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Andreas Bley , Bernard Fortz , Eric Gourdin , Kaj Holmberg , Olivier Klopfenstein , Michał Pióro , Artur Tomaszewski or Hakan Ümit .

Editor information

Editors and Affiliations

  1. LS II für Mathematik, RWTH Aachen, Templergraben 55, Aachen, 52056, Germany

    Arie Koster

  2. Depto. Matematica Aplicada IV, Universitat Politècnica de Catalunya, C. Jordi Girona 1-3, Barcelona, 08034, Spain

    Xavier Muñoz

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Bley, A. et al. (2009). Optimization of OSPF Routing in IP Networks. In: Koster, A., Muñoz, X. (eds) Graphs and Algorithms in Communication Networks. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02250-0_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02250-0_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02249-4

  • Online ISBN: 978-3-642-02250-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation