Skip to main content
SpringerLink
Log in

Multiobjective design of survivable IP networks

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

Modern communication networks often use Internet Protocol routing and the intra-domain protocol OSPF (Open Shortest Path First). The routers in such a network calculate the shortest path to each destination and send the traffic on these paths, using load balancing. The issue of survivability, i.e. the question of how much traffic the network will be able to accommodate if components fail, is increasingly important. We consider the problem of designing a survivable IP network, which also requires determining the routing of the traffic. This is done by choosing the weights used for the shortest path calculations.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Ahuja, R.K., T.L. Magnanti, and J.B. Orlin. (1993). Network Flows. Theory, Algorithms and Applications. Prentice Hall.

  • Bley, A., M. Grötschel, and R. Wessäly. (2000). “Design of Broadband Virtual Private Private Networks: Model and Heuristics for the B-WiN.” In N., Dean, D.F. Hsu, and R. Rav (Eds.), Robust Communication Networks: Interconnection and Survivability volume 53 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, AMS, pp. 1–16.

  • Buriol, L., M. Resende, C. Ribeiro, and M. Thorup. (2003). “A Hybrid Genetic Algorithm for the Weight Setting Problem in OSPF/IS-IS Routing.” Technical Report TD-5NTN5G, AT&T Labs Research, USA.

  • Ericsson, M., M. Resende, and P. Pardalos. (2002). “A Genetic Algorithm for the Weight Setting Problem in OSPF Routing.” Journal of Combinatorial Optimization, 6, 299–333.

    Article  Google Scholar 

  • Fortz, B. and M. Thorup. (2000). “Internet Traffic Engineering by Optimizing OSPF Weights.” In Proceedings of IEEE INFOCOM ’00, vol. 2, pp. 519–528.

  • Fortz, B. and M. Thorup. (2003). “Robust Optimization of OSPF/IS-IS Weights.” In Proceedings of INOC2003, pp. 225–230.

  • Holmberg, K. and D. Yuan. (2000). “A Lagrangean Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem.” Operations Research, 48, 461–481.

    Article  Google Scholar 

  • Holmberg, K. and D. Yuan. (2004). “Optimization of Internet Protocol Network Design and Routing.” Networks, 43(1), 39–53.

    Article  Google Scholar 

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

Download references

Author information

Authors and Affiliations

  1. Division of Optimization, Department of Mathematics, Linköping Institute of Technology, SE-581 83, Linköping, Sweden

    Peter Broström & Kaj Holmberg

Authors
  1. Peter Broström
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kaj Holmberg
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kaj Holmberg.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Broström, P., Holmberg, K. Multiobjective design of survivable IP networks. Ann Oper Res 147, 235–253 (2006). https://doi.org/10.1007/s10479-006-0067-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-006-0067-y

Keywords

Search

Navigation