SPARK: A smart parametric online RWA algorithm

The large potential bandwidth available in wavelength-division multiplexed optical networks makes this technology of crucial importance for satisfying the ever increasing capacity requirements of the next-generation Internet. In this scenario, the routing and wavelength assignment (RWA) problem that concerns deter- mining the optical paths and wavelengths to be used for connection establishment in a wavelength-routed network, is still one of the most important open issues. In this paper we propose a new on- line dynamic grooming-capable RWA heuristic scheme working on wavelength division multiplexing (WDM) networks as a multistage selection process. The proposed algorithm is transparent with respect to the presence of wavelength converters, achieves very low connection rejection ratios with minimal computational complexity and is appropriate for the modern multilayer optical circuit and wavelength switched networks with sparse wavelength conversion capability.

[1]  Ezhan Karasan,et al.  Effects of wavelength routing and selection algorithms on wavelength conversion gain in WDM optical networks , 1996, Digest IEEE/Leos 1996 Summer Topical Meeting. Advanced Applications of Lasers in Materials and Processing.

[2]  Murali S. Kodialam,et al.  Integrated dynamic IP and wavelength routing in IP over WDM networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

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

[4]  Suresh Subramaniam,et al.  All-optical networks with sparse wavelength conversion , 1996, TNET.

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

[6]  Bo Li,et al.  A dynamic RWA algorithm in a wavelength-routed all-optical network with wavelength converters , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[7]  Andrew V. Goldberg,et al.  A new approach to the maximum flow problem , 1986, STOC '86.

[8]  Ariel Orda,et al.  QoS Routing Mechanisms and OSPF Extensions , 1999, RFC.

[9]  Wen-De Zhong,et al.  Connection Establishment of Label Switched Paths in IP/MPLS over Optical Networks , 2004, Photonic Network Communications.

[10]  Biswanath Mukherjee,et al.  Dynamic traffic grooming in WDM mesh networks using a novel graph model , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[11]  Byrav Ramamurthy,et al.  Wavelength conversion in WDM networking , 1998, IEEE J. Sel. Areas Commun..

[12]  Harry R. Lewis,et al.  Data Structures and Their Algorithms , 1991 .

[13]  Daniel O. Awduche,et al.  Applicability Statement for Extensions to RSVP for LSP-Tunnels , 2001, RFC.

[14]  Biswanath Mukherjee,et al.  Fixed-alternate routing and wavelength conversion in wavelength-routed optical networks , 2002, TNET.

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

[16]  Arun K. Somani,et al.  Capacity fairness of WDM networks with grooming capabilities , 2000, Other Conferences.

[17]  Koushik Kar,et al.  Minimum interference routing of bandwidth guaranteed tunnels with MPLS traffic engineering applications , 2000, IEEE Journal on Selected Areas in Communications.

[18]  Biswanath Mukherjee,et al.  A novel generic graph model for traffic grooming in heterogeneous WDM mesh networks , 2003, TNET.

[19]  Amit Kumar,et al.  Wavelength conversion in optical networks , 1999, SODA '99.

[20]  Toshihide Ibaraki,et al.  An efficient algorithm for K shortest simple paths , 1982, Networks.