Converter placement in all-optical networks using genetic algorithms

Authors:
C. Vijayanand;M. Shiva Kumar;K. R. Venugopal;P. Sreenivasa Kumar
Affiliations:
Department of Computer Science and Engineering, Indian Institute of Technology Madras, Chennai 600 036, India;Department of Computer Science and Engineering, Indian Institute of Technology Madras, Chennai 600 036, India;Department of Computer Science and Engineering, Indian Institute of Technology Madras, Chennai 600 036, India;Department of Computer Science and Engineering, Indian Institute of Technology Madras, Chennai 600 036, India
Venue:
Computer Communications
Year:
2000

Citing 6
Cited 5

Routing and wavelength assignment in all-optical networks

IEEE/ACM Transactions on Networking (TON)
All-optical networks with sparse wavelength conversion

IEEE/ACM Transactions on Networking (TON)
Performance Analysis of Wavelength Converters in WDM Wavelength Routed Optical Networks

HIPC '98 Proceedings of the Fifth International Conference on High Performance Computing
A new model for optimal routing and wavelength assignment in wavelength division multiplexed optical networks

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Models of blocking probability in all-optical networks with and without wavelength changers

IEEE Journal on Selected Areas in Communications
Wavelength conversion in WDM networking

IEEE Journal on Selected Areas in Communications

Strictly nonblocking grooming of dynamic traffic in unidirectional SONET/WDM rings using genetic algorithms

Computer Networks: The International Journal of Computer and Telecommunications Networking
Computational intelligence in photonics technology and optical networks: A survey and future perspectives

Information Sciences: an International Journal
Routing and wavelength converter allocation in WDM networks: a multi-objective evolutionary optimization approach

Photonic Network Communications
Differential evolution optimization applied to the wavelength converters placement problem in all optical networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Traffic grooming in unidirectional WDM ring networks using genetic algorithms

Computer Communications

Quantified Score

Hi-index	0.24

Visualization

Abstract

Wavelength routed optical networks have emerged as a technology that can effectively utilize the enormous bandwidth of the optical fiber. Wavelength converters play an important role in enhancing the fiber utilization and reducing the overall call blocking probability of the network. Placement of wavelength converters is an NP-complete problem (K.C. Lee, V.O.K. Li, IEEE Journal of Lightwave Technology 11(5/6) (1993) 962-970) in an arbitrary mesh network. In this paper, new Integer Linear Program (ILP) formulations have been proposed for the static and dynamic routing and wavelength assignment problem to reduce the number of conversions. We use Genetic Algorithms (GAs) for placing limited range wavelength converters in arbitrary mesh wavelength routed optical networks. The objective is to achieve near optimal placement of full and limited range wavelength converters resulting in reduced blocking probabilities and low distortion of the optical signal. Certain heuristics are used to obtain starting solutions for the GAs to enable it to converge faster. The results obtained using GAs are compared with the heuristic method of placement. We study the range of loads for which converters are useful. We observe that limited range converters placed near optimally at a few nodes can provide almost the same blocking probability as full range wavelength converters placed at all the nodes and that increasing the number of converters yields only a marginal improvement in blocking probability. We also observe that uniform placement of converters can be adopted in ring networks at low offered loads. We study the effect of uniform placement at higher loads and suggest that when used with reservation in the routing algorithm, converters ensure fairness to all nodes. Simulations have been carried out on a 12-node ring network and 14-node NSFNET.