Application of Ant Colony Optmization to the Routing and Wavelength Assignment problem

dc.contributor.advisorLa, Richard J.en_US
dc.contributor.authorKim, Eunmien_US
dc.contributor.departmentElectrical Engineeringen_US
dc.contributor.publisherDigital Repository at the University of Marylanden_US
dc.contributor.publisherUniversity of Maryland (College Park, Md.)en_US
dc.description.abstractThe transmission capacity of a link in today's optical networks has increased significantly due to wavelength-division multiplexing (WDM) technology. A unique feature of optical WDM networks is tight coupling between routing and wavelength selection. A lightpath is implemented by selecting a set or sequence of physical links between the source and destination nodes, and reserving a wavelength on each of these links for the lightpath. Thus, in establishing an optical connection we must deal with both routing (selecting a suitable path, i.e., sequence of physical links) and wavelength assignment (allocating an available wavelength for the connection (source-destination pair)). The resulting problem is referred to as the routing and wavelength assignment (RWA) problem, and is significantly more difficult than the routing problem in electrical networks. In this thesis, we offer a new heuristic algorithm to solve the RWA problem using Ant Colony Optimization (ACO) meta-heuristic. An edge disjoint path problem and a partition coloring problem are used to formulate the algorithm.en_US
dc.format.extent712298 bytes
dc.subject.pqcontrolledEngineering, Electronics and Electricalen_US
dc.titleApplication of Ant Colony Optmization to the Routing and Wavelength Assignment problemen_US


Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
695.6 KB
Adobe Portable Document Format