{"id":"https://openalex.org/W2067201651","doi":"https://doi.org/10.1109/infcom.2013.6566857","title":"Shortest path versus multi-hub routing in networks with uncertain demand","display_name":"Shortest path versus multi-hub routing in networks with uncertain demand","publication_year":2013,"publication_date":"2013-04-01","ids":{"openalex":"https://openalex.org/W2067201651","doi":"https://doi.org/10.1109/infcom.2013.6566857","mag":"2067201651"},"language":"en","primary_location":{"id":"doi:10.1109/infcom.2013.6566857","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2013.6566857","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 Proceedings IEEE INFOCOM","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/A5026396216","display_name":"Alexandre Fr\u00e9chette","orcid":null},"institutions":[{"id":"https://openalex.org/I141945490","display_name":"University of British Columbia","ror":"https://ror.org/03rmrcq20","country_code":"CA","type":"education","lineage":["https://openalex.org/I141945490"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Alexandre Frechette","raw_affiliation_strings":["Department of Computer Science, University of British Columbia, Canada","Department of Computer Science, University of British Columbia, Vancouver, BC Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of British Columbia, Canada","institution_ids":["https://openalex.org/I141945490"]},{"raw_affiliation_string":"Department of Computer Science, University of British Columbia, Vancouver, BC Canada","institution_ids":["https://openalex.org/I141945490"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044801840","display_name":"F. Bruce Shepherd","orcid":"https://orcid.org/0000-0003-1972-1396"},"institutions":[{"id":"https://openalex.org/I5023651","display_name":"McGill University","ror":"https://ror.org/01pxwe438","country_code":"CA","type":"education","lineage":["https://openalex.org/I5023651"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"F. Bruce Shepherd","raw_affiliation_strings":["Department of Mathematics and Statistics, McGill University, Canada","Dept. of Math. & Stat., McGill Univ., Montreal, QC, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Statistics, McGill University, Canada","institution_ids":["https://openalex.org/I5023651"]},{"raw_affiliation_string":"Dept. of Math. & Stat., McGill Univ., Montreal, QC, Canada","institution_ids":["https://openalex.org/I5023651"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054336795","display_name":"Marina Thottan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Marina K. Thottan","raw_affiliation_strings":["Emerging Technology Division, Bell Laboratories, Murray Hill, NJ, USA","Emerging Technol. Div., Bell Labs., Murray Hill, NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Emerging Technology Division, Bell Laboratories, Murray Hill, NJ, USA","institution_ids":[]},{"raw_affiliation_string":"Emerging Technol. Div., Bell Labs., Murray Hill, NJ, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013146659","display_name":"Peter J. Winzer","orcid":"https://orcid.org/0000-0002-6696-3884"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Peter J. Winzer","raw_affiliation_strings":["Optical Transmission and Networks Research Department, Bell Laboratories, Holmdel, NJ, USA","Opt. Transm. & Networks Res. Dept., Bell Labs., Holmdel, NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Optical Transmission and Networks Research Department, Bell Laboratories, Holmdel, NJ, USA","institution_ids":[]},{"raw_affiliation_string":"Opt. Transm. & Networks Res. Dept., Bell Labs., Holmdel, NJ, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7201,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.75525533,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"3","issue":null,"first_page":"710","last_page":"718"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9950000047683716,"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.9950000047683716,"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/T10698","display_name":"Transportation Planning and Optimization","score":0.9908000230789185,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.9797000288963318,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6859638690948486},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6040091514587402},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.571977436542511},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.5717593431472778},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.49342742562294006},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.48597443103790283},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.4475133419036865},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4381854832172394},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.43328607082366943},{"id":"https://openalex.org/keywords/network-planning-and-design","display_name":"Network planning and design","score":0.41632890701293945},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3595644235610962},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2637551426887512},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.25083214044570923},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18297407031059265},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1736432909965515}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6859638690948486},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6040091514587402},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.571977436542511},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.5717593431472778},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.49342742562294006},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48597443103790283},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.4475133419036865},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4381854832172394},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.43328607082366943},{"id":"https://openalex.org/C114563136","wikidata":"https://www.wikidata.org/wiki/Q19725982","display_name":"Network planning and design","level":2,"score":0.41632890701293945},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3595644235610962},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2637551426887512},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.25083214044570923},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18297407031059265},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1736432909965515},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/infcom.2013.6566857","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2013.6566857","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 Proceedings IEEE INFOCOM","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W1501204926","https://openalex.org/W1518157041","https://openalex.org/W1970701242","https://openalex.org/W1974487043","https://openalex.org/W2047517090","https://openalex.org/W2064289893","https://openalex.org/W2067201651","https://openalex.org/W2068811470","https://openalex.org/W2076701885","https://openalex.org/W2076704288","https://openalex.org/W2085399064","https://openalex.org/W2088844265","https://openalex.org/W2094410510","https://openalex.org/W2096881311","https://openalex.org/W2103655097","https://openalex.org/W2107526127","https://openalex.org/W2107997203","https://openalex.org/W2117358494","https://openalex.org/W2119016372","https://openalex.org/W2143213750","https://openalex.org/W2145818650","https://openalex.org/W2161719898","https://openalex.org/W2164355806","https://openalex.org/W2949835240","https://openalex.org/W3159998597","https://openalex.org/W3160113188","https://openalex.org/W4212977651","https://openalex.org/W6666557511","https://openalex.org/W6677801669"],"related_works":["https://openalex.org/W2181601090","https://openalex.org/W3127002380","https://openalex.org/W2068473861","https://openalex.org/W757657516","https://openalex.org/W2351878639","https://openalex.org/W2539097916","https://openalex.org/W2148093630","https://openalex.org/W2136173851","https://openalex.org/W4253436398","https://openalex.org/W2124642421"],"abstract_inverted_index":{"We":[0,76,124,221,254],"study":[1,193,292],"a":[2,78,84,162,195,213,230,268],"class":[3,196],"of":[4,87,131,164,194,197,238,270,281],"robust":[5,198],"network":[6,30,70,199],"design":[7,200],"problems":[8,202],"motivated":[9],"by":[10,111,174,277],"the":[11,29,43,62,69,92,105,116,128,152,179,182,192,236,239,250,278],"need":[12],"to":[13,17,31,71,82,137,148,204,228,248,286],"scale":[14],"core":[15],"networks":[16,266],"meet":[18],"increasingly":[19],"dynamic":[20],"capacity":[21],"demands.":[22,75,290],"Past":[23],"work":[24],"has":[25],"focused":[26],"on":[27,54,121,127,212],"designing":[28],"support":[32,72],"all":[33],"hose":[34,80,106,133,180,273],"matrices":[35,37,89,134],"(all":[36],"not":[38],"exceeding":[39],"marginal":[40],"bounds":[41],"at":[42],"nodes).":[44],"This":[45,190,291],"model":[46,81,107,118],"may":[47],"be":[48],"too":[49],"conservative":[50],"if":[51],"additional":[52],"information":[53,247],"traffic":[55,88,140,274],"patterns":[56],"is":[57,61,99,186,210,226],"available.":[58],"Another":[59],"extreme":[60],"fixed":[63],"demand":[64],"model,":[65,181],"where":[66],"one":[67],"designs":[68,103],"peak":[73,176,242,289],"point-to-point":[74,288],"introduce":[77],"capped":[79,132,272],"explore":[83],"broader":[85],"range":[86],"which":[90,139,297],"includes":[91],"above":[93],"two":[94],"as":[95,146,284],"special":[96],"cases.":[97],"It":[98],"known":[100],"that":[101,173,224,233],"optimal":[102],"for":[104,115,215,235],"are":[108,119,142],"always":[109],"determined":[110],"single-hub":[112,183,303],"routing,":[113],"and":[114,166,241,244,267,304],"fixed-demand":[117],"based":[120,211],"shortest-path":[122,305],"routing.":[123,168],"shed":[125],"light":[126],"wider":[129],"space":[130,153],"in":[135,154],"order":[136],"see":[138],"models":[141],"more":[143],"shortest":[144],"path-like":[145],"opposed":[147,285],"hub-like.":[149],"To":[150],"address":[151],"between,":[155],"we":[156,171],"use":[157,245],"hierarchical":[158,218],"multi-hub":[159,298],"routing":[160,231,252,261,299],"templates,":[161,262],"generalization":[163],"hub":[165],"tree":[167],"In":[169],"particular,":[170],"show":[172],"adding":[175],"capacities":[177],"into":[178],"tree-routing":[184],"template":[185],"no":[187],"longer":[188],"cost-effective.":[189],"initiates":[191],"(RND)":[201],"restricted":[203],"these":[205],"templates.":[206],"Our":[207],"empirical":[208],"analysis":[209],"heuristic":[214],"this":[216,246],"new":[217],"RND":[219],"problem.":[220],"also":[222,293],"propose":[223],"it":[225],"possible":[227],"define":[229],"indicator":[232],"accounts":[234],"strengths":[237],"marginals":[240,283],"demands":[243],"choose":[249],"appropriate":[251],"template.":[253],"benchmark":[255],"our":[256],"approach":[257],"against":[258],"other":[259],"well-known":[260],"using":[263],"representative":[264],"carrier":[265],"variety":[269],"different":[271],"demands,":[275],"parameterized":[276],"relative":[279],"importance":[280],"their":[282,287],"reveals":[294],"conditions":[295],"under":[296],"gives":[300],"improvements":[301],"over":[302],"routings.":[306]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}