Please use this identifier to cite or link to this item:
http://10.1.7.192:80/jspui/handle/123456789/6870
Title: | Routing and Wavelength Assignment(RWA) Problem Solving using Genetic Algorithm |
Authors: | Rajput, Shifali |
Keywords: | EC 2014 Project Report Project Report 2014 EC Project Report EC (Communication) Communication Communication 2014 14MECC 14MECC18 |
Issue Date: | 1-Jun-2016 |
Publisher: | Institute of Technology |
Series/Report no.: | 14MECC18; |
Abstract: | All-optical networks utilizing Wavelength Division Multiplexing (WDM) method are emerging as of next generation internet. In WDM optical networks, every fiber connection is sensibly partitioned into various non-interfering, circuit-switched communication channels known as wavelength channels and are identified by the length of the wave. Routing and Wavelength Assignment (RWA) problem is a established problem in WDM networks. It is further separated into two sub prob- lems: (i) Routing and (ii) Wavelength Assignment. Routing sub problem finds a route from source to destination. Wavelength Assignment sub problem assigns a wavelength to the route established by routing sub problem. The RWA problem is combinatorial by its inclination and belongs to a class of difficult combinatorial optimization problems. The optimal solution to the RWA problem is found with different approaches with routing and wavelength assignment in network. In this work, first is develop code was developed in order to investigate study of various Routing and Wavelength assignment algorithm. Afterwards, the simula- tion was performed in networks with two criteria, i.e. call blocking probability and average hop length. RWA problem is reported in the current literature as an integer linear program- ming problem (ILP) that typically optimizes a various objective functions, it either minimizes the number of amplifiers and the network load or maximizes the number of connections while satisfying power constraints. In this dissertation, the RWA problem was formulated as ILP problem using dif- ferent types of objectives. Essential concern is to establish a loop free lightpath that is insusceptible to signal distortion and cross talk. An attempt is made to ob- tain a feasible solution using genetic algorithm (GA). The parameters considered for optimization are congestion among the individual lightpath requests, connec- tion set up time, the number of intermediate hops traversed and the number of fibers used to honor the established connection requests. ARPANET (Advanced Research Project Agency NETwork) and NSFNET (National Science Foundation NETwork) was considered for simulation in TOMLAB/CPLEX optimization. |
URI: | http://hdl.handle.net/123456789/6870 |
Appears in Collections: | Dissertation, EC (Communication) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
14MECC18.pdf | 14MECC18 | 2.09 MB | Adobe PDF | ![]() View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.