In this paper, we address the issue of resiliency against single link network failures in optical grids and show how the anycast routing principle, which is typical of grids, can be exploited in providing efficient shared path protection. We investigate two different integer linear program models for the full anycast routing problem, deciding on the primary and backup server locations as well as on the lightpaths toward them. The first model is a classical integer linear programming (ILP) model, which lacks scalability. The second model is a large-scale optimization model which can be efficiently solved using column generation techniques. We also design two new heuristics: the first one is an improvement of a previously proposed one which, although providing near optimal solutions, lacks scalability, while the second one is highly scalable, at the expense of reduced accuracy. Numerical results are presented for three mesh networks with varying node degrees. They allow an illustration of the scalability of the newly proposed approaches. Apart from highlighting the difference in performance (i.e., scalability and optimality) among the algorithms, our case studies demonstrate the bandwidth savings that can be achieved by exploiting relocation rather than using a backup path to the original (failure-free) destination site. Numerical results for varying network topologies, as well as different numbers of server sites show that relocation allows bandwidth savings in the range of 7–21%.
© 2011 OSA
Original Manuscript: March 7, 2011
Revised Manuscript: July 8, 2011
Manuscript Accepted: July 26, 2011
Published: August 31, 2011
Ali Shaikh, Jens Buysse, Brigitte Jaumard, and Chris Develder, "Anycast Routing for Survivable Optical Grids: Scalable Solution Methods and the Impact of Relocation," J. Opt. Commun. Netw. 3, 767-779 (2011)