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

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

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/9934

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

Title:	A Hybrid Method for Solving ARWA Problem on WDM Network
Authors:	Din, Der-Rong
Contributors:	資訊工程系
Keywords:	Anycast;Genetic algorithm;NP-hard;Routing and wavelength assignment;Simulated annealing;WDM
Date:	2007-01
Issue Date:	2012-04-30T04:32:26Z
Publisher:	Elsevier BV
Abstract:	Anycast refers to the transmission of data from a source node to (any) one member in the group of designed recipients in a network. In WDM network, the anycast requests can be used as an optimization tool to ensure survivability. If the anycast requests can be routed and delivered carefully, it is enough to find more free lightpath (or wavelengths) to other traffic (unicast or multicast). When the WDM network and the set of anycast requests are given, the anycast routing and wavelength assignment (ARWA) problem is to find a set of light-paths, one for each source, for anycasting messages to any one of the member in the anycast destination group such that not any path using the same wavelength passes through the same link. The goal of the ARWA problem is to minimize the number of used wavelengths. In this paper, the ARWA problem is formulated and studied; since ARWA problem is NP-hard, a hybrid method which combines simulated annealing and genetic algorithm technologies is proposed to solve it. In the proposed algorithm, the random routing method is used to generate the routing path from source to destination, heuristic algorithm is used to find the assigning wavelength of routing path. Nine types of perturbation schemes are proposed to generate the neighboring configuration, these perturbation schemes can avoid the proposed algorithm to trap into local optimum. Moreover, iterative improving technique is used to reduce the computing time for finding the new wavelength assignment. Simulated results show that the proposed algorithm can get better performance than other GA and heuristic algorithms.
Relation:	Computer Communications, 30(2): 385-395
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	594	View/Open

Loading...