Advertisement

Annals of Operations Research

, Volume 147, Issue 1, pp 235–253 | Cite as

Multiobjective design of survivable IP networks

  • Peter Broström
  • Kaj HolmbergEmail author
Article

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.

Keywords

Internet protocol OSPF Network design Survivability Weight optimization 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ahuja, R.K., T.L. Magnanti, and J.B. Orlin. (1993). Network Flows. Theory, Algorithms and Applications. Prentice Hall.Google Scholar
  2. 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.Google Scholar
  3. 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.Google Scholar
  4. 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.CrossRefGoogle Scholar
  5. Fortz, B. and M. Thorup. (2000). “Internet Traffic Engineering by Optimizing OSPF Weights.” In Proceedings of IEEE INFOCOM ’00, vol. 2, pp. 519–528.Google Scholar
  6. Fortz, B. and M. Thorup. (2003). “Robust Optimization of OSPF/IS-IS Weights.” In Proceedings of INOC2003, pp. 225–230.Google Scholar
  7. 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.CrossRefGoogle Scholar
  8. Holmberg, K. and D. Yuan. (2004). “Optimization of Internet Protocol Network Design and Routing.” Networks, 43(1), 39–53.CrossRefGoogle Scholar
  9. Moy, J. (1998). OSPF: Anatomy of an Internet Routing Protocol. Addison-Wesley 1998.Google Scholar

Copyright information

© Springer Science + Business Media, LLC 2006

Authors and Affiliations

  1. 1.Division of Optimization, Department of MathematicsLinköping Institute of TechnologyLinköpingSweden

Personalised recommendations