{"id":"https://openalex.org/W2918263392","doi":"https://doi.org/10.1109/infocom.2019.8737606","title":"No Regret in Cloud Resources Reservation with Violation Guarantees","display_name":"No Regret in Cloud Resources Reservation with Violation Guarantees","publication_year":2019,"publication_date":"2019-04-01","ids":{"openalex":"https://openalex.org/W2918263392","doi":"https://doi.org/10.1109/infocom.2019.8737606","mag":"2918263392"},"language":"en","primary_location":{"id":"doi:10.1109/infocom.2019.8737606","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom.2019.8737606","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/A5062148267","display_name":"Nikolaos Liakopoulos","orcid":"https://orcid.org/0000-0002-9339-8921"},"institutions":[{"id":"https://openalex.org/I1902872","display_name":"EURECOM","ror":"https://ror.org/00sse7z02","country_code":"FR","type":"education","lineage":["https://openalex.org/I1902872","https://openalex.org/I205703379"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Nikolaos Liakopoulos","raw_affiliation_strings":["EURECOM, Sophia-Antipolis France"],"affiliations":[{"raw_affiliation_string":"EURECOM, Sophia-Antipolis France","institution_ids":["https://openalex.org/I1902872"]}]},{"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 Paschos","raw_affiliation_strings":["Mathematical and Algorithmic Sciences Lab, FRC, Huawei Technologies SASU"],"affiliations":[{"raw_affiliation_string":"Mathematical and Algorithmic Sciences Lab, FRC, Huawei Technologies SASU","institution_ids":["https://openalex.org/I4210123571"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056364055","display_name":"Thrasyvoulos Spyropoulos","orcid":null},"institutions":[{"id":"https://openalex.org/I1902872","display_name":"EURECOM","ror":"https://ror.org/00sse7z02","country_code":"FR","type":"education","lineage":["https://openalex.org/I1902872","https://openalex.org/I205703379"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Thrasyvoulos Spyropoulos","raw_affiliation_strings":["EURECOM, Sophia-Antipolis France"],"affiliations":[{"raw_affiliation_string":"EURECOM, Sophia-Antipolis France","institution_ids":["https://openalex.org/I1902872"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5062148267"],"corresponding_institution_ids":["https://openalex.org/I1902872"],"apc_list":null,"apc_paid":null,"fwci":2.0621,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.87247851,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1747","last_page":"1755"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9986000061035156,"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.9986000061035156,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9972000122070312,"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/regret","display_name":"Regret","score":0.7945601940155029},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7200503945350647},{"id":"https://openalex.org/keywords/reservation","display_name":"Reservation","score":0.6433682441711426},{"id":"https://openalex.org/keywords/workload","display_name":"Workload","score":0.5875290036201477},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.504871666431427},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.49883556365966797},{"id":"https://openalex.org/keywords/cloud-computing","display_name":"Cloud computing","score":0.4896238446235657},{"id":"https://openalex.org/keywords/provisioning","display_name":"Provisioning","score":0.4155520796775818},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.38523146510124207},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.34807103872299194},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.15792322158813477},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.13910040259361267},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.13032782077789307},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1270507276058197}],"concepts":[{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.7945601940155029},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7200503945350647},{"id":"https://openalex.org/C2777632111","wikidata":"https://www.wikidata.org/wiki/Q1937518","display_name":"Reservation","level":2,"score":0.6433682441711426},{"id":"https://openalex.org/C2778476105","wikidata":"https://www.wikidata.org/wiki/Q628539","display_name":"Workload","level":2,"score":0.5875290036201477},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.504871666431427},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49883556365966797},{"id":"https://openalex.org/C79974875","wikidata":"https://www.wikidata.org/wiki/Q483639","display_name":"Cloud computing","level":2,"score":0.4896238446235657},{"id":"https://openalex.org/C172191483","wikidata":"https://www.wikidata.org/wiki/Q1071806","display_name":"Provisioning","level":2,"score":0.4155520796775818},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.38523146510124207},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.34807103872299194},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.15792322158813477},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.13910040259361267},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.13032782077789307},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1270507276058197},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/infocom.2019.8737606","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom.2019.8737606","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"},{"id":"pmh:oai:fr.eurecom:5828","is_oa":false,"landing_page_url":"http://www.eurecom.fr/publication/5828","pdf_url":null,"source":{"id":"https://openalex.org/S4377196942","display_name":"Graduate School and Research Center in Digital Science (EURECOM)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1902872","host_organization_name":"EURECOM","host_organization_lineage":["https://openalex.org/I1902872"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"INFOCOM 2019, IEEE International Conference on Computer Communications, 29 April-2 May 2019, Paris, France","raw_type":"Conference"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1520045492","https://openalex.org/W2072362295","https://openalex.org/W2077723394","https://openalex.org/W2095762034","https://openalex.org/W2122299160","https://openalex.org/W2129542763","https://openalex.org/W2137152139","https://openalex.org/W2138993731","https://openalex.org/W2148825261","https://openalex.org/W2157672420","https://openalex.org/W2592542720","https://openalex.org/W2798019336","https://openalex.org/W2913535645","https://openalex.org/W2963070834","https://openalex.org/W4244393449","https://openalex.org/W4297972233","https://openalex.org/W6631271631","https://openalex.org/W6674228005","https://openalex.org/W6681723013","https://openalex.org/W6687723142","https://openalex.org/W6734292001"],"related_works":["https://openalex.org/W2971351794","https://openalex.org/W4376155396","https://openalex.org/W1947085858","https://openalex.org/W2101991911","https://openalex.org/W2174986909","https://openalex.org/W2527791220","https://openalex.org/W2155070487","https://openalex.org/W4311589891","https://openalex.org/W3123835761","https://openalex.org/W118270247"],"abstract_inverted_index":{"This":[0,135],"paper":[1],"addresses":[2],"a":[3,47,79,93,106,115,142,147,186],"fundamental":[4],"challenge":[5],"in":[6,40,55,127,162],"cloud":[7],"computing,":[8],"that":[9,51,83,97],"of":[10,81,108,118],"learning":[11,128],"an":[12,68],"economical":[13],"yet":[14],"robust":[15],"reservation,":[16],"i.e.":[17],"reserve":[18],"just":[19],"enough":[20],"resources":[21],"to":[22,36,64,72,85,92,138,152,185],"avoid":[23],"both":[24,159],"violations":[25],"and":[26,42,76,114,129,155,164,177],"expensive":[27],"over":[28,168],"provisioning.":[29],"Prediction":[30],"tools":[31],"are":[32],"often":[33],"inadequate":[34],"due":[35],"observed":[37],"high":[38],"variability":[39],"CPU":[41],"memory":[43],"workload.":[44],"We":[45],"propose":[46,105],"novel":[48],"model-free":[49],"approach":[50],"has":[52,173],"its":[53],"root":[54],"online":[56,130],"learning.":[57],"Specifically,":[58],"we":[59,77,104],"allow":[60],"the":[61,99,109,119,123,153,169,180],"workload":[62,100],"profile":[63],"be":[65],"engineered":[66],"by":[67],"adversary":[69],"who":[70],"aims":[71],"harm":[73],"our":[74],"decisions,":[75],"investigate":[78],"class":[80],"policies":[82],"aim":[84],"minimize":[86],"regret":[87,144,176],"(minimize":[88],"losses":[89],"with":[90,141],"respect":[91],"baseline":[94],"static":[95],"policy":[96,148,172],"knows":[98],"sample":[101],"path).":[102],"Then":[103],"combination":[107],"Lyapunov":[110],"optimization":[111,131],"theory":[112],"[1]":[113],"linear":[116],"prediction":[117],"future":[120],"based":[121],"on":[122],"recent":[124],"past,":[125],"used":[126],"problems,":[132],"see":[133],"[2].":[134],"enables":[136],"us":[137],"come":[139],"up":[140],"no":[143],"policy,":[145],"i.e.,":[146],"whose":[149],"cost":[150,182],"difference":[151],"benchmark":[154],"violation":[156],"constraint":[157,188],"residual":[158],"grow":[160],"sublinearly":[161],"time,":[163],"hence":[165],"become":[166],"amortized":[167],"horizon.":[170],"Our":[171],"then":[174],"\u201cno":[175],"eventually":[178],"learns":[179],"minimum":[181],"reservation":[183],"subject":[184],"time-average":[187],"for":[189],"violations.":[190]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}