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

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

Title: A Simulated Annealing Algorithm for Finding Minimal Wavelength on WDM Ring
Authors: Din, Der-Rong
Contributors: 資訊工程系
Keywords: Integer programming;Routing and wavelength assignment;Simulated annealing;WDM ring
Date: 2004-07
Issue Date: 2012-04-30T04:31:37Z
Publisher: CRL Publishing Ltd.
Abstract: The routing ond wavelength assignment (RWA) problem on wavelength division multiplexing (WDM) ring networks without wavelength conversion is considered in this paper. When the physical network and required connections are given, RWA is the problem to select a suitable path and wavelength among the many possible choices for each connection such that not any paths using the same wavelength pass through the same link. This problem has been proven to be the NP-hard problem. In the paper, a simulated annealing (SA) algorithm is proposed to solve it. Experimental results indicate that SA is robust for this problem.
Relation: Computer Systems Science & Engineering, 19(4): 253-262
Appears in Collections:[資訊工程學系] 期刊論文

Files in This Item:

File SizeFormat
2050400110004.pdf.pdf12KbAdobe PDF507View/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