2017
DOI: 10.1007/s11082-017-1022-7
|View full text |Cite
|
Sign up to set email alerts
|

New bi-level programming model for routing and spectrum assignment in elastic optical network

Abstract: The routing and spectrum assignment problems in elastic optical networks are well-known NP-hard problem, and are even more complex and challenging when the energy consumption is taken into account. To tackle this challenging problem, we establish a bi-level programming model with the energy consumption of the optical networks and the maximum index of used frequency slots as the leader's and follower's objectives to be minimized, respectively, which are used to determine the optimal schemes of routing and spect… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
5
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
5
1
1

Relationship

1
6

Authors

Journals

citations
Cited by 9 publications
(5 citation statements)
references
References 25 publications
0
5
0
Order By: Relevance
“…In the manycast routing and spectrum assignment problem, we should determine the optimal scheme of routing and spectrum assignment. For the spectrum assignment, it is much easier to assign spectra using first fit strategy [6] than using the method with encoding. Thus, it only needs to encode for routing scheme.…”
Section: Encoding Schemementioning
confidence: 99%
See 1 more Smart Citation
“…In the manycast routing and spectrum assignment problem, we should determine the optimal scheme of routing and spectrum assignment. For the spectrum assignment, it is much easier to assign spectra using first fit strategy [6] than using the method with encoding. Thus, it only needs to encode for routing scheme.…”
Section: Encoding Schemementioning
confidence: 99%
“…Orthogonal frequency division multiplexing is a multi-carrier modulation technology. It can distribute the high-speed data stream into several orthogonal low-speed subcarriers [6]. The adjacent subcarriers have the spectrum overlapping of a subcarrier bandwidth.…”
Section: Introductionmentioning
confidence: 99%
“…In [6], a bilevel programming model was used to study the distribution center problem where the upper and lower layers are to find the minimum transportation cost from factories to distribution centers and from distribution centers to customers, respectively, which was solved by four algorithms to find an optimum balance between the two layers. In order to determine the optimal schemes of routing and spectrum assignments, Xuan et al [7] established a bi-level programming model with the energy consumption of the optical networks and the maximum index of used frequency slots as the upper's and lower's objectives to be minimized, respectively, and designed a genetic algorithm with tailormade crossover, mutation, and local search operator to solve the model. In the study of the proactive countermeasure selection problem for complex information and communication technology systems, Mahjoub et al [32] proposed a bi-level programming model with a compact formulation based on primal-dual optimality conditions and an extended formulation employing an exponential number of path constraints.…”
Section: Related Workmentioning
confidence: 99%
“…In this work, with the purpose of improving the satisfaction for both demanders and providers, we propose a novel selection method based on bi-level programming model [5][6][7] to meet interests of both sides. In the bilevel programming selection method, both demanders and providers are evaluated by opposite side according to their individual needs or interests.…”
Section: Introductionmentioning
confidence: 99%
“…The routing and spectrum assignment (RSA) problem (Wang et al, 2011), plays an important role in design of modern elastic optical networks (EON) (Chatterjee and Oki, 2020;Alyatama et al, 2020;Xuan et al, 2017). It is very similar to the routing and wavelength assignment (RWA) problem well-described in the literature of wavelength division multiplexing (WDM) networks Ramaswami et al (2009).…”
Section: Introductionmentioning
confidence: 99%