{"id":"https://openalex.org/W2204757301","doi":"https://doi.org/10.1109/tac.2017.2747409","title":"Stochastic Online Shortest Path Routing: The Value of Feedback","display_name":"Stochastic Online Shortest Path Routing: The Value of Feedback","publication_year":2017,"publication_date":"2017-08-30","ids":{"openalex":"https://openalex.org/W2204757301","doi":"https://doi.org/10.1109/tac.2017.2747409","mag":"2204757301"},"language":"en","primary_location":{"id":"doi:10.1109/tac.2017.2747409","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tac.2017.2747409","pdf_url":null,"source":{"id":"https://openalex.org/S184954342","display_name":"IEEE Transactions on Automatic Control","issn_l":"0018-9286","issn":["0018-9286","1558-2523","2334-3303"],"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 Transactions on Automatic Control","raw_type":"journal-article"},"type":"preprint","indexed_in":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1309.7367.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101839059","display_name":"Mohammad Sadegh Talebi","orcid":"https://orcid.org/0000-0002-6533-957X"},"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":"Mohammad Sadegh Talebi","raw_affiliation_strings":["ACCESS Linnaeus Center and the School of Electrical Engineering, KTH Royal Institute of Technology, Stockholm, Sweden"],"affiliations":[{"raw_affiliation_string":"ACCESS Linnaeus Center and the School of Electrical Engineering, KTH Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085409605","display_name":"Zhenhua Zou","orcid":"https://orcid.org/0000-0002-8439-2472"},"institutions":[{"id":"https://openalex.org/I1306339040","display_name":"Ericsson (Sweden)","ror":"https://ror.org/05a7rhx54","country_code":"SE","type":"company","lineage":["https://openalex.org/I1306339040"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Zhenhua Zou","raw_affiliation_strings":["Ericsson Research, Stockholm, Sweden"],"affiliations":[{"raw_affiliation_string":"Ericsson Research, Stockholm, Sweden","institution_ids":["https://openalex.org/I1306339040"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022336927","display_name":"Richard Combes","orcid":"https://orcid.org/0000-0003-3954-7241"},"institutions":[{"id":"https://openalex.org/I4210107720","display_name":"CentraleSup\u00e9lec","ror":"https://ror.org/019tcpt25","country_code":"FR","type":"facility","lineage":["https://openalex.org/I277688954","https://openalex.org/I4210107720"]},{"id":"https://openalex.org/I102475099","display_name":"Sup\u00e9lec","ror":"https://ror.org/00n7gwn90","country_code":"FR","type":"education","lineage":["https://openalex.org/I102475099"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Richard Combes","raw_affiliation_strings":["Telecommunications Department, Centrale-Supelec (L2S), Gif-Sur-Yvette, France"],"affiliations":[{"raw_affiliation_string":"Telecommunications Department, Centrale-Supelec (L2S), Gif-Sur-Yvette, France","institution_ids":["https://openalex.org/I102475099","https://openalex.org/I4210107720"]}]},{"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/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":"Alexandre Proutiere","raw_affiliation_strings":["ACCESS Linnaeus Center and the School of Electrical Engineering, KTH Royal Institute of Technology, Stockholm, Sweden"],"affiliations":[{"raw_affiliation_string":"ACCESS Linnaeus Center and the School of Electrical Engineering, KTH Royal Institute of Technology, Stockholm, Sweden","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":["ACCESS Linnaeus Center and the School of Electrical Engineering, KTH Royal Institute of Technology, Stockholm, Sweden"],"affiliations":[{"raw_affiliation_string":"ACCESS Linnaeus Center and the School of Electrical Engineering, KTH Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5101839059"],"corresponding_institution_ids":["https://openalex.org/I86987016"],"apc_list":null,"apc_paid":null,"fwci":0.4379,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.65042514,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"63","issue":"4","first_page":"915","last_page":"930"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9947999715805054,"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.9947999715805054,"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/T13553","display_name":"Age of Information Optimization","score":0.9865000247955322,"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/T11158","display_name":"Wireless Networks and Protocols","score":0.9858999848365784,"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/regret","display_name":"Regret","score":0.8508310317993164},{"id":"https://openalex.org/keywords/path-vector-protocol","display_name":"Path vector protocol","score":0.7056992650032043},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6615800261497498},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.6560550928115845},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6078293323516846},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5528700351715088},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5394734740257263},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5236839056015015},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.4788746237754822},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.4364883303642273},{"id":"https://openalex.org/keywords/private-network-to-network-interface","display_name":"Private Network-to-Network Interface","score":0.4350828230381012},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.4348889887332916},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.4348367154598236},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.2879905104637146},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24918541312217712},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.21365872025489807},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.14051777124404907}],"concepts":[{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.8508310317993164},{"id":"https://openalex.org/C128917274","wikidata":"https://www.wikidata.org/wiki/Q1666535","display_name":"Path vector protocol","level":5,"score":0.7056992650032043},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6615800261497498},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.6560550928115845},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6078293323516846},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5528700351715088},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5394734740257263},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5236839056015015},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.4788746237754822},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.4364883303642273},{"id":"https://openalex.org/C204348804","wikidata":"https://www.wikidata.org/wiki/Q3888133","display_name":"Private Network-to-Network Interface","level":5,"score":0.4350828230381012},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.4348889887332916},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.4348367154598236},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.2879905104637146},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24918541312217712},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.21365872025489807},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.14051777124404907},{"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":4,"locations":[{"id":"doi:10.1109/tac.2017.2747409","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tac.2017.2747409","pdf_url":null,"source":{"id":"https://openalex.org/S184954342","display_name":"IEEE Transactions on Automatic Control","issn_l":"0018-9286","issn":["0018-9286","1558-2523","2334-3303"],"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 Transactions on Automatic Control","raw_type":"journal-article"},{"id":"mag:2204757301","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1309.7367.pdf","pdf_url":null,"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":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:HAL:hal-01575796v1","is_oa":true,"landing_page_url":"https://hal.science/hal-01575796","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Transactions on Automatic Control, 2017, 63 (4), pp.915 - 930. ⟨10.1109/TAC.2017.2747409⟩","raw_type":"Journal articles"},{"id":"doi:10.48550/arxiv.1309.7367","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1309.7367","pdf_url":null,"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"mag:2204757301","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1309.7367.pdf","pdf_url":null,"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":"arXiv (Cornell University)","raw_type":null},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W157259654","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/W2043136268","https://openalex.org/W2093562354","https://openalex.org/W2096825593","https://openalex.org/W2109212697","https://openalex.org/W2125724988","https://openalex.org/W2129036575","https://openalex.org/W2138637686","https://openalex.org/W2152898676","https://openalex.org/W2168405694","https://openalex.org/W2293168792","https://openalex.org/W2508573783","https://openalex.org/W2914156981","https://openalex.org/W4232753567","https://openalex.org/W4234228486","https://openalex.org/W6601392155","https://openalex.org/W6606032028","https://openalex.org/W6630117878","https://openalex.org/W6633531804","https://openalex.org/W6634623812","https://openalex.org/W6637659893","https://openalex.org/W6639039794","https://openalex.org/W6639210758","https://openalex.org/W6640542924","https://openalex.org/W6681556291","https://openalex.org/W6683841709","https://openalex.org/W6684381734","https://openalex.org/W6688020240","https://openalex.org/W6695750551","https://openalex.org/W6764239134"],"related_works":["https://openalex.org/W2949216381","https://openalex.org/W2014482607","https://openalex.org/W1546782532","https://openalex.org/W3023901828","https://openalex.org/W1978258815","https://openalex.org/W2963792588","https://openalex.org/W2510377198","https://openalex.org/W2086820406","https://openalex.org/W2272298159","https://openalex.org/W2107387902","https://openalex.org/W2309478456","https://openalex.org/W1498376617","https://openalex.org/W2113426865","https://openalex.org/W1161417182","https://openalex.org/W1979447922","https://openalex.org/W2464794817","https://openalex.org/W2186932829","https://openalex.org/W1974399255","https://openalex.org/W607725241","https://openalex.org/W2324805610"],"abstract_inverted_index":{"This":[0],"paper":[1],"studies":[2],"online":[3,134],"shortest":[4],"path":[5,73],"routing":[6,43,59,101,135],"over":[7,157],"multihop":[8],"networks.":[9],"Link":[10],"costs":[11],"or":[12],"delays":[13],"are":[14,28,103,147],"time":[15],"varying":[16],"and":[17,21,33,48,78,93,105,145,173],"modeled":[18],"by":[19,42,75,132],"independent":[20],"identically":[22],"distributed":[23],"random":[24],"processes,":[25],"whose":[26],"parameters":[27],"initially":[29],"unknown.":[30],"The":[31,149],"parameters,":[32],"hence":[34],"the":[35,46,50,63,72,76,79,85,107,112,125,160,167,170],"optimal":[36,81],"path,":[37],"can":[38],"only":[39],"be":[40,130],"estimated":[41],"packets":[44],"through":[45],"network":[47],"observing":[49],"realized":[51],"delays.":[52],"Our":[53],"aim":[54],"is":[55],"to":[56,129,176],"find":[57],"a":[58,88,119,140],"policy":[60,77],"that":[61,97,127,177],"minimizes":[62],"regret":[64,126,150],"(the":[65],"cumulative":[66],"difference":[67],"of":[68,153,159,169,178],"expected":[69],"delay)":[70],"between":[71,142],"chosen":[74],"unknown":[80],"path.":[82],"We":[83,163],"formulate":[84],"problem":[86,92],"as":[87],"combinatorial":[89],"bandit":[90],"optimization":[91],"consider":[94],"several":[95],"scenarios":[96],"differ":[98],"in":[99,106],"where":[100],"decisions":[102],"made":[104],"information":[108],"available":[109],"when":[110],"making":[111],"decisions.":[113],"For":[114],"each":[115],"scenario,":[116],"we":[117],"derive":[118],"tight":[120],"asymptotic":[121],"lower":[122],"bound":[123],"on":[124],"has":[128],"satisfied":[131],"any":[133],"policy.":[136],"Three":[137],"algorithms,":[138],"with":[139],"tradeoff":[141],"computational":[143],"complexity":[144],"performance,":[146],"proposed.":[148],"upper":[151],"bounds":[152],"these":[154],"algorithms":[155,172],"improve":[156],"those":[158],"existing":[161,179],"algorithms.":[162,180],"also":[164],"assess":[165],"numerically":[166],"performance":[168],"proposed":[171],"compare":[174],"it":[175]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}