{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,20]],"date-time":"2025-07-20T04:12:23Z","timestamp":1752984743392},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2014,10,2]],"date-time":"2014-10-02T00:00:00Z","timestamp":1412208000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Netw Syst Manage"],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1007\/s10922-014-9332-6","type":"journal-article","created":{"date-parts":[[2014,10,1]],"date-time":"2014-10-01T12:49:27Z","timestamp":1412167767000},"page":"1067-1103","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Two Heuristics for Calculating a Shared Risk Link Group Disjoint Set of Paths of Min-Sum Cost"],"prefix":"10.1007","volume":"23","author":[{"given":"Teresa","family":"Gomes","sequence":"first","affiliation":[]},{"given":"Miguel","family":"Soares","sequence":"additional","affiliation":[]},{"given":"Jos\u00e9","family":"Craveirinha","sequence":"additional","affiliation":[]},{"given":"Paulo","family":"Melo","sequence":"additional","affiliation":[]},{"given":"Lu\u00edsa","family":"Jorge","sequence":"additional","affiliation":[]},{"given":"Vitor","family":"Mirones","sequence":"additional","affiliation":[]},{"given":"Andr\u00e9","family":"Br\u00edzido","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,10,2]]},"reference":[{"key":"9332_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-1169-4","volume-title":"Optical networks: arquitecture and survivability","author":"HT Mouftah","year":"2003","unstructured":"Mouftah, H.T., Ho, P.-H.: Optical networks: arquitecture and survivability. Kluwer Academic Publishers, Dordrecht (2003)"},{"issue":"2","key":"9332_CR2","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1109\/TR.2008.923480","volume":"57","author":"J Tapolcai","year":"2008","unstructured":"Tapolcai, J., Pin-Han Ho, D., Verchere, T.Cinkler: A new shared segment protection method for survivable networks with guaranteed recovery time. IEEE Trans. Reliab. 57(2), 272\u2013282 (2008)","journal-title":"IEEE Trans. Reliab."},{"key":"9332_CR3","doi-asserted-by":"crossref","unstructured":"Jaumard, B., Nahar Bhuiyan, N., Sebbah, S., Huc, F., Coudert , D.: A new framework for efficient shared segment protection scheme for WDM networks. In: International Conference on High Performance Switching and Routing (HPSR), 2010, pp. 189\u2013196. (2010)","DOI":"10.1109\/HPSR.2010.5580274"},{"issue":"2","key":"9332_CR4","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/BF01035885","volume":"1","author":"D Medhi","year":"1993","unstructured":"Medhi, D., Sankarappan, S.: Impact of a transmission facility link failure on dynamic call routing cicuit-switched networks under various circuit layout policies. J. Netw. Syst. Manag. 1(2), 143\u2013169 (1993)","journal-title":"J. Netw. Syst. Manag."},{"issue":"9","key":"9332_CR5","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1109\/35.868148","volume":"38","author":"B Rajagopalan","year":"2000","unstructured":"Rajagopalan, B., Pendarakis, D., Saha, D., Ramamoorthy, R.S.: IP over optical networks: architectural aspects. IEEE Commun. Mag. 38(9), 94\u2013102 (2000)","journal-title":"IEEE Commun. Mag."},{"key":"9332_CR6","volume-title":"Network Recovery: Protection and Restoration of Optical, SONET-SDH, IP, and MPLS","author":"J-P Vasseur","year":"2004","unstructured":"Vasseur, J.-P., Pickavet, M., Demeester, P.: Network Recovery: Protection and Restoration of Optical, SONET-SDH, IP, and MPLS. Elsevier, Amsterdam (2004)"},{"key":"9332_CR7","doi-asserted-by":"crossref","unstructured":"Braden, R., Zhang, L., Berson, S., Herzog, S., Jamin, S.: Resource reservation protocol (RSVP\u2014version 1 functional specification. IETF RFC 2205). (1997)","DOI":"10.17487\/rfc2209"},{"key":"9332_CR8","doi-asserted-by":"crossref","unstructured":"Awduche, D., Berger, L., Gan, D., Li, T., Srinivasan, V., Swallow, G.: RSVP-TE: extensions to RSVP for LSP tunnels. IETF RFC 3209. (2001)","DOI":"10.17487\/rfc3209"},{"key":"9332_CR9","unstructured":"Zhang, F., Li, D., Gonzalez de Dios, O., Margaria, C.: RSVP-TE extensions for collecting SRLG information. IETF Draft. (2014)"},{"key":"9332_CR10","doi-asserted-by":"crossref","unstructured":"Kompella, K., Rekhter, Y.: Routing extensions in support of generalized multi-protocol label switching (GMPLS). IETF RFC 4202. (2005)","DOI":"10.17487\/rfc4202"},{"key":"9332_CR11","doi-asserted-by":"crossref","unstructured":"Farrel, A., Vasseur, J.-P., Ash, J.: A path computation element (PCE)-based architecture. ITEF RFC 4655. (2006)","DOI":"10.17487\/rfc4655"},{"key":"9332_CR12","unstructured":"Saturio, M. C., L\u00f3pez, V., Dios, \u00d3. G., del Nuevo, F. M., Fern\u00e1ndez-Palacios, J. P.: Implementation and assessment of pre-reservation mechanism for PCE environments. J. Netw. Syst. Manag. 22(3), 488\u2013508 (2014)"},{"issue":"2","key":"9332_CR13","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1002\/net.3230140209","volume":"14","author":"JW Suurballe","year":"1984","unstructured":"Suurballe, J.W., Tarjan, R.E.: A quick method for finding shortest pairs of disjoint paths. Networks 14(2), 325\u2013336 (1984)","journal-title":"Networks"},{"key":"9332_CR14","volume-title":"Survivable Networks, Algorithms for Diverse Routing","author":"R Bhandari","year":"1999","unstructured":"Bhandari, R.: Survivable Networks, Algorithms for Diverse Routing. Kluwer Academic Publishers, Norwell, MA (1999)"},{"key":"9332_CR15","unstructured":"Xu, D., Chen, Y., Xiong, Y., Qiao, C., He, X.: On finding disjoint paths in single and dual link cost networks. In: IEEE INFOCOM 2004. Hong Kong (2004)"},{"key":"9332_CR16","first-page":"902","volume":"2000","author":"M Kodialam","year":"2000","unstructured":"Kodialam, M., Lakshman, T.V.: Dynamic routing of bandwidth guaranteed tunnels with restoration. IEEE INFOCOM 2000, 902\u2013911 (2000)","journal-title":"IEEE INFOCOM"},{"key":"9332_CR17","first-page":"220","volume-title":"Proceedings of Design of Reliable Communication Networks (DRCN)","author":"P Laborczi","year":"2001","unstructured":"Laborczi, P., Tapolcai, J., Ho, P.-H., Cinkler, T., Recski, A., Mouftah, H.T.: Algorithms for asymmetrically weighted pair of disjoint paths in survivable networks. In: Cinkler, T. (ed.) Proceedings of Design of Reliable Communication Networks (DRCN), pp. 220\u2013227. Budapest, Hungary (2001)"},{"issue":"2","key":"9332_CR18","first-page":"783","volume":"52","author":"Ming-Lee Gan","year":"2013","unstructured":"Gan, Ming-Lee, Liew, Soung-Yue: Effective algorithms for finding optimum pairs of link-disjoint paths in $$\\alpha +1$$ \u03b1 + 1 path protection. Telecommun. Syst. 52(2), 783\u2013797 (2013)","journal-title":"Telecommun. Syst."},{"issue":"1","key":"9332_CR19","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0166-218X(90)90024-7","volume":"26","author":"CL Li","year":"1990","unstructured":"Li, C.L., McCormick, S.T., Simchi-Levi, D.: The complexity of finding two disjoint paths with min\u2013max objective function. Discret. Appl. Math. 26(1), 105\u2013115 (1990)","journal-title":"Discret. Appl. Math."},{"issue":"5","key":"9332_CR20","doi-asserted-by":"crossref","first-page":"1670","DOI":"10.1016\/j.cor.2008.04.002","volume":"36","author":"T Gomes","year":"2009","unstructured":"Gomes, T., Craveirinha, J., Jorge, L.: An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs. Comput. Oper. Res. 36(5), 1670\u20131682 (2009)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"9332_CR21","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1109\/LCOMM.2010.04.091597","volume":"14","author":"J Rak","year":"2010","unstructured":"Rak, J.: $$k$$ k -Penalty: a novel approach to find $$k$$ k -disjoint paths with differentiated path costs. Commun. Lett. IEEE 14(4), 354\u2013356 (2010)","journal-title":"Commun. Lett. IEEE"},{"issue":"3","key":"9332_CR22","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1109\/TCOMM.2003.809779","volume":"51","author":"JQ Hu","year":"2003","unstructured":"Hu, J.Q.: Diverse routing in optical mesh networks. IEEE Trans. Commun. 51(3), 489\u2013494 (2003)","journal-title":"IEEE Trans. Commun."},{"issue":"9","key":"9332_CR23","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1109\/LCOMM.2002.803477","volume":"6","author":"E Oki","year":"2002","unstructured":"Oki, E., Matsuura, N., Shiomoto, K., Yamanaka, N.: A disjoint path selection scheme with shared risk link groups in GMPLS networks. IEEE Commun. Lett. 6(9), 406\u2013408 (2002)","journal-title":"IEEE Commun. Lett."},{"issue":"11","key":"9332_CR24","doi-asserted-by":"crossref","first-page":"2683","DOI":"10.1109\/JLT.2003.819545","volume":"21","author":"D Xu","year":"2003","unstructured":"Xu, D., Xiong, Y., Qiao, C., Li, G.: Trap avoidance and protection schemes in networks with shared risk link groups. J. Lightwave Technol. 21(11), 2683\u20132693 (2003)","journal-title":"J. Lightwave Technol."},{"issue":"1","key":"9332_CR25","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1109\/MCOM.2004.1262164","volume":"42","author":"P-H Ho","year":"2004","unstructured":"Ho, P.-H., Mouftah, H.T.: Shared protection in mesh WDM networks. IEEE Commun. Mag. 42(1), 70\u201376 (2004)","journal-title":"IEEE Commun. Mag."},{"key":"9332_CR26","doi-asserted-by":"crossref","unstructured":"Rostami, M.J., Khorsandi, S., Khodaparast, A.A.: CoSE: A SRLG-disjoint routing algorithm. In: Proceedings of the Fourth European Conference on Universal Multiservice Networks (ECUMN\u201907). Toulouse (2007)","DOI":"10.1109\/ECUMN.2007.15"},{"key":"9332_CR27","doi-asserted-by":"crossref","unstructured":"Gomes, T., Fernandes, L.: Obtaining a SRLG-disjoint path pair of min-sum cost. In: Rak, J., Tipper, D., Walkowiak, K. (eds.) RNDM 2010\u20132nd International Workshop on Reliable Networks Design and Modeling, colocated with ICUMT 2010. ISBN: 978-I-4244-7283-3, pp. 116\u2013122. Moscow (2010)","DOI":"10.1109\/ICUMT.2010.5676578"},{"issue":"2","key":"9332_CR28","first-page":"737","volume":"52","author":"T Gomes","year":"2013","unstructured":"Gomes, T., Sim\u00f5es, C., Fernandes, L.: Resilient routing in optical networks using SRLG-disjoint path pairs of min-sum cost. Telecommun. Syst. J. 52(2), 737\u2013749 (2013)","journal-title":"Telecommun. Syst. J."},{"key":"9332_CR29","doi-asserted-by":"crossref","unstructured":"Todimala, A., Ramamurthy, B.: IMSH: An iterative heuristic for SRLG diverse routing in WDM mesh networks. In: Proceedings of the 13th International Conference on Computer Communications and Networks, ICCCN\u20192004, pp. 199\u2013204. (2004)","DOI":"10.1109\/ICCCN.2004.1401627"},{"issue":"2","key":"9332_CR30","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1109\/TR.2004.829141","volume":"53","author":"P-H Ho","year":"2004","unstructured":"Ho, P.-H., Tapolcai, J., Mouftah, H.T.: On achieving optimal survivable routing for shared protection in survivable next-generation internet. IEEE Trans. Reliab. 53(2), 216\u2013225 (2004)","journal-title":"IEEE Trans. Reliab."},{"issue":"12","key":"9332_CR31","doi-asserted-by":"crossref","first-page":"2381","DOI":"10.1016\/j.comnet.2008.04.017","volume":"52","author":"Pallab Datta","year":"2008","unstructured":"Datta, Pallab, Somani, Arun K.: Graph transformation approaches for diverse routing in shared risk resource group (srrg) failures. Comput. Netw. 52(12), 2381\u20132394 (2008)","journal-title":"Comput. Netw."},{"issue":"6","key":"9332_CR32","doi-asserted-by":"crossref","first-page":"1895","DOI":"10.1109\/TNET.2010.2050490","volume":"18","author":"H-W Lee","year":"2010","unstructured":"Lee, H.-W., Modiano, E., Lee, K.: Diverse routing in networks with probabilistic failures. IEEE\/ACM Trans. Netw. 18(6), 1895\u20131907 (2010)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"8","key":"9332_CR33","doi-asserted-by":"crossref","first-page":"1320","DOI":"10.1109\/LCOMM.2012.060112.120353","volume":"16","author":"O Diaz","year":"2012","unstructured":"Diaz, O., Xu, F., Min-Allah, N., Khodeir, M., Peng, M., Khan, S., Ghani, N.: Network survivability for multiple probabilistic failures. Commun. Lett. IEEE 16(8), 1320\u20131323 (2012)","journal-title":"Commun. Lett. IEEE"},{"key":"9332_CR34","doi-asserted-by":"crossref","unstructured":"Xu, D., Li, G., Ramamurthy, B., Chiu, A., Wang, D., Doverspike, R.: SRLG-diverse routing of multiple circuits in a heterogeneous optical transport network. In: Proceedings of the 8th International Workshop on the Design of Reliable Communication Networks (DRCN 2011), pp. 180\u2013187. (2011)","DOI":"10.1109\/DRCN.2011.6076901"},{"issue":"6","key":"9332_CR35","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1016\/j.comcom.2012.08.014","volume":"36","author":"Dahai Xu","year":"2013","unstructured":"Xu, Dahai, Li, Guangzhi, Ramamurthy, Byrav, Chiu, Angela, Wang, Dongmei, Doverspike, Robert: On provisioning diverse circuits in heterogeneous multi-layer optical networks. Comput. Commun. 36(6), 689\u2013697 (2013). Reliable Network-based Services.","journal-title":"Comput. Commun."},{"issue":"16","key":"9332_CR36","doi-asserted-by":"crossref","first-page":"2563","DOI":"10.1109\/JLT.2012.2201696","volume":"30","author":"MF Habib","year":"2012","unstructured":"Habib, M.F., Tornatore, M., De Leenheer, M., Dikbiyik, F., Mukherjee, B.: Design of disaster-resilient optical datacenter networks. J. Lightwave Technol. 30(16), 2563\u20132573 (2012)","journal-title":"J. Lightwave Technol."},{"key":"9332_CR37","doi-asserted-by":"crossref","unstructured":"Develder, C., Buysse, J., De Leenheer, M., Jaumard, B., Dhoedt, B.: Resilient network dimensioning for optical grid\/clouds using relocation. In: IEEE International Conference on Communications (ICC), 2012, pp 6262\u20136267. (2012)","DOI":"10.1109\/ICC.2012.6364981"},{"issue":"11","key":"9332_CR38","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$$ k shortest loopless paths in a network. Manag. Sci. 17(11), 712\u2013716 (1971)","journal-title":"Manag. Sci."},{"key":"9332_CR39","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1, 269\u2013271 (1959)","journal-title":"Numer. Math."},{"key":"9332_CR40","unstructured":"Kuipers, F.A., Korkmaz, T., Krunz, M., Van Mieghem, P.: A review of constraint-based routing algorithms. Technical report, Delft University of Technology, (2002)"},{"issue":"3","key":"9332_CR41","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1111\/j.1475-3995.2010.00772.x","volume":"18","author":"J Cl\u00edmaco","year":"2011","unstructured":"Cl\u00edmaco, J., Craveirinha, J.: On OR-based routing approaches for the Internet. Int. Trans. Oper. Res. 18(3), 295\u2013305 (2011)","journal-title":"Int. Trans. Oper. Res."},{"issue":"2","key":"9332_CR42","first-page":"121","volume":"1","author":"E Martins","year":"2003","unstructured":"Martins, E., Pascoal, M.: A new implementation of Yen\u2019s ranking loopless paths algorithm. 4OR Q. J. Belg. Fr. Ital. Oper. Res. Soc. 1(2), 121\u2013134 (2003)","journal-title":"4OR Q. J. Belg. Fr. Ital. Oper. Res. Soc."},{"issue":"3","key":"9332_CR43","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1142\/S0129054199000186","volume":"10","author":"E Martins","year":"1999","unstructured":"Martins, E., Pascoal, M., Santos, J.: Deviation algorithms for ranking shortest paths. Int. J. Found. Comput. Sci. 10(3), 247\u2013263 (1999)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"9332_CR44","unstructured":"Martins, E., Pascoal, M., Santos, J.: An algorithm for ranking loopless paths. Technical Report 99\/007, CISUC. (1999)"},{"issue":"4","key":"9332_CR45","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1002\/net.10073","volume":"41","author":"J Cl\u00edmaco","year":"2003","unstructured":"Cl\u00edmaco, J., Craveirinha, J., Pascoal, M.: A bicriterion approach for routing problems in multimedia networks. Networks 41(4), 206\u2013219 (2003)","journal-title":"Networks"},{"key":"9332_CR46","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/s11107-005-7357-1","volume":"11","author":"Chang Liu","year":"2006","unstructured":"Liu, Chang, Ruan, Lu: p-Cycle design in survivable WDM networks with shared risk link groups (SRLGs). Photonic Netw. Commun. 11, 301\u2013311 (2006)","journal-title":"Photonic Netw. Commun."},{"issue":"1","key":"9332_CR47","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1109\/TSMCB.2006.883269","volume":"37","author":"Qingfu Zhang","year":"2007","unstructured":"Zhang, Qingfu, Sun, Jianyong, Xiao, Gaoxi, Tsang, Edward: Evolutionary algorithms refining a heuristic: a hybrid method for shared-path protections in WDM networks under SRLG constraints. IEEE Trans. Syst. Man Cybern. Part B Cybern. 37(1), 51\u201361 (2007)","journal-title":"IEEE Trans. Syst. Man Cybern. Part B Cybern."},{"key":"9332_CR48","unstructured":"Bermond, J.-C., Coudert, D., D\u2019Angelo, G., Moataz, F.Z.: SRLG-diverse routing with the star property. In: Proceedings of the 9th International Conference on the Design of Reliable Communication Networks, DRCN 2013, pp. 163\u2013170. IEEE, 4\u20137 March 2013"}],"container-title":["Journal of Network and Systems Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10922-014-9332-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10922-014-9332-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10922-014-9332-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,15]],"date-time":"2019-08-15T18:31:04Z","timestamp":1565893864000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10922-014-9332-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,2]]},"references-count":48,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,10]]}},"alternative-id":["9332"],"URL":"https:\/\/doi.org\/10.1007\/s10922-014-9332-6","relation":{},"ISSN":["1064-7570","1573-7705"],"issn-type":[{"value":"1064-7570","type":"print"},{"value":"1573-7705","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,10,2]]}}}