{"id":"https://openalex.org/W2950317007","doi":"https://doi.org/10.48550/arxiv.1201.4906","title":"Adaptive Shortest-Path Routing under Unknown and Stochastically Varying Link States","display_name":"Adaptive Shortest-Path Routing under Unknown and Stochastically Varying Link States","publication_year":2012,"publication_date":"2012-01-24","ids":{"openalex":"https://openalex.org/W2950317007","doi":"https://doi.org/10.48550/arxiv.1201.4906","mag":"2950317007"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:1201.4906","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/1201.4906","pdf_url":"https://arxiv.org/pdf/1201.4906","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":null,"raw_type":"text"},"volume":null,"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1201.4906","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5007144865","display_name":"Keqin Liu","orcid":"https://orcid.org/0000-0002-7995-7125","observed_orcids":["https://orcid.org/0000-0002-7995-7125","https://orcid.org/0000-0002-4783-346X"]},"institutions":[{"id":"https://openalex.org/I84218800","display_name":"University of California, Davis","ror":"https://ror.org/05rrcem69","country_code":"US","type":"education","lineage":["https://openalex.org/I84218800"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Liu, Keqin","raw_affiliation_strings":["Dept. of Elec. and Comp. Eng., Univ. of California, Davis, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Elec. and Comp. Eng., Univ. of California, Davis, USA","institution_ids":["https://openalex.org/I84218800"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013788255","display_name":"Qing Qi Zhao","orcid":"https://orcid.org/0000-0002-9590-4285","observed_orcids":["https://orcid.org/0000-0002-9590-4285"]},"institutions":[{"id":"https://openalex.org/I84218800","display_name":"University of California, Davis","ror":"https://ror.org/05rrcem69","country_code":"US","type":"education","lineage":["https://openalex.org/I84218800"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zhao, Qing","raw_affiliation_strings":["Dept. of Elec. and Comp. Eng., Univ. of California, Davis, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Elec. and Comp. Eng., Univ. of California, Davis, USA","institution_ids":["https://openalex.org/I84218800"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I84218800"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":44,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"232","last_page":"237"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9940999746322632,"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":0.9940999746322632,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.0020000000949949026,"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/T11409","display_name":"Advanced Wireless Network Optimization","score":0.0010999999940395355,"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/wireless-networks","display_name":"wireless networks","score":0.7860000133514404},{"id":"https://openalex.org/keywords/multi-armed-bandits","display_name":"multi-armed bandits","score":0.7839999794960022},{"id":"https://openalex.org/keywords/regret-minimization","display_name":"regret minimization","score":0.9150000214576721},{"id":"https://openalex.org/keywords/heavy-tailed-distributions","display_name":"heavy-tailed distributions","score":0.8450000286102295},{"id":"https://openalex.org/keywords/cognitive-radio","display_name":"cognitive radio","score":0.7850000262260437},{"id":"https://openalex.org/keywords/ad-hoc-networks","display_name":"ad hoc networks","score":0.9779999852180481}],"concepts":[{"id":"https://openalex.org/C204348804","wikidata":"https://www.wikidata.org/wiki/Q3888133","display_name":"Private Network-to-Network Interface","level":5,"score":0.6815295219421387},{"id":"https://openalex.org/C2778753846","wikidata":"https://www.wikidata.org/wiki/Q6554239","display_name":"Link (geometry)","level":2,"score":0.641157329082489},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6366562843322754},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6307488679885864},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.5599965453147888},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.5549688935279846},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.530584990978241},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4917931854724884},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.47353026270866394},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.4539893865585327},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.45354264974594116},{"id":"https://openalex.org/C128917274","wikidata":"https://www.wikidata.org/wiki/Q1666535","display_name":"Path vector protocol","level":5,"score":0.44660574197769165},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.38168829679489136},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.3637475371360779},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18263459205627441},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.17802274227142334},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.09532171487808228},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.07216277718544006}],"mesh":[],"locations_count":6,"locations":[{"id":"pmh:oai:arXiv.org:1201.4906","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/1201.4906","pdf_url":"https://arxiv.org/pdf/1201.4906","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":null,"raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.225.783","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.225.783","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ece.ucdavis.edu/%7Eqzhao/TR-12-02.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.739.6787","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.739.6787","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://hal.inria.fr/docs/00/76/37/80/PDF/p232-liu.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.760.8224","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.760.8224","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1201.4906.pdf","raw_type":"text"},{"id":"pmh:oai:HAL:hal-00763780v1","doi":null,"is_oa":true,"landing_page_url":"https://inria.hal.science/hal-00763780","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4405252976","host_organization_name":"Centre pour la Communication Scientifique Directe","host_organization_lineage":["https://openalex.org/I4405252976"],"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":"WiOpt'12: Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, May 2012, Paderborn, Germany. pp.232-237","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"doi:10.48550/arxiv.1201.4906","doi":"https://doi.org/10.48550/arxiv.1201.4906","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1201.4906","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1201.4906","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/1201.4906","pdf_url":"https://arxiv.org/pdf/1201.4906","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":null,"raw_type":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W50486269","https://openalex.org/W1833992807","https://openalex.org/W1973885534","https://openalex.org/W1998498767","https://openalex.org/W2000080679","https://openalex.org/W2009551863","https://openalex.org/W2012731843","https://openalex.org/W2049689520","https://openalex.org/W2092203504","https://openalex.org/W2093562354","https://openalex.org/W2168405694","https://openalex.org/W2169401877","https://openalex.org/W3023115439","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W7096262916","https://openalex.org/W7095595266","https://openalex.org/W7100063222","https://openalex.org/W2530669010","https://openalex.org/W2548246674","https://openalex.org/W4379113495","https://openalex.org/W3198738752","https://openalex.org/W2052495536","https://openalex.org/W3041946542","https://openalex.org/W2204757301"],"abstract_inverted_index":{"We":[0,95,106],"consider":[1],"the":[2,24,40,45,48,71,124,136,149],"adaptive":[3,35],"shortest-path":[4],"routing":[5],"problem":[6,98],"in":[7,44,132,175],"wireless":[8],"networks":[9,181],"under":[10,162],"unknown":[11,62,183],"and":[12,31,42,172,178,184],"stochastically":[13],"varying":[14],"link":[15,52,91],"states.":[16],"In":[17],"this":[18,78,97],"problem,":[19],"we":[20],"aim":[21],"to":[22,39,57],"optimize":[23],"quality":[25,49,73,87],"of":[26,50,74,88,148,166],"communication":[27,186],"between":[28],"a":[29,32,58,65,100,113,145,163],"source":[30],"destination":[33],"through":[34],"path":[36,66,79,82],"selection.":[37],"Due":[38],"randomness":[41],"uncertainties":[43],"network":[46,117,141],"dynamics,":[47],"each":[51,89],"varies":[53],"over":[54],"time":[55],"according":[56],"stochastic":[59],"process":[60],"with":[61,103,116,128,135,140,182],"distributions.":[63],"After":[64],"is":[67,84,92,131],"selected":[68],"for":[69],"communication,":[70],"aggregated":[72],"all":[75],"links":[76],"on":[77],"(e.g.,":[80],"total":[81],"delay)":[83],"observed.":[85],"The":[86],"individual":[90],"not":[93],"observable.":[94],"formulate":[96],"as":[99],"multi-armed":[101],"bandit":[102],"dependent":[104],"arms.":[105],"show":[107],"that":[108,153],"by":[109,144],"exploiting":[110],"arm":[111,155],"dependencies,":[112],"regret":[114,138],"polynomial":[115],"size":[118,142],"can":[119],"be":[120],"achieved":[121],"while":[122],"maintaining":[123],"optimal":[125],"logarithmic":[126],"order":[127,139],"time.":[129],"This":[130],"sharp":[133],"contrast":[134],"exponential":[137],"offered":[143],"direct":[146],"application":[147],"classic":[150],"MAB":[151],"policies":[152],"ignore":[154],"dependencies.":[156],"Furthermore,":[157],"our":[158],"results":[159],"are":[160],"obtained":[161],"general":[164],"model":[165],"link-quality":[167],"distributions":[168],"(including":[169],"heavy-tailed":[170],"distributions)":[171],"find":[173],"applications":[174],"cognitive":[176],"radio":[177],"ad":[179],"hoc":[180],"dynamic":[185],"environments.":[187]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":7},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":1}],"updated_date":"2026-11-03T10:50:19.383937","created_date":"2025-10-10T00:00:00"}