On provisioning diverse circuits in heterogeneous multi-layer optical networks

Network planners are often requested to provision multiple physically-diverse high-speed circuits over a large carrier's core (inter-city) DWDM network, which consists of multiple layers and heterogeneous vendor systems. Optimally provisioning such circuits while avoiding shared risk link group (SRLG) failures is an NP-hard problem. In this paper, we propose a novel and practical two-step approach: pre-processing with Integer Linear Programming (ILP) for absolutely or maximally SRLG-diverse routes and post-processing for DWDM system selection, regenerator placement and wavelength assignment. This approach has been implemented in a production network planning tool. According to our experiments, for a typical large carrier's core optical network, most of the diverse-routing demands can be solved within 1min, even with tens of thousands of binary decision variables, which allows interactive use by network planners.

[1]  Charles Kalmanek,et al.  Fiber span failure protection in mesh optical networks , 2001, OptiComm: Optical Networking and Communications Conference.

[2]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[3]  Ramesh Bhandari Optimal diverse routing in telecommunication fiber networks , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[4]  Eric Bouillet,et al.  Stochastic approaches to compute shared mesh restored lightpaths in optical network architectures , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[5]  Byrav Ramamurthy,et al.  Survivable traffic grooming in WDM mesh networks under SRLG constraints , 2005, IEEE International Conference on Communications, 2005. ICC 2005. 2005.

[6]  Jian-Qiang Hu,et al.  Diverse routing in optical mesh networks , 2003, IEEE Trans. Commun..

[7]  Dong Shen,et al.  Efficient regenerator placement and wavelength assignment in optical networks , 2011, 2011 Optical Fiber Communication Conference and Exposition and the National Fiber Optic Engineers Conference.

[8]  Torsten Tholey Finding Disjoint Paths on Directed Acyclic Graphs , 2005, WG.

[9]  Eiji Oki,et al.  A disjoint path selection scheme with shared risk link groups in GMPLS networks , 2002, IEEE Communications Letters.

[10]  Byrav Ramamurthy,et al.  Cost and Reliability Considerations in Designing the Next-Generation IP over WDM Backbone Networks , 2011, 2011 Proceedings of 20th International Conference on Computer Communications and Networks (ICCCN).

[11]  Chunming Qiao,et al.  Trap avoidance and protection schemes in networks with shared risk link groups , 2003 .

[12]  Jasbir S. Arora,et al.  Survey of multi-objective optimization methods for engineering , 2004 .

[13]  Dong Shen,et al.  On multiplexing optimization in DWDM networks , 2011, 2011 Optical Fiber Communication Conference and Exposition and the National Fiber Optic Engineers Conference.

[14]  Dahai Xu,et al.  Circuit planning tool over heterogeneous networks , 2011, 2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

[15]  J. W. Suurballe Disjoint paths in a network , 1974, Networks.

[16]  Brian W. Kernighan,et al.  AMPL: A Modeling Language for Mathematical Programming , 1993 .