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

Optimal Route, Spectrum, and Modulation Level Assignment in Split-Spectrum-Enabled Dynamic Elastic Optical Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
23
0
5

Year Published

2015
2015
2020
2020

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 48 publications
(28 citation statements)
references
References 11 publications
0
23
0
5
Order By: Relevance
“…The generated sub-lightpaths do not require to be allocated contiguously in the spectrum, , and we assume that they can be routed along different paths (i.e., multi-path slice-ability). In this way slice-ability provides the maximum benefit to the lightpath blocking probability [36], [37]. However, according with the considered SBVT architecture [12], all the sublightpaths must be served by the same SBVT at both source and destination nodes.…”
Section: Rsta-s Schemementioning
confidence: 99%
See 1 more Smart Citation
“…The generated sub-lightpaths do not require to be allocated contiguously in the spectrum, , and we assume that they can be routed along different paths (i.e., multi-path slice-ability). In this way slice-ability provides the maximum benefit to the lightpath blocking probability [36], [37]. However, according with the considered SBVT architecture [12], all the sublightpaths must be served by the same SBVT at both source and destination nodes.…”
Section: Rsta-s Schemementioning
confidence: 99%
“…This increases the slice-ability effectiveness but it introduces differential delay between sub-channels that has to be compensated at the destination node. The studies in [36], [37] compare singlepath and multi-path slice-ability, whereas the work in [40] focuses on a GMPLS control plane extension to support multi-path slice-ability. Differential delay compensation is typically demanded at the OTN layer that natively support Virtual Concatenation [7].…”
Section: Introductionmentioning
confidence: 99%
“…The simplest method is a fragmentation aware routing and spectrum assignment (RSA) algorithm that specifies how traffic demands are routed in order to minimize fragmentation [10,16]. Approaches splitting the blocked demand into sub-demands in order to use finer granularities have also been proposed [6,7]. Another intuitive method consists of defragmenting the spectrum in such a way that free blocks are contiguous [12].…”
Section: State Of the Artmentioning
confidence: 99%
“…Related works often consider dynamic traffic scenarios to evaluate SF and different approaches are proposed [6,7,10,12,16]. These approaches consist either in avoiding as much as possible SF in planning processes, in splitting traffic demands or in reallocating some central frequencies (spectrum defragmentation).…”
Section: Introductionmentioning
confidence: 99%
“…Hence, when building the light-forest, we may not only divide the destinations in D into groups and cover each with a light-tree, but also split the traffic to certain destination(s) into multiple sub-streams and send them over several light-trees. The latter mimics the spectrum-splitting scheme for serving unicast lightpaths [11], [27].…”
Section: B Multicast Using Light-forest With R-ncmentioning
confidence: 99%