National Changhua University of Education Institutional Repository : Item 987654321/9941
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 6507/11669
造访人次 : 29939642      在线人数 : 494
RC Version 3.2 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 进阶搜寻

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.ncue.edu.tw/ir/handle/987654321/9941

题名: Solving virtual topology reconfiguration problem on survivable WDM networks by using simulated annealing and genetic algorithms
作者: Din, Der-Rong
贡献者: 資訊工程系
关键词: WDM;Survivability;Reconfiguration;Simulated annealing algorithm;Genetic algorithm;Dedicated path-protection
日期: 2009
上传时间: 2012-04-30T04:32:44Z
出版者: Kluwer Academic Publishers
摘要: 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.
關聯: Photonic Network Communications, 18(1): 1-13
显示于类别:[資訊工程學系] 期刊論文

文件中的档案:

档案 大小格式浏览次数
index.html0KbHTML596检视/开启


在NCUEIR中所有的数据项都受到原著作权保护.

 

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