National Changhua University of Education Institutional Repository : Item 987654321/9931
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 6491/11663
造访人次 : 23792927      在线人数 : 126
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/9931

题名: Anycast Routing Problem on WDM Ring Network
作者: Din, Der-Rong
贡献者: 資訊工程系
关键词: Anycast routing;Heuristic algorithm;NP-hard;Simulated annealing;WDM ting
日期: 2005-04
上传时间: 2012-04-30T04:32:03Z
出版者: 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 WDM anycast routing problem (WARP) is to find a set of light-paths, one for each source, for anycasting messages to 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 WARP is to minimize the number of used wavelengths. In this paper, the WARP is formulated and studied, since WARP is NP-hard, several heuristic algorithms and a hybrid method which combines heuristic and simulated annealing techniques are proposed to solve it. These algorithms are used to find the close-to-optimal solution. Simulated results show that the proposed algorithms are able to achieve good performance.
關聯: IEICE Transactions on Communications, Special Issue on Internet Technology V, E88-B(4): 1347-1354
显示于类别:[資訊工程學系] 期刊論文

文件中的档案:

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


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

 


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