TY - JOUR
T1 - Resource learning aware algorithm for route prediction and resources allocation in elastic optical networks with network analytics
AU - Khan, Akhtar Nawaz
AU - Ahmed, Hassan Yousif
AU - Zeghid, Medien
N1 - Publisher Copyright:
© 2024 The Authors
PY - 2024/12
Y1 - 2024/12
N2 - We have proposed two algorithms in this paper for dynamic traffic in elastic optical networks (EON). Algorithm1 considers the spatial access blocking probability metric (SABPM) during dynamic operation and route traffic to a path with lower SABPM. Therefore, it considers a path with more contiguous blocks to support heterogeneous bandwidths (BW) and modulation schemes. Algorithm1 keeps a balance of fragmentation on available routes. Algorithm2 makes routing decision for dynamic traffic based on the maximum idle slots as well as minimum SABPM. Therefore, it selects a less fragmented path with more number of available contiguous blocks to support heterogeneous BW. Algorithm2 balances the path utilization and avoids over utilization of congested route. We have evaluated the performance of both algorithms in terms of spatial external fragmentation, contiguity ratio, contiguous aligned spectrum ratio, SABPM, and BW blocking probability (BwBP). Python with seaborn, pandas, and other libraries are used for network analytics. Results show that resource utilization improves with the proposed algorithms. It has been shown that algorithm2 and algorithm1 achieve 27% and 18% traffic gains respectively over the alternate routing.
AB - We have proposed two algorithms in this paper for dynamic traffic in elastic optical networks (EON). Algorithm1 considers the spatial access blocking probability metric (SABPM) during dynamic operation and route traffic to a path with lower SABPM. Therefore, it considers a path with more contiguous blocks to support heterogeneous bandwidths (BW) and modulation schemes. Algorithm1 keeps a balance of fragmentation on available routes. Algorithm2 makes routing decision for dynamic traffic based on the maximum idle slots as well as minimum SABPM. Therefore, it selects a less fragmented path with more number of available contiguous blocks to support heterogeneous BW. Algorithm2 balances the path utilization and avoids over utilization of congested route. We have evaluated the performance of both algorithms in terms of spatial external fragmentation, contiguity ratio, contiguous aligned spectrum ratio, SABPM, and BW blocking probability (BwBP). Python with seaborn, pandas, and other libraries are used for network analytics. Results show that resource utilization improves with the proposed algorithms. It has been shown that algorithm2 and algorithm1 achieve 27% and 18% traffic gains respectively over the alternate routing.
KW - Bandwidth blocking probability, fragmentation, and, network analytics
KW - Contiguity constraint
KW - Continuity constraint
KW - Elastic optical networks
UR - http://www.scopus.com/inward/record.url?scp=85207601566&partnerID=8YFLogxK
U2 - 10.1016/j.rineng.2024.103176
DO - 10.1016/j.rineng.2024.103176
M3 - Article
AN - SCOPUS:85207601566
SN - 2590-1230
VL - 24
JO - Results in Engineering
JF - Results in Engineering
M1 - 103176
ER -