資料載入中.....
|
請使用永久網址來引用或連結此文件:
http://ir.ncue.edu.tw/ir/handle/987654321/9965
|
題名: | Virtual Topology Reconfiguration Problem on Survivable WDM Networks |
作者: | Din, Der-Rong |
貢獻者: | 資訊工程系 |
關鍵詞: | WDM;survivability;reconfiguration;simulated annealing;genetic algorithm;dedicated path-protected |
日期: | 2008-08
|
上傳時間: | 2012-04-30T07:14:25Z
|
出版者: | IEEE |
摘要: | 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. |
關聯: | In proceedings of IEEE 2008 Third International Conference on Communications and Networking in China, Hangzhou, China, August 25-27, 2008: 805-809 |
顯示於類別: | [資訊工程學系] 會議論文
|
文件中的檔案:
檔案 |
大小 | 格式 | 瀏覽次數 |
index.html | 0Kb | HTML | 601 | 檢視/開啟 |
|
在NCUEIR中所有的資料項目都受到原著作權保護.
|