標題: SOLVING ROUTING AND WAVELENGTH ASSIGNMENT PROBLEM WITH MAXIMUM EDGE-DISJOINT PATHS
作者: Hsu, Chia-Chun
Cho, Hsun-Jung
Fang, Shu-Cherng
運輸與物流管理系 註:原交通所+運管所
Department of Transportation and Logistics Management
關鍵字: Edge-disjoint paths;MEDP;routing and wavelength assignment problem;RWA
公開日期: 1-Apr-2017
摘要: The routing and wavelength assignment (RWA) problem in wavelength-division multiplexing optical networks is critically important for increasing the efficiency of wavelength-routed all-optical networks. Given the physical network structure and a set of connection requests, the problem aims to establishing routes for the requests and assigning a wavelength to each of them, subject to the wavelength continuous and wavelength clash constraints. The objective is to minimize he number of required wavelengths to satisfy all requests. The RWA problem was proven to be NP-hard and has been investigated for decades. In this paper, an algorithm based on the maximum edge-disjoint paths is proposed to tackle the RWA problem. Its performance is verified by experiments on some realistic network topologies. Compared with the state-of-the-art bin-packing based methods and the particle swarm optimization al- gorithm, the proposed method can find the best solution among all testing instances in reasonable computing time.
URI: http://dx.doi.org/10.3934/jimo.2016062
http://hdl.handle.net/11536/145329
ISSN: 1547-5816
DOI: 10.3934/jimo.2016062
期刊: JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION
Volume: 13
起始頁: 1065
結束頁: 1084
Appears in Collections:Articles