2017 IEEE International Conference on Communications (ICC) 2017
DOI: 10.1109/icc.2017.7997377
|View full text |Cite
|
Sign up to set email alerts
|

Inscribed rectangles algorithm for routing, core and spectrum assignment for SDM optical networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2018
2018
2020
2020

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 12 publications
0
1
0
Order By: Relevance
“…A batch can be postponed until the closest time at which the deadline still can be reached. the Connected-Component Labeling (CCL) [Moura and da Fonseca 2016] and Inscribed Rectangle (IR) [Moura and da Fonseca 2017] RCSA algorithms to deal with allocation of batches of requests. We used the Multiple Knapsack Problem (MKP) to choose a set of slots in the spectrum.…”
Section: Batch Groomingmentioning
confidence: 99%
“…A batch can be postponed until the closest time at which the deadline still can be reached. the Connected-Component Labeling (CCL) [Moura and da Fonseca 2016] and Inscribed Rectangle (IR) [Moura and da Fonseca 2017] RCSA algorithms to deal with allocation of batches of requests. We used the Multiple Knapsack Problem (MKP) to choose a set of slots in the spectrum.…”
Section: Batch Groomingmentioning
confidence: 99%