National Changhua University of Education Institutional Repository : Item 987654321/9940
English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 6498/11670
造訪人次 : 26049174      線上人數 : 115
RC Version 3.2 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 進階搜尋


題名: A Genetic Algorithm for Solving Virtual Topology Reconfiguration Problem in Survivable WDM Networks with Reconfiguration Constraint
作者: Din, Der-Rong;Chiu, Yu-Sheng
貢獻者: 資訊工程系
關鍵詞: WDM;Survivability;Virtual topology reconfiguration;Genetic algorithm;Dedicated path-protection
日期: 2008-06
上傳時間: 2012-04-30T04:32:43Z
出版者: Elsevier BV
摘要: In wavelength division multiplexing (WDM) networks, the performance of the virtual topology designed for a pre-specified traffic pattern can be improved by performing virtual topology reconfiguration. Simultaneously, the provision of survivability of WDM networks is important, because the transmission of huge data should be protected when fiber fails. Thus, the combination of survivability and reconfiguration is an important issue on WDM networks.In this paper, the virtual topology reconfiguration problem (VTRP) in survivable WDM networks with reconfiguration constraint is studied. Given the physical topology, dedicated path-protection virtual topology and a new traffic demand matrix, the goal of VTRP is to reconfigure current virtual topology under the pre-specified reconfiguration constraint so that the objective cost can be minimized. The object cost of VTRP 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 genetic algorithm (GA) is proposed to solve this problem. Experiment results reveal that the objective cost can be decreased effectively by using the proposed genetic algorithm.
關聯: Computer Communications, 31(10): 2520-2533
顯示於類別:[資訊工程學系] 期刊論文


檔案 大小格式瀏覽次數



DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回饋