English  |  正體中文  |  简体中文  |  Items with full text/Total items : 6481/11653
Visitors : 23343726      Online Users : 295
RC Version 3.2 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Adv. Search
LoginUploadHelpAboutAdminister

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

Title: Anycast Routing Problem on WDM Ring Network
Authors: Din, Der-Rong
Contributors: 資訊工程系
Keywords: Anycast routing;Heuristic algorithm;NP-hard;Simulated annealing;WDM ting
Date: 2005-04
Issue Date: 2012-04-30T04:32:03Z
Publisher: Oxford University Press
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. 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.
Relation: IEICE Transactions on Communications, Special Issue on Internet Technology V, E88-B(4): 1347-1354
Appears in Collections:[資訊工程學系] 期刊論文

Files in This Item:

File SizeFormat
2050400110006.pdf.pdf13KbAdobe PDF539View/Open


All items in NCUEIR are protected by copyright, with all rights reserved.

 


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