Tailoring neighborhood search for the internet protocol network design problem with reliability and routing constraints

The Internet Protocol Network Design Problem with Reliability and Routing Constraints (IPRR) can be shortly stated as follows. A telecommunication network is given in terms of a set of nodes and a set of traffic demands; we want to define the minimum cost capacity reservation such that all the traffic is routed even under fault scenarios. Capacity is provided by reserving some already installed devices of a given capacity between pairs of nodes and traffic must be loaded on the network according to the OSPF-ECM (Open Shortest Path First-Equal Commodity Multipath) protocol, with additional constraints on the maximum number of hops. The problem is NP-Hard and literature proposes neighborhood search heuristics which do not take the reliability and max-hop requirements into account, or assume a simplified OSPF routing. The design and the implementation of the components of any neighborhood search algorithms are strongly conditioned by the reliability and routing constraints, which impli...

• Type: Journal
• Year: 2007
• Where: NETWORKS
• Authors: Luigi De Giovanni, Roberto Tadei
• Keywords: Computer Networks, Neighborhood Search, Neighborhood Search Heuristics, NETWORKS 2007, Shortest Paths