survivability

On the hop-constrained survivable network design problem with reliable edges

  • Quentin Botton
  • Bernard Fortz
  • Luís Gouveia
    • Categories Branch and Cut Algorithms, Cutting Plane Approaches, Network Optimization Tags , , , ,

    In this paper, we study the hop-constrained survivable network design problem with reliable edges. Given a graph with non-negative edge weights and node pairs Q, the hop-constrained survivable network design problem consists of constructing a minimum weight set of edges so that the induced subgraph contains at least K edge-disjoint paths containing at most L … Read more

    Survivable IP network design with OSPF routing

  • Luciana S. Buriol
  • Mauricio G.C. Resende
  • Mikkel Thorup
    • Categories Meta Heuristics, Network Optimization, Telecommunications Tags , , , ,

    Internet protocol (IP) traffic follows rules established by routing protocols. Shortest path based protocols, such as Open Shortest Path First (OSPF), direct traffic based on arc weights assigned by the network operator. Each router computes shortest paths and creates destination tables used for routing flow on the shortest paths. If a router has multiple outgoing … Read more