Kumar, Birendra (2013) Review of routing and wavelength assignment problem. BTech thesis.
In today’s internet world there is a growing demand of network bandwidth. Where traditional copper fibers offer very less bandwidth, optical fibers can offer very lager
bandwidth. So, there is a growing sense of using optical fibers. Optical networks generally use wavelength division multiplexing (WDM) technique, which is the backbone of future generation internet. In WDM networks fibers are logically divided into non-interfering, circuit-switched communication channels.
In optical network Routing and Wavelength Assignment (RWA) problem is a typical problem. This can be seen as a conjunction of two problems, one is Routing and other one is Wavelength Assignment. First one finds a route from source to destination for requested connection and the next one assigns a wavelength to this route. The nature of RWA problem is NP-complete. Hence, heuristic approaches
suits well for this class of problems.
RWA problem can be formulated as Integer linear programming (ILP) problem. This type of problem focuses on optimizing a single objective. Here objectives may be minimizing the number of amplifiers or maximizing the number of connections or minimizing the number of wavelength used. But our primary objective in RWA problem is to establish a loop free path which minimizes the crosstalk. To achieve this objective we are taking the help of genetic algorithm (GA). Congestion among the individual lightpath request will be the parameter for the application of genetic
|Item Type:||Thesis (BTech)|
|Uncontrolled Keywords:||wavelength division multiplexing, Routing and Wavelength Assignment|
|Subjects:||Engineering and Technology > Computer and Information Science > Networks|
|Divisions:||Engineering and Technology > Department of Computer Science|
|Deposited By:||Hemanta Biswal|
|Deposited On:||15 Jan 2014 08:50|
|Last Modified:||15 Jan 2014 08:50|
|Supervisor(s):||Turuk, A K|
Repository Staff Only: item control page