Models, Complexity and Algorithms for the Design of Multi-fiber WDM Networks

In this paper, we study multi-fiber optical networks with wavelength division multiplexing (WDM). We extend the definition of the well-known Wavelength Assignment Problem (WAP) to the case of k fibers per link and w wavelengths per fiber, generalization that we will call (k,w)-WAP. We develop a new model for the (k,w)-WAP based on conflict hypergraphs. Furthermore, we consider two natural optimization problems that arise from the (k,w)-WAP: minimizing the number of fibers k given a number of wavelengths w, on one hand, and minimizing w given k, on the other. We develop and analyze the practical performance of two methodologies based on hypergraph coloring.

[1]  Emmanuel Dotaro,et al.  ROUTING AND WAVELENGTH ASSIGNMENT OF SCHEDULED LIGHTPATH DEMANDS IN A WDM OPTICAL TRANSPORT NETWORK , 2002 .

[2]  Klaus Jansen,et al.  Optimal Wavelength Routing on Directed Fiber Trees , 1999, Theor. Comput. Sci..

[3]  Janos Simon,et al.  Decidable Properties of Graphs of All-Optical Networks , 2001, ICALP.

[4]  Chi-Jen Lu.  Deterministic Hypergraph Coloring and Its Applications , 1998, RANDOM.

[5]  S. Baroni,et al.  Analysis and design of resilient multifiber wavelength-routed optical transport networks , 1999 .

[6]  Aravind Srinivasan,et al.  An extension of the Lovász local lemma, and its applications to integer programming , 1996, SODA '96.

[7]  Rahul Simha,et al.  On the wavelength assignment problem in multifiber WDM star and ring networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[8]  Dorit S. Hochba,et al.  Approximation Algorithms for NP-Hard Problems , 1997, SIGA.

[9]  Jorma Virtamo,et al.  Wavelength Assignment in multifibre WDM-networks , 1999 .

[10]  Janos Simon,et al.  Wavelength Assignment Problem on All-Optical Networks with k Fibres per Link , 2000, ICALP.

[11]  Kumar N. Sivarajan,et al.  Optical Networks: A Practical Perspective , 1998 .

[12]  Ling Li,et al.  A new analytical model for multifiber WDM networks , 2000, IEEE Journal on Selected Areas in Communications.

[13]  Hervé Rivano,et al.  Fractional Path Coloring with Applications to WDM Networks , 2001, ICALP.

[14]  Aravind Srinivasan,et al.  New algorithmic aspects of the Local Lemma with applications to routing and partitioning , 1999, SODA '99.

[15]  P. Hell,et al.  Graph Problems Arising from Wavelength-Routing in All-Optical Networks , 2004 .

[16]  François Margot,et al.  Pruning by isomorphism in branch-and-cut , 2001, Math. Program..

[17]  Vijay Kumar,et al.  Approximating Circular Arc Colouring and Bandwidth Allocation in All-Optical Ring Networks , 1998, APPROX.

[18]  Chunming Qiao,et al.  Wavelength assignment for dynamic traffic in multi-fiber WDM networks , 1998, Proceedings 7th International Conference on Computer Communications and Networks (Cat. No.98EX226).

[19]  Rahul Simha,et al.  On the wavelength assignment problem in multifiber WDM star and ring networks , 2001, TNET.

[20]  Lemin Li,et al.  Wavelength assignment for dynamic traffic in WDM networks , 1999 .

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

[22]  Neil Robertson,et al.  Graph Minors .XIII. The Disjoint Paths Problem , 1995, J. Comb. Theory B.

[23]  Hervé Rivano,et al.  Lightpath assignment for multifibers WDM networks with wavelength translators , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

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

[25]  Zhi-Quan Luo,et al.  A Lagrangean decomposition approach for the routing and wavelength assignment in multifiber WDM networks , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

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