{"id":"https://openalex.org/W3122243047","doi":"https://doi.org/10.1109/globecom42002.2020.9322420","title":"Delay Minimization for Edge Computing with Dynamic Server Computing Capacity: A Learning Approach","display_name":"Delay Minimization for Edge Computing with Dynamic Server Computing Capacity: A Learning Approach","publication_year":2020,"publication_date":"2020-12-01","ids":{"openalex":"https://openalex.org/W3122243047","doi":"https://doi.org/10.1109/globecom42002.2020.9322420","mag":"3122243047"},"language":"en","primary_location":{"id":"doi:10.1109/globecom42002.2020.9322420","is_oa":false,"landing_page_url":"https://doi.org/10.1109/globecom42002.2020.9322420","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"GLOBECOM 2020 - 2020 IEEE Global Communications Conference","raw_type":"proceedings-article"},"type":"conference-paper","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/A5100611260","display_name":"Burak Y\u0131lmaz","orcid":"https://orcid.org/0000-0001-6578-916X"},"institutions":[{"id":"https://openalex.org/I31512782","display_name":"Technische Universit\u00e4t Darmstadt","ror":"https://ror.org/05n911h24","country_code":"DE","type":"education","lineage":["https://openalex.org/I31512782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Burak Yilmaz","raw_affiliation_strings":["Technische Universit\u00e4t Darmstadt"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Darmstadt","institution_ids":["https://openalex.org/I31512782"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043544023","display_name":"Andrea Ortiz","orcid":"https://orcid.org/0000-0002-6544-1152"},"institutions":[{"id":"https://openalex.org/I31512782","display_name":"Technische Universit\u00e4t Darmstadt","ror":"https://ror.org/05n911h24","country_code":"DE","type":"education","lineage":["https://openalex.org/I31512782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Andrea Ortiz","raw_affiliation_strings":["Technische Universit\u00e4t Darmstadt"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Darmstadt","institution_ids":["https://openalex.org/I31512782"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5040462233","display_name":"Anja Klein","orcid":"https://orcid.org/0000-0002-7626-4470"},"institutions":[{"id":"https://openalex.org/I31512782","display_name":"Technische Universit\u00e4t Darmstadt","ror":"https://ror.org/05n911h24","country_code":"DE","type":"education","lineage":["https://openalex.org/I31512782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Anja Klein","raw_affiliation_strings":["Technische Universit\u00e4t Darmstadt"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Darmstadt","institution_ids":["https://openalex.org/I31512782"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I31512782"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10273","display_name":"IoT and Edge/Fog Computing","score":0.9997000098228455,"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/T10273","display_name":"IoT and Edge/Fog Computing","score":0.9997000098228455,"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/T13553","display_name":"Age of Information Optimization","score":0.9973999857902527,"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/T11392","display_name":"Energy Harvesting in Wireless Networks","score":0.9922000169754028,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8107261657714844},{"id":"https://openalex.org/keywords/curse-of-dimensionality","display_name":"Curse of dimensionality","score":0.6996491551399231},{"id":"https://openalex.org/keywords/mobile-edge-computing","display_name":"Mobile edge computing","score":0.6628793478012085},{"id":"https://openalex.org/keywords/reinforcement-learning","display_name":"Reinforcement learning","score":0.6381925344467163},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.6175218820571899},{"id":"https://openalex.org/keywords/edge-computing","display_name":"Edge computing","score":0.5881960391998291},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5087478756904602},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.46087366342544556},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4596085548400879},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.45585498213768005},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.38527753949165344},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.22817817330360413},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19146376848220825},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11607682704925537}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8107261657714844},{"id":"https://openalex.org/C111030470","wikidata":"https://www.wikidata.org/wiki/Q1430460","display_name":"Curse of dimensionality","level":2,"score":0.6996491551399231},{"id":"https://openalex.org/C2776061582","wikidata":"https://www.wikidata.org/wiki/Q25325231","display_name":"Mobile edge computing","level":3,"score":0.6628793478012085},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.6381925344467163},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.6175218820571899},{"id":"https://openalex.org/C2778456923","wikidata":"https://www.wikidata.org/wiki/Q5337692","display_name":"Edge computing","level":3,"score":0.5881960391998291},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5087478756904602},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.46087366342544556},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4596085548400879},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.45585498213768005},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.38527753949165344},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.22817817330360413},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19146376848220825},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11607682704925537},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/globecom42002.2020.9322420","is_oa":false,"landing_page_url":"https://doi.org/10.1109/globecom42002.2020.9322420","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"GLOBECOM 2020 - 2020 IEEE Global Communications Conference","raw_type":"proceedings-article"},{"id":"pmh:oai:tubiblio.ulb.tu-darmstadt.de:123199","is_oa":false,"landing_page_url":"http://tubiblio.ulb.tu-darmstadt.de/123199/","pdf_url":null,"source":{"id":"https://openalex.org/S4377196390","display_name":"TUbilio (Technical University of Darmstadt)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I31512782","host_organization_name":"Technische Universit\u00e4t Darmstadt","host_organization_lineage":["https://openalex.org/I31512782"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Konferenzver\u00f6ffentlichung"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.75,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320321707","display_name":"EWE","ror":"https://ror.org/040gfwf91"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W41554520","https://openalex.org/W182605591","https://openalex.org/W2049934117","https://openalex.org/W2083213425","https://openalex.org/W2121863487","https://openalex.org/W2195423816","https://openalex.org/W2404643895","https://openalex.org/W2482293012","https://openalex.org/W2561715741","https://openalex.org/W2592843051","https://openalex.org/W2594560857","https://openalex.org/W2799026114","https://openalex.org/W2912884317","https://openalex.org/W2963060851","https://openalex.org/W2963821095","https://openalex.org/W2964335916","https://openalex.org/W2970905513","https://openalex.org/W3106445841","https://openalex.org/W3124943657","https://openalex.org/W6607432528"],"related_works":["https://openalex.org/W4361251304","https://openalex.org/W3024547383","https://openalex.org/W4210813012","https://openalex.org/W3174690704","https://openalex.org/W2968424451","https://openalex.org/W4221092438","https://openalex.org/W4385335479","https://openalex.org/W2905685817","https://openalex.org/W2730940305","https://openalex.org/W4207020266"],"abstract_inverted_index":{"The":[0,127],"offloading":[1,58,124,148],"decisions":[2],"of":[3,65,107,138,161,164],"K":[4],"mobile":[5],"users":[6],"(MUs)":[7],"aiming":[8,151],"at":[9,152],"minimizing":[10,153],"the":[11,56,62,72,80,92,98,104,108,135,139,142,147,154,159,169,209],"execution":[12],"delay":[13,99],"in":[14],"a":[15,32,116,193],"Mobile":[16],"Edge":[17],"Computing":[18],"(MEC)":[19],"scenario":[20],"with":[21,198],"non-orthogonal":[22],"multiple":[23],"access":[24],"is":[25],"considered.":[26],"In":[27,53],"this":[28,54],"work,":[29],"we":[30,114,145,157,185],"assume":[31],"time-varying":[33],"MEC":[34,73],"server":[35,74],"computing":[36,41,75],"capacity":[37],"which":[38],"exploits":[39],"additional":[40],"resources":[42],"that":[43,187],"are":[44,49],"freed":[45],"over":[46],"time,":[47],"but":[48],"not":[50],"known":[51,206],"beforehand.":[52],"setting,":[55],"optimal":[57,196],"decision":[59,149],"depends":[60],"on":[61],"different":[63],"tasks":[64],"MUs,":[66],"their":[67],"channel":[68],"fading":[69],"processes":[70],"and":[71,83,100,177,201,204],"capacity.":[76],"We":[77],"first":[78],"formulate":[79],"optimization":[81],"problem":[82],"identify":[84],"two":[85],"main":[86],"challenges,":[87,113],"namely,":[88],"how":[89,101],"to":[90,96,102,133,192],"exploit":[91],"given":[93],"incomplete":[94],"knowledge":[95],"minimize":[97],"handle":[103,134,158],"high":[105],"dimensionality":[106],"problem.":[109],"To":[110],"address":[111],"these":[112],"propose":[115],"novel":[117],"reinforcement":[118],"learning":[119,125,170],"(RL)":[120],"algorithm,":[121],"termed":[122],"combinatorial":[123,136,165],"(COL).":[126],"name":[128],"stands":[129],"for":[130],"its":[131],"ability":[132],"nature":[137],"solutions.":[140],"Exploiting":[141],"available":[143],"knowledge,":[144],"learn":[146],"policy":[150],"delay.":[155],"Furthermore,":[156],"curse":[160],"dimensionality,":[162],"typical":[163],"problems,":[166],"by":[167],"splitting":[168],"task,":[171],"solving":[172],"K+1":[173],"smaller":[174],"RL":[175],"problems":[176],"using":[178],"linear":[179],"function":[180],"approximation.":[181],"Through":[182],"numerical":[183],"simulations,":[184],"show":[186],"COL":[188],"could":[189],"perform":[190],"similar":[191],"short":[194],"term":[195],"solution":[197],"complete":[199],"information":[200],"exhaustive":[202],"search,":[203],"outperforms":[205],"strategies":[207],"like":[208],"greedy":[210],"approach.":[211]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}
