{"id":"https://openalex.org/W2902261664","doi":"https://doi.org/10.1109/tnet.2019.2913666","title":"Optimal Learning for Dynamic Coding in Deadline-Constrained Multi-Channel Networks","display_name":"Optimal Learning for Dynamic Coding in Deadline-Constrained Multi-Channel Networks","publication_year":2019,"publication_date":"2019-05-08","ids":{"openalex":"https://openalex.org/W2902261664","doi":"https://doi.org/10.1109/tnet.2019.2913666","mag":"2902261664"},"language":"en","primary_location":{"id":"doi:10.1109/tnet.2019.2913666","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tnet.2019.2913666","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/A5054923152","display_name":"Semih \u00c7ayc\u0131","orcid":"https://orcid.org/0000-0001-7928-0794"},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Semih Cayci","raw_affiliation_strings":["The Ohio State University, Columbus, OH, USA"],"raw_orcid":"https://orcid.org/0000-0001-7928-0794","affiliations":[{"raw_affiliation_string":"The Ohio State University, Columbus, OH, USA","institution_ids":["https://openalex.org/I52357470"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076974020","display_name":"Atilla Ery\u0131lmaz","orcid":"https://orcid.org/0000-0001-5560-5806"},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Atilla Eryilmaz","raw_affiliation_strings":["The Ohio State University, Columbus, OH, USA"],"raw_orcid":"https://orcid.org/0000-0001-5560-5806","affiliations":[{"raw_affiliation_string":"The Ohio State University, Columbus, OH, USA","institution_ids":["https://openalex.org/I52357470"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I52357470"],"apc_list":null,"apc_paid":null,"fwci":0.3954,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.64732903,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"27","issue":"3","first_page":"1043","last_page":"1054"},"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/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9997000098228455,"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/T13553","display_name":"Age of Information Optimization","score":0.9995999932289124,"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/computer-science","display_name":"Computer science","score":0.8372097015380859},{"id":"https://openalex.org/keywords/regret","display_name":"Regret","score":0.8258093595504761},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.6352136135101318},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.5147050023078918},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4902341961860657},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.4881173074245453},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.47806814312934875},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.44014987349510193},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.41688427329063416},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.33649927377700806},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3183562159538269},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09294313192367554}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8372097015380859},{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.8258093595504761},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.6352136135101318},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.5147050023078918},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4902341961860657},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.4881173074245453},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.47806814312934875},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.44014987349510193},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.41688427329063416},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.33649927377700806},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3183562159538269},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09294313192367554},{"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/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tnet.2019.2913666","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tnet.2019.2913666","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":[{"score":0.5299999713897705,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[{"id":"https://openalex.org/G1060121603","display_name":null,"funder_award_id":"CNS-SpecEES-1824337","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2379327423","display_name":null,"funder_award_id":"HDTRA1-15-1-0003","funder_id":"https://openalex.org/F4320332186","funder_display_name":"Defense Threat Reduction Agency"},{"id":"https://openalex.org/G3020841490","display_name":null,"funder_award_id":"HDTRA1-18-1-0050","funder_id":"https://openalex.org/F4320332186","funder_display_name":"Defense Threat Reduction Agency"},{"id":"https://openalex.org/G7136181975","display_name":null,"funder_award_id":"CNS-NeTS-1717045","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7888925327","display_name":null,"funder_award_id":"CMMISMOR-1562065","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8682229216","display_name":null,"funder_award_id":"CNS-ICN-WEN-1719371","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G923841940","display_name":null,"funder_award_id":"CNS-NeTS-1514260","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320332186","display_name":"Defense Threat Reduction Agency","ror":"https://ror.org/04tz64554"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W905396345","https://openalex.org/W1808410902","https://openalex.org/W1997834106","https://openalex.org/W2002581886","https://openalex.org/W2049934117","https://openalex.org/W2096752169","https://openalex.org/W2109977037","https://openalex.org/W2115334467","https://openalex.org/W2129301967","https://openalex.org/W2129462326","https://openalex.org/W2134789631","https://openalex.org/W2138020668","https://openalex.org/W2138993731","https://openalex.org/W2163418239","https://openalex.org/W2165768656","https://openalex.org/W2168131851","https://openalex.org/W2168405694","https://openalex.org/W2170192755","https://openalex.org/W2339643019","https://openalex.org/W2404446105","https://openalex.org/W2486403688","https://openalex.org/W2583219443","https://openalex.org/W2730925570","https://openalex.org/W2950929549","https://openalex.org/W2963814530","https://openalex.org/W2982319229","https://openalex.org/W4297972217","https://openalex.org/W4297972233","https://openalex.org/W6678770941","https://openalex.org/W6679907205"],"related_works":["https://openalex.org/W2971351794","https://openalex.org/W4376155396","https://openalex.org/W1947085858","https://openalex.org/W2101991911","https://openalex.org/W2947263763","https://openalex.org/W4288373430","https://openalex.org/W4287753704","https://openalex.org/W3036260055","https://openalex.org/W3158925485","https://openalex.org/W2996735312"],"abstract_inverted_index":{"We":[0,135],"study":[1],"the":[2,27,33,39,49,56,96,104,108,142,148,151],"problem":[3,24],"of":[4,41,51,58,110,150],"serving":[5],"randomly":[6],"arriving":[7],"and":[8,20,35,44,66,86,122,145],"delay-sensitive":[9],"traffic":[10,84],"over":[11],"a":[12,112],"multi-channel":[13],"communication":[14],"system":[15],"with":[16],"time-varying":[17],"channel":[18,53,78,90,113],"states":[19],"unknown":[21],"statistics.":[22],"This":[23],"deviates":[25],"from":[26],"classical":[28],"exploration-exploitation":[29],"setting":[30],"in":[31,103],"that":[32,61,81,95,131,157],"design":[34],"analysis":[36],"must":[37],"accommodate":[38],"dynamics":[40],"packet":[42],"availability":[43],"urgency":[45],"as":[46,48],"well":[47],"cost":[50,109],"each":[52],"use":[54],"at":[55],"time":[57],"decision.":[59],"To":[60],"end,":[62],"we":[63,92,129,158],"have":[64,93],"developed":[65],"investigated":[67],"an":[68],"index-based":[69],"policy":[70,98],"upper":[71],"confidence":[72],"bound":[73],"(UCB)-deadline,":[74],"which":[75],"performs":[76],"dynamic":[77],"allocation":[79],"decisions":[80],"incorporate":[82],"these":[83],"requirements":[85],"costs.":[87],"Under":[88],"symmetric":[89],"conditions,":[91],"proved":[94],"UCB-deadline":[97,132,152],"can":[99],"achieve":[100],"bounded":[101],"regret":[102,124],"likely":[105],"case":[106],"where":[107],"using":[111],"is":[114,133],"not":[115],"too":[116],"high":[117],"to":[118,140,153],"prevent":[119],"all":[120],"transmissions,":[121],"logarithmic":[123],"otherwise.":[125],"In":[126],"this":[127],"case,":[128],"show":[130],"order-optimal.":[134],"also":[136,146],"perform":[137],"numerical":[138],"investigations":[139],"validate":[141],"theoretical":[143],"fundings,":[144],"compare":[147],"performance":[149],"another":[154],"learning":[155],"algorithm":[156],"propose":[159],"based":[160],"on":[161],"Thompson":[162],"sampling.":[163]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}