{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T13:38:37Z","timestamp":1767706717859,"version":"3.40.3"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030446840"},{"type":"electronic","value":"9783030446857"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-44685-7_19","type":"book-chapter","created":{"date-parts":[[2020,7,22]],"date-time":"2020-07-22T14:07:01Z","timestamp":1595426821000},"page":"483-506","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Disaster-Resilient Routing Schemes for\u00a0Regional Failures"],"prefix":"10.1007","author":[{"given":"Teresa","family":"Gomes","sequence":"first","affiliation":[]},{"given":"Dorabella","family":"Santos","sequence":"additional","affiliation":[]},{"given":"Rita","family":"Gir\u00e3o-Silva","sequence":"additional","affiliation":[]},{"given":"L\u00facia","family":"Martins","sequence":"additional","affiliation":[]},{"given":"Boro","family":"Nedic","sequence":"additional","affiliation":[]},{"given":"Matthias","family":"Gunkel","sequence":"additional","affiliation":[]},{"given":"Bal\u00e1zs","family":"Vass","sequence":"additional","affiliation":[]},{"given":"J\u00e1nos","family":"Tapolcai","sequence":"additional","affiliation":[]},{"given":"Jacek","family":"Rak","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,7,23]]},"reference":[{"issue":"2","key":"19_CR1","doi-asserted-by":"publisher","first-page":"733","DOI":"10.11591\/ijeecs.v10.i2.pp733-740","volume":"10","author":"MW Ashraf","year":"2018","unstructured":"Ashraf MW, Idrus SM, Iqbal F (2018) Maximally spatial-disjoint lightpaths in optical networks. Indones J Electr Eng Comput Sci 10(2):733\u2013740","journal-title":"Indones J Electr Eng Comput Sci"},{"issue":"11","key":"19_CR2","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/s11107-018-0764-x","volume":"36","author":"MW Ashraf","year":"2018","unstructured":"Ashraf MW, Idrus SM, Iqbal F, Butt RA (2018) On spatially disjoint lightpaths in optical networks. Photon Netw Commun 36(11):11\u201325","journal-title":"Photon Netw Commun"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Beshir A, Kuipers F, Orda A, Van Mieghem P (2012) Survivable routing and regenerator placement in optical networks. In: IV International Congress on Ultra Modern Telecommunications and Control Systems (ICUMT 2012), St. Petersburg, Russia, pp 684\u2013690","DOI":"10.1109\/ICUMT.2012.6459753"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Cheng Y, Gardner MT, Li J, May R, Medhi D, Sterbenz JPG (2014) Optimised heuristics for a geodiverse routing protocol. In: 2014 10th International Conference on the Design of Reliable Communication Networks (DRCN), pp 1\u20139","DOI":"10.1109\/DRCN.2014.6816133"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Cheng Y, Gardner MT, Li J, May R, Medhi D, Sterbenz JPG (2015) Analysing geopath diversity and improving routing performance in optical networks. Comput Netw 82:50\u201367","DOI":"10.1016\/j.comnet.2015.02.021"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Cheng Y, Li J, Sterbenz JPG (2013) Path geo-diversification: design and analysis. In: 2013 5th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT), pp 46\u201353","DOI":"10.1109\/ICUMT.2013.6798403"},{"issue":"4","key":"19_CR7","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1002\/net.21660","volume":"66","author":"Y Cheng","year":"2015","unstructured":"Cheng Y, Medhi D, Sterbenz JPG (2015) Geodiverse routing with path delay and skew requirement under area-based challenges. Networks 66(4):335\u2013346","journal-title":"Networks"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Cheng Y, Sterbenz JPG (2015) Critical region identification and geodiverse routing protocol under massive challenges. In: 2015 7th International Workshop on Reliable Networks Design and Modeling (RNDM), pp 14\u201320","DOI":"10.1109\/RNDM.2015.7324303"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.osn.2018.10.003","volume":"31","author":"A de Sousa","year":"2019","unstructured":"de Sousa A, Gomes T, Gir\u00e3o-Silva R, Martins L (2019) Minimization of the network availability upgrade cost with geodiverse routing for disaster resilience. Opt Switch Netw 31:127\u2013143","journal-title":"Opt Switch Netw"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"de\u00a0Sousa A, Gomes T, Gir\u00e3o-Silva R, Martins L (2017) Minimizing the network availability upgrade cost with geodiversity guarantees. In: 2017 9th International Workshop on Resilient Networks Design and Modeling (RNDM), pp 1\u20138","DOI":"10.1109\/RNDM.2017.8093022"},{"key":"19_CR11","unstructured":"de\u00a0Sousa A, Santos D, Monteiro P (2017) Determination of the minimum cost pair of $$D$$-geodiverse paths. In: DRCN 2017\u201413th International Conference on the Design of Reliable Communication Networks, Munich, Germany"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Dikbiyik F, Reaz AS, De Leenheer M, Mukherjee B (2012) Minimizing the disaster risk in optical telecom networks. In: OFC\/NFOEC, pp 1\u20133","DOI":"10.1364\/OFC.2012.OTh4B.2"},{"issue":"18","key":"19_CR13","doi-asserted-by":"publisher","first-page":"3175","DOI":"10.1109\/JLT.2014.2334713","volume":"32","author":"F Dikbiyik","year":"2014","unstructured":"Dikbiyik F, Tornatore M, Mukherjee B (2014) Minimizing the risk from disaster failures in optical backbone networks. J Lightwave Technol 32(18):3175\u20133183","journal-title":"J Lightwave Technol"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Gir\u00e3o-Silva R, Nedic B, Gunkel M, Gomes T (2020) Shared Risk Link Group disjointness and geodiverse routing: a trade-off between benefit and practical effort. Networks (in press)","DOI":"10.1002\/net.21931"},{"issue":"3","key":"19_CR15","doi-asserted-by":"publisher","first-page":"1055","DOI":"10.1016\/j.ejor.2006.03.005","volume":"182","author":"T Gomes","year":"2007","unstructured":"Gomes T, Craveirinha J (2007) Efficient calculation of the most reliable pair of link disjoint paths in telecommunication networks. Eur J Oper Res 182(3):1055\u20131064","journal-title":"Eur J Oper Res"},{"issue":"1","key":"19_CR16","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/s11107-015-0524-0","volume":"31","author":"T Gomes","year":"2016","unstructured":"Gomes T, Jorge L, Melo P, Gir\u00e3o-Silva R (2016) Maximally node and SRLG-disjoint path pair of min-sum cost in GMPLS networks: a lexicographic approach. Photon Netw Commun 31(1):11\u201322","journal-title":"Photon Netw Commun"},{"key":"19_CR17","unstructured":"Gomes T, Sim\u00f5es C, Fernandes L (2013) Resilient routing in optical networks using SRLG-disjoint path pairs of min-sum cost. Telecommun Syst 52(2):737\u2013749"},{"key":"19_CR18","unstructured":"Gr\u00fcnthal G (1998) European macroseismic scale 1998 (EMS-98). Cahiers du Centre Europ\u00e9en de G\u00e9odynamique et de S\u00e9ismologie 15"},{"key":"19_CR19","unstructured":"http:\/\/www.deec.uc.pt\/~teresa\/rndm2018 (2018)"},{"issue":"3","key":"19_CR20","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1109\/TCOMM.2003.809779","volume":"51","author":"JQ Hu","year":"2003","unstructured":"Hu JQ (2003) Diverse routing in optical mesh networks. IEEE Trans Commun 51(3):489\u2013494","journal-title":"IEEE Trans Commun"},{"key":"19_CR21","unstructured":"IBM ILOG CPLEX Optimization Studio V12.8. IBM (2017)"},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"Iqbal F, Kuipers FA (2015) Disjoint paths in networks (invited paper). Wiley encyclopedia of electrical and electronics engineering. Wiley","DOI":"10.1002\/047134608X.W8254"},{"key":"19_CR23","doi-asserted-by":"crossref","unstructured":"Kobayashi Y, Otsuki K (2014) Max-flow min-cut theorem and faster algorithms in a circular disk failure model. In: IEEE INFOCOM 2014\u2014IEEE Conference on Computer Communications, pp 1635\u20131643","DOI":"10.1109\/INFOCOM.2014.6848100"},{"key":"19_CR24","unstructured":"Laborczi P, Tapolcai J, Ho PH, Cinkler T, Recski A, Mouftah HT (2001) Algorithms for asymmetrically weighted pair of disjoint paths in survivable networks. In: Cinkler T (ed) Proceedings of Design of Reliable Communication Networks (DRCN), Budapest, Hungary, pp 220\u2013227"},{"issue":"3","key":"19_CR25","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1142\/S0129054199000186","volume":"10","author":"E Martins","year":"1999","unstructured":"Martins E, Pascoal M, Santos J (1999) Deviation algorithms for ranking shortest paths. Int J Found Comput Sci 10(3):247\u2013263","journal-title":"Int J Found Comput Sci"},{"key":"19_CR26","doi-asserted-by":"crossref","unstructured":"Nedic B, Gunkel M, Gomes T, Gir\u00e3o-Silva R (2018) SRLG-disjointness and geodiverse routing\u2014a practical network study and operational conclusions. In: 10th International Workshop on Resilient Networks Design and Modeling (RNDM 2018). Longyearbyen, Svalbard (Spitsbergen), Norway, pp 1\u20138","DOI":"10.1109\/RNDM.2018.8489808"},{"key":"19_CR27","doi-asserted-by":"crossref","unstructured":"Oguz M, Dikbiyik F, Kuyuk HS (2016) Earthquake preparedness strategies for telecom backbone with integration of early warning systems and optical WDM networks. In: 2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM), pp 181\u2013188","DOI":"10.1109\/RNDM.2016.7608285"},{"issue":"2","key":"19_CR28","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1016\/j.ejor.2015.07.035","volume":"248","author":"K Otsuki","year":"2016","unstructured":"Otsuki K, Kobayashi Y, Murota K (2016) Improved max-flow min-cut algorithms in a circular disk failure model with application to a road network. Eur J Oper Res 248(2):396\u2013403","journal-title":"Eur J Oper Res"},{"issue":"11","key":"19_CR29","doi-asserted-by":"publisher","first-page":"742","DOI":"10.1109\/LPT.2011.2131125","volume":"23","author":"P Poggiolini","year":"2011","unstructured":"Poggiolini P, Carena A, Curri V, Bosco G, Forghieri F (2011) Analytical modeling of nonlinear propagation in uncompensated optical transmission links. IEEE Photonics Technol Lett 23(11):742\u2013744","journal-title":"IEEE Photonics Technol Lett"},{"key":"19_CR30","doi-asserted-by":"crossref","unstructured":"Sen A, Murthy S, Banerjee S (2009) Region-based connectivity\u2014a new paradigm for design of fault-tolerant networks. In: 2009 International Conference on High Performance Switching and Routing, Paris, France, pp 1\u20137","DOI":"10.1109\/HPSR.2009.5307417"},{"issue":"6","key":"19_CR31","doi-asserted-by":"publisher","first-page":"1366","DOI":"10.1109\/TNET.2008.918083","volume":"16","author":"L Song","year":"2008","unstructured":"Song L, Zhang J, Mukherjee B (2008) A comprehensive study on backup-bandwidth reprovisioning after network-state updates in survivable telecom mesh networks. IEEE\/ACM Trans Netw 16(6):1366\u20131377","journal-title":"IEEE\/ACM Trans Netw"},{"issue":"2","key":"19_CR32","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1002\/net.3230140209","volume":"14","author":"JW Suurballe","year":"1984","unstructured":"Suurballe JW, Tarjan RE (1984) A quick method for finding shortest pairs of disjoint paths. Networks 14(2):325\u2013336","journal-title":"Networks"},{"key":"19_CR33","doi-asserted-by":"crossref","unstructured":"Tapolcai J, R\u00f3nyai L, Vass B, Gyim\u00f3thi L (2017) List of shared risk link groups representing regional failures with limited size. In: IEEE INFOCOM 2017\u2014IEEE Conference on Computer Communications, pp 1\u20139","DOI":"10.1109\/INFOCOM.2017.8057040"},{"key":"19_CR34","doi-asserted-by":"crossref","unstructured":"Todimala A, Ramamurthy B (2004) IMSH: an iterative heuristic for SRLG diverse routing in WDM mesh networks. In: 13th International Conference on Computer Communications and Networks, ICCCN\u20192004, pp 199\u2013204","DOI":"10.1109\/ICCCN.2004.1401627"},{"issue":"3","key":"19_CR35","doi-asserted-by":"publisher","first-page":"908","DOI":"10.1109\/TNET.2014.2309253","volume":"23","author":"S Trajanovski","year":"2015","unstructured":"Trajanovski S, Kuipers FA, Ili\u0107 A, Crowcroft J, Van Mieghem P (2015) Finding critical regions and region-disjoint paths in a network. IEEE\/ACM Trans Netw 23(3):908\u2013921","journal-title":"IEEE\/ACM Trans Netw"},{"key":"19_CR36","doi-asserted-by":"crossref","unstructured":"Tsubaki T, Ishizuka M, Yasukawa S (2018) A new algorithm of route design against large-scale disasters. In: NOMS 2018\u20142018 IEEE\/IFIP Network Operations and Management Symposium, Taipei, Taiwan, pp 1\u20135","DOI":"10.1109\/NOMS.2018.8406209"},{"key":"19_CR37","unstructured":"Vass B, B\u00e9rczi-Kov\u00e1cs E, Tapolcai J (2017) Enumerating shared risk link groups of circular disk failures hitting $$k$$ nodes. In: DRCN 2017\u201413th International Conference on the Design of Reliable Communication Networks, Munich, Germany, pp 1\u20139"},{"key":"19_CR38","doi-asserted-by":"crossref","unstructured":"Vass B, N\u00e9meth L, Tapolcai J (2020) The Earth is nearly flat: precise and approximate algorithms for detecting vulnerable regions of networks in plane and on sphere. Networks (in press)","DOI":"10.1002\/net.21936"},{"issue":"7","key":"19_CR39","doi-asserted-by":"publisher","first-page":"1533","DOI":"10.1109\/LCOMM.2017.2691698","volume":"21","author":"J Wang","year":"2017","unstructured":"Wang J, Bigham J, Phillips C (2017) A geographical proximity aware multi-path routing mechanism for resilient networking. IEEE Commun Lett 21(7):1533\u20131536","journal-title":"IEEE Commun Lett"},{"issue":"11","key":"19_CR40","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1287\/mnsc.17.11.712","volume":"17","author":"JY Yen","year":"1971","unstructured":"Yen JY (1971) Finding the $$k$$ shortest loopless paths in a network. Manag Sci 17(11):712\u2013716","journal-title":"Manag Sci"}],"container-title":["Computer Communications and Networks","Guide to Disaster-Resilient Communication Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-44685-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,4]],"date-time":"2023-10-04T17:27:57Z","timestamp":1696440477000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-44685-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030446840","9783030446857"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-44685-7_19","relation":{},"ISSN":["1617-7975","2197-8433"],"issn-type":[{"type":"print","value":"1617-7975"},{"type":"electronic","value":"2197-8433"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"23 July 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}