Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

Anycast Routing for Survivable Optical Grids: Scalable Solution Methods and the Impact of Relocation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Shaikh, A. ; CSE Dept., Concordia Univ., Montreal, QC, Canada ; Buysse, J. ; Jaumard, B. ; Develder, C.

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%.

Published in:

Optical Communications and Networking, IEEE/OSA Journal of  (Volume:3 ,  Issue: 9 )