Skip to main content
SpringerLink
Log in

An Integer Programming Algorithm for Routing Optimization in IP Networks

  • Conference paper
Algorithms - ESA 2008 (ESA 2008)

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

Included in the following conference series:

Abstract

Most data networks nowadays use shortest path protocols to route the traffic. Given administrative routing lengths for the links of the network, all data packets are sent along shortest paths with respect to these lengths from their source to their destination.

In this paper, we present an integer programming algorithm for the minimum congestion unsplittable shortest path routing problem, which arises in the operational planning of such networks. Given a capacitated directed graph and a set of communication demands, the goal is to find routing lengths that define a unique shortest path for each demand and minimize the maximum congestion over all links in the resulting routing. We illustrate the general decomposition approach our algorithm is based on, present the integer and linear programming models used to solve the master and the client problem, and discuss the most important implementational aspects. Finally, we report computational results for various benchmark problems, which demonstrate the efficiency of our algorithm.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Algorithmic Solutions Software GmbH: LEDA – Library of Efficient Data types and Algorithms (2000–2007), http://www.algorithmic-solution.com/leda

  2. atesio GmbH: Discnet – Network optimization software library (2000–2007), http://www.atesio.de

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

    Article  MATH  MathSciNet  Google Scholar 

  4. Bley, A.: A Lagrangian approach for integrated network design and routing in IP networks. In: Ben-Ameur, W., Pertrowski, A. (eds.) 1st International Network Optimization Conference, pp. 107–113. Institut National des Télécommunications, Evry/Paris (2003)

    Google Scholar 

  5. Bley, A.: Finding small administrative lengths for shortest path routing. In: Gouveia, L., Mourão, C. (eds.) 2nd International Network Optimization Conference, pp. 121–128. Universidade de Lisboa, Lisbon (2005)

    Google Scholar 

  6. Bley, A.: On the approximability of the minimum congestion unsplittable shortest path routing problem. In: Jünger, M., Kaibel, V. (eds.) IPCO 2005. LNCS, vol. 3509, pp. 97–110. Springer, Heidelberg (2005)

    Google Scholar 

  7. Bley, A.: Approximability of unsplittable shortest path routing problems. Technical report ZR-06-02, Zuse Institute Berlin (2006)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  9. Bley, A.: Routing and capacity optimization for IP networks. PhD thesis, Technische Universität Berlin (2007)

    Google Scholar 

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

    Google Scholar 

  11. Bley, A., Koch, T.: Integer programming approaches to access and backbone IP-network planning. In: 3rd International Conference on High Performance Scientific Computing, Hanoi, Vietnam (2006)

    Google Scholar 

  12. Bourquia, N., Ben-Ameur, W., Gourdin, E., Tolla, P.: Optimal shortest path routing for Internet networks. In: Ben-Ameur, W., Pertrowski, A. (eds.) 1st International Network Optimization Conference, pp. 119–125. Institut National des Télécommunications, Evry/Paris (2003)

    Google Scholar 

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

    Google Scholar 

  14. Broström, P., Holmberg, K.: Stronger necessary conditions for the existence of a compatible OSPF metric. Technical report LiTH-MAT-R-2004-08, Linköping University (2004)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  16. Callon, R.: Use of OSI IS-IS for routing in TCP/IP and dual environments. IETF Internet RFC 1195 (1990)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  19. de Giovanni, L., Fortz, B., Labbé, M.: A lower bound for the Internet protocol network design problem. In: Gouveia, L., Mourão, C. (eds.) 2nd International Network Optimization Conference, pp. 402–408. Universidade de Lisboa, Lisbon (2005)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  21. ILOG CPLEX Division: CPLEX 11.0 (2007), http://www.ilog.com

  22. Moy, J.: OSPF version 2. IETF Internet RFC 2328 (1998)

    Google Scholar 

  23. Orlowski, S., Pióro, M., Tomaszewski, A., Wessäly, R.: SNDlib 1.0 – Survivable Network Design Library. In: Fortz, B. (ed.) 3rd International Network Optimization Conference. Université Libre de Bruxels, Brussels (2007), http://sndlib.zib.de

    Google Scholar 

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

    Google Scholar 

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

    MATH  Google Scholar 

  26. 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, Ilkley, UK, pp. 70/1–70/14 (2000)

    Google Scholar 

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

  28. Tomaszewski, A., Pióro, M., Dzida, M., Mycek, M., Zagożdżon, M.: Valid inequalities for a shortest-path routing optimization problem. In: Fortz, B. (ed.) 3rd International Network Optimization Conference. Université Libre de Bruxels, Brussels (2007)

    Google Scholar 

  29. 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: Gouveia, L., Mourão, C. (eds.) 2nd International Network Optimization Conference, pp. 393–400. Universidade de Lisboa, Lisbon (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Zuse Institute Berlin, Takustr. 7, D-14195, Berlin, Germany

    Andreas Bley

Authors
  1. Andreas Bley
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Dan Halperin Kurt Mehlhorn

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bley, A. (2008). An Integer Programming Algorithm for Routing Optimization in IP Networks. In: Halperin, D., Mehlhorn, K. (eds) Algorithms - ESA 2008. ESA 2008. Lecture Notes in Computer Science, vol 5193. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87744-8_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-87744-8_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-87743-1

  • Online ISBN: 978-3-540-87744-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation