2017
DOI: 10.1515/eletel-2017-0053
|View full text |Cite
|
Sign up to set email alerts
|

Spectrum Allocation Policy in Elastic Optical Networks

Abstract: Abstract-The considered problem covers routing and spectrum allocation problem (RSA problem) in Elastic Optical Networks while maintaining the spectrum continuity constraints, non-overlapping spectra constraints for adjacent connections on individual links of the network and spectrum contiguity constraints of the connection. In this article the modified version of the First Fit spectrum slot allocation policy for Fixed Alternate Routing in flexible optical networks has been proposed. The Fixed Alternate Routin… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 12 publications
(3 citation statements)
references
References 9 publications
0
3
0
Order By: Relevance
“…However, it is a greedy algorithm in which some links are shared more frequently than others and is not suited for network design process and resource allocation [ 23 ]. Similarly, alternate routing considers a set of two or three shortest paths between end nodes using the k-shortest path routing scheme; these paths are also found using Dijkstra ' s algorithm [ 21,24,25 ]. In a dynamic network scenario, when resources are not available on the first shortest path, traffic is routed on the second shortest path using an alternate routing scheme that minimizes the congestion in the network.…”
Section: Literature Reviewmentioning
confidence: 99%
“…However, it is a greedy algorithm in which some links are shared more frequently than others and is not suited for network design process and resource allocation [ 23 ]. Similarly, alternate routing considers a set of two or three shortest paths between end nodes using the k-shortest path routing scheme; these paths are also found using Dijkstra ' s algorithm [ 21,24,25 ]. In a dynamic network scenario, when resources are not available on the first shortest path, traffic is routed on the second shortest path using an alternate routing scheme that minimizes the congestion in the network.…”
Section: Literature Reviewmentioning
confidence: 99%
“…In dynamic RSA problems, ligthpath requests with finite holding time and variable bandwidth demands arrives randomly and hold resources in the network till departure. The goal of the dynamic RSA problem is to reduce the probability of bandwidth blocking [24], [25] which can be divided into routing subproblem and spectrum allocation subproblem [26], [27]. A global optimizaiton method has been proposed in [28] called cross stratum optimization (CSO) which dynamically allocates resources according to the modulation format and bandwidth requirements in EON.…”
Section: Introductionmentioning
confidence: 99%
“…An online unsupervised fuzzy clustering algorithm is used for resource allocation in [34] which takes into account physical impairements in EON. Similarly, first-fit, last-fit, random-fit, most-used, and least-used heuristics have been used for spectrum allocation in EON [19], [22], [26], [30]. Fragmentation is a major issue in EON which in large is related to the spectrum allocation techniques.…”
Section: Introductionmentioning
confidence: 99%