National Changhua University of Education Institutional Repository : Item 987654321/9940

English | 正體中文 | 简体中文 | Items with full text/Total items : 6507/11669
Visitors : 30014136 Online Users : 440

RC Version 3.2 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.

Scope Adv. Search

Login ‧ Upload ‧ Help ‧ About ‧ Administer

NCUEIR > College of Engineering > Department and Graduate Institute of Computer Science and Information Engineering > Periodical Articles > Item 987654321/9940

Please use this identifier to cite or link to this item: http://ir.ncue.edu.tw/ir/handle/987654321/9940

Title:	A Genetic Algorithm for Solving Virtual Topology Reconfiguration Problem in Survivable WDM Networks with Reconfiguration Constraint
Authors:	Din, Der-Rong;Chiu, Yu-Sheng
Contributors:	資訊工程系
Keywords:	WDM;Survivability;Virtual topology reconfiguration;Genetic algorithm;Dedicated path-protection
Date:	2008-06
Issue Date:	2012-04-30T04:32:43Z
Publisher:	Elsevier BV
Abstract:	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.
Relation:	Computer Communications, 31(10): 2520-2533
Appears in Collections:	[Department and Graduate Institute of Computer Science and Information Engineering] Periodical Articles

Files in This Item:

File	Size	Format
index.html	0Kb	HTML	963	View/Open

Loading...