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

A novel elastic optical path network that utilizes bitrate-specific anchored frequency slot arrangement

Abstract: We propose a novel elastic optical path network where each specific bitrate signal uses its own dedicated fixed grid and one edge of its frequency grid is anchored at a specific frequency. Numerical evaluations using various bitrate signal patterns and network topologies show that the network proposal can almost match the performance of conventional flexible grid networks, while greatly mitigating the hardware requirements: it allows the use of the tunable filters for the fixed grid systems.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
9
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 9 publications
(9 citation statements)
references
References 11 publications
0
9
0
Order By: Relevance
“…It is compared with Odd case (only odd BW values from 1 to 9 FS are allowed), and the 2-5-8 case (connections sizes are limited to 2, 5 and 8 FS). It has to be highlighted that, due to network fragmentation, larger connections experience always higher blocking, as finding enough contiguous FS becomes harder as connections size increases [18]. Therefore, the Odd case has a weakness from this point of view (connections with BW=9 FS are only present in this case).…”
Section: Simulation Resultsmentioning
confidence: 99%
“…It is compared with Odd case (only odd BW values from 1 to 9 FS are allowed), and the 2-5-8 case (connections sizes are limited to 2, 5 and 8 FS). It has to be highlighted that, due to network fragmentation, larger connections experience always higher blocking, as finding enough contiguous FS becomes harder as connections size increases [18]. Therefore, the Odd case has a weakness from this point of view (connections with BW=9 FS are only present in this case).…”
Section: Simulation Resultsmentioning
confidence: 99%
“…For each of the three allocation policies AP, we now consider the set of transition rate matrices Q AP that contains all the transition rate matrices that are compatible with the relevant (bounds on the) rates specified in Section V-B2. In particular, for every policy AP and any choice of µ + 1 (i, j, e) ∈ [i min µ 1 , i max µ 1 ], we obtain a different matrix Q AP ∈ Q AP The resulting set Q AP then characterises a lower transition rate operator Q AP according to (7). In this way, we obtain three sets Q RA , Q LF and Q MF , and their respective associated lower transition rate operators Q RA , Q LF and Q MF .…”
Section: A Policy-dependent Imprecise MC Modelsmentioning
confidence: 99%
“…From a practical point of view, an important question is how to efficiently execute the minimisation in (7). To discuss this, we fix some x = (i, j, e) ∈ X red and define…”
Section: Appendix B a Closer Look At The Lower Transition Rate Operatmentioning
confidence: 99%
See 2 more Smart Citations