Font Size: a A A

The Study And Realization Algorithm On Routing And Wavelength Assignment Problem

Posted on:2007-11-27Degree:MasterType:Thesis
Country:ChinaCandidate:Z J LiFull Text:PDF
GTID:2178360185974707Subject:Software engineering
Abstract/Summary:PDF Full Text Request
In optical network based on WDM(Wavelength Division Multiplexingl), traffic engineering (TE) is mapping traffic flows on the physical topology of optical network according to user's requirement, in order to optimize the network utility, avoid jamming and improve the network reliability. Accompany with the continuous development of OXC (Optical Cross Connect) and OADM (Optical Add/Drop Multiplexer), optical network based on DWDM (Dense Wavelength Division Multiplexing) is no longer restricted in the peer-to-peer transmission, but it spans to the area of network interconnecting. Thus, the network resource allocation based on need and optimization is desperate. Resource allocation based on need is to allocate limited network resource according to the need of different users, in order to sate various applications. The aim of optimization is to allocate resource more reasonably, in order to minimize the total cost of the whole net, to maximize the utility and to achieve the load balance. To solve these two problems mentioned above and to sate the need of traffic QoS, TE is needed in the WDM optical network.This paper describes solving the static RWA(Routing and Wavelength Assignment) problem, an aspect of TE problem in optical network, with simulated anneal algorithm. The static RWA problem is to allocate proper route and wavelength for a set of link requests with the concern of optimization, on a network whose physical topology is known. To compare the results of simulated anneal algorithm on the static RWA problem, a heuristic algorithm is introduced as reference.In this paper, a network model based on real network situation is studied. Then the result of certain k-shortest path algorithm is introduced as a set to be chosen by both the simulated anneal algorithm and heuristic algorithm, concerning the end-to-end traffic requirement and restriction on link bandwidth. Afterwards, the effect of the value k on the outcome of the simulated anneal algorithm is researched. The network resource is allocated, while the study of link protection problem on traffic routing is introduced and two types of protection, shared protection and dedicated protection, are carried out. Based on the researches done above, two ways of optimization, one for minimized total cost and one for best load balance, are performed. And the final results of simulated anneal algorithm and heuristic algorithm are compared and analyzed.To confirm and evaluate the correctness and performance of simulated anneal...
Keywords/Search Tags:WDM, RWA, Constrained-Routing Algorithm, Simulated Anneal Algorithm
PDF Full Text Request
Related items