A fast path-based ILP formulation for offline RWA in mesh optical networks

RWA is a fundamental problem in the design and control of optical networks. We introduce the concept of symmetric RWA solutions and present a new ILP formulation to construct optimally such solutions. The formulation scales to mesh topologies representative of backbone and regional networks. Numerical results demonstrate that the new formulation achieves a decrease of up to two orders of magnitude in running time compared to existing formulations. In particular, optimal solutions for topologies up to 20 nodes can be obtained within minutes using commodity CPUs, and larger networks can be solved in reasonable time. Our approach significantly lowers the barrier to entry in fully exploring the solution space of optical network design and in investigating the sensitivity of design decisions to forecast demands via extensive “what-if” analysis. Such analysis cannot be carried out currently without large investments in computational resources and time.

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

[2]  Asuman E. Ozdaglar,et al.  Routing and wavelength assignment in optical networks , 2003, TNET.

[3]  J. M. Simmons,et al.  Optical Network Design and Planning , 2008 .

[4]  Kumar N. Sivarajan,et al.  Routing and wavelength assignment in all-optical networks , 1995, TNET.

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

[6]  Emmanuel Dotaro,et al.  Routing and wavelength assignment of scheduled lightpath demands , 2003, IEEE J. Sel. Areas Commun..

[7]  G. N. Rouskas,et al.  Fast Exact ILP Decompositions for Ring RWA , 2011, IEEE/OSA Journal of Optical Communications and Networking.

[8]  Brigitte Jaumard,et al.  ILP formulations and optimal solutions for the RWA problem , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[9]  Imrich Chlamtac,et al.  Lightpath communications: an approach to high bandwidth optical WAN's , 1992, IEEE Trans. Commun..

[10]  Wayne D. Grover,et al.  A new approach to node-failure protection with span-protecting p-cycles , 2009, 2009 11th International Conference on Transparent Optical Networks.

[11]  Biswanath Mukherjee,et al.  Some principles for designing a wide-area WDM optical network , 1996, TNET.

[12]  Biswanath Mukherjee,et al.  A Practical Approach for Routing and Wavelength Assignment in Large Wavelength-Routed Optical Networks , 1996, IEEE J. Sel. Areas Commun..

[13]  Biswanath Mukherjee,et al.  Traffic grooming in an optical WDM mesh network , 2002, IEEE J. Sel. Areas Commun..

[14]  David Eppstein,et al.  Finding the k shortest paths , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[15]  Michael A. Trick,et al.  A Column Generation Approach for Graph Coloring , 1996, INFORMS J. Comput..

[16]  Kyungsik Lee,et al.  Optimal routing and wavelength assignment in WDM ring networks , 2000, IEEE Journal on Selected Areas in Communications.

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

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

[19]  Zhi-Quan Luo,et al.  On the routing and wavelength assignment in multifiber WDM networks , 2004, IEEE Journal on Selected Areas in Communications.

[20]  Emmanouel A. Varvarigos,et al.  Offline Routing and Wavelength Assignment in Transparent WDM Networks , 2010, IEEE/ACM Transactions on Networking.

[21]  G.N. Rouskas,et al.  On Hierarchical Traffic Grooming in WDM Networks , 2008, IEEE/ACM Transactions on Networking.

[22]  Biswanath Mukherjee,et al.  Survivable WDM mesh networks. Part I-Protection , 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]  Tali Eilam-Tzoreff,et al.  The Disjoint Shortest Paths Problem , 1998, Discret. Appl. Math..

[24]  Kumar N. Sivarajan,et al.  Algorithms for routing and wavelength assignment based on solutions of LP-relaxations , 2001, IEEE Communications Letters.

[25]  Emmanouel A. Varvarigos,et al.  Comparison of Routing and Wavelength Assignment Algorithms in WDM Networks , 2008, IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference.

[26]  Enke Chen,et al.  Current Practice of Implementing Symmetric Routing and Load Sharing in the Multi-Provider Internet , 1996 .

[27]  R. Musmanno,et al.  Label Correcting Methods to Solve Multicriteria Shortest Path Problems , 2001 .

[28]  Maurizio Dusi,et al.  Estimating routing symmetry on single links by passive flow measurements , 2010, IWCMC.

[29]  Biswanath Mukherjee,et al.  Survivable WDM mesh networks , 2003 .

[30]  Dimitra Simeonidou,et al.  The design of a European optical network , 1995 .

[31]  George N. Rouskas,et al.  Traffic Grooming for Optical Networks: Foundations, Techniques and Frontiers , 2008 .

[32]  George N. Rouskas,et al.  Traffic grooming in WDM networks: past and future , 2002, IEEE Netw..