{"id":"https://openalex.org/W2026934179","doi":"https://doi.org/10.1109/icumt.2010.5676576","title":"On the complexity of computing shortest fast reroute paths","display_name":"On the complexity of computing shortest fast reroute paths","publication_year":2010,"publication_date":"2010-10-01","ids":{"openalex":"https://openalex.org/W2026934179","doi":"https://doi.org/10.1109/icumt.2010.5676576","mag":"2026934179"},"language":"en","primary_location":{"id":"doi:10.1109/icumt.2010.5676576","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icumt.2010.5676576","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Congress on Ultra Modern Telecommunications and Control Systems","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5032568553","display_name":"Aubin Jarry","orcid":null},"institutions":[{"id":"https://openalex.org/I114457229","display_name":"University of Geneva","ror":"https://ror.org/01swzsf04","country_code":"CH","type":"education","lineage":["https://openalex.org/I114457229"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Aubin Jarry","raw_affiliation_strings":["CUI-University of Geneva, Carouge, Switzerland","CUI, University of Geneva, Bat. A, route de Drize 7, CH-1227 Carouge, Switzerland"],"affiliations":[{"raw_affiliation_string":"CUI-University of Geneva, Carouge, Switzerland","institution_ids":["https://openalex.org/I114457229"]},{"raw_affiliation_string":"CUI, University of Geneva, Bat. A, route de Drize 7, CH-1227 Carouge, Switzerland","institution_ids":["https://openalex.org/I114457229"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5032568553"],"corresponding_institution_ids":["https://openalex.org/I114457229"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.09782856,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"33","issue":null,"first_page":"595","last_page":"600"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10714","display_name":"Software-Defined Networks and 5G","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/backup","display_name":"Backup","score":0.8941612243652344},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7389552593231201},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5842980146408081},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5811538100242615},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.5574013590812683},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5030657649040222},{"id":"https://openalex.org/keywords/multiprotocol-label-switching","display_name":"Multiprotocol Label Switching","score":0.46308380365371704},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4514070451259613},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.4453083276748657},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44446611404418945},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3876188099384308},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.38566136360168457},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.367622971534729},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.32212042808532715},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1165148913860321},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.07971125841140747},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.06876453757286072}],"concepts":[{"id":"https://openalex.org/C2780945871","wikidata":"https://www.wikidata.org/wiki/Q194274","display_name":"Backup","level":2,"score":0.8941612243652344},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7389552593231201},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5842980146408081},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5811538100242615},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.5574013590812683},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5030657649040222},{"id":"https://openalex.org/C129880937","wikidata":"https://www.wikidata.org/wiki/Q677023","display_name":"Multiprotocol Label Switching","level":3,"score":0.46308380365371704},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4514070451259613},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.4453083276748657},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44446611404418945},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3876188099384308},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.38566136360168457},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.367622971534729},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.32212042808532715},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1165148913860321},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.07971125841140747},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.06876453757286072},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icumt.2010.5676576","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icumt.2010.5676576","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Congress on Ultra Modern Telecommunications and Control Systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","score":0.4300000071525574,"display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1536656161","https://openalex.org/W1996805805","https://openalex.org/W2023696105","https://openalex.org/W2050815987","https://openalex.org/W2110879089","https://openalex.org/W2147147828","https://openalex.org/W2151021662","https://openalex.org/W2167670964","https://openalex.org/W2168117245","https://openalex.org/W6632227867","https://openalex.org/W6649580733"],"related_works":["https://openalex.org/W2354846196","https://openalex.org/W2391130892","https://openalex.org/W4293054712","https://openalex.org/W2360981904","https://openalex.org/W2348761196","https://openalex.org/W2347245430","https://openalex.org/W1617152041","https://openalex.org/W2392078542","https://openalex.org/W1519427079","https://openalex.org/W2597144308"],"abstract_inverted_index":{"In":[0,31,56,97,130],"order":[1],"to":[2,121],"keep":[3],"services":[4],"running":[5],"despite":[6],"link":[7],"or":[8],"node":[9],"failure":[10],"in":[11,79,127],"MPLS":[12],"networks,":[13],"RSVP-TE":[14],"fast":[15],"reroute":[16],"(FRR)":[17],"schemes":[18],"use":[19],"precomputed":[20],"backup":[21,42,92],"label-switched":[22],"path":[23],"tunnels":[24,44],"for":[25],"local":[26],"repair":[27],"of":[28,34,38,50,64,72,100,133],"LSP":[29,43],"tunnels.":[30],"the":[32,36,47,61,98,131],"event":[33],"failure,":[35],"redirection":[37],"traffic":[39],"occurs":[40],"onto":[41],"that":[45,85,105,112],"have":[46],"same":[48],"quality":[49,71],"service":[51,73],"constraints":[52],"than":[53],"original":[54,66],"paths.":[55],"this":[57,106],"paper,":[58],"we":[59,103,136],"study":[60],"algorithmic":[62],"aspects":[63],"computing":[65,113],"and":[67],"back-up":[68],"paths":[69,89,116,126],"under":[70],"constraints.":[74],"We":[75],"give":[76],"an":[77],"algorithm":[78,107,140],"O(nm+n":[80],"<sup":[81,147],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[82,148],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sup>":[83,149],"log(n))":[84],"computes":[86],"shortest":[87,114,125],"guaranteed":[88,115],"with":[90,141],"their":[91],"towards":[93],"a":[94,138],"single":[95],"destination.":[96],"case":[99,132],"directed":[101,128],"graphs,":[102,135],"show":[104],"is":[108,117],"optimal":[109],"by":[110],"proving":[111],"as":[118,120],"hard":[119],"compute":[122],"multiple":[123],"source":[124],"graphs.":[129],"undirected":[134],"propose":[137],"faster":[139],"time":[142],"complexity":[143],"O(mlog(n)":[144],"+":[145],"n":[146],").":[150]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}