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

Fragmentation aware routing and spectrum assignment algorithm

Abstract: In flex-grid (elastic) networks, the spectrum can be allocated at a much finer granularity than it can be allocated in WDM networks. However, the dynamic establishment and tear down of lightpaths yields to the fragmentation of the spectrum with consequent increase in blocking of requests for connection establishment. Therefore, it is of paramount importance that allocation decisions try to mitigate the fragmentation problem. In line with that, this paper introduces the Multigraph Shortest Path Algorithm for no… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
5
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
6
2

Relationship

1
7

Authors

Journals

citations
Cited by 23 publications
(5 citation statements)
references
References 11 publications
0
5
0
Order By: Relevance
“…A spectrum partitioning scheme based on machine learning approach is presented in Xiong et al 18 In the strategy to forecast network traffic, Elman neural network is used, and spectrum allocation based on the two‐dimensional rectangular packing model is used in Xiong et al 18 A load balancing routing strategy based on the traffic distribution and spectrum block capability is given in Chen et al 19 The advantage of the proposed strategy is low complexity compared with the other strategies. Moura et al 20 presented fragmentation aware multigraph shortest path (MGSP) algorithm, which is based on two cost functions, that is, degree of fragmentation and acceptance prone. Similarly, based on cost function, fragmentation aware RMSA strategy is presented in Yin et al, 21 which considers number of hops, spectrum slots, cuts, fragments, and aliment for the cost of route.…”
Section: Related Workmentioning
confidence: 99%
“…A spectrum partitioning scheme based on machine learning approach is presented in Xiong et al 18 In the strategy to forecast network traffic, Elman neural network is used, and spectrum allocation based on the two‐dimensional rectangular packing model is used in Xiong et al 18 A load balancing routing strategy based on the traffic distribution and spectrum block capability is given in Chen et al 19 The advantage of the proposed strategy is low complexity compared with the other strategies. Moura et al 20 presented fragmentation aware multigraph shortest path (MGSP) algorithm, which is based on two cost functions, that is, degree of fragmentation and acceptance prone. Similarly, based on cost function, fragmentation aware RMSA strategy is presented in Yin et al, 21 which considers number of hops, spectrum slots, cuts, fragments, and aliment for the cost of route.…”
Section: Related Workmentioning
confidence: 99%
“…To mitigate spectrum fragmentation effects in EONs, Moura et al [23], Yin et al [24], and Liu et al [25] propose dynamic fragmentation aware routing and spectrum assignment algorithms, assuming the traffic demands may have an arbitrary bandwidth requirement. However, under an arbitrary bandwidth requirement, it is hard to reduce spectrum fragmentation.…”
Section: Related Work and Our Contributionsmentioning
confidence: 99%
“…Moreover, this paper proposes an algorithm called Energy Aware Multigraph Shortest Path (EAMGSP), which extends the Multigraph Shortest Path (MGSP) proposed by the authors in [4] to incorporate the modulation level choice as well as energy awareness. A cost function to account the power consumption of network devices in the RMLSA computation is proposed.…”
Section: Introductionmentioning
confidence: 99%