{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T20:37:20Z","timestamp":1743107840765,"version":"3.40.3"},"publisher-location":"Cham","reference-count":35,"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_17","type":"book-chapter","created":{"date-parts":[[2020,7,22]],"date-time":"2020-07-22T14:07:01Z","timestamp":1595426821000},"page":"429-453","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Fundamental Schemes to Determine Disjoint Paths for Multiple Failure Scenarios"],"prefix":"10.1007","author":[{"given":"Teresa","family":"Gomes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luisa","family":"Jorge","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rita","family":"Gir\u00e3o-Silva","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jose","family":"Yallouz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P\u00e9ter","family":"Babarczi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jacek","family":"Rak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,7,23]]},"reference":[{"key":"17_CR1","unstructured":"Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms and applications. Prentice Hall"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Bhandari R (1997) Optimal physical diversity algorithms and survivable networks. In: Second IEEE Symposium on Computers and Communications, 1997. Proceedings. IEEE, pp 433\u2013441","DOI":"10.1109\/ISCC.1997.616037"},{"key":"17_CR3","volume-title":"Survivable networks, algorithms for diverse routing","author":"R Bhandari","year":"1999","unstructured":"Bhandari R (1999) Survivable networks, algorithms for diverse routing. Kluwer Academic Publishers, Norwell, MA, USA"},{"key":"17_CR4","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"},{"key":"17_CR5","doi-asserted-by":"crossref","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","DOI":"10.1002\/net.21660"},{"issue":"3","key":"17_CR6","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1016\/j.ejor.2016.05.008","volume":"254","author":"RC de Andrade","year":"2016","unstructured":"de Andrade RC (2016) New formulations for the elementary shortest-path problem visiting a given set of nodes. Eur J Oper Res 254(3):755\u2013768","journal-title":"Eur J Oper Res"},{"key":"17_CR7","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":"17_CR8","unstructured":"de\u00a0Sousa A, Santos D, Monteiro P (2017) Determination of the minimum cost pair of $$D$$-geodiverse paths. In: The 2017 International Conference on Design of Reliable Communication Networks (DRCN 2017), Munich"},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra EW (1959) A note on two problems in connexion with graphs. Numer Math 1:269\u2013271","journal-title":"Numer Math"},{"key":"17_CR10","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman & Co.,"},{"issue":"3","key":"17_CR11","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":"2","key":"17_CR12","first-page":"737","volume":"52","author":"T Gomes","year":"2013","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","journal-title":"Telecommun Syst"},{"issue":"4","key":"17_CR13","doi-asserted-by":"publisher","first-page":"1067","DOI":"10.1007\/s10922-014-9332-6","volume":"23","author":"T Gomes","year":"2015","unstructured":"Gomes T, Soares M, Craveirinha J, Melo P, Jorge L, Mirones V, Br\u00edzido A (2015) Two heuristics for calculating a shared risk link group disjoint set of paths of min-sum cost. J Netw Syst Manag 23(4):1067\u20131103","journal-title":"J Netw Syst Manag"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Gomes T, Tapolcai J, Esposito C, Hutchison D, Kuipers F, Rak J, de\u00a0Sousa A, Iossifides A, Travanca R, Andr\u00e9 J, Jorge L, Martins L, Ugalde PO, Pa\u0161i\u0107 A, Pezaros D, Jouet S, Secci S, Tornatore M (2016) A survey of strategies for communication networks to protect against large-scale natural disasters. In: 2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM), pp 11\u201322","DOI":"10.1109\/RNDM.2016.7608263"},{"issue":"3","key":"17_CR15","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":"17_CR16","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0022-247X(66)90020-5","volume":"14","author":"H Joksch","year":"1966","unstructured":"Joksch H (1966) The shortest route problem with constraints. J Math Anal Appl 14:191\u2013197","journal-title":"J Math Anal Appl"},{"issue":"5","key":"17_CR17","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/S0167-6377(01)00069-4","volume":"28","author":"DH Lorenz","year":"2001","unstructured":"Lorenz DH, Raz D (2001) A simple efficient approximation scheme for the restricted shortest path problem. Oper Res Lett 28(5):213\u2013219","journal-title":"Oper Res Lett"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Martins L, Gomes T, Tipper D (2017) Efficient heuristics for determining node-disjoint path pairs visiting specified nodes. Networks 70(4):292\u2013307","DOI":"10.1002\/net.21778"},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"Moy C (1998) OSPF version 2. IETF RFC 2328","DOI":"10.17487\/rfc2328"},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"Oran D (1990) OSI IS-IS intra-domain routing protocol. IETF RFC 1142","DOI":"10.17487\/rfc1142"},{"issue":"5","key":"17_CR21","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1287\/opre.8.5.733","volume":"8","author":"M Pollack","year":"1960","unstructured":"Pollack M (1960) The maximum capacity through a network. Oper Res 8(5):733\u2013736","journal-title":"Oper Res"},{"key":"17_CR22","doi-asserted-by":"crossref","unstructured":"Rak J (2015) Resilient routing in communication networks. Springer, Switzerland","DOI":"10.1007\/978-3-319-22333-9"},{"issue":"4","key":"17_CR23","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1109\/LCOMM.2010.04.091597","volume":"14","author":"J Rak","year":"2010","unstructured":"Rak J (2010) $$k$$-Penalty: a novel approach to find $$k$$-disjoint paths with differentiated path costs. IEEE Commun Lett 14(4):354\u2013356","journal-title":"IEEE Commun Lett"},{"issue":"1","key":"17_CR24","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1109\/JLT.2011.2175198","volume":"30","author":"J Rak","year":"2012","unstructured":"Rak J (2012) Fast service recovery under shared protection in WDM networks. J Lightwave Technol 30(1):84\u201395","journal-title":"J Lightwave Technol"},{"key":"17_CR25","doi-asserted-by":"crossref","unstructured":"Rostami MJ, Khorsandi S, Khodaparast AA (2007) CoSE: a SRLG-disjoint routing algorithm. In: Proceedings of the Fourth European Conference on Universal Multiservice Networks (ECUMN\u201907), Toulouse, France","DOI":"10.1109\/ECUMN.2007.15"},{"issue":"4","key":"17_CR26","first-page":"303","volume":"10","author":"A Sen","year":"2001","unstructured":"Sen A, Shen BH, Bandyopadhyray S (2001) Survivability of lightwave networks\u2014path lengths in WDM protection scheme. J High Speed Netw 10(4):303\u2013315","journal-title":"J High Speed Netw"},{"key":"17_CR27","unstructured":"Shen BH, Hao B, Sen A (2004) On multipath routing using widest pair of disjoint paths. In: 2004 Workshop on High Performance Switching and Routing, pp 134\u2013140"},{"issue":"2","key":"17_CR28","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"},{"issue":"2","key":"17_CR29","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1109\/TR.2008.923480","volume":"57","author":"J Tapolcai","year":"2008","unstructured":"Tapolcai J, Ho PH, Verchere D, Cinkler T, Haque A (2008) A new shared segment protection method for survivable networks with guaranteed recovery time. IEEE Trans Reliab 57(2):272\u2013282","journal-title":"IEEE Trans Reliab"},{"key":"17_CR30","doi-asserted-by":"crossref","unstructured":"Tapolcai J, Ronyai L, Vass B, Gyimothi 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":"17_CR31","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"},{"key":"17_CR32","unstructured":"Xu D, Chen Y, Xiong Y, Qiao C, He X (2006) On the complexity of and algorithms for finding the shortest path with a disjoint counterpart. IEEE\/ACM Trans Netw 14(1):147\u2013158"},{"key":"17_CR33","unstructured":"Xu D, Xiong Y, Qiao C, Li G (2003) Trap avoidance and protection schemes in networks with shared risk link groups. J Lightwave Technol 21(11):2683\u20132693"},{"issue":"1","key":"17_CR34","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1109\/TNET.2016.2606342","volume":"25","author":"J Yallouz","year":"2017","unstructured":"Yallouz J, Orda A (2017) Tunable QoS-aware network survivability. IEEE\/ACM Trans Netw 25(1):139\u2013149","journal-title":"IEEE\/ACM Trans Netw"},{"issue":"3","key":"17_CR35","doi-asserted-by":"publisher","first-page":"1110","DOI":"10.1109\/TNET.2018.2823912","volume":"26","author":"J Yallouz","year":"2018","unstructured":"Yallouz J, Rottenstreich O, Babarczi P, Mendelson A, Orda A (2018) Minimum-weight link-disjoint node\u2014\u201csomewhat disjoint\u201d paths. IEEE\/ACM Trans Netw 26(3):1110\u20131122","journal-title":"IEEE\/ACM Trans Netw"}],"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_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,22]],"date-time":"2020-07-22T23:29:06Z","timestamp":1595460546000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-44685-7_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030446840","9783030446857"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-44685-7_17","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"}}]}}