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

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

[1]  Piet Demeester,et al.  Design and control of optical grid networks , 2007, 2007 Fourth International Conference on Broadband Communications, Networks and Systems (BROADNETS '07).

[2]  Albert Y. Zomaya,et al.  Rescheduling for reliable job completion with the support of clouds , 2010, Future Gener. Comput. Syst..

[3]  Chris Develder,et al.  On the impact of relocation on network dimensions in resilient optical Grids. , 2010, 2010 14th Conference on Optical Network Design and Modeling (ONDM).

[4]  Ken-ichi Sato Advances in Transport Network Technologies: Photonic Networks, ATM, and SDH , 1996 .

[5]  Leon S. Lasdon,et al.  Optimization Theory of Large Systems , 1970 .

[6]  Chris Develder,et al.  Column Generation for Dimensioning Resilient Optical Grid Networks with Relocation , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.

[7]  Biswanath Mukherjee,et al.  On dimensioning optical grids and the impact of scheduling , 2008, Photonic Network Communications.

[8]  J. W. Suuballe,et al.  Disjoint Paths in a Network , 2022 .

[9]  Thomas R. Stidsen,et al.  Optimal routing with failure‐independent path protection , 2010, Networks.

[10]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[11]  J. E. Van Ness Problems in the design of large power networks , 1972, Networks.

[12]  Gianluigi Zanetti,et al.  Suspending, migrating and resuming HPC virtual clusters , 2010, Future Gener. Comput. Syst..

[13]  Ting Wang,et al.  Task Scheduling and Lightpath Establishment in Optical Grids , 2009, Journal of Lightwave Technology.

[14]  Chris Develder,et al.  Providing resiliency for optical grids by exploiting relocation: A dimensioning study based on ILP , 2011, Comput. Commun..

[15]  Andrzej Jajszczyk,et al.  Automatically switched optical networks: benefits and requirements , 2005, IEEE Commun. Mag..

[16]  Ami Marowka,et al.  The GRID: Blueprint for a New Computing Infrastructure , 2000, Parallel Distributed Comput. Pract..

[17]  Tao Jiang,et al.  Application-specific resource provisioning for wide-area distributed computing , 2010, IEEE Network.

[18]  Robert E. Tarjan,et al.  A quick method for finding shortest pairs of disjoint paths , 1984, Networks.

[19]  Piet Demeester,et al.  Anycast Routing Algorithms for Effective Job Scheduling in Optical Grids , 2006, 2006 European Conference on Optical Communications.

[20]  Didier Colle,et al.  Pan-European Optical Transport Networks: An Availability-based Comparison , 2004, Photonic Network Communications.

[21]  Biswanath Mukherjee,et al.  Path-protection routing and wavelength assignment (RWA) in WDM mesh networks under duct-layer constraints , 2003, TNET.

[22]  Chris Develder,et al.  Exploiting relocation to reduce network dimensions of resilient optical grids , 2009, 2009 7th International Workshop on Design of Reliable Communication Networks.

[23]  George N. Rouskas,et al.  A Survey of Virtual Topology Design Algorithms for Wavelength Routed Optical Networks , 1999 .

[24]  Brigitte Jaumard,et al.  Comparison of ILP formulations for the RWA problem , 2004, Opt. Switch. Netw..

[25]  B. Mukherjee,et al.  A Review of Routing and Wavelength Assignment Approaches for Wavelength- Routed Optical WDM Networks , 2000 .

[26]  Brigitte Jaumard,et al.  On column generation formulations for the RWA problem , 2004, Discret. Appl. Math..

[27]  Arie M. C. A. Koster,et al.  Demand-wise Shared Protection for Meshed Optical Networks , 2005, Journal of Network and Systems Management.

[28]  Ian Foster,et al.  The Grid 2 - Blueprint for a New Computing Infrastructure, Second Edition , 1998, The Grid 2, 2nd Edition.