{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T15:53:19Z","timestamp":1762444399406},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,8,23]],"date-time":"2013-08-23T00:00:00Z","timestamp":1377216000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Telecommun Syst"],"published-print":{"date-parts":[[2014,5]]},"DOI":"10.1007\/s11235-013-9822-y","type":"journal-article","created":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T21:27:31Z","timestamp":1377206851000},"page":"103-119","source":"Crossref","is-referenced-by-count":10,"title":["Optimization methods for improving IP-level fast protection for local shared risk groups with Loop-Free Alternates"],"prefix":"10.1007","volume":"56","author":[{"given":"M\u00e1t\u00e9","family":"Nagy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00e1nos","family":"Tapolcai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00e1bor","family":"R\u00e9tv\u00e1ri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,8,23]]},"reference":[{"key":"9822_CR1","unstructured":"Atlas, A., Kebler, R., Konstantynowicz, M., Enyedi, G., Cs\u00e1sz\u00e1r, A., & Shand, M. (2011). An architecture for IP\/LDP fast-reroute using maximally redundant trees. Internet draft."},{"key":"9822_CR2","doi-asserted-by":"crossref","unstructured":"Atlas, A., & Zinin, A. (2008). Basic specification for IP fast reroute: Loop-Free Alternates. RFC 5286.","DOI":"10.17487\/rfc5286"},{"key":"9822_CR3","unstructured":"Bryant, S., Filsfils, C., Previdi, S., & Shand, M. (2007). IP Fast Reroute using tunnels. Internet draft."},{"key":"9822_CR4","unstructured":"Bryant, S., Shand, M., & Previdi, S. (2010). IP fast reroute using Not-via addresses. Internet draft."},{"key":"9822_CR5","doi-asserted-by":"crossref","unstructured":"Callon, R. (1990). Use of OSI IS-IS for routing in TCP\/IP and dual environments. RFC 1195.","DOI":"10.17487\/rfc1195"},{"key":"9822_CR6","first-page":"152","volume-title":"Broadnets","author":"T. \u010ci\u010dic","year":"2007","unstructured":"\u010ci\u010dic, T., Hansen, A. F., & Apeland, O. K. (2007). Redundant trees for fast IP recovery. In Broadnets (pp. 152\u2013159)."},{"key":"9822_CR7","unstructured":"Cisco Systems (2008). Cisco IOS XR routing configuration guide. Release 3.7."},{"issue":"4","key":"9822_CR8","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1109\/MNET.2007.386464","volume":"21","author":"A. Cs\u00e1sz\u00e1r","year":"2007","unstructured":"Cs\u00e1sz\u00e1r, A., Enyedi, G., Hidell, M., R\u00e9tv\u00e1ri, G., & Sj\u00f6din, P. (2007). Converging the evolution of router architectures and IP networks. IEEE Network Magazine, Special Issue on Advances in Network Systems Architecture, 21(4), 8\u201314. doi: 10.1109\/MNET.2007.386464 .","journal-title":"IEEE Network Magazine, Special Issue on Advances in Network Systems Architecture"},{"key":"9822_CR9","volume-title":"EUNICE","author":"G. Enyedi","year":"2007","unstructured":"Enyedi, G., R\u00e9tv\u00e1ri, G., & Cinkler, T. (2007). A novel loop-free IP fast reroute algorithm. In EUNICE."},{"key":"9822_CR10","unstructured":"Enyedi, G., & R\u00e9tv\u00e1ri, R. (2010). Finding multiple maximally redundant trees in linear time. Periodica Polytechnica. Available online: http:\/\/opti.tmit.bme.hu\/~enyedi\/ipfrr\/distMaxRedTree.pdf (to appear)."},{"key":"9822_CR11","volume-title":"INFOCOM mini-conf.","author":"G. Enyedi","year":"2009","unstructured":"Enyedi, G., Szil\u00e1gyi, P., R\u00e9tv\u00e1ri, G., & Cs\u00e1sz\u00e1r, A. (2009). IP fast ReRoute: lightweight Not-via without additional addresses. In INFOCOM mini-conf."},{"issue":"10","key":"9822_CR12","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1109\/MCOM.2002.1039866","volume":"40","author":"B. Fortz","year":"2002","unstructured":"Fortz, B., Rexford, J., & Thorup, M. (2002). Traffic engineering with traditional IP routing protocols. IEEE Communications Magazine, 40(10), 118\u2013124.","journal-title":"IEEE Communications Magazine"},{"key":"9822_CR13","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1145\/1095921.1095962","volume-title":"ACM CoNEXT","author":"P. Francois","year":"2005","unstructured":"Francois, P., & Bonaventure, O. (2005). An evaluation of IP-based fast reroute techniques. In ACM CoNEXT (pp. 244\u2013245)."},{"issue":"3","key":"9822_CR14","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1145\/1070873.1070877","volume":"35","author":"P. Francois","year":"2005","unstructured":"Francois, P., Filsfils, C., Evans, J., & Bonaventure, O. (2005). Achieving sub-second IGP convergence in large IP networks. Computer Communication Review, 35(3), 35\u201344.","journal-title":"Computer Communication Review"},{"key":"9822_CR15","volume-title":"Computers and intractability; a guide to the theory of NP-completeness","author":"M. Garey","year":"1990","unstructured":"Garey, M., & Johnson, D. (1990). Computers and intractability; a guide to the theory of NP-completeness. New York: Freeman."},{"key":"9822_CR16","volume-title":"IEEE comsware","author":"M. Gjoka","year":"2007","unstructured":"Gjoka, M., Ram, V., & Yang, X. (2007). Evaluation of IP fast reroute proposals. In IEEE comsware."},{"key":"9822_CR17","unstructured":"Gomes, T., Simoes, C., & Fernandes, L. (2010). Resilient routing in optical networks using SRLG-disjoint path pairs of min-sum cost. Telecommunication Systems."},{"key":"9822_CR18","unstructured":"Hewlett-Packard (2008) HP 6600 router series: QuickSpecs. Available online: http:\/\/h18000.www1.hp.com\/products\/quickspecs\/13811_na\/13811_na.PDF ."},{"key":"9822_CR19","doi-asserted-by":"crossref","unstructured":"Hock, D., Hartmann, M., Menth, M., Pi\u00f3ro, M., Tomaszewski, A., & Zukowski, C. (2011). Comparison of IP-based and explicit paths for one-to-one FastReroute in MPLS networks. Telecommunication Systems.","DOI":"10.1007\/s11235-011-9603-4"},{"key":"9822_CR20","unstructured":"Hokelek, I., Fecko, M., Gurung, P., Samtani, S., Cevher, S., & Sucec, J. (2008). Loop-free IP Fast Reroute using local and remote LFAPs. Internet draft."},{"key":"9822_CR21","unstructured":"Juniper Networks (2009) JUNOS 9.6 Routing protocols configuration guide."},{"key":"9822_CR22","unstructured":"Knight, S., Nguyen, H. X., Falkner, N., Bowden, R., & Roughan, M. The Internet Topology Zoo. http:\/\/www.topology-zoo.org ."},{"key":"9822_CR23","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/3-540-32390-2_27","volume-title":"Computer recognition systems: proceedings of the 4th international conference on computer recognition systems (CORES\u201905)","author":"P. Kulaga","year":"2005","unstructured":"Kulaga, P., Sapiecha, P., & Sej, K. (2005). Approximation algorithm for the argument reduction problem. In Computer recognition systems: proceedings of the 4th international conference on computer recognition systems (CORES\u201905) (p. 243). Berlin: Springer."},{"issue":"2","key":"9822_CR24","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1109\/TNET.2008.926507","volume":"17","author":"A. Kvalbein","year":"2009","unstructured":"Kvalbein, A., Hansen, A. F., \u010ci\u010dic, T., Gjessing, S., & Lysne, O. (2009). Multiple routing configurations for fast IP network recovery. IEEE\/ACM Transactions on Networking, 17(2), 473\u2013486.","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"9822_CR25","volume-title":"INFOCOM 2010","author":"K. W. Kwong","year":"2010","unstructured":"Kwong, K. W., Gao, L., Guerin, R., & Zhang, Z. L. (2010). On the feasibility and efficacy of protection routing in IP networks. In INFOCOM 2010 (long version appears as tech. rep. 2009, University of Pennsylvania)."},{"key":"9822_CR26","volume-title":"INFOCOM","author":"S. Lee","year":"2004","unstructured":"Lee, S., Yu, Y., Nelakuditi, S., Zhang, Z. L., & Chuah, C. N. (2004). Proactive vs reactive approaches to failure resilient routing. In INFOCOM."},{"key":"9822_CR27","unstructured":"LEMON\u2014library for efficient modeling and optimization in networks (2009). http:\/\/lemon.cs.elte.hu\/ ."},{"key":"9822_CR28","volume-title":"ACM CoNEXT","author":"A. Li","year":"2007","unstructured":"Li, A., Francois, P., & Yang, X. (2007). On improving the efficiency and manageability of NotVia. In ACM CoNEXT."},{"key":"9822_CR29","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1145\/1658939.1658974","volume-title":"ACM CoNEXT","author":"A. Li","year":"2009","unstructured":"Li, A., Yang, X., & Wetherall, D. (2009). SafeGuard: safe forwarding during route changes. In ACM CoNEXT (pp. 301\u2013312)."},{"issue":"4","key":"9822_CR30","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/0012-365X(75)90058-8","volume":"13","author":"L. Lov\u00e1sz","year":"1975","unstructured":"Lov\u00e1sz, L. (1975). On the ratio of optimal integral and fractional covers. Discrete Mathematics, 13(4), 383\u2013390.","journal-title":"Discrete Mathematics"},{"key":"9822_CR31","first-page":"231","volume-title":"ACM IMC","author":"R. Mahajan","year":"2002","unstructured":"Mahajan, R., Spring, N., Wetherall, D., & Anderson, T. (2002). Inferring link weights using end-to-end measurements. In ACM IMC (pp. 231\u2013236)."},{"issue":"4","key":"9822_CR32","doi-asserted-by":"crossref","first-page":"749","DOI":"10.1109\/TNET.2007.902727","volume":"16","author":"A. Markopoulou","year":"2008","unstructured":"Markopoulou, A., Iannaccone, G., Bhattacharyya, S., Chuah, C., Ganjali, Y., & Diot, C. (2008). Characterization of failures in an operational IP backbone network. IEEE\/ACM Transactions on Networking, 16(4), 749\u2013762.","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"9822_CR33","series-title":"Advances in Soft Computing","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1007\/978-3-540-75175-5_31","volume-title":"Computer Recognition Systems 2","author":"B. Mazbic-Kulma","year":"2007","unstructured":"Mazbic-Kulma, B., & Sep, K. (2007). Some approximation algorithms for minimum vertex cover in a hypergraph. In M. Kurzynski, E. Puchala, M. Wozniak, & A. Zolnierek (Eds.), Advances in Soft Computing: Vol.\u00a045. Computer Recognition Systems 2 (pp. 250\u2013257). Berlin: Springer."},{"key":"9822_CR34","unstructured":"Menth, M., Hartmann, M., & Hock, D. (2010). Routing optimization with IP Fast Reroute. Internet draft."},{"issue":"8","key":"9822_CR35","doi-asserted-by":"crossref","first-page":"1300","DOI":"10.1016\/j.comnet.2009.10.020","volume":"54","author":"M. Menth","year":"2010","unstructured":"Menth, M., Hartmann, M., Martin, R., \u010ci\u010di\u0107, T., & Kvalbein, A. (2010). Loop-free alternates and not-via addresses: a\u00a0proper combination for IP fast reroute? Computer Networks, 54(8), 1300\u20131315.","journal-title":"Computer Networks"},{"key":"9822_CR36","doi-asserted-by":"crossref","unstructured":"Moy, J. (1998). OSPF version 2. RFC 2328.","DOI":"10.17487\/rfc2328"},{"key":"9822_CR37","volume-title":"Proc. of the 4th international workshop on reliable networks design and modeling (RNDM)","author":"M. Nagy","year":"2011","unstructured":"Nagy, M., & R\u00e9tv\u00e1ri, G. (2011). An evaluation of approximate network optimization methods for improving IP-level fast protection with loop-free alternates. In Proc. of the 4th international workshop on reliable networks design and modeling (RNDM)."},{"key":"9822_CR38","doi-asserted-by":"crossref","unstructured":"Pan, P., Swallow, G., & Atlas, A. (2005). Fast reroute extensions to RSVP-TE for LSP tunnels. RFC 4090.","DOI":"10.17487\/rfc4090"},{"key":"9822_CR39","unstructured":"Previdi, S. (2006). IP fast ReRoute technologies. APRICOT."},{"key":"9822_CR40","volume-title":"Proc. international workshop on design of reliable communication networks (DRCN)","author":"G. R\u00e9tv\u00e1ri","year":"2011","unstructured":"R\u00e9tv\u00e1ri, G., Csikor, L., Tapolcai, J., Enyedi, G., & Cs\u00e1sz\u00e1r, A. (2011). Optimizing IGP link costs for improving IP-level resilience. In Proc. international workshop on design of reliable communication networks (DRCN)."},{"key":"9822_CR41","doi-asserted-by":"crossref","first-page":"2948","DOI":"10.1109\/INFCOM.2011.5935135","volume-title":"INFOCOM 2011","author":"G. R\u00e9tv\u00e1ri","year":"2011","unstructured":"R\u00e9tv\u00e1ri, G., Tapolcai, J., Enyedi, G., & Cs\u00e1sz\u00e1r, A. (2011). IP fast ReRoute: Loop Free Alternates revisited. In INFOCOM 2011 (pp. 2948\u20132956)."},{"key":"9822_CR42","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1109\/HPSR.2003.1226686","volume-title":"Workshop on high performance switching and routing (HPSR 2003)","author":"G. Schollmeier","year":"2003","unstructured":"Schollmeier, G., Charzinski, J., Kirstadter, A., Reichert, C., Schrodi, K., Glickman, Y., & Winkler, C. (2003). Improving the resilience in IP networks. In Workshop on high performance switching and routing (HPSR 2003) (pp. 91\u201396)."},{"key":"9822_CR43","doi-asserted-by":"crossref","unstructured":"Shand, M., & Bryant, S. (2010). IP Fast Reroute framework. RFC 5714.","DOI":"10.17487\/rfc5714"},{"key":"9822_CR44","unstructured":"SNDlib: Survivable fixed telecommunication network design library. http:\/\/sndlib.zib.de ."},{"key":"9822_CR45","volume-title":"Evaluation of network resilience, survivability, and disruption tolerance: analysis, topology generation, simulation and experimentation","author":"J. Sterbez","year":"2011","unstructured":"Sterbez, J., Cetinkaya, E., Hameed, M., Jabbar, A., Qian, S., & Rohrer, J. (2011). Evaluation of network resilience, survivability, and disruption tolerance: analysis, topology generation, simulation and experimentation. Berlin: Springer."},{"key":"9822_CR46","doi-asserted-by":"crossref","unstructured":"Swallow, G., Bryant, S., & Andersson, L. (2007). Avoiding equal cost multipath treatment in MPLS networks. RFC 4928.","DOI":"10.17487\/rfc4928"},{"key":"9822_CR47","unstructured":"Thorup, M., & Roughan, M. (2001). Avoiding ties in shortest path first routing (Technical Report). AT&T, Shannon Laboratory, Florham Park, NJ. http:\/\/www.research.att.com\/~mthorup\/PAPERS\/ties_ospf.ps ."},{"key":"9822_CR48","volume-title":"Rencontres francophones sur les aspects algorithmiques des telecommunications (Algotel 2009)","author":"H. T. Viet","year":"2009","unstructured":"Viet, H. T., Francois, P., Deville, Y., & Bonaventure, O. (2009). Implementation of a traffic engineering technique that preserves IP Fast Reroute in COMET. In Rencontres francophones sur les aspects algorithmiques des telecommunications (Algotel 2009)."},{"key":"9822_CR49","volume-title":"INFOCOM","author":"Z. Zhong","year":"2005","unstructured":"Zhong, Z., Nelakuditi, S., Yu, Y., Lee, S., Wang, J., & Chuah, C. N. (2005). Failure inferencing based fast rerouting for handling transient link and node failures. In INFOCOM."}],"container-title":["Telecommunication Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-013-9822-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11235-013-9822-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-013-9822-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,17]],"date-time":"2024-05-17T01:29:02Z","timestamp":1715909342000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11235-013-9822-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8,23]]},"references-count":49,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,5]]}},"alternative-id":["9822"],"URL":"https:\/\/doi.org\/10.1007\/s11235-013-9822-y","relation":{},"ISSN":["1018-4864","1572-9451"],"issn-type":[{"value":"1018-4864","type":"print"},{"value":"1572-9451","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,8,23]]}}}