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

Quality of Service Provisioning and Energy Minimized Scheduling in Software Defined Flexible Optical Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 18 publications
(3 citation statements)
references
References 18 publications
0
3
0
Order By: Relevance
“…The considered traffic range should include short and long term traffic variations, which should be traded off with various QoS aspects, such as type of application and delay constraints, as well as the resulting costs and control overheads. Khodakarami et al [362] have taken steps in this direction by forming a traffic forecasting model for both long-term and short-term forecasts in a wide-area mesh network. Optical lightpaths are then configured based on the overall traffic forecast, while electronic switching capacities are allocated based on short-term forecasts.…”
Section: Sdn Application Layermentioning
confidence: 99%
“…The considered traffic range should include short and long term traffic variations, which should be traded off with various QoS aspects, such as type of application and delay constraints, as well as the resulting costs and control overheads. Khodakarami et al [362] have taken steps in this direction by forming a traffic forecasting model for both long-term and short-term forecasts in a wide-area mesh network. Optical lightpaths are then configured based on the overall traffic forecast, while electronic switching capacities are allocated based on short-term forecasts.…”
Section: Sdn Application Layermentioning
confidence: 99%
“…Ignoring constraints (14), (15), (16) and the penalty term of the goal function (8), the above formulation is equivalent geometric program of the previous MINLP in which expressions (7) and the mentioned posynomial curve fitting have been used for QoS constraint (9). Constraints (14) and (15) and the penalty term are added to guarantee the implicit equality of d q,i = ω q − ω i [11].…”
Section: Transponder Configuartion Problemmentioning
confidence: 99%
“…Flexible resource allocation is an NP-hard problem and it is usually decomposed into several sub-problems with lower complexity [9]. Following this approach, we decompose the resource allocation problem into 1) Routing and Ordering Sub-problem (ROS) and 2) Transponder Configuration Subproblem (TCS) and mainly focus on TCS which is more complex and time-consuming [10], [11].…”
Section: Introductionmentioning
confidence: 99%