{"id":"https://openalex.org/W2137181539","doi":"https://doi.org/10.1109/icccn.2007.4317870","title":"Enhancing Robustness Under Dual-Link Failures","display_name":"Enhancing Robustness Under Dual-Link Failures","publication_year":2007,"publication_date":"2007-08-01","ids":{"openalex":"https://openalex.org/W2137181539","doi":"https://doi.org/10.1109/icccn.2007.4317870","mag":"2137181539"},"language":"en","primary_location":{"id":"doi:10.1109/icccn.2007.4317870","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccn.2007.4317870","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 16th International Conference on Computer Communications and Networks","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/A5111574119","display_name":"Sandeep Kour Ahuja","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":"Sandeep Kour Ahuja","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Arizona Tucson, Tucson, AZ, USA","Arizona Univ., Tucson#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Arizona Tucson, Tucson, AZ, USA","institution_ids":["https://openalex.org/I138006243"]},{"raw_affiliation_string":"Arizona Univ., Tucson#TAB#","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":"Srinivasan Ramasubramanian","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Arizona Tucson, Tucson, AZ, USA","Arizona Univ., Tucson#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Arizona Tucson, Tucson, AZ, USA","institution_ids":["https://openalex.org/I138006243"]},{"raw_affiliation_string":"Arizona Univ., Tucson#TAB#","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":0.3592,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.67769649,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"510","last_page":"515"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9994000196456909,"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.9994000196456909,"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/T11180","display_name":"Pesticide and Herbicide Environmental Studies","score":0.9876000285148621,"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"}},{"id":"https://openalex.org/T10714","display_name":"Software-Defined Networks and 5G","score":0.9848999977111816,"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/robustness","display_name":"Robustness (evolution)","score":0.7200800180435181},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6685371398925781},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6630251407623291},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.575955331325531},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.5443458557128906},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5389820337295532},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5074986815452576},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.4997262954711914},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4542080760002136},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.4342897832393646},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.4277164936065674},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33531898260116577},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1414335072040558},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.11484095454216003},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.086113840341568}],"concepts":[{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.7200800180435181},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6685371398925781},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6630251407623291},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.575955331325531},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.5443458557128906},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5389820337295532},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5074986815452576},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.4997262954711914},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4542080760002136},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.4342897832393646},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.4277164936065674},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33531898260116577},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1414335072040558},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.11484095454216003},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.086113840341568},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icccn.2007.4317870","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccn.2007.4317870","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 16th International Conference on Computer Communications and Networks","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"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":19,"referenced_works":["https://openalex.org/W111740604","https://openalex.org/W1528862039","https://openalex.org/W1536656161","https://openalex.org/W1977545325","https://openalex.org/W1985893635","https://openalex.org/W1996983748","https://openalex.org/W1998012504","https://openalex.org/W2023286597","https://openalex.org/W2103707056","https://openalex.org/W2119257015","https://openalex.org/W2128097223","https://openalex.org/W2140297344","https://openalex.org/W2152484891","https://openalex.org/W2154434560","https://openalex.org/W2155061423","https://openalex.org/W2158685305","https://openalex.org/W2752885492","https://openalex.org/W3145128584","https://openalex.org/W4246219036"],"related_works":["https://openalex.org/W2198982833","https://openalex.org/W4293054712","https://openalex.org/W2767202586","https://openalex.org/W2375775343","https://openalex.org/W2388654557","https://openalex.org/W2360981904","https://openalex.org/W2365712669","https://openalex.org/W2161960576","https://openalex.org/W1990043277","https://openalex.org/W2349797546"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"show":[4],"that":[5,78,95],"minimizing":[6,14],"the":[7,15,31,36,46,53,101],"product":[8,91],"of":[9,17,38,96],"path":[10,48,71,89],"lengths":[11],"results":[12],"in":[13,30],"probability":[16],"connection":[18],"failure":[19],"between":[20,42],"a":[21,56,80],"source":[22],"and":[23],"destination":[24],"given":[25],"two":[26,43],"links":[27],"have":[28],"failed":[29],"network.":[32],"We,":[33],"therefore,":[34],"analyze":[35],"problem":[37,54],"finding":[39],"disjoint":[40],"paths":[41,87],"nodes":[44],"with":[45],"minimum":[47],"length":[49,90],"product.":[50],"We":[51,63,73],"formulate":[52],"as":[55],"mixed":[57],"integer":[58],"quadratic":[59],"programming":[60],"(MIQP)":[61],"problem.":[62],"develop":[64],"an":[65],"iterative":[66],"heuristic":[67],"based":[68],"on":[69],"k-shortest":[70],"approach.":[72],"demonstrate":[74],"through":[75],"extensive":[76],"simulations":[77],"only":[79],"few":[81],"iterations":[82],"are":[83],"sufficient":[84],"to":[85,94],"obtain":[86],"whose":[88],"is":[92],"comparable":[93],"optimal":[97],"obtained":[98],"by":[99],"solving":[100],"MIQP.":[102]},"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}