2017
DOI: 10.3934/jimo.2016062
|View full text |Cite
|
Sign up to set email alerts
|

Solving routing and wavelength assignment problem with maximum edge-disjoint paths

Abstract: 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 sati… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
2
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(3 citation statements)
references
References 21 publications
0
2
0
Order By: Relevance
“…Pavarangkoon and Oki [16] proposed a routing and wavelength allocation scheme considering all-optical carrier replication to minimize wavelengths required for multi-carrier distributed networks with wavelength reuse. According to the nondeterministic polynomial (NP) characteristics of the RWA problem in optical networks, Hsu et al [17] proposed an algorithm based on the maximum disjoint path to achieve routing and wavelength allocation.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Pavarangkoon and Oki [16] proposed a routing and wavelength allocation scheme considering all-optical carrier replication to minimize wavelengths required for multi-carrier distributed networks with wavelength reuse. According to the nondeterministic polynomial (NP) characteristics of the RWA problem in optical networks, Hsu et al [17] proposed an algorithm based on the maximum disjoint path to achieve routing and wavelength allocation.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Conventional AO systems are relatively mature and have been successfully applied in fields such as astronomical observations [15]- [19]. However, conventional AO systems have their limitations in scenarios such as strong turbulence on the transmission path, long horizontal transmission distance, faint targets, and microscopic imaging [20]- [25]. WFSless AO technology provides possibilities for applications in these scenarios.…”
Section: Introductionmentioning
confidence: 99%
“…Nevertheless, the general problems of NDP and EDP routing on graphs are computationally hard even in the single wavelength case and a variety of methods have been used to address them in the context of optical communication networks and more general problems. Alongside established methods, such as integer/linear programming and its variants [17][18][19][20][21] bin-packing based approaches [22], Monte Carlo search [23], post-optimization [24] and greedy algorithms [25][26][27][28], a large number of heuristics have also been used to obtain approximate solutions in both problems, among them genetic algorithms [29][30][31], ant colony optimization [32] and particle swarm optimization [33]. Specifically in the area of optical communication networks, it is common to use integer/linear programming and its variants for small networks, to obtain exact results, and a variety of heuristics for larger networks.…”
Section: Introductionmentioning
confidence: 99%