Lightpath Re-optimization in mesh optical networks

Intelligent mesh optical networks deployed today offer unparalleled capacity, flexibility, availability, and, inevitably, new challenges to master all these qualities in the most efficient and practical manner. More specifically, demands are routed according to the state of the network available at the moment. As the network and the traffic evolve, the lightpaths of the existing demands becomes sub-optimal. In this paper we study two algorithms to re-optimize lightpaths in resilient mesh optical networks. One is a complete re-optimization algorithm that re-routes both primary and backup paths, and the second is a partial re-optimization algorithm that re-routes the backup paths only. We show that on average, these algorithms allow bandwidth savings of 3% to 5% of the total capacity in scenarios where the backup path only is re-routed, and substantially larger bandwidth savings when both the working and backup paths are re-routed. We also prove that trying all possible demand permutations with an online algorithm does not guarantee optimality, and in certain cases does not achieve it, while for the same scenario optimality is achieved through re-optimization. This observation motivates the needs for a re-optimization approach that does not just simply look at different sequences, and we propose and experiment with such an approach. Re-optimization has actually been performed in a nationwide live optical mesh network and the resulting savings are reported in this paper, validating reality and the usefulness of re-optimization in real networks.

[1]  Chunming Qiao,et al.  Novel models for efficient shared-path protection , 2002, Optical Fiber Communication Conference and Exhibit.

[2]  George N. Rouskas,et al.  Dynamic Reconfiguration in Multihop WDM Networks , 1995, J. High Speed Networks.

[3]  J.-F.P. Labourdette,et al.  Analysis and Design of Fully Shared Networks , 1994 .

[4]  Lorne Mason,et al.  Restoration strategies and spare capacity requirements in self-healing ATM networks , 1997, Proceedings of INFOCOM '97.

[5]  Eric Bouillet,et al.  Invited: Routing Strategies for Capacity-Efficient and Fast-Restorable Mesh Optical Networks , 2004, Photonic Network Communications.

[6]  Biswanath Mukherjee,et al.  Wavelength-routed optical networks: linear formulation, resource budgeting tradeoffs, and a reconfiguration study , 2000, TNET.

[7]  Murali S. Kodialam,et al.  Dynamic routing of bandwidth guaranteed tunnels with restoration , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[8]  Deep Medhi.  Multi-hour, multi-traffic class network design for virtual path-based dynamically reconfigurable wide-area ATM networks , 1995, TNET.

[9]  Biswanath Mukherjee,et al.  Virtual-topology adaptation for WDM mesh networks under dynamic traffic , 2003, TNET.

[10]  Thomas E. Stern,et al.  Multiwavelength Optical Networks: A Layered Approach , 1999 .

[11]  D. W. Anding.  Service offerings utilizing digital cross-connect systems-A Bell South perspective , 1988, IEEE International Conference on Communications, - Spanning the Universe..

[12]  Eric Bouillet,et al.  Local optimization of shared backup channels in optical mesh networks , 2003, OFC 2003 Optical Fiber Communications Conference, 2003..

[13]  Yufei Wang,et al.  Optical network design and restoration , 1999, Bell Labs Technical Journal.

[14]  R.W. Tkach,et al.  Fast restoration in a mesh network of optical cross-connects , 1999, OFC/IOOC . Technical Digest. Optical Fiber Communication Conference, 1999, and the International Conference on Integrated Optics and Optical Fiber Communication.

[15]  Eric Bouillet,et al.  Enhanced algorithm cost model to control tradeoffs in provisioning shared mesh restored lightpaths , 2002, Optical Fiber Communication Conference and Exhibit.

[16]  D. Du,et al.  Multiwavelength Optical Networks , 2002, Network Theory and Applications.

[17]  Surajit Chaudhuri,et al.  Capacity performance of dynamic provisioning in optical networks , 2001 .

[18]  A. Herschtal,et al.  Dynamic capacity allocation and optimal rearrangement for reconfigurable networks , 1995, Proceedings of GLOBECOM '95.

[19]  Murti V. Salapaka,et al.  Approaches for capacity and revenue optimization in survivable WDM networks , 2001, J. High Speed Networks.

[20]  Anthony S. Acampora,et al.  Branch-exchange sequences for reconfiguration of lightwave networks , 1994, IEEE Trans. Commun..

[21]  S. Chaudhuri,et al.  A national mesh network using optical cross-connect switches , 2003, OFC 2003 Optical Fiber Communications Conference, 2003..

[22]  George N. Rouskas,et al.  Dynamic reconfiguration policies for WDM networks , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[23]  Dhadesugoor R. Vaman,et al.  Reconfiguration for Service and Self-Healing in ATM Networks Based on Virtual Paths , 1997, Comput. Networks ISDN Syst..

[24]  Yu Liu,et al.  Approximating optimal spare capacity allocation by successive survivable routing , 2001, IEEE/ACM Transactions on Networking.

[25]  S. Chaudhuri,et al.  Dynegy's national long-haul optical mesh network utilizing intelligent optical switches , 2002, The 15th Annual Meeting of the IEEE Lasers and Electro-Optics Society.

[26]  Sudipta Sengupta,et al.  Efficient channel reservation for backup paths in optical mesh networks , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[27]  M. Gerla,et al.  Topological reconfiguration of ATM networks , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.

[28]  Ahmet A. Akyamaç,et al.  Ring Speed Restoration and Optical Core Mesh Networks , 2002 .

[29]  Wayne D. Grover,et al.  Comparison of Mesh Protection and Restoration Schemes and the Dependency of Graph Connectivity , 2001, DRCN.

[30]  W.D. Grover,et al.  Bi-criteria studies of mesh network restoration path-length versus capacity tradeoffs , 2001, OFC 2001. Optical Fiber Communication Conference and Exhibit. Technical Digest Postconference Edition (IEEE Cat. 01CH37171).

[31]  Wayne D. Grover,et al.  Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks , 1998, TNET.