The precedence-constrained asymmetric traveling salesman polytope
Mathematical Programming: Series A and B
The disjoint shortest paths problem
Discrete Applied Mathematics
Routing Through Virtual Paths in Layered Telecommunication Networks
Operations Research
On the complexity and approximation of the min-sum and min-max disjoint paths problems
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
| Hi-index | 0.00 |
With the explosive growth of traffic data, telecommunication networks have evolved toward a model of high-speed IP routers interconnected by intelligent optical core networks. This IP-over-optical architecture is particularly considered as an important opportunity for telecommunication carriers who want to vary services and add more multimedia applications. In our work, we are interested in the problem of survivability in multilayer IP-over-optical networks. Given a set of traffic demands for which we know a survivable logical routing in the IP layer, our purpose is to determine the corresponding survivable topology in the optical layer. We show that the problem is NP-hard even for one demand. We formulate the problem in terms of 0-1 linear program based on path variables. We discuss the pricing problem and prove that it reduces to a shortest path problem. Using this, we propose a Branch-and-Price algorithm. Some preliminary computational results are also discussed.