{"id":"https://openalex.org/W2109212697","doi":"https://doi.org/10.1109/acc.2014.6859133","title":"Online shortest path routing: The value of information","display_name":"Online shortest path routing: The value of information","publication_year":2014,"publication_date":"2014-06-01","ids":{"openalex":"https://openalex.org/W2109212697","doi":"https://doi.org/10.1109/acc.2014.6859133","mag":"2109212697"},"language":"en","primary_location":{"id":"doi:10.1109/acc.2014.6859133","is_oa":false,"landing_page_url":"https://doi.org/10.1109/acc.2014.6859133","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 American Control Conference","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1309.7367","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5085409605","display_name":"Zhenhua Zou","orcid":"https://orcid.org/0000-0002-8439-2472"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Zhenhua Zou","raw_affiliation_strings":["KTH-Royal Institute of Technology, Sweden","KTH Royal Institute of Technology [Stockholm]"],"affiliations":[{"raw_affiliation_string":"KTH-Royal Institute of Technology, Sweden","institution_ids":["https://openalex.org/I86987016"]},{"raw_affiliation_string":"KTH Royal Institute of Technology [Stockholm]","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025136069","display_name":"Alexandre Prouti\u00e8re","orcid":"https://orcid.org/0000-0002-4679-4673"},"institutions":[{"id":"https://openalex.org/I4210153302","display_name":"Geometric (India)","ror":"https://ror.org/04xprjz26","country_code":"IN","type":"company","lineage":["https://openalex.org/I4210153302"]},{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["IN","SE"],"is_corresponding":false,"raw_author_name":"Alexandre Proutiere","raw_affiliation_strings":["KTH-Royal Institute of Technology, Sweden","Dynamics of Geometric Networks","KTH Royal Institute of Technology [Stockholm]"],"affiliations":[{"raw_affiliation_string":"KTH-Royal Institute of Technology, Sweden","institution_ids":["https://openalex.org/I86987016"]},{"raw_affiliation_string":"Dynamics of Geometric Networks","institution_ids":["https://openalex.org/I4210153302"]},{"raw_affiliation_string":"KTH Royal Institute of Technology [Stockholm]","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024256519","display_name":"Mikael Johansson","orcid":"https://orcid.org/0000-0002-2237-2580"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Mikael Johansson","raw_affiliation_strings":["KTH-Royal Institute of Technology, Sweden","KTH Royal Institute of Technology [Stockholm]"],"affiliations":[{"raw_affiliation_string":"KTH-Royal Institute of Technology, Sweden","institution_ids":["https://openalex.org/I86987016"]},{"raw_affiliation_string":"KTH Royal Institute of Technology [Stockholm]","institution_ids":["https://openalex.org/I86987016"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5085409605"],"corresponding_institution_ids":["https://openalex.org/I86987016"],"apc_list":null,"apc_paid":null,"fwci":1.6712,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.86269937,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"2142","last_page":"2147"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9987999796867371,"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/T10603","display_name":"Smart Grid Energy Management","score":0.9944999814033508,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.7864742279052734},{"id":"https://openalex.org/keywords/regret","display_name":"Regret","score":0.7830225825309753},{"id":"https://openalex.org/keywords/path-vector-protocol","display_name":"Path vector protocol","score":0.7022541165351868},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6387219429016113},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6350239515304565},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5560438632965088},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.5362870693206787},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.5361544489860535},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5345059633255005},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.48875927925109863},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.4670240879058838},{"id":"https://openalex.org/keywords/private-network-to-network-interface","display_name":"Private Network-to-Network Interface","score":0.44806116819381714},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.42559194564819336},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.34955549240112305},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3007676601409912},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.2909727990627289},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2165575623512268},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1180427074432373}],"concepts":[{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.7864742279052734},{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.7830225825309753},{"id":"https://openalex.org/C128917274","wikidata":"https://www.wikidata.org/wiki/Q1666535","display_name":"Path vector protocol","level":5,"score":0.7022541165351868},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6387219429016113},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6350239515304565},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5560438632965088},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.5362870693206787},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.5361544489860535},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5345059633255005},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.48875927925109863},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.4670240879058838},{"id":"https://openalex.org/C204348804","wikidata":"https://www.wikidata.org/wiki/Q3888133","display_name":"Private Network-to-Network Interface","level":5,"score":0.44806116819381714},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.42559194564819336},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.34955549240112305},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3007676601409912},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.2909727990627289},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2165575623512268},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1180427074432373},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/acc.2014.6859133","is_oa":false,"landing_page_url":"https://doi.org/10.1109/acc.2014.6859133","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 American Control Conference","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1309.7367","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1309.7367","pdf_url":"https://arxiv.org/pdf/1309.7367","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1309.7367","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1309.7367","pdf_url":"https://arxiv.org/pdf/1309.7367","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},"sustainable_development_goals":[{"score":0.7599999904632568,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W35251828","https://openalex.org/W148122774","https://openalex.org/W1501823362","https://openalex.org/W1608015248","https://openalex.org/W1721811070","https://openalex.org/W1850488217","https://openalex.org/W1950398167","https://openalex.org/W1968525591","https://openalex.org/W1992577915","https://openalex.org/W1998376807","https://openalex.org/W1998498767","https://openalex.org/W2009551863","https://openalex.org/W2014482607","https://openalex.org/W2020254732","https://openalex.org/W2027796553","https://openalex.org/W2077148472","https://openalex.org/W2093562354","https://openalex.org/W2109212697","https://openalex.org/W2119567691","https://openalex.org/W2119738618","https://openalex.org/W2121394852","https://openalex.org/W2129036575","https://openalex.org/W2133794215","https://openalex.org/W2138637686","https://openalex.org/W2152898676","https://openalex.org/W2157457404","https://openalex.org/W2168405694","https://openalex.org/W2594297742","https://openalex.org/W2914156981","https://openalex.org/W2951590424","https://openalex.org/W2953359952","https://openalex.org/W2963750583","https://openalex.org/W2964007796","https://openalex.org/W3084669832","https://openalex.org/W3100329718","https://openalex.org/W3101676093","https://openalex.org/W6640542924"],"related_works":["https://openalex.org/W2154023691","https://openalex.org/W1515277195","https://openalex.org/W1997440971","https://openalex.org/W1972487624","https://openalex.org/W2186932829","https://openalex.org/W2064711473","https://openalex.org/W1579931977","https://openalex.org/W2237860883","https://openalex.org/W2121598558","https://openalex.org/W1971025399"],"abstract_inverted_index":{"This":[0],"paper":[1],"studies":[2],"online":[3,132],"shortest":[4],"path":[5,71,169],"routing":[6,43,59,99,133,150],"over":[7],"dynamic":[8],"multi-hop":[9],"networks.":[10],"Link":[11],"costs":[12,165],"or":[13],"delays":[14],"are":[15,28,101,190],"time-varying":[16],"and":[17,21,33,48,76,91,103,161,192],"modelled":[18],"by":[19,42,73,130],"independent":[20],"identically":[22],"distributed":[23],"random":[24],"processes,":[25],"whose":[26],"parameters":[27],"initially":[29],"unknown.":[30],"The":[31],"parameters,":[32],"hence":[34],"the":[35,46,50,63,70,74,77,83,105,110,117,123,141,158,195],"optimal":[36,79],"path,":[37],"can":[38,145,183],"only":[39],"be":[40,128],"estimated":[41],"packets":[44],"through":[45],"network":[47],"observing":[49,163],"realized":[51],"delays.":[52],"Our":[53],"aim":[54],"is":[55,177],"to":[56,127,139],"find":[57],"a":[58,86,185],"policy":[60,75],"that":[61,95,125,175],"minimizes":[62],"regret":[64,124],"(the":[65],"cumulative":[66],"delay":[67],"difference)":[68],"between":[69],"chosen":[72],"unknown":[78],"path.":[80],"We":[81],"formulate":[82],"problem":[84,90],"as":[85],"combinatorial":[87],"bandit":[88],"optimization":[89],"consider":[92],"several":[93],"scenarios":[94],"differ":[96],"in":[97,104],"where":[98],"decisions":[100,151],"made":[102],"information":[106],"available":[107],"when":[108,147],"making":[109],"decision.":[111],"For":[112],"each":[113,153],"scenario,":[114],"we":[115,144,173],"derive":[116],"tight":[118],"asymptotic":[119],"lower":[120],"bound":[121],"on":[122],"has":[126],"satisfied":[129],"any":[131],"policy.":[134],"These":[135],"bounds":[136],"help":[137],"us":[138],"understand":[140],"performance":[142],"improvements":[143],"expect":[146],"(i)":[148,176],"taking":[149],"at":[152,157],"hop":[154],"rather":[155,166],"than":[156,167],"source":[159],"only,":[160],"(ii)":[162,182],"per-link":[164],"aggregate":[168],"costs.":[170],"In":[171],"particular,":[172],"show":[174],"of":[178],"no":[179],"use":[180],"while":[181],"have":[184],"spectacular":[186],"impact.":[187],"Efficient":[188],"algorithms":[189],"proposed":[191],"evaluated":[193],"against":[194],"state-of-the":[196],"art.":[197]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2026-03-11T14:59:36.786465","created_date":"2025-10-10T00:00:00"}