Disaster-resilient lightpath routing in WDM optical networks

被引:0
作者
M. Waqar Ashraf
Rizwan Aslam Butt
M. Faheem
M. Tariq
Abid Munir
机构
[1] Bahauddin Zakariya University,Department of Computer Engineering
[2] NED University of Engineering & Technology,Department of Telecommunication Engineering
[3] Abdullah Gul University,Department of Computer Engineering
[4] Islamia University,Department of Electronics Engineering
来源
Optical and Quantum Electronics | 2022年 / 54卷
关键词
Lightpath routing; Network survivability; Minimum spatial distance; Optical network;
D O I
暂无
中图分类号
学科分类号
摘要
Optical network serves as a core network with huge capacity and a multitude of high-speed data transmission. Natural disasters and physical attacks showed significant impacts on the optical networks such as damages the network nodes and optical links. Network survivability attempts to provide uninterrupted services when network component ceases to function or malfunctioned either in the event of a disaster or due to human intervention. In this paper, two polynomial-time algorithms have been proposed to select an optimal pair of link-disjoint lightpaths between two network nodes such that (1) their minimum spatial distance (MSD) is maximized, and (2) the path length of the primary lightpath is minimized such that backup lightpath has some particular MSD from the primary lightpath while disregarding safe regions around the source and destination nodes. Through extensive simulations, it is shown that, in case of disaster event, the first algorithm (DPMMSD) computes the backup path with maximum survivability in case of multiple link failures of spatially close nodes, whereas second algorithm (CMMSD) computes the shortest backup lightpath while adhering to the target survivability requirements. DPMMSD, CMMSD and the benchmark EKSP enables the evaluation and comparison of the performance. EKSP computes more pairs hence takes more computing time whereas DPMMSD and CMMSD modestly discard the computation of self and repeating pairs, enabling quick computations.
引用
收藏
相关论文
共 56 条
[1]  
Ahuja RK(1990)Faster algorithms for the shortest path problem J. ACM (JACM) 37 213-223
[2]  
Mehlhorn K(2011)K⁎: a heuristic search algorithm for finding the k shortest paths Artif. Intell. 175 2129-2154
[3]  
Orlin J(2019)Post-Disaster least loaded lightpath routing in elastic optical networks Int. J. Commun. Syst. 32 e3920-A289
[4]  
Tarjan RE(2017)Resilient optical network technologies for Catastrophic Disasters J. Opt. Commun. Netw. 9 A280-517
[5]  
Aljazzar H(1975)Multidimensional binary search trees used for associative searching Commun. ACM 18 509-138
[6]  
Leue S(2018)A survey of energy conservation schemes for present and next generation passive optical networks J. Commun. 13 129-673
[7]  
Ashraf MW(2019)Machine learning based dynamic load balancing DWBA scheme for TWDM PON Opt. Fiber Technol. 52 101964-226
[8]  
Idrus SM(1998)Finding the k shortest paths SIAM J. Comput. 28 652-158
[9]  
Butt RA(1977)An algorithm for finding best matches in logarithmic expected time ACM Trans. Math. Softw. (TOMS) 3 209-15
[10]  
Iqbal F(2016)Efficient approximation algorithms for computing k J. Comb. Optim. 32 144-59