{"id":"https://openalex.org/W2048366963","doi":"https://doi.org/10.1109/infcom.2013.6567023","title":"Endhost-based shortest path routing in dynamic networks: An online learning approach","display_name":"Endhost-based shortest path routing in dynamic networks: An online learning approach","publication_year":2013,"publication_date":"2013-04-01","ids":{"openalex":"https://openalex.org/W2048366963","doi":"https://doi.org/10.1109/infcom.2013.6567023","mag":"2048366963"},"language":"en","primary_location":{"id":"doi:10.1109/infcom.2013.6567023","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2013.6567023","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/A5088400668","display_name":"Ting He","orcid":"https://orcid.org/0000-0003-1070-7483"},"institutions":[{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]},{"id":"https://openalex.org/I4210114115","display_name":"IBM Research - Thomas J. Watson Research Center","ror":"https://ror.org/0265w5591","country_code":"US","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210114115"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ting He","raw_affiliation_strings":["IBM Thomas J. Watson Research Center, Yorktown, NY, USA","IBM T. J. Watson Research Center, Yorktown Heights , NY, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM Thomas J. Watson Research Center, Yorktown, NY, USA","institution_ids":["https://openalex.org/I4210114115"]},{"raw_affiliation_string":"IBM T. J. Watson Research Center, Yorktown Heights , NY, USA#TAB#","institution_ids":["https://openalex.org/I1341412227"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064436231","display_name":"Dennis Goeckel","orcid":"https://orcid.org/0000-0002-4190-9515"},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dennis Goeckel","raw_affiliation_strings":["Department of ECE, University of Massachusetts, Amherst, MA, USA","Dept. of ECE, Univ. of Massachusetts, Amherst, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of ECE, University of Massachusetts, Amherst, MA, USA","institution_ids":["https://openalex.org/I24603500"]},{"raw_affiliation_string":"Dept. of ECE, Univ. of Massachusetts, Amherst, MA, USA","institution_ids":["https://openalex.org/I24603500"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013045755","display_name":"Ramya Raghavendra","orcid":null},"institutions":[{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]},{"id":"https://openalex.org/I4210114115","display_name":"IBM Research - Thomas J. Watson Research Center","ror":"https://ror.org/0265w5591","country_code":"US","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210114115"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ramya Raghavendra","raw_affiliation_strings":["IBM Thomas J. Watson Research Center, Yorktown, NY, USA","IBM T. J. Watson Research Center, Yorktown Heights , NY, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM Thomas J. Watson Research Center, Yorktown, NY, USA","institution_ids":["https://openalex.org/I4210114115"]},{"raw_affiliation_string":"IBM T. J. Watson Research Center, Yorktown Heights , NY, USA#TAB#","institution_ids":["https://openalex.org/I1341412227"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5036683370","display_name":"Don Towsley","orcid":"https://orcid.org/0000-0002-7808-7375"},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Don Towsley","raw_affiliation_strings":["Department of CS, University of Massachusetts, Amherst, MA, USA","Dept. of ECE, Univ. of Massachusetts, Amherst, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of CS, University of Massachusetts, Amherst, MA, USA","institution_ids":["https://openalex.org/I24603500"]},{"raw_affiliation_string":"Dept. of ECE, Univ. of Massachusetts, Amherst, MA, USA","institution_ids":["https://openalex.org/I24603500"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.9833,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.91385556,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"2202","last_page":"2210"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9998000264167786,"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.9998000264167786,"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/T10579","display_name":"Cognitive Radio Networks and Spectrum Sensing","score":0.9969000220298767,"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/T12288","display_name":"Optimization and Search Problems","score":0.9940000176429749,"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.897514820098877},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6554254293441772},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5941960215568542},{"id":"https://openalex.org/keywords/decoupling","display_name":"Decoupling (probability)","score":0.5343152284622192},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5332042574882507},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5166450142860413},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.5034179091453552},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.49306342005729675},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.436001181602478},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.4121798276901245},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.23081564903259277},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21920332312583923},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.16158533096313477},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.16089048981666565},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.14644068479537964}],"concepts":[{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.897514820098877},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6554254293441772},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5941960215568542},{"id":"https://openalex.org/C205606062","wikidata":"https://www.wikidata.org/wiki/Q5249645","display_name":"Decoupling (probability)","level":2,"score":0.5343152284622192},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5332042574882507},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5166450142860413},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.5034179091453552},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.49306342005729675},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.436001181602478},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.4121798276901245},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.23081564903259277},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21920332312583923},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.16158533096313477},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.16089048981666565},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.14644068479537964},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C133731056","wikidata":"https://www.wikidata.org/wiki/Q4917288","display_name":"Control engineering","level":1,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/infcom.2013.6567023","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2013.6567023","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W50486269","https://openalex.org/W1909215291","https://openalex.org/W2070941899","https://openalex.org/W2092203504","https://openalex.org/W2093562354","https://openalex.org/W2099111195","https://openalex.org/W2121098412","https://openalex.org/W2125724988","https://openalex.org/W2138637686","https://openalex.org/W2543823843","https://openalex.org/W3084669832","https://openalex.org/W6602031475","https://openalex.org/W6668084206"],"related_works":["https://openalex.org/W2108305519","https://openalex.org/W3035942111","https://openalex.org/W2347665962","https://openalex.org/W2138640781","https://openalex.org/W2162880363","https://openalex.org/W2351097701","https://openalex.org/W1971663816","https://openalex.org/W2555559350","https://openalex.org/W2001312276","https://openalex.org/W4237143639"],"abstract_inverted_index":{"We":[0,132,160],"consider":[1],"the":[2,25,30,46,61,71,102,157,165,167,212],"problem":[3,72],"of":[4,24,51,211],"endhost-based":[5,57],"shortest":[6],"path":[7],"routing":[8,18,58],"in":[9,48,91,112,130,154,173],"a":[10,83,116],"network":[11,26],"with":[12,56,93,197],"unknown,":[13],"time-varying":[14],"link":[15,103,192],"qualities.":[16,104],"Endhost-based":[17],"is":[19,89,127,215],"needed":[20],"when":[21],"internal":[22],"nodes":[23],"do":[27],"not":[28],"have":[29],"scope":[31],"or":[32,54],"capability":[33],"to":[34,39,95,137,200],"provide":[35],"globally":[36],"optimal":[37],"paths":[38],"given":[40],"source-destination":[41],"pairs,":[42],"as":[43,73,178],"can":[44,63],"be":[45],"case":[47],"networks":[49],"consisting":[50],"autonomous":[52],"subnetworks":[53],"those":[55],"restrictions.":[59],"Assuming":[60],"source":[62],"probe":[64],"links":[65],"along":[66],"selected":[67],"paths,":[68],"we":[69,114,148],"formulate":[70],"an":[74,79,97,150],"online":[75],"learning":[76,143],"problem,":[77],"where":[78,147,204],"existing":[80],"solution":[81,136,195,214],"achieves":[82],"performance":[84],"loss":[85],"(called":[86],"regret)":[87],"that":[88,100,163],"logarithmic":[90],"time":[92],"respect":[94],"(wrt)":[96],"offline":[98],"algorithm":[99,118],"knows":[101],"Current":[105],"solutions":[106],"assume":[107],"coupled":[108],"probing":[109,122,140,158],"and":[110,123,141],"routing;":[111],"contrast,":[113],"give":[115],"simple":[117],"based":[119],"on":[120,191],"decoupled":[121],"routing,":[124],"whose":[125],"regret":[126,155,168],"only":[128],"constant":[129,182],"time.":[131],"then":[133],"extend":[134],"our":[135,185,194],"support":[138],"multi-path":[139],"cooperative":[142],"between":[144],"multiple":[145],"sources,":[146],"show":[149,162],"inversely":[151],"proportional":[152],"decay":[153],"wrt":[156],"rate.":[159],"also":[161],"without":[164],"decoupling,":[166],"grows":[169],"at":[170],"least":[171],"logarithmically":[172],"time,":[174],"thus":[175],"establishing":[176],"decoupling":[177],"critical":[179],"for":[180],"obtaining":[181],"regret.":[183],"Although":[184],"analysis":[186],"assumes":[187],"certain":[188],"conditions":[189,206],"(i.i.d.)":[190],"qualities,":[193],"applies":[196],"straightforward":[198],"amendments":[199],"much":[201],"broader":[202],"scenarios":[203],"these":[205],"are":[207],"relaxed.":[208],"The":[209],"efficacy":[210],"proposed":[213],"verified":[216],"by":[217],"trace-driven":[218],"simulations.":[219]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}