{"id":"https://openalex.org/W2919633219","doi":"https://doi.org/10.1109/infocom.2019.8737552","title":"Optimal Trunk-Reservation by Policy Learning","display_name":"Optimal Trunk-Reservation by Policy Learning","publication_year":2019,"publication_date":"2019-04-01","ids":{"openalex":"https://openalex.org/W2919633219","doi":"https://doi.org/10.1109/infocom.2019.8737552","mag":"2919633219"},"language":"en","primary_location":{"id":"doi:10.1109/infocom.2019.8737552","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom.2019.8737552","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2019 - 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/A5070693243","display_name":"Antonio Massaro","orcid":"https://orcid.org/0000-0003-2002-8687"},"institutions":[{"id":"https://openalex.org/I2277624104","display_name":"Fondazione Bruno Kessler","ror":"https://ror.org/01j33xk10","country_code":"IT","type":"facility","lineage":["https://openalex.org/I2277624104"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Antonio Massaro","raw_affiliation_strings":["Fondazione Bruno Kessler, via Sommarive, 18 - 38123, Trento, Italy"],"affiliations":[{"raw_affiliation_string":"Fondazione Bruno Kessler, via Sommarive, 18 - 38123, Trento, Italy","institution_ids":["https://openalex.org/I2277624104"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038365789","display_name":"Francesco De Pellegrini","orcid":"https://orcid.org/0000-0002-1370-9401"},"institutions":[{"id":"https://openalex.org/I198415970","display_name":"Universit\u00e9 d'Avignon et des Pays de Vaucluse","ror":"https://ror.org/00mfpxb84","country_code":"FR","type":"education","lineage":["https://openalex.org/I198415970"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Francesco De Pellegrini","raw_affiliation_strings":["CERI/LIA University of Avignon, chemin des Meinajaries 339, 84911 Avignon, France"],"affiliations":[{"raw_affiliation_string":"CERI/LIA University of Avignon, chemin des Meinajaries 339, 84911 Avignon, France","institution_ids":["https://openalex.org/I198415970"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101915605","display_name":"Lorenzo Maggi","orcid":"https://orcid.org/0000-0003-3643-8349"},"institutions":[{"id":"https://openalex.org/I4210149358","display_name":"Nokia (France)","ror":"https://ror.org/04kwfkk85","country_code":"FR","type":"company","lineage":["https://openalex.org/I2738502077","https://openalex.org/I4210149358"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Lorenzo Maggi","raw_affiliation_strings":["Nokia Bell Labs, Paris Saclay, France"],"affiliations":[{"raw_affiliation_string":"Nokia Bell Labs, Paris Saclay, France","institution_ids":["https://openalex.org/I4210149358"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5070693243"],"corresponding_institution_ids":["https://openalex.org/I2277624104"],"apc_list":null,"apc_paid":null,"fwci":0.5305,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.67314273,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"127","last_page":"135"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9980000257492065,"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/T12288","display_name":"Optimization and Search Problems","score":0.9980000257492065,"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/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9957000017166138,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7397754192352295},{"id":"https://openalex.org/keywords/reinforcement-learning","display_name":"Reinforcement learning","score":0.7210414409637451},{"id":"https://openalex.org/keywords/reservation","display_name":"Reservation","score":0.6862204074859619},{"id":"https://openalex.org/keywords/leverage","display_name":"Leverage (statistics)","score":0.6720606088638306},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.6271699666976929},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6007426977157593},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.5673926472663879},{"id":"https://openalex.org/keywords/queueing-theory","display_name":"Queueing theory","score":0.5093122720718384},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.4899227023124695},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.43746674060821533},{"id":"https://openalex.org/keywords/monotonic-function","display_name":"Monotonic function","score":0.413106232881546},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.371638685464859},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.27658578753471375},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.21460846066474915},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14366045594215393}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7397754192352295},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.7210414409637451},{"id":"https://openalex.org/C2777632111","wikidata":"https://www.wikidata.org/wiki/Q1937518","display_name":"Reservation","level":2,"score":0.6862204074859619},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.6720606088638306},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.6271699666976929},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6007426977157593},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.5673926472663879},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.5093122720718384},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4899227023124695},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.43746674060821533},{"id":"https://openalex.org/C72169020","wikidata":"https://www.wikidata.org/wiki/Q194404","display_name":"Monotonic function","level":2,"score":0.413106232881546},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.371638685464859},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.27658578753471375},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.21460846066474915},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14366045594215393},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/infocom.2019.8737552","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom.2019.8737552","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2019 - IEEE Conference on Computer Communications","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.6299999952316284,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W32403112","https://openalex.org/W2020799265","https://openalex.org/W2073384958","https://openalex.org/W2076798550","https://openalex.org/W2103588946","https://openalex.org/W2113772903","https://openalex.org/W2119224218","https://openalex.org/W2119567691","https://openalex.org/W2119717200","https://openalex.org/W2121863487","https://openalex.org/W2147750403","https://openalex.org/W2149195579","https://openalex.org/W2155027007","https://openalex.org/W2780536202","https://openalex.org/W4211221179","https://openalex.org/W4214717370","https://openalex.org/W4233696721","https://openalex.org/W4298023569","https://openalex.org/W6675711008","https://openalex.org/W6683204974"],"related_works":["https://openalex.org/W2077314575","https://openalex.org/W2379215383","https://openalex.org/W2271928667","https://openalex.org/W4315701745","https://openalex.org/W1990290471","https://openalex.org/W4380682190","https://openalex.org/W1994860013","https://openalex.org/W246884077","https://openalex.org/W2005710836","https://openalex.org/W3210156514"],"abstract_inverted_index":{"In":[0,90],"the":[1,44,53,59,64,68,84,102,124,128,149,153,162],"framework":[2],"of":[3,67,97,127,152,165,183],"queuing":[4],"theory":[5],"with":[6,39,81],"multiclass":[7],"jobs,":[8,70],"trunk-reservation":[9,99],"is":[10,34,61,74,79],"an":[11,21],"admission":[12],"control":[13],"technique":[14],"to":[15,62,83,131,148],"handle":[16],"job":[17,73],"class":[18,86,106],"priority":[19,29,42,85],"in":[20,181],"online":[22,95],"fashion,":[23],"and":[24,109,173],"serve":[25],"as":[26,31],"many":[27],"high":[28],"jobs":[30,38],"possible.":[32],"This":[33],"achieved":[35],"by":[36],"rejecting":[37],"sufficiently":[40],"low":[41],"when":[43,52,101],"buffer":[45],"space":[46],"becomes":[47],"a":[48,76,116,137],"scarce":[49],"resource,":[50],"i.e.,":[51,105],"queue":[54],"may":[55],"soon":[56],"overflow.":[57],"Mathematically,":[58],"objective":[60],"maximize":[63],"long-term":[65],"reward":[66,77],"admitted":[69],"where":[71],"each":[72],"assigned":[75],"which":[78],"monotonic":[80],"respect":[82],"it":[87,176],"belongs":[88],"to.":[89],"this":[91],"paper":[92],"we":[93,122],"study":[94],"learning":[96,139],"optimal":[98,129],"policies":[100],"system":[103],"parameters,":[104],"arrival":[107],"rates":[108],"service":[110],"time,":[111],"are":[112],"unknown.":[113],"Starting":[114],"from":[115],"Markov":[117],"Decision":[118],"Process":[119],"(MDP)":[120],"formulation,":[121],"leverage":[123],"stairway":[125],"structure":[126],"policy":[130],"define":[132],"Integer":[133],"Gradient":[134],"Ascent":[135],"(IGA),":[136],"reinforcement":[138],"(RL)":[140],"algorithm":[141],"based":[142],"on":[143,161],"policy-gradient":[144],"methods,":[145],"specifically":[146],"tailored":[147],"mathematical":[150],"properties":[151,164],"problem":[154],"at":[155],"hand.":[156],"We":[157],"provide":[158],"theoretical":[159],"results":[160],"convergence":[163,184],"IGA.":[166],"Extensive":[167],"numerical":[168],"experiments":[169],"characterize":[170],"its":[171],"behavior":[172],"confirm":[174],"that":[175],"outperforms":[177],"standard":[178],"RL":[179],"techniques":[180],"terms":[182],"rate.":[185]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}