National Changhua University of Education Institutional Repository : Item 987654321/9929
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 6507/11669
造访人次 : 30063747      在线人数 : 560
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/9929

题名: Anycast Routing and Wavelength Assignment Problem on WDM Network
作者: Din, Der-Rong
贡献者: 資訊工程系
关键词: Anycast;Genetic algorithm;NP-hard;Routing and wavelength assignment;WDM
日期: 2005-10
上传时间: 2012-04-30T04:31:50Z
出版者: Oxford University Press
摘要: Anycast refers to the transmission of data from a source node to (any) one member in the group of designed recipients in a network. When the physical 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 three-phase genetic algorithm is proposed to solve it. This algorithm is used to find the close-to-optimal solution. Simulated results show that the proposed algorithm is able to achieve good performance.
關聯: IEICE Transactions on Communications, Special Section on Next Generation Photonic Network Technologies, E88-B(10): 3941-3451
显示于类别:[資訊工程學系] 期刊論文

文件中的档案:

档案 大小格式浏览次数
2050400110005.pdf.pdf13KbAdobe PDF597检视/开启


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

 

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