{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,23]],"date-time":"2025-12-23T10:00:48Z","timestamp":1766484048318,"version":"3.38.0"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","license":[{"start":{"date-parts":[[2011,8,19]],"date-time":"2011-08-19T00:00:00Z","timestamp":1313712000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Telecommun Syst"],"DOI":"10.1007\/s11235-011-9574-5","type":"journal-article","created":{"date-parts":[[2011,8,18]],"date-time":"2011-08-18T19:18:08Z","timestamp":1313695088000},"source":"Crossref","is-referenced-by-count":7,"title":["Resilient routing in optical networks using SRLG-disjoint path pairs of min-sum cost"],"prefix":"10.1007","author":[{"given":"Teresa","family":"Gomes","sequence":"first","affiliation":[]},{"given":"Carlos","family":"Sim\u00f5es","sequence":"additional","affiliation":[]},{"given":"Lu\u00eds","family":"Fernandes","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,8,19]]},"reference":[{"key":"9574_CR1","series-title":"Springer monographs in mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4471-3886-0","volume-title":"Digraphs: Theory, Algorithms and Applications","author":"J. Bang-Jensen","year":"2002","unstructured":"Bang-Jensen, J., & Gutin, G. (2002). Springer monographs in mathematics. Digraphs: Theory, Algorithms and Applications. London: Springer."},{"key":"9574_CR2","unstructured":"Betker, A., Gerlach, C., J\u00e4ger, M., Barry, M., Bodamer, S., Sp\u00e4th, J., Gauger, C. M., & K\u00f6hn, M. (2003). Reference transport network scenario (Technical report). MultiTeraNet Report."},{"key":"9574_CR3","volume-title":"Survivable networks, algorithms for diverse routing","author":"R. Bhandari","year":"1999","unstructured":"Bhandari, R. (1999). Survivable networks, algorithms for diverse routing. Norwell: Kluwer Academic."},{"issue":"11","key":"9574_CR4","doi-asserted-by":"crossref","first-page":"2892","DOI":"10.1016\/j.cor.2009.01.002","volume":"36","author":"J. Cl\u00edmaco","year":"2009","unstructured":"Cl\u00edmaco, J., & Pascoal, M. M. B. (2009). Finding non-dominated bicriteria shortest pairs of disjoint simple paths. Computers & Operations Research, 36(11), 2892\u20132898.","journal-title":"Computers & Operations Research"},{"key":"9574_CR5","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E. W. Dijkstra","year":"1959","unstructured":"Dijkstra, E. W. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1, 269\u2013271.","journal-title":"Numerische Mathematik"},{"issue":"2","key":"9574_CR6","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1137\/S0097539795290477","volume":"28","author":"D. Eppstein","year":"1999","unstructured":"Eppstein, D. (1999). Finding the k shortest paths. SIAM Journal on Computing, 28(2), 652\u2013673.","journal-title":"SIAM Journal on Computing"},{"key":"9574_CR7","doi-asserted-by":"crossref","first-page":"5","DOI":"10.26636\/jtit.2010.3.1079","volume":"3","author":"T. Gomes","year":"2010","unstructured":"Gomes, T., & Craveirinha, J. (2010). An algorithm for enumerating SRLG diverse path pairs. Journal of Telecommunications and Information Technology, 3, 5\u201312.","journal-title":"Journal of Telecommunications and Information Technology"},{"key":"9574_CR8","first-page":"116","volume-title":"RNDM\u201910\u20142nd international workshop on reliable networks designand modeling","author":"T. Gomes","year":"2010","unstructured":"Gomes, T., & Fernandes, L. (2010). Obtaining a SRLG-disjoint path pair of min-sum cost. In J. Rak, D. Tipper, & K. Walkowiak (Eds.), RNDM\u201910\u20142nd international workshop on reliable networks designand modeling (pp.\u00a0116\u2013122). Moscow. ISBN: 978-I-4244-7283-3"},{"issue":"1","key":"9574_CR9","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s11067-007-9038-3","volume":"8","author":"L. Gouveia","year":"2008","unstructured":"Gouveia, L., Patr\u00edcio, P., & Sousa, A. (2008). Hop-constrained node survivable network design: An application to MPLS over WDM. Networks and Spatial Economics, 8(1), 3\u201321.","journal-title":"Networks and Spatial Economics"},{"issue":"1","key":"9574_CR10","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. (2004). Shared protection in mesh WDM networks. IEEE Communications Magazine, 42(1), 70\u201376.","journal-title":"IEEE Communications Magazine"},{"issue":"3","key":"9574_CR11","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1109\/TCOMM.2003.809779","volume":"51","author":"J. Q. Hu","year":"2003","unstructured":"Hu, J. Q. (2003). Diverse routing in optical mesh networks. IEEE Transactions on Communications, 51(3), 489\u2013494.","journal-title":"IEEE Transactions on Communications"},{"key":"9574_CR12","doi-asserted-by":"crossref","unstructured":"Kompella, K., & Rekhter, Y. (2005). OSPF extensions in support of generalized multi-protocol label switching (GMPLS) (IETF RFC 4203).","DOI":"10.17487\/rfc4203"},{"key":"9574_CR13","first-page":"220","volume-title":"Proceedings of design of reliable communication networks (DCRN 2001)","author":"P. Laborczi","year":"2001","unstructured":"Laborczi, P., Tapolcai, J., Ho, P.-H., Cinkler, T., Recski, A., & Mouftah, H. T. (2001). Algorithms for asymmetrically weighted pair of disjoint paths in survivable networks. In T. Cinkler (Ed.), Proceedings of design of reliable communication networks (DCRN 2001) (pp. 220\u2013227), Hungary."},{"issue":"2","key":"9574_CR14","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/s10288-002-0010-2","volume":"1","author":"E. Martins","year":"2003","unstructured":"Martins, E., & Pascoal, M. (2003). A new implementation of Yen\u2019s ranking loopless paths algorithm. 4OR, 1(2), 121\u2013134.","journal-title":"4OR"},{"key":"9574_CR15","unstructured":"Martins, E., Pascoal, M., & Santos, J. (1999). An algorithm for ranking loopless paths (Technical Report 99\/007). CISUC."},{"issue":"3","key":"9574_CR16","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. (1999). Deviation algorithms for ranking shortest paths. International Journal of Foundations of Computer Science, 10(3), 247\u2013263.","journal-title":"International Journal of Foundations of Computer Science"},{"key":"9574_CR17","doi-asserted-by":"crossref","unstructured":"Pan, P., Swallow, G., & Atlas, A. (2005). Fast reroute extensions to RSVP-TE for LSP tunnels (IETF RFC 4090).","DOI":"10.17487\/rfc4090"},{"key":"9574_CR18","first-page":"381","volume-title":"International Conference on Computational Science (ICCS 2004)","author":"X. Pan","year":"2004","unstructured":"Pan, X., & Xiao, G. (2004). Algorithms for the diverse routing problem in WDM networks with shared risk link groups. In International Conference on Computational Science (ICCS 2004) (pp. 381\u2013385), Krakow, Poland."},{"issue":"1","key":"9574_CR19","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s11107-006-5321-3","volume":"11","author":"X. Pan","year":"2006","unstructured":"Pan, X., & Xiao, G. (2006). Heuristics for diverse routing in wavelength-routed networks with shared risk link groups. Photonic Network Communications, 11(1), 29\u201338.","journal-title":"Photonic Network Communications"},{"key":"9574_CR20","volume-title":"Proceedings of the fourth European conference on universal multiservice networks (ECUMN\u201907)","author":"M. J. Rostami","year":"2007","unstructured":"Rostami, M. J., Khorsandi, S., & Khodaparast, A. A. (2007). CoSE: A SRLG-disjoint routing algorithm. In Proceedings of the fourth European conference on universal multiservice networks (ECUMN\u201907), Toulouse, France."},{"issue":"2","key":"9574_CR21","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1002\/net.3230140209","volume":"14","author":"J. W. Suurballe","year":"1984","unstructured":"Suurballe, J. W., & Tarjan, R. E. (1984). A quick method for finding shortest pairs of disjoint paths. Networks, 14(2), 325\u2013336.","journal-title":"Networks"},{"key":"9574_CR22","first-page":"199","volume-title":"13th international conference on computer communications and networks, ICCCN\u20192004","author":"A. Todimala","year":"2004","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)."},{"key":"9574_CR23","first-page":"1915","volume-title":"IEEE Globlecom 2005","author":"A. Todimala","year":"2005","unstructured":"Todimala, A., & Ramamurthy, B. (2005). A heuristic with bounded guarantee to compute diverse paths under shared protection in WDM mesh networks. In IEEE Globlecom 2005 (pp. 1915\u20131919), November 28\u2013December 2, 2005, St. Louis, MO, USA."},{"issue":"11","key":"9574_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. (2003). Trap avoidance and protection schemes in networks with shared risk link groups. Journal of Lightwave Technology, 21(11), 2683\u20132693.","journal-title":"Journal of Lightwave Technology"},{"key":"9574_CR25","volume-title":"IEEE INFOCOM 2004","author":"D. Xu","year":"2004","unstructured":"Xu, D., Chen, Y., Xiong, Y., Qiao, C., & He, X. (2004). On finding disjoint paths in single and dual link cost networks. In IEEE INFOCOM 2004, Hong Kong."},{"issue":"11","key":"9574_CR26","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1287\/mnsc.17.11.712","volume":"17","author":"J. Y. Yen","year":"1971","unstructured":"Yen, J. Y. (1971). Finding the k shortest loopless paths in a network. Management Science, 17(11), 712\u2013716.","journal-title":"Management Science"}],"container-title":["Telecommunication Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-011-9574-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11235-011-9574-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-011-9574-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,8]],"date-time":"2025-03-08T22:52:48Z","timestamp":1741474368000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11235-011-9574-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,8,19]]},"references-count":26,"alternative-id":["9574"],"URL":"https:\/\/doi.org\/10.1007\/s11235-011-9574-5","relation":{},"ISSN":["1018-4864","1572-9451"],"issn-type":[{"type":"print","value":"1018-4864"},{"type":"electronic","value":"1572-9451"}],"subject":[],"published":{"date-parts":[[2011,8,19]]}}}