Loading...
|
Please use this identifier to cite or link to this item:
http://ir.ncue.edu.tw/ir/handle/987654321/9941
|
| Title: | Solving virtual topology reconfiguration problem on survivable WDM networks by using simulated annealing and genetic algorithms |
| Authors: | Din, Der-Rong |
| Contributors: | 資訊工程系 |
| Keywords: | WDM;Survivability;Reconfiguration;Simulated annealing algorithm;Genetic algorithm;Dedicated path-protection |
| Date: | 2009
|
| Issue Date: | 2012-04-30T04:32:44Z
|
| Publisher: | Kluwer Academic Publishers |
| Abstract: | In a Wavelength Division Multiplexing (WDM) network, the performance of the virtual topology (VT) designed for a pre-specified traffic pattern can be improved by performing virtual topology reconfiguration (VTR). Simultaneously, the provision of survivability of WDM networks
is important, because the transmission of huge data should be protected when a fiber fails. Thus, the combination of survivability
and reconfiguration is an important issue inWDM networks. In this paper, the Virtual Topology Reconfiguration Problem (VTRP) in survivableWDMnetworkswith a reconfiguration constraint is studied. Given the physical topology, dedicated path-protection VT, and a new traffic demand matrix, the goal of VTRP is to reconfigure the current VT under the pre-specified reconfiguration constraint so that the objective value can be minimized. The object cost ofVTRP is the average weighted propagation delay (AWPD). Because designing a polynomial time algorithm to find the optimal solution of VTRP is impractical, in this paper, a simulated annealing (SA) algorithm and a genetic algorithm (GA) are
proposed to solve this problem. Experimental results of these algorithms are also given. |
| Relation: | Photonic Network Communications, 18(1): 1-13 |
| Appears in Collections: | [資訊工程學系] 期刊論文
|
Files in This Item:
| File |
Size | Format | |
|---|
| index.html | 0Kb | HTML | 359 | View/Open |
|
All items in NCUEIR are protected by copyright, with all rights reserved.
|
