English  |  正體中文  |  简体中文  |  Items with full text/Total items : 6480/11652
Visitors : 20126542      Online Users : 189
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/9929

Title: Anycast Routing and Wavelength Assignment Problem on WDM Network
Authors: Din, Der-Rong
Contributors: 資訊工程系
Keywords: Anycast;Genetic algorithm;NP-hard;Routing and wavelength assignment;WDM
Date: 2005-10
Issue Date: 2012-04-30T04:31:50Z
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 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.
Relation: IEICE Transactions on Communications, Special Section on Next Generation Photonic Network Technologies, E88-B(10): 3941-3451
Appears in Collections:[資訊工程學系] 期刊論文

Files in This Item:

File SizeFormat
2050400110005.pdf.pdf13KbAdobe PDF478View/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