2019
DOI: 10.1364/jocn.11.000250
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic Resource Allocation in Metro Elastic Optical Networks Using Lyapunov Drift Optimization

Abstract: Consistent growth in the volume and dynamic behavior of traffic mandates new requirements for fast and adaptive resource allocation in metro networks. We propose a dynamic resource allocation technique for adaptive minimization of spectrum usage in metro elastic optical networks. We consider optical transmission as a service specified by its bandwidth profile parameters, which are minimum, average, and maximum required transmission rates. To consider random traffic events, we use a stochastic optimization tech… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
38
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 38 publications
(38 citation statements)
references
References 18 publications
0
38
0
Order By: Relevance
“…Mohammad Hadi et al [10] proposed a new dynamic resource assignment method for the metro elastic optical network. This approach addressed the issues in service level provisions and firmness of network constraints.…”
Section: Routing and Spectrum Assignment Algorithm Based Approachesmentioning
confidence: 99%
See 1 more Smart Citation
“…Mohammad Hadi et al [10] proposed a new dynamic resource assignment method for the metro elastic optical network. This approach addressed the issues in service level provisions and firmness of network constraints.…”
Section: Routing and Spectrum Assignment Algorithm Based Approachesmentioning
confidence: 99%
“…In MPS-NSA [13] used next state aware allocation policy is good for fragmentation spectrum because each request light path connection assigned then it will find to the free space spectrum slot for needed so it reduces the number of blocks. The LDO [10] uses the Lyapunov penalty coefficient that helps to allocate and reallocate the spectrum resources periodically based on intention of traffic flows. Also, LDO provides much better solutions defragmentation and produce the higher spectrum resource utilization under large number of the connection request.…”
Section: The Comparison Of Rsa and Rmsa Algorithmsmentioning
confidence: 99%
“…2) Slice assignment and Spectral Contiguity constraints: We ensure by (4) that if a path p is selected with a specific transmission configuration t, then the required number of slices n t to support the data-rate t (d) is allocated on the path. (5) ensures that each slice on an SLink is allocated to at most one path. Finally, (6) ensures the slices allocated on each link of a path form a contiguous frequency spectrum.…”
Section: A Decision Variablesmentioning
confidence: 99%
“…foreachē ∈Ē in the sorted order do 4 Iē ←FindEmbedding(G,ē, P ī e , Tē) 5 foreach e ∈ p|p ∈ Iē.P do 6 Perform slice assignment using Iē.S…”
Section: A Heuristic Solution For Reliable Vn Embeddingmentioning
confidence: 99%
See 1 more Smart Citation