Comparing Restoration Concepts Using Optimal Network Configurations with Integrated Hardware and Routing Decisions

  • Authors:
  • Sebastian Orlowski;Roland Wessäly

  • Affiliations:
  • Aff1 Aff2;Zuse Institute Berlin, Berlin, Germany D-14195

  • Venue:
  • Journal of Network and Systems Management
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

We investigate the impact of link and path restoration on the cost of telecommunication networks. The main observation is that the cost of an optimal network configuration is almost independent of the restoration concept if (i) the installation of network elements (ADMs, DXCs, or routers) and interface cards, (ii) link capacities, and (iii) working and restoration routings are simultaneously optimized.We present a mixed-integer programming model which integrates all these decisions. Using a branch-and-cut algorithm (with column generation to deal with all admissible routing paths), we solve structurally different real-world based problem instances and show that the cost of optimal solutions is almost independent of the used restoration concept.In addition, we optimize spare capacities based on predetermined shortest working paths with respect to different link weights. On our test instances, the additional cost of solutions obtained with this sequential approach, compared to simultaneous optimization of working and restoration routings, varies between 0 and 164%.