{"id":"https://openalex.org/W4401508542","doi":"https://doi.org/10.1109/infocom52122.2024.10621295","title":"Backlogged Bandits: Cost-Effective Learning for Utility Maximization in Queueing Networks","display_name":"Backlogged Bandits: Cost-Effective Learning for Utility Maximization in Queueing Networks","publication_year":2024,"publication_date":"2024-05-20","ids":{"openalex":"https://openalex.org/W4401508542","doi":"https://doi.org/10.1109/infocom52122.2024.10621295"},"language":"en","primary_location":{"id":"doi:10.1109/infocom52122.2024.10621295","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/infocom52122.2024.10621295","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2024 - IEEE Conference on Computer Communications","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/A5026491429","display_name":"Juaren Steiger","orcid":"https://orcid.org/0009-0005-4064-5107"},"institutions":[{"id":"https://openalex.org/I204722609","display_name":"Queen's University","ror":"https://ror.org/02y72wh86","country_code":"CA","type":"education","lineage":["https://openalex.org/I204722609"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Juaren Steiger","raw_affiliation_strings":["Queen&#x2019;s University,Department of Electrical and Computer Engineering,Kingston,Ontario,Canada"],"affiliations":[{"raw_affiliation_string":"Queen&#x2019;s University,Department of Electrical and Computer Engineering,Kingston,Ontario,Canada","institution_ids":["https://openalex.org/I204722609"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100365193","display_name":"Bin Li","orcid":"https://orcid.org/0000-0002-5746-9665"},"institutions":[{"id":"https://openalex.org/I130769515","display_name":"Pennsylvania State University","ror":"https://ror.org/04p491231","country_code":"US","type":"education","lineage":["https://openalex.org/I130769515"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bin Li","raw_affiliation_strings":["Pennsylvania State University,School of Electrical Engineering and Computer Science,State College,Pennsylvania,USA"],"affiliations":[{"raw_affiliation_string":"Pennsylvania State University,School of Electrical Engineering and Computer Science,State College,Pennsylvania,USA","institution_ids":["https://openalex.org/I130769515"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100432389","display_name":"Ning Lu","orcid":"https://orcid.org/0000-0002-2141-0653"},"institutions":[{"id":"https://openalex.org/I204722609","display_name":"Queen's University","ror":"https://ror.org/02y72wh86","country_code":"CA","type":"education","lineage":["https://openalex.org/I204722609"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Ning Lu","raw_affiliation_strings":["Queen&#x2019;s University,Department of Electrical and Computer Engineering,Kingston,Ontario,Canada"],"affiliations":[{"raw_affiliation_string":"Queen&#x2019;s University,Department of Electrical and Computer Engineering,Kingston,Ontario,Canada","institution_ids":["https://openalex.org/I204722609"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5026491429"],"corresponding_institution_ids":["https://openalex.org/I204722609"],"apc_list":null,"apc_paid":null,"fwci":0.7326,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.71869349,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"381","last_page":"390"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13553","display_name":"Age of Information Optimization","score":0.9857000112533569,"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/T13553","display_name":"Age of Information Optimization","score":0.9857000112533569,"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.9713000059127808,"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/T10273","display_name":"IoT and Edge/Fog Computing","score":0.9641000032424927,"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/queueing-theory","display_name":"Queueing theory","score":0.8048063516616821},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7745920419692993},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.6584241390228271},{"id":"https://openalex.org/keywords/layered-queueing-network","display_name":"Layered queueing network","score":0.49489086866378784},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.47139933705329895},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.466264545917511},{"id":"https://openalex.org/keywords/utility-maximization","display_name":"Utility maximization","score":0.42404812574386597},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.3361852765083313},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2934974431991577},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.1339752972126007},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09685492515563965}],"concepts":[{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.8048063516616821},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7745920419692993},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.6584241390228271},{"id":"https://openalex.org/C33891772","wikidata":"https://www.wikidata.org/wiki/Q6505536","display_name":"Layered queueing network","level":3,"score":0.49489086866378784},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.47139933705329895},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.466264545917511},{"id":"https://openalex.org/C2985793214","wikidata":"https://www.wikidata.org/wiki/Q3274096","display_name":"Utility maximization","level":2,"score":0.42404812574386597},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.3361852765083313},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2934974431991577},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.1339752972126007},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09685492515563965}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/infocom52122.2024.10621295","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/infocom52122.2024.10621295","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2024 - IEEE Conference on Computer Communications","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":48,"referenced_works":["https://openalex.org/W2120575449","https://openalex.org/W2604738573","https://openalex.org/W2810804998","https://openalex.org/W2887481401","https://openalex.org/W2914304175","https://openalex.org/W2918314918","https://openalex.org/W2959222764","https://openalex.org/W2960987286","https://openalex.org/W2962921664","https://openalex.org/W2963945346","https://openalex.org/W2979889710","https://openalex.org/W3020161630","https://openalex.org/W3038426846","https://openalex.org/W3054830817","https://openalex.org/W3086913918","https://openalex.org/W3095593352","https://openalex.org/W3100318176","https://openalex.org/W3102449016","https://openalex.org/W3109504587","https://openalex.org/W3112475644","https://openalex.org/W3124291373","https://openalex.org/W3132619898","https://openalex.org/W3137953094","https://openalex.org/W3153000374","https://openalex.org/W3155217882","https://openalex.org/W3171842449","https://openalex.org/W4206530644","https://openalex.org/W4221156940","https://openalex.org/W4280610369","https://openalex.org/W4283217744","https://openalex.org/W4283829803","https://openalex.org/W4295298559","https://openalex.org/W4301305932","https://openalex.org/W4301852635","https://openalex.org/W4311079702","https://openalex.org/W4386243245","https://openalex.org/W4386245216","https://openalex.org/W4386260563","https://openalex.org/W6602031475","https://openalex.org/W6683841709","https://openalex.org/W6703562905","https://openalex.org/W6768954044","https://openalex.org/W6782103484","https://openalex.org/W6793917791","https://openalex.org/W6796668474","https://openalex.org/W6810485500","https://openalex.org/W6842687297","https://openalex.org/W6842847180"],"related_works":["https://openalex.org/W1701464461","https://openalex.org/W2168047232","https://openalex.org/W2121863833","https://openalex.org/W2137668347","https://openalex.org/W2299822401","https://openalex.org/W1977970311","https://openalex.org/W2149540948","https://openalex.org/W36834199","https://openalex.org/W2170282368","https://openalex.org/W1556477456"],"abstract_inverted_index":{"Bipartite":[0],"queueing":[1,54,73],"networks":[2,55],"with":[3,56,117,136,148],"unknown":[4,57],"statistics,":[5],"where":[6,64],"jobs":[7],"are":[8],"routed":[9],"to":[10,45],"and":[11,15,29,91,98,113,122,143,152],"queued":[12],"at":[13],"servers":[14],"yield":[16],"server-dependent":[17],"utilities":[18],"upon":[19],"completion,":[20],"model":[21],"a":[22,60,127],"wide":[23],"range":[24],"of":[25,88,110],"problems":[26],"in":[27,36,41,52,146],"communications":[28],"related":[30],"research":[31],"areas":[32],"(e.g.,":[33],"call":[34,37],"routing":[35],"centers,":[38],"task":[39],"assignment":[40],"crowdsourcing,":[42],"job":[43],"dispatching":[44],"cloud":[46],"servers).":[47],"The":[48],"utility":[49],"maximization":[50],"problem":[51,63,141],"bipartite":[53],"statistics":[58],"is":[59,134],"bandit":[61],"learning":[62],"the":[65,71,85,89,137],"delayed":[66],"semi-bandit":[67],"feedback":[68,99],"depends":[69],"on":[70],"server":[72],"delay.":[74,100],"In":[75],"this":[76],"paper,":[77],"we":[78],"propose":[79],"an":[80],"efficient":[81],"algorithm":[82],"that":[83],"overcomes":[84],"technical":[86],"shortcomings":[87],"state-of-the-art":[90,138],"achieves":[92],"square":[93],"root":[94],"regret,":[95],"queue":[96],"length,":[97],"Our":[101],"approach":[102],"also":[103],"accommodates":[104],"additional":[105],"constraints,":[106,116],"such":[107],"as":[108],"quality":[109],"service,":[111],"fairness,":[112],"budgeted":[114],"cost":[115],"constant":[118],"expected":[119,124],"peak":[120],"violation":[121,125],"zero":[123],"after":[126],"fixed":[128],"timeslot.":[129],"Empirically,":[130],"our":[131],"algorithm\u2019s":[132],"regret":[133],"competitive":[135],"for":[139],"some":[140],"instances":[142],"outperforms":[144],"it":[145],"others,":[147],"much":[149],"lower":[150],"delay":[151],"constraint":[153],"violation.":[154]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1}],"updated_date":"2026-01-13T01:12:25.745995","created_date":"2025-10-10T00:00:00"}
