{"id":"https://openalex.org/W2803466884","doi":"https://doi.org/10.23919/wiopt.2018.8362847","title":"Scheduling URLLC users with reliable latency guarantees","display_name":"Scheduling URLLC users with reliable latency guarantees","publication_year":2018,"publication_date":"2018-05-01","ids":{"openalex":"https://openalex.org/W2803466884","doi":"https://doi.org/10.23919/wiopt.2018.8362847","mag":"2803466884"},"language":"en","primary_location":{"id":"doi:10.23919/wiopt.2018.8362847","is_oa":false,"landing_page_url":"https://doi.org/10.23919/wiopt.2018.8362847","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","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/A5062222447","display_name":"Apostolos Destounis","orcid":"https://orcid.org/0000-0003-0420-3430"},"institutions":[{"id":"https://openalex.org/I4210123571","display_name":"Huawei Technologies (France)","ror":"https://ror.org/02rbzf697","country_code":"FR","type":"company","lineage":["https://openalex.org/I2250955327","https://openalex.org/I4210123571"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Apostolos Destounis","raw_affiliation_strings":["Mathematical and Algorithmic Sciences Lab, Huawei Technologies Co. Ltd, Boulogne-Billancourt, France"],"affiliations":[{"raw_affiliation_string":"Mathematical and Algorithmic Sciences Lab, Huawei Technologies Co. Ltd, Boulogne-Billancourt, France","institution_ids":["https://openalex.org/I4210123571"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070393786","display_name":"Georgios S. Paschos","orcid":"https://orcid.org/0000-0002-5922-1612"},"institutions":[{"id":"https://openalex.org/I4210123571","display_name":"Huawei Technologies (France)","ror":"https://ror.org/02rbzf697","country_code":"FR","type":"company","lineage":["https://openalex.org/I2250955327","https://openalex.org/I4210123571"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Georgios S. Paschos","raw_affiliation_strings":["Mathematical and Algorithmic Sciences Lab, Huawei Technologies Co. Ltd, Boulogne-Billancourt, France"],"affiliations":[{"raw_affiliation_string":"Mathematical and Algorithmic Sciences Lab, Huawei Technologies Co. Ltd, Boulogne-Billancourt, France","institution_ids":["https://openalex.org/I4210123571"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068347572","display_name":"Jes\u00fas Arnau","orcid":"https://orcid.org/0000-0002-8398-8426"},"institutions":[{"id":"https://openalex.org/I4210123571","display_name":"Huawei Technologies (France)","ror":"https://ror.org/02rbzf697","country_code":"FR","type":"company","lineage":["https://openalex.org/I2250955327","https://openalex.org/I4210123571"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Jesus Arnau","raw_affiliation_strings":["Mathematical and Algorithmic Sciences Lab, Huawei Technologies Co. Ltd, Boulogne-Billancourt, France"],"affiliations":[{"raw_affiliation_string":"Mathematical and Algorithmic Sciences Lab, Huawei Technologies Co. Ltd, Boulogne-Billancourt, France","institution_ids":["https://openalex.org/I4210123571"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088602155","display_name":"Marios Kountouris","orcid":"https://orcid.org/0000-0003-1143-080X"},"institutions":[{"id":"https://openalex.org/I4210123571","display_name":"Huawei Technologies (France)","ror":"https://ror.org/02rbzf697","country_code":"FR","type":"company","lineage":["https://openalex.org/I2250955327","https://openalex.org/I4210123571"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Marios Kountouris","raw_affiliation_strings":["Mathematical and Algorithmic Sciences Lab, Huawei Technologies Co. Ltd, Boulogne-Billancourt, France"],"affiliations":[{"raw_affiliation_string":"Mathematical and Algorithmic Sciences Lab, Huawei Technologies Co. Ltd, Boulogne-Billancourt, France","institution_ids":["https://openalex.org/I4210123571"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5062222447"],"corresponding_institution_ids":["https://openalex.org/I4210123571"],"apc_list":null,"apc_paid":null,"fwci":3.0901,"has_fulltext":false,"cited_by_count":38,"citation_normalized_percentile":{"value":0.92120425,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.9998999834060669,"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/T10148","display_name":"Advanced MIMO Systems Optimization","score":0.9998000264167786,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9994000196456909,"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.8088534474372864},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6522814035415649},{"id":"https://openalex.org/keywords/latency","display_name":"Latency (audio)","score":0.5737926959991455},{"id":"https://openalex.org/keywords/curse-of-dimensionality","display_name":"Curse of dimensionality","score":0.5225692987442017},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.4848112165927887},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.4703514873981476},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.46784886717796326},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.45986509323120117},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4430508613586426},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.37548190355300903},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.13392552733421326},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10154521465301514},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.0977942943572998},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09380897879600525}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8088534474372864},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6522814035415649},{"id":"https://openalex.org/C82876162","wikidata":"https://www.wikidata.org/wiki/Q17096504","display_name":"Latency (audio)","level":2,"score":0.5737926959991455},{"id":"https://openalex.org/C111030470","wikidata":"https://www.wikidata.org/wiki/Q1430460","display_name":"Curse of dimensionality","level":2,"score":0.5225692987442017},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.4848112165927887},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.4703514873981476},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46784886717796326},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.45986509323120117},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4430508613586426},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.37548190355300903},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.13392552733421326},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10154521465301514},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0977942943572998},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09380897879600525},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/wiopt.2018.8362847","is_oa":false,"landing_page_url":"https://doi.org/10.23919/wiopt.2018.8362847","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.6299999952316284,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W565357261","https://openalex.org/W1700014370","https://openalex.org/W1969198288","https://openalex.org/W1991777507","https://openalex.org/W1995100690","https://openalex.org/W2030611753","https://openalex.org/W2041025394","https://openalex.org/W2052371896","https://openalex.org/W2084404802","https://openalex.org/W2098432798","https://openalex.org/W2106864314","https://openalex.org/W2108327442","https://openalex.org/W2109672207","https://openalex.org/W2115632051","https://openalex.org/W2136138595","https://openalex.org/W2137152139","https://openalex.org/W2140314025","https://openalex.org/W2167264214","https://openalex.org/W2262889796","https://openalex.org/W2611804663","https://openalex.org/W2964259990","https://openalex.org/W4230573295","https://openalex.org/W4301852635","https://openalex.org/W6677082391","https://openalex.org/W6746804576"],"related_works":["https://openalex.org/W241127407","https://openalex.org/W2381035939","https://openalex.org/W2468477307","https://openalex.org/W2910645127","https://openalex.org/W162895179","https://openalex.org/W1521824362","https://openalex.org/W2315999538","https://openalex.org/W187740018","https://openalex.org/W2162286586","https://openalex.org/W4255368532"],"abstract_inverted_index":{"This":[0,95],"paper":[1],"studies":[2],"Ultra-Reliable":[3],"Low-Latency":[4],"Communications":[5],"(URLLC),":[6],"an":[7,108,127],"important":[8],"service":[9],"class":[10,149,168],"of":[11,74,140,150,198],"emerging":[12],"5G":[13],"networks.":[14],"In":[15],"this":[16],"class,":[17],"multiple":[18,63],"unreliable":[19],"transmissions":[20],"must":[21],"be":[22],"combined":[23],"to":[24,88,125,182],"achieve":[25],"reliable":[26,50,92],"latency:":[27],"a":[28,31,43,58,65,81,90,119,148,172],"user":[29],"experiences":[30],"frame":[32,53],"success":[33,54],"when":[34,51],"the":[35,52,72,75,98,138,177,189,199],"entire":[36],"L":[37,180],"bits":[38],"are":[39,123],"received":[40],"correctly":[41],"within":[42],"deadline,":[44],"and":[45,179],"its":[46],"latency":[47,93],"performance":[48],"is":[49,56,96,107],"rate":[55],"above":[57],"threshold.":[59],"When":[60],"jointly":[61],"serving":[62],"users,":[64],"natural":[66],"URLLC":[67,99],"scheduling":[68,82],"question":[69],"arises:":[70],"given":[71],"uncertainty":[73],"wireless":[76],"channel,":[77],"can":[78],"we":[79,122,146],"find":[80],"policy":[83,129,135,165],"that":[84,163,167,188],"allows":[85],"all":[86],"users":[87],"meet":[89],"target":[91],"objective?":[94],"called":[97],"SLA":[100],"Satisfaction":[101],"(USS)":[102],"problem.":[103,201],"The":[104],"USS":[105,200],"problem":[106],"infinite":[109],"horizon":[110],"constrained":[111],"Markov":[112],"Decision":[113],"Process,":[114],"for":[115,143],"which,":[116],"after":[117],"establishing":[118],"convenient":[120],"property,":[121],"able":[124],"derive":[126],"optimal":[128,158,170],"based":[130],"on":[131],"dynamic":[132],"programming.":[133],"Our":[134],"suffers":[136],"from":[137],"curse":[139],"dimensionality,":[141],"hence":[142],"large":[144],"instances":[145,197],"propose":[147],"knapsack-inspired":[151],"computationally":[152],"efficient":[153],"-":[154,159],"but":[155],"not":[156],"necessarily":[157],"policies.":[160],"We":[161],"prove":[162],"every":[164],"in":[166,171,194],"becomes":[169],"fluid":[173],"regime,":[174],"where":[175],"both":[176],"deadline":[178],"scale":[181],"infinity,":[183],"while":[184],"our":[185],"simulations":[186],"show":[187],"policies":[190],"perform":[191],"well":[192],"even":[193],"small":[195],"practical":[196]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":4}],"updated_date":"2025-12-11T23:09:37.256380","created_date":"2025-10-10T00:00:00"}