2017
DOI: 10.1016/j.dcan.2016.05.001
|View full text |Cite
|
Sign up to set email alerts
|

An efficient hybrid protection scheme with shared/dedicated backup paths on elastic optical networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
11
0
2

Year Published

2017
2017
2022
2022

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 50 publications
(13 citation statements)
references
References 20 publications
0
11
0
2
Order By: Relevance
“…4 in [17]). In the proposed algorithm, named as Modified Dual-path Allocation algorithm (Modified DPA), it was assumed that two link-disjoint paths are calculated on the basis of two weight matrices which causes the weakening of the objective function (2). The first matrix is…”
Section: Optimization Problem Solutionmentioning
confidence: 99%
See 1 more Smart Citation
“…4 in [17]). In the proposed algorithm, named as Modified Dual-path Allocation algorithm (Modified DPA), it was assumed that two link-disjoint paths are calculated on the basis of two weight matrices which causes the weakening of the objective function (2). The first matrix is…”
Section: Optimization Problem Solutionmentioning
confidence: 99%
“…In [1], an offline Routing and Spectrum Allocation (RSA) problem with Dedicated Path Protection (DPP) in EON is proposed. In turn, in [2] two algorithms have been proposed that solve the offline RSA problem with working path protection. The first one is with shared backup path protection and the second one is with dedicated backup path protection.…”
Section: Introductionmentioning
confidence: 99%
“…The hybrid protection algorithm also called hybrid protection light path which defines the power consumption and resource availability that has been proposed in [15] for EON. For every request the shortest backup path with minimum resource utilization has been selected.…”
Section: Related Workmentioning
confidence: 99%
“…These models are designed to find optimal routes based on static traffic information with an objective to minimize network resources. These models are designed subject to the criteria to assign network resources to given set of lightpaths requests [15], [21]- [23]. In dynamic RSA problems, ligthpath requests with finite holding time and variable bandwidth demands arrives randomly and hold resources in the network till departure.…”
Section: Introductionmentioning
confidence: 99%