Disaster-resilient lightpath routing in WDM optical networks
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 uninte...
Saved in:
Published in | Optical and quantum electronics Vol. 54; no. 3 |
---|---|
Main Authors | , , , , |
Format | Journal Article |
Language | English |
Published |
New York
Springer US
01.03.2022
Springer Nature B.V |
Subjects | |
Online Access | Get full text |
Cover
Loading…
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 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. |
---|---|
AbstractList | 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. |
ArticleNumber | 159 |
Author | Ashraf, M. Waqar Tariq, M. Munir, Abid Butt, Rizwan Aslam Faheem, M. |
Author_xml | – sequence: 1 givenname: M. Waqar orcidid: 0000-0003-1591-7041 surname: Ashraf fullname: Ashraf, M. Waqar email: waqarashraf@bzu.edu.pk organization: Department of Computer Engineering, Bahauddin Zakariya University – sequence: 2 givenname: Rizwan Aslam surname: Butt fullname: Butt, Rizwan Aslam organization: Department of Telecommunication Engineering, NED University of Engineering & Technology – sequence: 3 givenname: M. surname: Faheem fullname: Faheem, M. organization: Department of Computer Engineering, Abdullah Gul University – sequence: 4 givenname: M. surname: Tariq fullname: Tariq, M. organization: Department of Electronics Engineering, Islamia University – sequence: 5 givenname: Abid surname: Munir fullname: Munir, Abid organization: Department of Electronics Engineering, Islamia University |
BookMark | eNp9kE1LxDAURYOM4MzoH3BVcB19L2mbBNzIjF-guFF0F9I2nck4pjXJIP57qxXcuXjczT33wZmRie-8JeQY4RQBxFlEBMkosOF4wRUt9sgUC8GoRPEyIVPgUFKpUB2QWYwbACjzAqbkfOmiickGGmx0W2d9yrZutU69SessdLvk_CpzPnte3mddn1xttpm36aMLr_GQ7LdmG-3Rb87J09Xl4-KG3j1c3y4u7mjNUSUqVN1UWDWNUlC1qABFA8oCMm5kk-fcFBwr1UqZlwKYLDmIyrYlGNk2LVN8Tk7G3T507zsbk950u-CHl5qVTHLkUoihxcZWHboYg211H9ybCZ8aQX9b0qMlPVjSP5Z0MUB8hOJQ9isb_qb_ob4AuXlrUg |
CitedBy_id | crossref_primary_10_3390_app14020896 |
Cites_doi | 10.1109/MCOM.2014.6815917 10.1109/ANTS.2013.6802881 10.1145/361002.361007 10.1016/j.yofte.2019.101964 10.1007/s11082-019-2104-5 10.1109/TNET.2014.2309253 10.1002/dac.3920 10.1287/mnsc.17.11.712 10.1007/s10878-015-9934-2 10.12720/jcm.13.3.129-138 10.1016/j.artint.2011.07.003 10.1145/77600.77615 10.1109/WOCC.2017.7928978 10.1016/j.osn.2014.05.004 10.3390/photonics5040035 10.1145/355744.355745 10.1007/978-3-540-78773-0_34 10.1109/DRCN.2016.7470837 10.1007/978-3-642-03552-4_23 10.1137/S0097539795290477 10.1109/INFCOM.2010.5461984 10.1364/JOCN.4.000130 10.1109/LCOMM.2017.2691698 10.1364/JOCN.9.00A280 10.1007/s11082-020-02597-x 10.1109/ANTS.2017.8384176 |
ContentType | Journal Article |
Copyright | The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022 The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022. |
Copyright_xml | – notice: The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022 – notice: The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022. |
DBID | AAYXX CITATION |
DOI | 10.1007/s11082-022-03539-5 |
DatabaseName | CrossRef |
DatabaseTitle | CrossRef |
DatabaseTitleList | |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Applied Sciences Engineering Physics |
EISSN | 1572-817X |
ExternalDocumentID | 10_1007_s11082_022_03539_5 |
GroupedDBID | -54 -5F -5G -BR -EM -Y2 -~C -~X .86 .VR 06D 0R~ 0VY 1N0 2.D 203 28- 29N 29~ 2J2 2JN 2JY 2KG 2KM 2LR 2P1 2VQ 2~H 30V 4.4 406 408 409 40D 40E 5QI 5VS 67Z 6NX 78A 8TC 8UJ 95- 95. 95~ 96X AAAVM AABHQ AABYN AAFGU AAHNG AAIAL AAJKR AANZL AAPBV AARHV AARTL AATNV AATVU AAUYE AAWCG AAYFA AAYIU AAYQN AAYTO ABBBX ABBXA ABDBF ABDZT ABECU ABFGW ABFTD ABFTV ABHLI ABHQN ABJNI ABJOX ABKAS ABKCH ABKTR ABMNI ABMQK ABNWP ABPTK ABQBU ABSXP ABTAH ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACBMV ACBRV ACBXY ACBYP ACGFS ACHSB ACHXU ACIGE ACIPQ ACIWK ACKNC ACMDZ ACMLO ACNCT ACOKC ACOMO ACTTH ACVWB ACWMK ADHIR ADIMF ADINQ ADJSZ ADKNI ADKPE ADMDM ADOXG ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEEQQ AEFIE AEFTE AEGAL AEGNC AEJHL AEJRE AEKMD AENEX AEOHA AEPYU AESKC AESTI AETLH AEVLU AEVTX AEXYK AEYGD AFEXP AFFNX AFGCZ AFGFF AFLOW AFNRJ AFQWF AFWTZ AFZKB AGAYW AGDGC AGGBP AGGDS AGJBK AGMZJ AGQMX AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AHYZX AIAKS AIIXL AILAN AIMYW AITGF AJBLW AJDOV AJRNO AJZVZ AKQUC ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AOCGG ARMRJ ASPBG AVWKF AXYYD AYJHY AZFZN B-. BA0 BBWZM BDATZ BGNMA CAG COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP DU5 EBLON EBS EIOEI EJD EPL ESBYG ESX FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC G8K GGCAI GGRSB GJIRD GNWQR GPTSA GQ6 GQ7 GQ8 GXS HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ I-F I09 IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ KDC KOV KOW LAK LLZTM M4Y MA- N2Q NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM OVD P19 P9T PF0 PT4 PT5 QOK QOS R4E R89 R9I RHV RNI RNS ROL RPX RSV RZC RZE RZK S16 S1Z S26 S27 S28 S3B SAP SCLPG SDH SDM SGB SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPH SPISZ SRMVM SSLCW STPWE SZN T13 T16 TEORI TSG TSK TSV TUC TUS U2A UG4 UNUBA UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WH7 WK8 YLTOR Z45 Z7R Z7S Z7V Z7X Z7Y Z7Z Z83 Z85 Z88 Z8Z Z92 ZMTXR ZY4 ~8M ~A9 ~EX AACDK AAEOY AAJBT AASML AAYXX ABAKF ACAOD ACDTI ACZOJ AEFQL AEMSY AFBBN AGQEE AGRTI AIGIU CITATION H13 |
ID | FETCH-LOGICAL-c319t-79cdb1bdd990bf19017d09e0123a8d443a531b9f884670286307bef60a8fdf293 |
IEDL.DBID | AGYKE |
ISSN | 0306-8919 |
IngestDate | Thu Oct 10 16:23:43 EDT 2024 Thu Sep 12 17:50:20 EDT 2024 Sat Dec 16 12:07:22 EST 2023 |
IsPeerReviewed | true |
IsScholarly | true |
Issue | 3 |
Keywords | Lightpath routing Optical network Network survivability Minimum spatial distance |
Language | English |
LinkModel | DirectLink |
MergedId | FETCHMERGED-LOGICAL-c319t-79cdb1bdd990bf19017d09e0123a8d443a531b9f884670286307bef60a8fdf293 |
ORCID | 0000-0003-1591-7041 |
PQID | 2628313877 |
PQPubID | 2043598 |
ParticipantIDs | proquest_journals_2628313877 crossref_primary_10_1007_s11082_022_03539_5 springer_journals_10_1007_s11082_022_03539_5 |
PublicationCentury | 2000 |
PublicationDate | 2022-03-01 |
PublicationDateYYYYMMDD | 2022-03-01 |
PublicationDate_xml | – month: 03 year: 2022 text: 2022-03-01 day: 01 |
PublicationDecade | 2020 |
PublicationPlace | New York |
PublicationPlace_xml | – name: New York |
PublicationTitle | Optical and quantum electronics |
PublicationTitleAbbrev | Opt Quant Electron |
PublicationYear | 2022 |
Publisher | Springer US Springer Nature B.V |
Publisher_xml | – name: Springer US – name: Springer Nature B.V |
References | AwajiYFurukawaHXuSShiraiwaMWadaNTsuritaniTResilient optical network technologies for Catastrophic DisastersJ. Opt. Commun. Netw.201796A280A28910.1364/JOCN.9.00A280 FriedmanJHBentleyJLFinkelRAAn algorithm for finding best matches in logarithmic expected timeACM Trans. Math. Softw. (TOMS)19773320922610.1145/355744.355745 TrajanovskiSKuipersFAIlićACrowcroftJVan MieghemPFinding critical regions and region-disjoint paths in a networkIEEE/ACM Trans. Netw. (TON)201523390892110.1109/TNET.2014.2309253 HaiDTNetwork coding for improving throughput in WDM optical networks with dedicated protectionOpt. Quant. Electron.2019511211510.1007/s11082-019-2104-5 Agrawal, A., Sharma, P., Bhatia, V., and Prakash, S.: Survivability improvement against earthquakes in backbone optical networks using actual seismic zone information. arXiv 2017, arXiv:1703.02358, (2017) Internet2 Network's Layer 1 Services. https://www.internet2.edu/products-services/advanced-networking/layer-1-services/#service-overview (accessed 13 January 2018) TeleGeography: Submarine Cable Map 2018. https://www.submarinecablemap.com/ (accessed 11 April 2018) Asplund, M., Nadjm-Tehrani, S., Sigholm, J.: Emerging information infrastructures: cooperation in disasters. In: International workshop on critical information infrastructures security, Rome, Italy, 13–15. Springer, pp. 258–270 (2008) Submarine Cable: MAREA. https://www.submarinecablemap.com/#/submarine-cable/marea (accessed 15 April 2018) AljazzarHLeueSK⁎: a heuristic search algorithm for finding the k shortest pathsArtif. Intell.20111751821292154290617710.1016/j.artint.2011.07.003 MatroodZMGeorgeLEMahmoodFHA simple gis based method for designing fiber-networkInt. J. Eng. Innov. Technol.201444957 Neumayer, S. and Modiano, E.: Network reliability with geographically correlated failures. In: INFOCOM, Proceedings IEEE, pp. 1-9 (2010) Panigrahy, R.: An improved algorithm finding nearest neighbor using kd-trees. LATIN 2008: Theoretical Informatics, pp. 387–398 (2008) KumariMSharmaRSheetalAPerformance analysis of high speed backward compatible TWDM-PON with hybrid WDM–OCDMA PON using different OCDMA codesOpt. Quant. Electron.2020521115910.1007/s11082-020-02597-x VelascoLJirattigalachoteARuizMMontiPWosinskaLJunyentGStatistical approach for fast impairment-aware provisioning in dynamic all-optical networksJ. Opt. Commun. Netw.20124213014110.1364/JOCN.4.000130 LongXTipperDGomesTMeasuring the survivability of networks to geographic correlated failuresOpt. Switch. Netw.20141411713310.1016/j.osn.2014.05.004 ButtRAFaheemMArfeenAAshrafMWJawedMMachine learning based dynamic load balancing DWBA scheme for TWDM PONOpt. Fiber Technol.20195210196410.1016/j.yofte.2019.101964 Beschorner, N.: Infrastructure sharing and co-deployment issues: transport and ICT global practices. https://www.unescap.org/sites/default/files/Infrastructure%20Sharing%20and%20Co-Deployment%20Issues%2C%20World%20Bank.pdf (accessed June 23, 2018) Tsukiyama, S., Shirakawa, I., and Ozaki, H.: An algorithm for generating all the paths between two vertices in a digraph and its application. Technology Reports of the Osaka University, 26(1308-1336), 411-418 (1976) AhujaRKMehlhornKOrlinJTarjanREFaster algorithms for the shortest path problemJ. ACM (JACM)1990372213223107225610.1145/77600.77615 GuoLEfficient approximation algorithms for computing kJ. Comb. Optim.2016321144158351500610.1007/s10878-015-9934-2 Ferdousi, S., Dikhiyik, F., Habib, M. F., and Mukherjee, B.: Disaster-aware data-center and content placement in cloud networks. In: 2013 IEEE international conference on advanced networks and telecommunications systems (ANTS), pp. 1-3 (2013) Hoffman, M.: Cable Cuts. http://all.net/CID/Attack/papers/CableCuts.html#7 (accessed 25 June 2018), (2018) Calculate distance, bearing and more between Latitude/Longitude points. http://www.movable-type.co.uk/scripts/latlong.html (accessed 5 April 2017) Ashraf, M. W., Idrus, S. M., Iqbal, F., Butt, R. A., & Faheem, M.: Disaster-resilient optical network survivability: a comprehensive survey. Photonics 5(4), 35 (2018), Multidisciplinary Digital Publishing Institute EppsteinDFinding the k shortest pathsSIAM J. Comput.1998282652673163436410.1137/S0097539795290477 Asia-America Gateway (AAG) Cable System. https://www.submarinecablemap.com/#/submarine-cable/asia-america-gateway-aag-cable-system (accessed 11 April 2018) BentleyJLMultidimensional binary search trees used for associative searchingCommun. ACM197518950951710.1145/361002.361007 MukherjeeBHabibMDikbiyikFNetwork adaptability from disaster disruptions and cascading failuresIEEE Commun. Mag.201452523023810.1109/MCOM.2014.6815917 AshrafMWIdrusSMButtRAIqbalFPost-Disaster least loaded lightpath routing in elastic optical networksInt. J. Commun. Syst.2019328e392010.1002/dac.3920 Submarine Cable: CeltixConnect. https://www.submarinecablemap.com/#/submarine-cable/celtixconnect (accessed 13 April 2018) Das, A., Sen, A., Qiao, C., Ghani, N., and Mitton, N.: A Network planning and management tool for mitigating the impact of spatially correlated failures in infrastructure networks. In: 12th international conference on the design of reliable communication networks (DRCN), IEEE, pp. 71–78 (2016) Ardon, M. and Malik, N.: A recursive algorithm for generating circuits and related subgraphs. In: 5th Asilomar conference on circuits and systems, pp. 279–284 (1971) BT reveals pricing proposals for duct and pole access: http://www.computing.co.uk/ctg/news/1937275/bt-reveals-hotlyanticipated-pricing-proposals-duct-pole-access (accessed 23 March 2017) Cisco, Cisco visual networking index: forecast and methodology, 2016–2021, June 06, (2017) Galdamez, C., and Ye, Z.: Resilient virtual network mapping against large-scale regional failures. In: Wireless and optical communication conference (WOCC), 2017 26th: IEEE, pp. 1–4 (2017) Wang, J., Bigham, J., Phillips, C.: A geographical proximity aware multi-path routing mechanism for resilient networking. IEEE Commun. Lett. 21(7) (2017) ButtRAIdrusSMZulkifliNAshrafMWA survey of energy conservation schemes for present and next generation passive optical networksJ. Commun.201813312913810.12720/jcm.13.3.129-138 YenJYFinding the k shortest loopless paths in a networkManage. Sci.1971171171271630078210.1287/mnsc.17.11.712 Santos, J. L.: k-Shortest path algorithms. [Online]. Available: https://estudogeral.sib.uc.pt/bitstream/10316/11305/1/k-Shortest%20path%20algorithms.pdf (2007) Le, Q. et al.: Optical network optimization tool with network survivability. Electronics Engineering Society of Korea, pp. 228–231 (2017) Mehlhorn, K., Orlin, J., and Tarjan, R.: Faster algorithms for the shortest path problem. Technical Report CS-TR-154-88, Department of Computer Science, Princeton University, (1987) H Aljazzar (3539_CR10) 2011; 175 RK Ahuja (3539_CR9) 1990; 37 RA Butt (3539_CR18) 2018; 13 3539_CR17 3539_CR39 S Trajanovski (3539_CR38) 2015; 23 JY Yen (3539_CR42) 1971; 17 3539_CR13 3539_CR35 3539_CR14 3539_CR36 3539_CR37 3539_CR11 3539_CR33 3539_CR30 JH Friedman (3539_CR24) 1977; 3 Y Awaji (3539_CR15) 2017; 9 ZM Matrood (3539_CR32) 2014; 4 B Mukherjee (3539_CR34) 2014; 52 JL Bentley (3539_CR16) 1975; 18 DT Hai (3539_CR27) 2019; 51 3539_CR6 3539_CR7 3539_CR8 3539_CR2 3539_CR28 3539_CR3 3539_CR4 3539_CR5 3539_CR25 3539_CR1 MW Ashraf (3539_CR12) 2019; 32 X Long (3539_CR31) 2014; 14 3539_CR20 L Guo (3539_CR26) 2016; 32 3539_CR21 3539_CR23 M Kumari (3539_CR29) 2020; 52 D Eppstein (3539_CR22) 1998; 28 L Velasco (3539_CR40) 2012; 4 RA Butt (3539_CR19) 2019; 52 3539_CR41 |
References_xml | – volume: 52 start-page: 230 issue: 5 year: 2014 ident: 3539_CR34 publication-title: IEEE Commun. Mag. doi: 10.1109/MCOM.2014.6815917 contributor: fullname: B Mukherjee – ident: 3539_CR23 doi: 10.1109/ANTS.2013.6802881 – ident: 3539_CR20 – volume: 18 start-page: 509 issue: 9 year: 1975 ident: 3539_CR16 publication-title: Commun. ACM doi: 10.1145/361002.361007 contributor: fullname: JL Bentley – volume: 52 start-page: 101964 year: 2019 ident: 3539_CR19 publication-title: Opt. Fiber Technol. doi: 10.1016/j.yofte.2019.101964 contributor: fullname: RA Butt – volume: 51 start-page: 1 issue: 12 year: 2019 ident: 3539_CR27 publication-title: Opt. Quant. Electron. doi: 10.1007/s11082-019-2104-5 contributor: fullname: DT Hai – volume: 23 start-page: 908 issue: 3 year: 2015 ident: 3539_CR38 publication-title: IEEE/ACM Trans. Netw. (TON) doi: 10.1109/TNET.2014.2309253 contributor: fullname: S Trajanovski – volume: 32 start-page: e3920 issue: 8 year: 2019 ident: 3539_CR12 publication-title: Int. J. Commun. Syst. doi: 10.1002/dac.3920 contributor: fullname: MW Ashraf – ident: 3539_CR6 – ident: 3539_CR33 – ident: 3539_CR4 – ident: 3539_CR37 – ident: 3539_CR39 – volume: 17 start-page: 712 issue: 11 year: 1971 ident: 3539_CR42 publication-title: Manage. Sci. doi: 10.1287/mnsc.17.11.712 contributor: fullname: JY Yen – volume: 32 start-page: 144 issue: 1 year: 2016 ident: 3539_CR26 publication-title: J. Comb. Optim. doi: 10.1007/s10878-015-9934-2 contributor: fullname: L Guo – ident: 3539_CR1 – volume: 13 start-page: 129 issue: 3 year: 2018 ident: 3539_CR18 publication-title: J. Commun. doi: 10.12720/jcm.13.3.129-138 contributor: fullname: RA Butt – ident: 3539_CR28 – ident: 3539_CR3 – volume: 175 start-page: 2129 issue: 18 year: 2011 ident: 3539_CR10 publication-title: Artif. Intell. doi: 10.1016/j.artint.2011.07.003 contributor: fullname: H Aljazzar – volume: 37 start-page: 213 issue: 2 year: 1990 ident: 3539_CR9 publication-title: J. ACM (JACM) doi: 10.1145/77600.77615 contributor: fullname: RK Ahuja – ident: 3539_CR25 doi: 10.1109/WOCC.2017.7928978 – volume: 4 start-page: 49 year: 2014 ident: 3539_CR32 publication-title: Int. J. Eng. Innov. Technol. contributor: fullname: ZM Matrood – volume: 14 start-page: 117 year: 2014 ident: 3539_CR31 publication-title: Opt. Switch. Netw. doi: 10.1016/j.osn.2014.05.004 contributor: fullname: X Long – ident: 3539_CR13 doi: 10.3390/photonics5040035 – volume: 3 start-page: 209 issue: 3 year: 1977 ident: 3539_CR24 publication-title: ACM Trans. Math. Softw. (TOMS) doi: 10.1145/355744.355745 contributor: fullname: JH Friedman – ident: 3539_CR36 doi: 10.1007/978-3-540-78773-0_34 – ident: 3539_CR21 doi: 10.1109/DRCN.2016.7470837 – ident: 3539_CR17 – ident: 3539_CR14 doi: 10.1007/978-3-642-03552-4_23 – ident: 3539_CR11 – ident: 3539_CR7 – volume: 28 start-page: 652 issue: 2 year: 1998 ident: 3539_CR22 publication-title: SIAM J. Comput. doi: 10.1137/S0097539795290477 contributor: fullname: D Eppstein – ident: 3539_CR5 – ident: 3539_CR35 doi: 10.1109/INFCOM.2010.5461984 – volume: 4 start-page: 130 issue: 2 year: 2012 ident: 3539_CR40 publication-title: J. Opt. Commun. Netw. doi: 10.1364/JOCN.4.000130 contributor: fullname: L Velasco – ident: 3539_CR30 – ident: 3539_CR2 – ident: 3539_CR41 doi: 10.1109/LCOMM.2017.2691698 – volume: 9 start-page: A280 issue: 6 year: 2017 ident: 3539_CR15 publication-title: J. Opt. Commun. Netw. doi: 10.1364/JOCN.9.00A280 contributor: fullname: Y Awaji – volume: 52 start-page: 1 issue: 11 year: 2020 ident: 3539_CR29 publication-title: Opt. Quant. Electron. doi: 10.1007/s11082-020-02597-x contributor: fullname: M Kumari – ident: 3539_CR8 doi: 10.1109/ANTS.2017.8384176 |
SSID | ssj0006450 |
Score | 2.3355973 |
Snippet | Optical network serves as a core network with huge capacity and a multitude of high-speed data transmission. Natural disasters and physical attacks showed... |
SourceID | proquest crossref springer |
SourceType | Aggregation Database Publisher |
SubjectTerms | Algorithms Characterization and Evaluation of Materials Computer Communication Networks Computer networks Computing time Data transmission Disaster management Disasters Electrical Engineering Impact damage Lasers Natural disasters Nodes Optical communication Optical Devices Optics Photonics Physics Physics and Astronomy Polynomials Survivability Wavelength division multiplexing |
Title | Disaster-resilient lightpath routing in WDM optical networks |
URI | https://link.springer.com/article/10.1007/s11082-022-03539-5 https://www.proquest.com/docview/2628313877 |
Volume | 54 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3dT8IwEL8IxEQfRFEjiqQPvmnJxsq2Jr6ggEQjTxDxaWm7NiGSQRi8-Nfb7sP5-cDjsuWS3vXufrf-7gpwRXwRKikU5kzqAkVyhhkhUj-GtvCkRQVLWL4jdzghj9POtOjjTsju-YlkEqiLXjdbZytsyOeW03Eo7pSgkjWeVroPr0_9zwDskuRiVoOGsU9tmvXK_C3lez4qQOaPc9Ek3QyqMM6bdlKWyVtrs-Yt8f57huM2KzmEgwx-om66X45gR0Y1qGZQFGWOHtdg_8ucwhrsJjxRER_DbW8WMzNbAesyfTY3zZRobup7c7MxWi02hkWNZhF66T2jxTL5UY6ilGoen8Bk0B_fD3F2AQMW2jPX2KMi5DYPQ52yuDLQwQstKg0MY35IiMO0B3OqfANiNFBxdcDgUrkW81WoNJA4hXK0iOQZIEE9zpgiwrM5kdKlnCuHMKqkR6UvvTpc52YIlumcjaCYqGwUFmiFBYnCgk4dGrmlgszn4qDtaqhkO76nhd3kmi9e_y_tfLvPL2CvnRoPW3YDyuvVRl5qZLLmTb0TB3d3o2a2I5tQmrS7H2J027U |
link.rule.ids | 315,783,787,27936,27937,41093,41535,42162,42604,52123,52246 |
linkProvider | Springer Nature |
linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT8JAEJ4oxqgHH6gRRd2DN92kpdtuN_FCRIIKnCBya_aZkJBCKPx_d_sQNXrw2Gwzh287-33TnQfAHYmlMloaLLi2AYoWHHNCtH1UvqTaY5LnWb7DqDcmr5NwUhaFZVW2e3UlmZ_Um2I339IVdtnnXhAGDIfbsOP6q7uO-eNW-_P8jUg-l9WJYRwzn5WlMr_b-E5HG43541o0Z5vuMRyWMhG1i309gS2d1uGolIyodMisDgdf-gnWYTfP55TZKTx2phl3PRCwDaenM1f0iGYuDncTiNFyvnbZzmiaovfOAM0X-Q9tlBYp4dkZjLvPo6ceLgclYGk9aIUpk0r4QilLLcI4iqfKY9rJJR4rQgJuPU0wEzuxYQVFZB1baBN5PDbKWMI_h1o6T_UFIMmo4NwQSX1BtI6YECYgnBlNmY41bcB9hVeyKPphJJvOxw7dxKKb5OgmYQOaFaRJ6RtZ0oqspPGDmFpjDxXMm-W_rV3-7_Vb2OuNBv2k_zJ8u4L9VrHr2PObUFst1_raqomVuMk_ng82ecAz |
linkToPdf | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV07T8MwED5BKxAMPAqIQgEPbGCaNG4SSywVpTwKiAEETJGfUkWVVk268Oux86CAYECMUaJT4vPdfY6_-wxwSEIhtRIac6bMAkVxhhkhylxKVwTKoYJlLN87__KRXD-3nz918Wds93JLMu9psCpNcdocS92cNb65pnRhy0R3vLZHcXseqsQqI1Wg2rl46Z9_ZGOfZKe0WmiMQ-rSonHmZytfi9MMcX7bJM1qT28VWPnWOeXk9WSa8hPx9k3Q8T-ftQYrBTBFnXwmrcOcimuwWoBUVKSApAbLnxQMa7CQMUhFsgGn3UHCrOoCNgv4wdC2WaKhXfnbM4_RZDS1_Go0iNFT9xaNxtkvdBTnJPRkEx575w9nl7g4mgELE7MpDqiQ3OVSmmLGtQUVgXSosgCNhZIQj5nY5lSHFt4YCOObVMKV9h0WaqkNxNiCSjyK1TYgQQPOmCYicDlRyqeca48wqlVAVaiCOhyVPonGuQJHNNNatgMWmQGLsgGL2nVolG6LimhMopZvQJTrhYExdlx6YXb7d2s7f3v8ABbvu73o5uquvwtLrdyP2HEbUEknU7Vn4EvK94sZ-g5ZkOYI |
openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Disaster-resilient+lightpath+routing+in+WDM+optical+networks&rft.jtitle=Optical+and+quantum+electronics&rft.au=Waqar%2C+Ashraf+M&rft.au=Butt%2C+Rizwan+Aslam&rft.au=Faheem%2C+M&rft.au=Tariq%2C+M&rft.date=2022-03-01&rft.pub=Springer+Nature+B.V&rft.issn=0306-8919&rft.eissn=1572-817X&rft.volume=54&rft.issue=3&rft_id=info:doi/10.1007%2Fs11082-022-03539-5&rft.externalDBID=NO_FULL_TEXT |
thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0306-8919&client=summon |
thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0306-8919&client=summon |
thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0306-8919&client=summon |