Probability based dynamic-alternate routing and the corresponding converter placement algorithm in all-optical WDM networks

This paper proposes a new dynamic-alternate routing algorithm and its corresponding converter placement algorithm in order to reduce the connection blocking probability for all-optical WDM networks. The main idea in the proposed dynamic-alternate routing algorithm is to try to route the traffics according to a predefined optimal probability distribution. The problem for finding the optimal probability distribution was shown as a convex optimization problem. The problem can be solved by flow deviation method or other standard optimization techniques. Simulation results show that the proposed routing algorithm yields lower connection blocking probabilities than the previous works. The proposed routing algorithm produces similar traffic pattern as the optimal traffic pattern. The similarity between the traffic pattern produced by the proposed dynamic-alternate routing algorithm and the optimal traffic pattern can be further employed for solving other network designing problems such as converter placement problem. Since the optimal traffic pattern can be easily predicted, the optimal traffic pattern which minimizes the blocked traffic intensity is utilized for finding the locations of wavelength converters. The key idea is to place the wavelength converters at the nodes where they are needed most. Simulations have been performed to study the performance of the proposed wavelength converter placement method. The simulation results have shown that the proposed placement method combined with the proposed probability based dynamic-alternate routing algorithm yields smaller connection blocking probability than the two converter placement methods with their corresponding alternate routing algorithms.

[1]  Hussein T. Mouftah,et al.  Optical WDM Networks: Concepts and Design Principles , 2004 .

[2]  Yongtao Gong,et al.  A novel adaptive RWA algorithm in wavelength-routed network , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[3]  Masayuki Murata,et al.  An efficient algorithm for converter placement in dynamic WDM networks , 2005, IEEE International Conference on Communications, 2005. ICC 2005. 2005.

[4]  Masayuki Murata,et al.  Performance of alternate routing methods in all-optical switching networks , 1997, Proceedings of INFOCOM '97.

[5]  Oleg Gusak,et al.  Analysis of blocking probability in WDM all-optical networks with non-Poisson traffic statistics , 1999, International Conference on Transparent Optical Networks (Cat. No. 99EX350).

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

[7]  Masao Fukushima,et al.  A NONSMOOTH OPTIMIZATION APPROACH TO NONLINEAR MULTICOMMODITY NETWORK FLOW PROBLEMS , 1984 .

[8]  Debasis Mitra,et al.  Comparative evaluations of randomized and dynamic routing strategies for circuit-switched networks , 1991, IEEE Trans. Commun..

[9]  D. Varberg.  Convex Functions , 1973 .

[10]  Andre Girard,et al.  Routing and Dimensioning in Circuit-Switched Networks , 1990 .

[11]  C. Siva Ram Murthy,et al.  WDM Optical Networks: Concepts, Design, and Algorithms , 2001 .

[12]  Jacek Gondzio,et al.  Solving nonlinear multicommodity flow problems by the analytic center cutting plane method , 1997, Math. Program..

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

[14]  Charles A. Brackett,et al.  Dense Wavelength Division Multiplexing Networks: Principles and Applications , 1990, IEEE J. Sel. Areas Commun..

[15]  Nico M. van Dijk.  Queueing networks and product forms - a systems approach , 1993, Wiley-Interscience series in systems and optimization.

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

[17]  Kevin H. Liu.  WDM Optical Networks , 2003 .

[18]  Suresh Subramaniam,et al.  The benefits of wavelength conversion in WDM networks with non-Poisson traffic , 1999, IEEE Communications Letters.

[19]  Udi Manber,et al.  Introduction to algorithms - a creative approach , 1989 .

[20]  Su Fong Chien,et al.  Optimal placement of wavelength converters in WDM networks using particle swarm optimizer , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[21]  Maurice Gagnaire,et al.  Lightpath Rerouting Strategies in WDM All-Optical Networks Under Scheduled and Random Traffic , 2010, IEEE/OSA Journal of Optical Communications and Networking.

[22]  Hwa-Chun Lin,et al.  Finding Routing Paths for Alternate Routing in All-Optical WDM Networks , 2008, Journal of Lightwave Technology.

[23]  Ahmed Mokhtar,et al.  Adaptive wavelength routing in all-optical networks , 1998, TNET.

[24]  Seung-Woo Seo,et al.  A binary (0-1) linear program formulation for the placement of limited-range wavelength converters in wavelength-routed WDM networks , 2005 .

[25]  Mostafa A. Bassiouni,et al.  Dependency-based analytical model for computing connection blocking rates and its application in the sparse placement of optical converters , 2006, IEEE Transactions on Communications.

[26]  Ratul Mahajan,et al.  Measuring ISP topologies with rocketfuel , 2002, SIGCOMM 2002.

[27]  Luying Zhou,et al.  Provisioning lightpaths and computing resources for location-transparent scheduled grid demands , 2008, 2008 International Conference on Optical Network Design and Modeling.

[28]  Mohsen Guizani,et al.  Routing in all-optical DWDM networks with sparse wavelength conversion capabilities , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[29]  Ratul Mahajan,et al.  Measuring ISP topologies with rocketfuel , 2002, TNET.

[30]  Luigi Fratta,et al.  The flow deviation method: An approach to store-and-forward communication network design , 1973, Networks.

[31]  Bo Li,et al.  Wavelength converter placement under different RWA algorithms in wavelength-routed all-optical networks , 2003, IEEE Trans. Commun..

[32]  Kumar N. Sivarajan,et al.  Computing approximate blocking probabilities in wavelength routed all-optical networks with limited-range wavelength conversion , 2000, IEEE Journal on Selected Areas in Communications.

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

[34]  Maurice Gagnaire,et al.  Network Dimensioning under Scheduled and Random Lightpath Demands in All-Optical WDM Networks , 2007, IEEE Journal on Selected Areas in Communications.

[35]  Bo Li,et al.  Dynamic routing and wavelength assignment in the presence of wavelength conversion for all-optical networks , 2005, IEEE/ACM Transactions on Networking.

[36]  Kumar N. Sivarajan,et al.  Blocking in all-optical networks , 2004, IEEE/ACM Transactions on Networking.

[37]  Ling Li,et al.  Dynamic wavelength routing using congestion and neighborhood information , 1999, TNET.

[38]  George N. Rouskas,et al.  A path decomposition approach for computing blocking probabilities in wavelength-routing networks , 2000, TNET.

[39]  Yuanyuan Yang,et al.  Network-wide blocking probability in sparse limited wavelength convertible WDM networks , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[40]  Hwa-Chun Lin,et al.  Traffic Intensity Based Alternate Routing for All-Optical WDM Networks , 2008 .

[41]  Deying Li,et al.  Placement of wavelength converters for minimal wavelength usage in WDM networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.