Loading...
|
Please use this identifier to cite or link to this item:
http://ir.ncue.edu.tw/ir/handle/987654321/9965
|
| Title: | Virtual Topology Reconfiguration Problem on Survivable WDM Networks |
| Authors: | Din, Der-Rong |
| Contributors: | 資訊工程系 |
| Keywords: | WDM;survivability;reconfiguration;simulated annealing;genetic algorithm;dedicated path-protected |
| Date: | 2008-08
|
| Issue Date: | 2012-04-30T07:14:25Z
|
| Publisher: | IEEE |
| Abstract: | In this paper, the virtual topology reconfiguration problem (VTRP) on survivable WDM networks with reconfiguration constraint is studied. Given a physical topology, a dedicated path-protected virtual topology and a new traffic demand matrix, the goal of VTRP is to reconfigure the current virtual topology under the pre-specified reconfiguration constraint such that the objective value can be minimized. The objective value considered in this paper is the average weighted propagation delay (AWPD). Because designing a polynomial time algorithm to find the optimal solution of VTRP is impractical when the reconfiguration constraint is larger. In this paper, a simulated annealing (SA) and a genetic algorithm (GA) are proposed to solve this problem. Experiment results of these algorithms are also given. |
| Relation: | In proceedings of IEEE 2008 Third International Conference on Communications and Networking in China, Hangzhou, China, August 25-27, 2008: 805-809 |
| Appears in Collections: | [資訊工程學系] 會議論文
|
Files in This Item:
| File |
Size | Format | |
|---|
| index.html | 0Kb | HTML | 550 | View/Open |
|
All items in NCUEIR are protected by copyright, with all rights reserved.
|
