{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,20]],"date-time":"2026-06-20T08:59:03Z","timestamp":1781945943706,"version":"3.54.5"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,4,13]],"date-time":"2018-04-13T00:00:00Z","timestamp":1523577600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003093","name":"Ministry of Higher Education, Malaysia","doi-asserted-by":"publisher","award":["02K85"],"award-info":[{"award-number":["02K85"]}],"id":[{"id":"10.13039\/501100003093","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Photon Netw Commun"],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1007\/s11107-018-0764-x","type":"journal-article","created":{"date-parts":[[2018,4,13]],"date-time":"2018-04-13T12:40:08Z","timestamp":1523623208000},"page":"11-25","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["On spatially disjoint lightpaths in optical networks"],"prefix":"10.1007","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1591-7041","authenticated-orcid":false,"given":"M. Waqar","family":"Ashraf","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sevia M.","family":"Idrus","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Farabi","family":"Iqbal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rizwan Aslam","family":"Butt","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,4,13]]},"reference":[{"key":"764_CR1","doi-asserted-by":"crossref","first-page":"1245","DOI":"10.1016\/j.comnet.2010.03.005","volume":"54","author":"JP Sterbenz","year":"2010","unstructured":"Sterbenz, J.P., Hutchison, D., \u00c7etinkaya, E.K., Jabbar, A., Rohrer, J.P., Sch\u00f6ller, M., et al.: Resilience and survivability in communication networks: strategies, principles, and survey of disciplines. Comput. Netw. 54, 1245\u20131265 (2010)","journal-title":"Comput. Netw."},{"key":"764_CR2","unstructured":"Borland, J.: Analyzing the internet collapse. MIT Technology Review (2008). http:\/\/www.nrcc.cornell.edu\/page_ccd.html"},{"key":"764_CR3","unstructured":"Seismonepal website. http:\/\/seismonepal.gov.np\/"},{"key":"764_CR4","doi-asserted-by":"crossref","unstructured":"Dawadi, B.R., Shakya, S.: ICT implementation and infrastructure deployment approach for rural Nepal. In: Meesad, P., Boonkrong, S., Unger, H. (eds.) Recent Advances in Information and Communication Technology 2016, pp. 319\u2013331. Springer, Cham (2016)","DOI":"10.1007\/978-3-319-40415-8_31"},{"key":"764_CR5","unstructured":"Mexico Earthquake Fact Sheet #5 (29-09-2017). https:\/\/www.usaid.gov\/sites\/default\/files\/documents\/1866\/mexico_eq_fs05_09-29-2017.pdf"},{"key":"764_CR6","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1109\/MC.2013.155","volume":"46","author":"PP Tallon","year":"2013","unstructured":"Tallon, P.P.: Corporate governance of big data: perspectives on value, risk, and cost. Computer 46, 32\u201338 (2013)","journal-title":"Computer"},{"key":"764_CR7","doi-asserted-by":"crossref","unstructured":"Iqbal, F., Trajanovski, S., Kuipers, F.: Detection of spatially-close fiber segments in optical networks. In: 12th International Conference on the Design of Reliable Communication Networks (DRCN), pp. 95\u2013102 (2016)","DOI":"10.1109\/DRCN.2016.7470840"},{"key":"764_CR8","unstructured":"url(http:\/\/www.computing.co.uk\/ctg\/news\/1937275\/bt-reveals-hotlyanticipated-pricing-proposals-duct-pole-access)"},{"key":"764_CR9","doi-asserted-by":"crossref","unstructured":"Asplund, M., Nadjm-Tehrani, S., Sigholm, J. : Emerging information infrastructures: cooperation in disasters. In: International Workshop on Critical Information Infrastructures Security, pp. 258\u2013270 (2008)","DOI":"10.1007\/978-3-642-03552-4_23"},{"key":"764_CR10","doi-asserted-by":"crossref","unstructured":"Rak, J., Hutchison, D., Calle, E., Gomes, T., Gunkel, M., Smith et al., P.: RECODIS: resilient communication services protecting end-user applications from disaster-based failures. In: 2016 18th International Conference on Transparent Optical Networks (ICTON), pp. 1\u20134 (2016)","DOI":"10.1109\/ICTON.2016.7550596"},{"key":"764_CR11","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1023\/A:1016047527226","volume":"4","author":"G Maier","year":"2002","unstructured":"Maier, G., Pattavina, A., De Patre, S., Martinelli, M.: Optical network survivability: protection techniques in the WDM layer. Photon. Netw. Commun. 4, 251\u2013269 (2002)","journal-title":"Photon. Netw. Commun."},{"key":"764_CR12","doi-asserted-by":"crossref","first-page":"3175","DOI":"10.1109\/JLT.2014.2334713","volume":"32","author":"F Dikbiyik","year":"2014","unstructured":"Dikbiyik, F., Tornatore, M., Mukherjee, B.: Minimizing the risk from disaster failures in optical backbone networks. J. Lightw. Technol. 32, 3175\u20133183 (2014)","journal-title":"J. Lightw. Technol."},{"key":"764_CR13","first-page":"1","volume":"2010","author":"S Neumayer","year":"2010","unstructured":"Neumayer, S., Modiano, E.: Network reliability with geographically correlated failures. Proc. IEEE INFOCOM 2010, 1\u20139 (2010)","journal-title":"Proc. IEEE INFOCOM"},{"key":"764_CR14","doi-asserted-by":"crossref","unstructured":"Dikbiyik, F., Reaz, A. S., De Leenheer, M., Mukherjee, B.: Minimizing the disaster risk in optical telecom networks. In: Optical Fiber Communication Conference, p. OTh4B.2 (2012)","DOI":"10.1364\/OFC.2012.OTh4B.2"},{"key":"764_CR15","doi-asserted-by":"crossref","first-page":"1525","DOI":"10.1109\/TNET.2012.2232111","volume":"21","author":"PK Agarwal","year":"2013","unstructured":"Agarwal, P.K., Efrat, A., Ganjugunte, S.K., Hay, D., Sankararaman, S., Zussman, G.: The resilience of WDM networks to probabilistic geographical failures. IEEE ACM Trans. Netw. 21, 1525\u20131538 (2013)","journal-title":"IEEE ACM Trans. Netw."},{"key":"764_CR16","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1109\/MCOM.2014.6815917","volume":"52","author":"B Mukherjee","year":"2014","unstructured":"Mukherjee, B., Habib, M., Dikbiyik, F.: Network adaptability from disaster disruptions and cascading failures. IEEE Commun. Mag. 52, 230\u2013238 (2014)","journal-title":"IEEE Commun. Mag."},{"key":"764_CR17","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/j.comnet.2014.10.026","volume":"77","author":"S Neumayer","year":"2015","unstructured":"Neumayer, S., Efrat, A., Modiano, E.: Geographic max-flow and min-cut under a circular disk failure model. Comput. Netw. 77, 117\u2013127 (2015)","journal-title":"Comput. Netw."},{"key":"764_CR18","doi-asserted-by":"crossref","first-page":"908","DOI":"10.1109\/TNET.2014.2309253","volume":"23","author":"S Trajanovski","year":"2015","unstructured":"Trajanovski, S., Kuipers, F.A., Ili\u0107, A., Crowcroft, J., Van Mieghem, P.: Finding critical regions and region-disjoint paths in a network. IEEE ACM Trans. Netw. 23, 908\u2013921 (2015)","journal-title":"IEEE ACM Trans. Netw."},{"key":"764_CR19","doi-asserted-by":"crossref","unstructured":"Iqbal, F., Kuipers, F.: Spatiotemporal risk-averse routing. In: IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), pp. 395\u2013400 (2016)","DOI":"10.1109\/INFCOMW.2016.7562108"},{"key":"764_CR20","doi-asserted-by":"crossref","unstructured":"Agrawal,A., Sharma,P., Bhatia, V., Prakash, S.: Survivability Improvement Against Earthquakes in Backbone Optical Networks Using Actual Seismic Zone Information. arXiv:1703.02358, (2017)","DOI":"10.1109\/ANTS.2017.8384176"},{"key":"764_CR21","doi-asserted-by":"crossref","first-page":"A280","DOI":"10.1364\/JOCN.9.00A280","volume":"9","author":"Y Awaji","year":"2017","unstructured":"Awaji, Y., Furukawa, H., Xu, S., Shiraiwa, M., Wada, N., Tsuritani, T.: Resilient optical network technologies for catastrophic disasters. J. Opt. Commun. Netw. 9, A280\u2013A289 (2017)","journal-title":"J. Opt. Commun. Netw."},{"key":"764_CR22","doi-asserted-by":"crossref","unstructured":"Galdamez, C., Ye, Z.: Resilient virtual network mapping against large-scale regional failures. In: Wireless and Optical Communication Conference (WOCC), 2017, pp. 1\u20134 (2017)","DOI":"10.1109\/WOCC.2017.7928978"},{"key":"764_CR23","unstructured":"de Sousa, A., Santos, D., Monteiro, P.: Determination of the minimum cost pair of D-geodiverse paths. In: 13th International Conference Design of Reliable Communication Networks, pp. 1\u20138 (2017)"},{"key":"764_CR24","doi-asserted-by":"crossref","first-page":"1610","DOI":"10.1109\/TNET.2011.2128879","volume":"19","author":"S Neumayer","year":"2011","unstructured":"Neumayer, S., Zussman, G., Cohen, R., Modiano, E.: Assessing the vulnerability of the fiber infrastructure to disasters. IEEE ACM Trans. Netw. 19, 1610\u20131623 (2011)","journal-title":"IEEE ACM Trans. Netw."},{"key":"764_CR25","unstructured":"Foster, Jr., J. S., Gjelde, E., Graham, W. R., Hermann, R. J., Kluepfel, H. M., Lawson et al., R. L.: Report of the commission to assess the threat to the united states from electromagnetic pulse (EMP) attack: critical national infrastructures. Electromagnetic pulse (EMP) Commission. Mclean, VA (2008)"},{"key":"764_CR26","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1007\/s00454-014-9626-1","volume":"52","author":"PK Agarwal","year":"2014","unstructured":"Agarwal, P.K., Har-Peled, S., Kaplan, H., Sharir, M.: Union of random Minkowski sums and network vulnerability analysis. Discrete Comput. Geom. 52, 551\u2013582 (2014)","journal-title":"Discrete Comput. Geom."},{"key":"764_CR27","doi-asserted-by":"crossref","unstructured":"Banerjee, S., Shirazipourazad, S., Sen, A.: On region-based fault-tolerant design of distributed file storage in networks. In: 2012 Proceedings IEEE INFOCOM, pp. 2806\u20132810 (2012)","DOI":"10.1109\/INFCOM.2012.6195704"},{"key":"764_CR28","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1137\/S0097539792237462","volume":"24","author":"M Naor","year":"1995","unstructured":"Naor, M., Roth, R.M.: Optimal file sharing in distributed networks. SIAM J. Comput. 24, 158\u2013183 (1995)","journal-title":"SIAM J. Comput."},{"key":"764_CR29","doi-asserted-by":"crossref","unstructured":"Jiang, A., Bruck, J.: Memory allocation in information storage networks. In: Proceedings of the IEEE International Symposium on in Information Theory, 2003, p. 453 (2003)","DOI":"10.1109\/ISIT.2003.1228470"},{"key":"764_CR30","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1145\/1063786.1063788","volume":"1","author":"AA Jiang","year":"2005","unstructured":"Jiang, A.A., Bruck, J.: Network file storage with graceful performance degradation. ACM Trans Storage 1, 171\u2013189 (2005)","journal-title":"ACM Trans Storage"},{"key":"764_CR31","unstructured":"Trajanovski, S., Kuipers, F.A., Van Mieghem, P.: Finding critical regions in a network. In: IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), 2013, pp. 223\u2013228 (2013)"},{"key":"764_CR32","doi-asserted-by":"crossref","first-page":"1533","DOI":"10.1109\/LCOMM.2017.2691698","volume":"21","author":"J Wang","year":"2017","unstructured":"Wang, J., Bigham, J., Phillips, C.: A geographical proximity aware multi-path routing mechanism for resilient networking. IEEE Commun. Lett. 21, 1533 (2017)","journal-title":"IEEE Commun. Lett."},{"key":"764_CR33","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1287\/mnsc.17.11.712","volume":"17","author":"JY Yen","year":"1971","unstructured":"Yen, J.Y.: Finding the k shortest loopless paths in a network. Manag. Sci. 17, 712\u2013716 (1971)","journal-title":"Manag. Sci."},{"key":"764_CR34","unstructured":"Ardon, M., Malik, N.: A recursive algorithm for generating circuits and related subgraphs. In: 5th Asilomar Conference on Circuits and Systems, pp. 279\u2013284 (1971)"},{"key":"764_CR35","first-page":"411","volume":"26","author":"S Tsukiyama","year":"1976","unstructured":"Tsukiyama, S., Shirakawa, I., Ozaki, H.: An algorithm for generating all the paths between two vertices in a digraph and its application. Technol. Rep. Osaka Univ. 26, 411\u2013418 (1976)","journal-title":"Technol. Rep. Osaka Univ."},{"key":"764_CR36","unstructured":"Mehlhorn, K., Orlin, J., Tarjan, R.: Faster algorithms for the shortest path problem. Technical Report CS-TR-154-88. Princeton University, Department of Computer Science (1987)"},{"key":"764_CR37","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1145\/77600.77615","volume":"37","author":"RK Ahuja","year":"1990","unstructured":"Ahuja, R.K., Mehlhorn, K., Orlin, J., Tarjan, R.E.: Faster algorithms for the shortest path problem. JACM 37, 213\u2013223 (1990)","journal-title":"JACM"},{"key":"764_CR38","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1137\/S0097539795290477","volume":"28","author":"D Eppstein","year":"1998","unstructured":"Eppstein, D.: Finding the k shortest paths. SIAM J. Comput. 28, 652\u2013673 (1998)","journal-title":"SIAM J. Comput."},{"key":"764_CR39","unstructured":"Santos, J. L.: k-Shortest path algorithms (2007)"},{"key":"764_CR40","doi-asserted-by":"crossref","first-page":"2129","DOI":"10.1016\/j.artint.2011.07.003","volume":"175","author":"H Aljazzar","year":"2011","unstructured":"Aljazzar, H., Leue, S.: K$$\\ast $$*: a heuristic search algorithm for finding the k shortest paths. Artif. Intell. 175, 2129\u20132154 (2011)","journal-title":"Artif. Intell."},{"key":"764_CR41","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1007\/s10878-015-9934-2","volume":"32","author":"L Guo","year":"2016","unstructured":"Guo, L.: Efficient approximation algorithms for computing k. J. Comb. Optim. 32, 144\u2013158 (2016)","journal-title":"J. Comb. Optim."},{"key":"764_CR42","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"JL Bentley","year":"1975","unstructured":"Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM 18, 509\u2013517 (1975)","journal-title":"Commun. ACM"},{"key":"764_CR43","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1145\/355744.355745","volume":"3","author":"JH Friedman","year":"1977","unstructured":"Friedman, J.H., Bentley, J.L., Finkel, R.A.: An algorithm for finding best matches in logarithmic expected time. ACM Trans. Math. Softw. 3, 209\u2013226 (1977)","journal-title":"ACM Trans. Math. Softw."},{"key":"764_CR44","doi-asserted-by":"crossref","unstructured":"Panigrahy, R.: An improved algorithm finding nearest neighbor using kd-trees. LATIN 2008: Theoretical Informatics, pp. 387\u2013398 (2008)","DOI":"10.1007\/978-3-540-78773-0_34"},{"key":"764_CR45","unstructured":"Calculate distance, bearing and more between Latitude\/Longitude points. http:\/\/www.movable-type.co.uk\/scripts\/latlong.html"},{"key":"764_CR46","doi-asserted-by":"crossref","unstructured":"Tragoudas, S., Varol, Y. L.: Computing disjoint paths with length constraints. In: International Workshop on Graph-Theoretic Concepts in Computer Science, pp. 375\u2013389 (1996)","DOI":"10.1007\/3-540-62559-3_30"},{"key":"764_CR47","doi-asserted-by":"crossref","unstructured":"Kuipers, F. A.: An overview of algorithms for network survivability. ISRN Communications and Networking, vol. 2012 (2012)","DOI":"10.5402\/2012\/932456"},{"key":"764_CR48","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1002\/net.3230120306","volume":"12","author":"A Itai","year":"1982","unstructured":"Itai, A., Perl, Y., Shiloach, Y.: The complexity of finding maximum disjoint paths with length constraints. Networks 12, 277\u2013286 (1982)","journal-title":"Networks"},{"key":"764_CR49","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1002\/net.3230220705","volume":"22","author":"CL Li","year":"1992","unstructured":"Li, C.L., Simchi-Levi, D., Thomas McCormick, S.: Finding disjoint paths with different path-costs: complexity and algorithms, Networks 22, 653\u2013667 (1992)","journal-title":"Networks"},{"key":"764_CR50","first-page":"17","volume":"5","author":"P Erdos","year":"1960","unstructured":"Erdos, P., R\u00e9nyi, A.: On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci 5, 17\u201360 (1960)","journal-title":"Publ. Math. Inst. Hung. Acad. Sci"},{"key":"764_CR51","unstructured":"Watts and Strogatz model. https:\/\/en.wikipedia.org\/wiki\/Watts_and_Strogatz_model"},{"key":"764_CR52","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of \u2019small-world\u2019 networks. Nature 393, 440 (1998)","journal-title":"Nature"},{"key":"764_CR53","doi-asserted-by":"crossref","unstructured":"Verbrugge, S., Colle, D., Demeester, P., Huelsermann, R., Jaeger, M.: General availability model for multilayer transport networks. In: 5th International Workshop on Design of Reliable Communication Networks (DRCN 2005) (2005)","DOI":"10.1109\/DRCN.2005.1563848"},{"key":"764_CR54","unstructured":"CenturyLink. http:\/\/www.centurylink-business.com\/demos\/network-maps.html?server=wholesale#fiber"}],"container-title":["Photonic Network Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11107-018-0764-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11107-018-0764-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11107-018-0764-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,15]],"date-time":"2019-10-15T15:47:21Z","timestamp":1571154441000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11107-018-0764-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,13]]},"references-count":54,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,8]]}},"alternative-id":["764"],"URL":"https:\/\/doi.org\/10.1007\/s11107-018-0764-x","relation":{},"ISSN":["1387-974X","1572-8188"],"issn-type":[{"value":"1387-974X","type":"print"},{"value":"1572-8188","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,4,13]]}}}