{"id":"https://openalex.org/W2154884030","doi":"https://doi.org/10.1109/drcn.2003.1275341","title":"Backup path restoration design using path generation technique","display_name":"Backup path restoration design using path generation technique","publication_year":2004,"publication_date":"2004-07-08","ids":{"openalex":"https://openalex.org/W2154884030","doi":"https://doi.org/10.1109/drcn.2003.1275341","mag":"2154884030"},"language":"en","primary_location":{"id":"doi:10.1109/drcn.2003.1275341","is_oa":false,"landing_page_url":"https://doi.org/10.1109/drcn.2003.1275341","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fourth International Workshop on Design of Reliable Communication Networks, 2003. (DRCN 2003). Proceedings.","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/A5000792945","display_name":"Balaji Krithikaivasan","orcid":null},"institutions":[{"id":"https://openalex.org/I75421653","display_name":"University of Missouri\u2013Kansas City","ror":"https://ror.org/01w0d5g70","country_code":"US","type":"education","lineage":["https://openalex.org/I75421653"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"B. Krithikaivasan","raw_affiliation_strings":["School of Interdisciplinary Computing and Engineering, University of Missouri, Kansas City, MI, USA"],"affiliations":[{"raw_affiliation_string":"School of Interdisciplinary Computing and Engineering, University of Missouri, Kansas City, MI, USA","institution_ids":["https://openalex.org/I75421653"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101606091","display_name":"Sanjay Srivastava","orcid":"https://orcid.org/0000-0003-1306-5076"},"institutions":[{"id":"https://openalex.org/I75421653","display_name":"University of Missouri\u2013Kansas City","ror":"https://ror.org/01w0d5g70","country_code":"US","type":"education","lineage":["https://openalex.org/I75421653"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S. Srivastava","raw_affiliation_strings":["School of Interdisciplinary Computing and Engineering, University of Missouri, Kansas City, MI, USA"],"affiliations":[{"raw_affiliation_string":"School of Interdisciplinary Computing and Engineering, University of Missouri, Kansas City, MI, USA","institution_ids":["https://openalex.org/I75421653"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5094380988","display_name":"M. Piero","orcid":null},"institutions":[{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]},{"id":"https://openalex.org/I108403487","display_name":"Warsaw University of Technology","ror":"https://ror.org/00y0xnp53","country_code":"PL","type":"education","lineage":["https://openalex.org/I108403487"]}],"countries":["PL","SE"],"is_corresponding":false,"raw_author_name":"M. Piero","raw_affiliation_strings":["Lund University, Sweden","Warsaw University of Technology, Poland"],"affiliations":[{"raw_affiliation_string":"Lund University, Sweden","institution_ids":["https://openalex.org/I187531555"]},{"raw_affiliation_string":"Warsaw University of Technology, Poland","institution_ids":["https://openalex.org/I108403487"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5049499548","display_name":"Deepankar Medhi","orcid":null},"institutions":[{"id":"https://openalex.org/I75421653","display_name":"University of Missouri\u2013Kansas City","ror":"https://ror.org/01w0d5g70","country_code":"US","type":"education","lineage":["https://openalex.org/I75421653"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"D. Medhi","raw_affiliation_strings":["School of Interdisciplinary Computing and Engineering, University of Missouri, Kansas City, MI, USA"],"affiliations":[{"raw_affiliation_string":"School of Interdisciplinary Computing and Engineering, University of Missouri, Kansas City, MI, USA","institution_ids":["https://openalex.org/I75421653"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5000792945"],"corresponding_institution_ids":["https://openalex.org/I75421653"],"apc_list":null,"apc_paid":null,"fwci":1.3551,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.82395212,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"77","last_page":"84"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9990000128746033,"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.9990000128746033,"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.9945999979972839,"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/T11180","display_name":"Pesticide and Herbicide Environmental Studies","score":0.9821000099182129,"subfield":{"id":"https://openalex.org/subfields/2310","display_name":"Pollution"},"field":{"id":"https://openalex.org/fields/23","display_name":"Environmental Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/backup","display_name":"Backup","score":0.8158740997314453},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.8002588152885437},{"id":"https://openalex.org/keywords/fast-path","display_name":"Fast path","score":0.688431978225708},{"id":"https://openalex.org/keywords/column-generation","display_name":"Column generation","score":0.6732697486877441},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6468811631202698},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5442755818367004},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.4590643048286438},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.41156280040740967},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3542212247848511},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.33907729387283325},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.2984412610530853},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24848058819770813},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.18397274613380432},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.11453860998153687},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07642799615859985}],"concepts":[{"id":"https://openalex.org/C2780945871","wikidata":"https://www.wikidata.org/wiki/Q194274","display_name":"Backup","level":2,"score":0.8158740997314453},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.8002588152885437},{"id":"https://openalex.org/C32638748","wikidata":"https://www.wikidata.org/wiki/Q5437051","display_name":"Fast path","level":4,"score":0.688431978225708},{"id":"https://openalex.org/C168956720","wikidata":"https://www.wikidata.org/wiki/Q3123181","display_name":"Column generation","level":2,"score":0.6732697486877441},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6468811631202698},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5442755818367004},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.4590643048286438},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.41156280040740967},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3542212247848511},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.33907729387283325},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.2984412610530853},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24848058819770813},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.18397274613380432},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.11453860998153687},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07642799615859985},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/drcn.2003.1275341","is_oa":false,"landing_page_url":"https://doi.org/10.1109/drcn.2003.1275341","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fourth International Workshop on Design of Reliable Communication Networks, 2003. (DRCN 2003). Proceedings.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.58.6388","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.58.6388","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://conrel.sice.umkc.edu/shekhar/papers/drcn_final.pdf","raw_type":"text"},{"id":"pmh:oai:lup.lub.lu.se:b43657c0-bf31-4055-8b6a-ca8617c1a61e","is_oa":false,"landing_page_url":"https://lup.lub.lu.se/record/1024494","pdf_url":null,"source":{"id":"https://openalex.org/S4306400536","display_name":"Lund University Publications (Lund University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I187531555","host_organization_name":"Lund University","host_organization_lineage":["https://openalex.org/I187531555"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.6100000143051147,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1481747975","https://openalex.org/W1582786008","https://openalex.org/W1593250903","https://openalex.org/W1682076822","https://openalex.org/W1929501367","https://openalex.org/W1997231674","https://openalex.org/W2021528380","https://openalex.org/W2059476984","https://openalex.org/W2283125787","https://openalex.org/W2338905098"],"related_works":["https://openalex.org/W2946941768","https://openalex.org/W2315143898","https://openalex.org/W3046207687","https://openalex.org/W2995673330","https://openalex.org/W2604760770","https://openalex.org/W2490317825","https://openalex.org/W4400246438","https://openalex.org/W2138793431","https://openalex.org/W2171940562","https://openalex.org/W2758202899"],"abstract_inverted_index":{"In":[0],"this":[1],"work,":[2],"we":[3,13,118,142],"study":[4],"a":[5,26,40,56],"flow":[6],"restoration":[7,157],"based":[8,100],"network":[9],"design":[10,158],"problem":[11,67],"where":[12],"assume":[14],"the":[15,23,66,116,130,154],"knowledge":[16],"of":[17,25,46,65,132],"possible":[18],"failure":[19,53],"situations.":[20],"We":[21,58,108,128],"use":[22],"idea":[24],"situation":[27,54],"disjoint":[28],"path":[29,71,85,98,123,145,156],"pair":[30],"(nominal":[31],"path,":[32],"backup":[33,155],"path)":[34],"which":[35],"are":[36],"constructed":[37],"in":[38,50,105,115],"such":[39],"way":[41,117],"that":[42,92,113,144],"at":[43,125],"least":[44],"one":[45],"them":[47],"is":[48,88,148],"operational":[49],"any":[51],"given":[52],"for":[55,135],"flow.":[57],"present":[59,129],"an":[60,89,136,149],"approximate":[61],"linear":[62],"programming":[63],"formulation":[64],"and":[68,120],"show":[69],"how":[70],"generation":[72,86,146],"technique":[73],"(based":[74],"on":[75,101],"column":[76],"generation)":[77],"can":[78],"be":[79],"used":[80],"to":[81,95,152],"solve":[82,153],"it.":[83],"The":[84],"approach":[87,134,147],"iterative":[90],"method":[91,151],"allows":[93],"us":[94],"add":[96,121],"new":[97,122],"pairs":[99,124],"dual":[102],"Lagrangean":[103],"multipliers":[104],"every":[106,126],"iteration.":[107,127],"consider":[109],"four":[110],"different":[111],"scenarios":[112],"differ":[114],"compute":[119],"results":[131],"our":[133,140],"example":[137],"network.":[138],"From":[139],"observations,":[141],"conclude":[143],"effective":[150],"problem.":[159]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}