{"id":"https://openalex.org/W2119908302","doi":"https://doi.org/10.1109/icc.2011.5962676","title":"Enhancing Shortest Path Routing for Resilience and Load Balancing","display_name":"Enhancing Shortest Path Routing for Resilience and Load Balancing","publication_year":2011,"publication_date":"2011-06-01","ids":{"openalex":"https://openalex.org/W2119908302","doi":"https://doi.org/10.1109/icc.2011.5962676","mag":"2119908302"},"language":"en","primary_location":{"id":"doi:10.1109/icc.2011.5962676","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2011.5962676","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Conference on Communications (ICC)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5077684282","display_name":"Theodore Elhourani","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":"Theodore Elhourani","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Arizona Tucson, USA","[Dept. of Electr. & Comput. Eng., Univ. of Arizona, Tucson, AZ, USA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Arizona Tucson, USA","institution_ids":["https://openalex.org/I138006243"]},{"raw_affiliation_string":"[Dept. of Electr. & Comput. Eng., Univ. of Arizona, Tucson, AZ, USA]","institution_ids":["https://openalex.org/I138006243"]}]},{"author_position":"middle","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, USA","[Dept. of Electr. & Comput. Eng., Univ. of Arizona, Tucson, AZ, USA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Arizona Tucson, USA","institution_ids":["https://openalex.org/I138006243"]},{"raw_affiliation_string":"[Dept. of Electr. & Comput. Eng., Univ. of Arizona, Tucson, AZ, USA]","institution_ids":["https://openalex.org/I138006243"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030391444","display_name":"Amund Kvalbein","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"]},{"id":"https://openalex.org/I2799829267","display_name":"Simula Research Laboratory","ror":"https://ror.org/00vn06n10","country_code":"NO","type":"facility","lineage":["https://openalex.org/I2799829267"]}],"countries":["NO","US"],"is_corresponding":false,"raw_author_name":"Amund Kvalbein","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Arizona Tucson, USA","Simula Research Laboratory, Norway","Simula Res. Lab., Lysaker, Norway"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Arizona Tucson, USA","institution_ids":["https://openalex.org/I138006243"]},{"raw_affiliation_string":"Simula Research Laboratory, Norway","institution_ids":["https://openalex.org/I2799829267"]},{"raw_affiliation_string":"Simula Res. Lab., Lysaker, Norway","institution_ids":["https://openalex.org/I2799829267"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10714","display_name":"Software-Defined Networks and 5G","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"}},"topics":[{"id":"https://openalex.org/T10714","display_name":"Software-Defined Networks and 5G","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/T10138","display_name":"Network Traffic and Congestion Control","score":0.9988999962806702,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9986000061035156,"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/computer-science","display_name":"Computer science","score":0.7742588520050049},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.6799184083938599},{"id":"https://openalex.org/keywords/load-balancing","display_name":"Load balancing (electrical power)","score":0.5904750823974609},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.57107013463974},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.5678181648254395},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.5583314299583435},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.5417594909667969},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5061389803886414},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.5011422634124756},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4471997618675232},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.4315841794013977},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.43086469173431396},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.4233090281486511},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.38543182611465454},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24291068315505981},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.12388801574707031},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09562185406684875},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.06501436233520508},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.06063443422317505}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7742588520050049},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.6799184083938599},{"id":"https://openalex.org/C138959212","wikidata":"https://www.wikidata.org/wiki/Q1806783","display_name":"Load balancing (electrical power)","level":3,"score":0.5904750823974609},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.57107013463974},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.5678181648254395},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.5583314299583435},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.5417594909667969},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5061389803886414},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.5011422634124756},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4471997618675232},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.4315841794013977},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.43086469173431396},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.4233090281486511},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.38543182611465454},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24291068315505981},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.12388801574707031},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09562185406684875},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.06501436233520508},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.06063443422317505},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icc.2011.5962676","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2011.5962676","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Conference on Communications (ICC)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.406.7156","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.406.7156","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www2.engr.arizona.edu/~srini/papers/Srini-2011-ICC.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W62072953","https://openalex.org/W1547196795","https://openalex.org/W1564531230","https://openalex.org/W1620856823","https://openalex.org/W1981581553","https://openalex.org/W1987032287","https://openalex.org/W2096655151","https://openalex.org/W2114234222","https://openalex.org/W2118443981","https://openalex.org/W2135249558","https://openalex.org/W2145266561","https://openalex.org/W2148662748","https://openalex.org/W6602465000","https://openalex.org/W6633981961","https://openalex.org/W6646820729"],"related_works":["https://openalex.org/W2181601090","https://openalex.org/W2108305519","https://openalex.org/W2068473861","https://openalex.org/W1971663816","https://openalex.org/W3127002380","https://openalex.org/W2369989480","https://openalex.org/W2607223747","https://openalex.org/W2124642421","https://openalex.org/W2361465121","https://openalex.org/W2030786877"],"abstract_inverted_index":{"This":[0],"paper":[1],"develops":[2],"a":[3,59,82,90],"new":[4],"resilient":[5],"multipath":[6,20],"routing":[7,21,60],"technique,":[8],"referred":[9],"to":[10,34,54,62],"as":[11],"SPT-DAG,":[12],"that":[13,98,107],"has":[14,87],"the":[15,28,38,56,66,73,85,99],"following":[16],"characteristics:":[17],"(1)":[18],"provides":[19,42],"over":[22,65],"directed":[23],"acyclic":[24],"graphs":[25],"(DAG);":[26],"(2)":[27],"shortest":[29],"path":[30],"tree":[31],"is":[32],"guaranteed":[33,43],"be":[35],"part":[36],"of":[37],"DAG;":[39],"and":[40,58],"(3)":[41],"recovery":[44],"from":[45],"single":[46],"link":[47],"failures.":[48],"We":[49,75],"develop":[50],"polynomial":[51],"time":[52],"algorithm":[53],"compute":[55],"SPT-DAG":[57,67,100],"protocol":[61],"forward":[63],"packets":[64],"using":[68],"one":[69],"overhead":[70],"bit":[71],"in":[72],"packet.":[74],"consider":[76],"different":[77],"load-balancing":[78],"approaches":[79,106],"for":[80],"forwarding":[81],"packet":[83,86],"when":[84],"not":[88],"encountered":[89],"failure.":[91],"Through":[92],"extensive":[93],"flow-based":[94],"simulations,":[95],"we":[96],"show":[97],"performs":[101],"significantly":[102],"better":[103],"than":[104],"those":[105],"exclusively":[108],"target":[109],"load":[110],"balancing":[111],"or":[112],"resiliency.":[113]},"counts_by_year":[{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}