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


题名: A Hybrid Method for Solving ARWA Problem on WDM Network
作者: Din, Der-Rong
贡献者: 資訊工程系
关键词: Anycast;Genetic algorithm;NP-hard;Routing and wavelength assignment;Simulated annealing;WDM
日期: 2007-01
上传时间: 2012-04-30T04:32:26Z
出版者: Elsevier BV
摘要: 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.
關聯: Computer Communications, 30(2): 385-395
显示于类别:[資訊工程學系] 期刊論文


档案 大小格式浏览次数



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