Particle swarm optimization-based DRWA for wavelength continuous WDM optical networks using a novel fitness function

Greater demand of bandwidth and network usage flexibility from customers along with new automated means for network resource management has led to the concept of dynamic resource provisioning in WDM optical networks where unlike the traditional static channel assignment process, network resources can be assigned dynamically. This paper examines a novel particle swarm optimization (PSO)-based scheme to solve dynamic routing and wavelength assignment (dynamic RWA) process needed to provision optical channels for wavelength continuous Wavelength Division Multiplexed (WDM) optical network without any wavelength conversion capability. The proposed PSO scheme employs a novel fitness function which is used during quantization of solutions represented by respective particles of the swarm. The proposed fitness function takes into account the normalized path length of the chosen route and the normalized number of free wavelengths available over the whole route, enabling the PSO-based scheme to be self-tuning by minimizing the need to have a dynamic algorithmic parameter ‘α’ needed for better performance in terms of blocking probability of the connection requests. Simulation results show better performance of the proposed PSO scheme employing novel fitness function for solving dynamic RWA problem, not only in terms of connection blocking probability but also route computation time as compared to other evolutionary schemes like genetic algorithms.

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

[2]  Biswanath Mukherjee,et al.  Optical Communication Networks , 1997 .

[3]  Roberto Battiti,et al.  The gregarious particle swarm optimizer (G-PSO) , 2006, GECCO '06.

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

[5]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[6]  O. Weck,et al.  A COMPARISON OF PARTICLE SWARM OPTIMIZATION AND THE GENETIC ALGORITHM , 2005 .

[7]  Minyi Guo,et al.  A Genetic Algorithm for Dynamic Routing and Wavelength Assignment in WDM Networks , 2004, ISPA.

[8]  Russell C. Eberhart,et al.  Comparison between Genetic Algorithms and Particle Swarm Optimization , 1998, Evolutionary Programming.

[9]  Dingwei Wang,et al.  Genetic algorithms for solving shortest path problems , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[10]  Wenjun Zhang,et al.  Dissipative particle swarm optimization , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[11]  N. C. Sahoo,et al.  Research Article Efficient Computation of Shortest Paths in Networks Using Particle Swarm Optimization and Noising Metaheuristics , 2007 .

[12]  Rubén M. Lorenzo,et al.  Dynamic Routing and Wavelength Assignment in Optical Networks by Means of Genetic Algorithms , 2004, Photonic Network Communications.

[13]  C. Mouser,et al.  Comparing genetic algorithms and particle swarm optimisation for an inverse problem exercise , 2005 .

[14]  Yue Shi,et al.  A modified particle swarm optimizer , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[15]  Bryant A. Julstrom,et al.  A weighted coding in a genetic algorithm for the degree-constrained minimum spanning tree problem , 2000, SAC '00.

[16]  D.H. Werner,et al.  Particle swarm optimization versus genetic algorithms for phased array synthesis , 2004, IEEE Transactions on Antennas and Propagation.

[17]  Russell C. Eberhart,et al.  A new optimizer using particle swarm theory , 1995, MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science.

[18]  Donald E. Grierson,et al.  Comparison among five evolutionary-based optimization algorithms , 2005, Adv. Eng. Informatics.

[19]  Masaharu Munetomo,et al.  A migration scheme for the genetic adaptive routing algorithm , 1998, SMC'98 Conference Proceedings. 1998 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.98CH36218).

[20]  Colin G. Johnson,et al.  Varying the Topology and the Probability of Re-initialization in Dissipative Particle Swarm Optimisation , 2005 .

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

[22]  M. Clerc,et al.  The swarm and the queen: towards a deterministic and adaptive particle swarm optimization , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[23]  Imrich Chlamtac,et al.  Analysis of blocking probability for distributed lightpath establishment in WDM optical networks , 2005, IEEE/ACM Transactions on Networking.