dc.contributor.author | Ashraf, M. Waqar | |
dc.contributor.author | Butt, Rizwan Aslam | |
dc.contributor.author | Faheem, M | |
dc.contributor.author | Tariq, M. | |
dc.contributor.author | Munir, Abid | |
dc.date.accessioned | 2023-03-02T14:01:48Z | |
dc.date.available | 2023-03-02T14:01:48Z | |
dc.date.issued | 2022 | en_US |
dc.identifier.issn | 0306-8919 | |
dc.identifier.issn | 1572-817X | |
dc.identifier.other | WOS:000754669900001 | |
dc.identifier.uri | https://doi.org/10.1007/s11082-022-03539-5 | |
dc.identifier.uri | https://hdl.handle.net/20.500.12573/1491 | |
dc.description.abstract | Optical network serves as a core network with huge capacity and a multitude of high-speed
data transmission. Natural disasters and physical attacks showed signifcant 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 frst 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 | en_US |
dc.description.sponsorship | Bahauddin Zakariya University
Abdullah Gul University | en_US |
dc.language.iso | eng | en_US |
dc.publisher | SPRINGER | en_US |
dc.relation.isversionof | 10.1007/s11082-022-03539-5 | en_US |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.subject | Lightpath routing | en_US |
dc.subject | Network survivability | en_US |
dc.subject | Minimum spatial distance | en_US |
dc.subject | Optical network | en_US |
dc.title | Disaster-resilient lightpath routing in WDM optical networks | en_US |
dc.type | article | en_US |
dc.contributor.department | AGÜ, Mühendislik Fakültesi, Bilgisayar Mühendisliği Bölümü | en_US |
dc.contributor.institutionauthor | Faheem, M. | |
dc.identifier.volume | 54 | en_US |
dc.identifier.issue | 3 | en_US |
dc.identifier.startpage | 1 | en_US |
dc.identifier.endpage | 23 | en_US |
dc.relation.journal | OPTICAL AND QUANTUM ELECTRONICS | en_US |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |