{"id":"https://openalex.org/W2060030615","doi":"https://doi.org/10.1109/tnet.2014.2353576","title":"Shortest Path Versus Multihub Routing in Networks With Uncertain Demand","display_name":"Shortest Path Versus Multihub Routing in Networks With Uncertain Demand","publication_year":2014,"publication_date":"2014-10-01","ids":{"openalex":"https://openalex.org/W2060030615","doi":"https://doi.org/10.1109/tnet.2014.2353576","mag":"2060030615"},"language":"en","primary_location":{"id":"doi:10.1109/tnet.2014.2353576","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tnet.2014.2353576","pdf_url":null,"source":{"id":"https://openalex.org/S62238642","display_name":"IEEE/ACM Transactions on Networking","issn_l":"1063-6692","issn":["1063-6692","1558-2566"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE/ACM Transactions on Networking","raw_type":"journal-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":true,"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, Canada#TAB#"],"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, Canada#TAB#","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 Mathematics and Statistics, McGill University, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Statistics, McGill University, Canada","institution_ids":["https://openalex.org/I5023651"]},{"raw_affiliation_string":"Dept. of Mathematics and Statistics, McGill University, 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 Labs, Murray Hill, NJ, USA"],"affiliations":[{"raw_affiliation_string":"Emerging Technology Division, 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 Labs, Holmdel, NJ, USA"],"affiliations":[{"raw_affiliation_string":"Optical Transmission and Networks Research Department, Bell Labs, Holmdel, NJ, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5026396216"],"corresponding_institution_ids":["https://openalex.org/I141945490"],"apc_list":null,"apc_paid":null,"fwci":1.256,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.82660788,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"23","issue":"6","first_page":"1931","last_page":"1943"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9976999759674072,"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.9976999759674072,"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.9943000078201294,"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/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.9930999875068665,"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.7794817090034485},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.6475209593772888},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.5917561650276184},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.5644933581352234},{"id":"https://openalex.org/keywords/policy-based-routing","display_name":"Policy-based routing","score":0.52486652135849},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5154396295547485},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5048342347145081},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.5028175711631775},{"id":"https://openalex.org/keywords/routing-domain","display_name":"Routing domain","score":0.4576297402381897},{"id":"https://openalex.org/keywords/hierarchical-routing","display_name":"Hierarchical routing","score":0.43961766362190247},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.43662533164024353},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4262595772743225},{"id":"https://openalex.org/keywords/network-planning-and-design","display_name":"Network planning and design","score":0.4218827784061432},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3721470534801483},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.3516901731491089},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13006621599197388},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1250683069229126}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7794817090034485},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.6475209593772888},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.5917561650276184},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.5644933581352234},{"id":"https://openalex.org/C196423136","wikidata":"https://www.wikidata.org/wiki/Q7209671","display_name":"Policy-based routing","level":5,"score":0.52486652135849},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5154396295547485},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5048342347145081},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.5028175711631775},{"id":"https://openalex.org/C94600068","wikidata":"https://www.wikidata.org/wiki/Q7371621","display_name":"Routing domain","level":5,"score":0.4576297402381897},{"id":"https://openalex.org/C177818476","wikidata":"https://www.wikidata.org/wiki/Q12878103","display_name":"Hierarchical routing","level":5,"score":0.43961766362190247},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.43662533164024353},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4262595772743225},{"id":"https://openalex.org/C114563136","wikidata":"https://www.wikidata.org/wiki/Q19725982","display_name":"Network planning and design","level":2,"score":0.4218827784061432},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3721470534801483},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.3516901731491089},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13006621599197388},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1250683069229126},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tnet.2014.2353576","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tnet.2014.2353576","pdf_url":null,"source":{"id":"https://openalex.org/S62238642","display_name":"IEEE/ACM Transactions on Networking","issn_l":"1063-6692","issn":["1063-6692","1558-2566"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE/ACM Transactions on Networking","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":59,"referenced_works":["https://openalex.org/W1485272308","https://openalex.org/W1501204926","https://openalex.org/W1515192744","https://openalex.org/W1518157041","https://openalex.org/W1588337609","https://openalex.org/W1601948230","https://openalex.org/W1970701242","https://openalex.org/W1974487043","https://openalex.org/W1974677318","https://openalex.org/W1974898002","https://openalex.org/W1989485302","https://openalex.org/W1995285162","https://openalex.org/W2018047324","https://openalex.org/W2047517090","https://openalex.org/W2059635852","https://openalex.org/W2063634357","https://openalex.org/W2063946501","https://openalex.org/W2064289893","https://openalex.org/W2068394611","https://openalex.org/W2068811470","https://openalex.org/W2072947773","https://openalex.org/W2076701885","https://openalex.org/W2076704288","https://openalex.org/W2080440854","https://openalex.org/W2082353536","https://openalex.org/W2085399064","https://openalex.org/W2088844265","https://openalex.org/W2089797557","https://openalex.org/W2094410510","https://openalex.org/W2096881311","https://openalex.org/W2103655097","https://openalex.org/W2105667010","https://openalex.org/W2107526127","https://openalex.org/W2107997203","https://openalex.org/W2111308047","https://openalex.org/W2117358494","https://openalex.org/W2119016372","https://openalex.org/W2125570197","https://openalex.org/W2132064078","https://openalex.org/W2136884858","https://openalex.org/W2141111991","https://openalex.org/W2143213750","https://openalex.org/W2145818650","https://openalex.org/W2161253930","https://openalex.org/W2161719898","https://openalex.org/W2162747898","https://openalex.org/W2164355806","https://openalex.org/W2165775468","https://openalex.org/W2172163422","https://openalex.org/W2177058407","https://openalex.org/W2949835240","https://openalex.org/W2950283468","https://openalex.org/W2999389558","https://openalex.org/W3159998597","https://openalex.org/W3160113188","https://openalex.org/W4212977651","https://openalex.org/W4229690180","https://openalex.org/W4296437525","https://openalex.org/W6677801669"],"related_works":["https://openalex.org/W2181601090","https://openalex.org/W2148093630","https://openalex.org/W4253436398","https://openalex.org/W1538003338","https://openalex.org/W2364686261","https://openalex.org/W2556128816","https://openalex.org/W3125210154","https://openalex.org/W2351878639","https://openalex.org/W2607223747","https://openalex.org/W3046124320"],"abstract_inverted_index":{"We":[0,74,122,142],"study":[1],"a":[2,76,82,125,151,164,200],"class":[3],"of":[4,29,84,128,138,146,153,212],"robust":[5,169],"network":[6,35,45,100,170],"design":[7,33,43,171],"problems":[8],"motivated":[9],"by":[10,109],"the":[11,34,37,44,58,89,103,114,135,144,167],"need":[12],"to":[13,17,46,80,133,175,188,202,208],"scale":[14],"core":[15],"networks":[16],"meet":[18],"increasingly":[19],"dynamic":[20],"capacity":[21],"demands.":[22,41],"Past":[23],"work":[24],"has":[25],"focused":[26],"on":[27,69,119,163,182],"one":[28],"two":[30,91,176],"models.":[31],"First,":[32],"for":[36,102,113,166,199,217],"known":[38,97],"point-to-point":[39],"peak":[40],"Second,":[42],"support":[47],"all":[48],"hose":[49,78,104,140],"matrices":[50,52],"(all":[51],"not":[53],"exceeding":[54],"marginal":[55],"bounds":[56],"at":[57],"nodes).":[59],"Both":[60],"models":[61],"may":[62,196],"be":[63,197],"too":[64],"conservative":[65],"if":[66],"additional":[67],"information":[68],"traffic":[70,85,205],"patterns":[71],"is":[72,96,131,161,214],"available.":[73],"introduce":[75],"capped":[77,139],"model":[79,105,116],"explore":[81],"range":[83],"scenarios,":[86],"which":[87,210],"includes":[88],"above":[90],"as":[92],"special":[93],"cases.":[94],"It":[95],"that":[98,124],"optimal":[99],"designs":[101,180],"are":[106,117,185],"always":[107],"determined":[108],"single-hub":[110],"routing,":[111],"and":[112,155,191],"fixed-demand":[115],"based":[118,162,181],"shortest-path":[120],"routing.":[121,157],"demonstrate":[123],"wider":[126],"variety":[127],"routing":[129,149,184,213],"templates":[130],"required":[132],"address":[134],"broader":[136],"spectrum":[137],"matrices.":[141],"propose":[143],"use":[145],"hierarchical":[147],"multihub":[148,183],"templates,":[150],"generalization":[152],"hub":[154,190],"tree":[156],"Our":[158],"empirical":[159],"analysis":[160],"heuristic":[165],"resulting":[168],"problem.":[172],"These":[173],"lead":[174],"important":[177],"findings:":[178],"1)":[179],"often":[186],"preferable":[187],"both":[189],"shortest":[192],"path;":[193],"2)":[194],"it":[195],"possible":[198],"carrier":[201],"sample":[203],"their":[204,218],"in":[206],"order":[207],"determine":[209],"type":[211],"most":[215],"cost-effective":[216],"network.":[219]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}