{"id":"https://openalex.org/W1561631369","doi":"https://doi.org/10.1109/icbn.2005.1589622","title":"Dual-link failure resiliency through backup link mutual exclusion","display_name":"Dual-link failure resiliency through backup link mutual exclusion","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W1561631369","doi":"https://doi.org/10.1109/icbn.2005.1589622","mag":"1561631369"},"language":"en","primary_location":{"id":"doi:10.1109/icbn.2005.1589622","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icbn.2005.1589622","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2nd International Conference on Broadband Networks, 2005.","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/A5083774179","display_name":"A. Chandak","orcid":null},"institutions":[{"id":"https://openalex.org/I138006243","display_name":"University of Arizona","ror":"https://ror.org/03m2x1q45","country_code":"US","type":"education","lineage":["https://openalex.org/I138006243"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A. Chandak","raw_affiliation_strings":["Dept. of Electr. & Comput. Eng., Arizona Univ., Tucson, AZ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., Arizona Univ., Tucson, AZ, USA","institution_ids":["https://openalex.org/I138006243"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078681720","display_name":"Srinivasan Ramasubramanian","orcid":null},"institutions":[{"id":"https://openalex.org/I138006243","display_name":"University of Arizona","ror":"https://ror.org/03m2x1q45","country_code":"US","type":"education","lineage":["https://openalex.org/I138006243"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S. Ramasubramanian","raw_affiliation_strings":["Dept. of Electr. & Comput. Eng., Arizona Univ., Tucson, AZ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., Arizona Univ., Tucson, AZ, USA","institution_ids":["https://openalex.org/I138006243"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.4537,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.81660546,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"258","last_page":"267 Vol. 1"},"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9997000098228455,"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/T10714","display_name":"Software-Defined Networks and 5G","score":0.9993000030517578,"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.9158856868743896},{"id":"https://openalex.org/keywords/link","display_name":"Link (geometry)","score":0.7767020463943481},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.7047556042671204},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6544889211654663},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6260364055633545},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6120925545692444},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5271113514900208},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.498945951461792},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.47444188594818115},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.47092169523239136},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.4292244613170624},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4028022289276123},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2461751401424408},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2236720323562622},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07074487209320068}],"concepts":[{"id":"https://openalex.org/C2780945871","wikidata":"https://www.wikidata.org/wiki/Q194274","display_name":"Backup","level":2,"score":0.9158856868743896},{"id":"https://openalex.org/C2778753846","wikidata":"https://www.wikidata.org/wiki/Q6554239","display_name":"Link (geometry)","level":2,"score":0.7767020463943481},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.7047556042671204},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6544889211654663},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6260364055633545},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6120925545692444},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5271113514900208},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.498945951461792},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.47444188594818115},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.47092169523239136},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.4292244613170624},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4028022289276123},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2461751401424408},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2236720323562622},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07074487209320068},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"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/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icbn.2005.1589622","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icbn.2005.1589622","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2nd International Conference on Broadband Networks, 2005.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.137.7991","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.137.7991","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ece.arizona.edu/~srini/papers/Srini-2005-Broadnets.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.800000011920929,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1484040084","https://openalex.org/W1561631369","https://openalex.org/W1968590998","https://openalex.org/W1996983748","https://openalex.org/W2095599233","https://openalex.org/W2098143839","https://openalex.org/W2098776722","https://openalex.org/W2118889957","https://openalex.org/W2138997989","https://openalex.org/W2139166505","https://openalex.org/W2152484891","https://openalex.org/W2172092264","https://openalex.org/W6677952473","https://openalex.org/W6680573564"],"related_works":["https://openalex.org/W2955195711","https://openalex.org/W2354454611","https://openalex.org/W2993266126","https://openalex.org/W2392283887","https://openalex.org/W2351388597","https://openalex.org/W2939925694","https://openalex.org/W2829881200","https://openalex.org/W2184647741","https://openalex.org/W1974217798","https://openalex.org/W2011675579"],"abstract_inverted_index":{"One":[0],"of":[1,55,130,167,170],"the":[2,15,53,65,72,78,86,150,162,165,168],"strategies":[3],"to":[4,10,44,70,116,124,138,145,190],"recover":[5,191],"from":[6,192],"dual-link":[7,131,147,194],"failures":[8],"is":[9,42,68,122,136],"employ":[11],"link":[12,47,62],"protection":[13],"for":[14,60],"two":[16,23],"failed":[17],"links":[18,24],"independently":[19],"which":[20],"requires":[21],"that":[22,63,126,142,175],"may":[25,36,154,180],"not":[26],"use":[27],"each":[28],"other":[29],"in":[30,81],"their":[31,120],"backup":[32,46,58,87,151],"paths":[33],"if":[34],"they":[35],"fail":[37],"simultaneously.":[38],"Such":[39],"a":[40,57,98,187],"requirement":[41,67],"referred":[43,69],"as":[45,71,90],"mutual":[48],"exclusion":[49],"(BLME)":[50],"constraint":[51],"and":[52,95,112,119],"problem":[54,80],"identifying":[56],"path":[59,88,107,152],"every":[61],"satisfies":[64],"above":[66],"BLME":[73,79],"problem.":[74],"This":[75],"paper":[76,163],"explores":[77],"depth":[82],"by:":[83],"(1)":[84],"formulating":[85],"selection":[89],"an":[91],"integer":[92],"linear":[93],"program;":[94],"(2)":[96],"developing":[97],"pseudo-polynomial":[99],"time":[100],"approximation":[101],"algorithm":[102],"based":[103],"on":[104],"minimum":[105],"cost":[106],"routing.":[108],"The":[109,133],"ILP":[110],"formulation":[111],"heuristic":[113,134],"are":[114,143],"applied":[115],"six":[117],"networks":[118],"performance":[121],"compared":[123],"approaches":[125],"assume":[127],"precise":[128],"knowledge":[129,169],"failure.":[132],"approach":[135],"shown":[137],"obtain":[139],"feasible":[140],"solutions":[141],"resilient":[144],"most":[146],"failures,":[148],"although":[149],"lengths":[153],"be":[155],"significantly":[156],"higher":[157,178],"than":[158,184],"optimal.":[159],"In":[160],"addition,":[161],"demonstrates":[164],"significance":[166],"failure":[171],"location":[172],"by":[173],"illustrating":[174],"network":[176],"with":[177,186],"connectivity":[179,189],"require":[181],"lesser":[182],"capacity":[183],"one":[185],"lower":[188],"arbitrary":[193],"failures.":[195]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}