{"id":"https://openalex.org/W4387869699","doi":"https://doi.org/10.1109/icc45041.2023.10278692","title":"Optimistic Online Caching for Batched Requests","display_name":"Optimistic Online Caching for Batched Requests","publication_year":2023,"publication_date":"2023-05-28","ids":{"openalex":"https://openalex.org/W4387869699","doi":"https://doi.org/10.1109/icc45041.2023.10278692"},"language":"en","primary_location":{"id":"doi:10.1109/icc45041.2023.10278692","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/icc45041.2023.10278692","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICC 2023 - IEEE International Conference on Communications","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://inria.hal.science/hal-04367129/document","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5002267438","display_name":"Francescomaria Faticanti","orcid":"https://orcid.org/0000-0002-3075-313X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Francescomaria Faticanti","raw_affiliation_strings":["Inria, Universit&#x00E9; C&#x00F4;te d&#x0027;Azur","NEO - Network Engineering and Operations (2004 route des Lucioles BP 93 06902 Sophia Antipolis - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Inria, Universit&#x00E9; C&#x00F4;te d&#x0027;Azur","institution_ids":[]},{"raw_affiliation_string":"NEO - Network Engineering and Operations (2004 route des Lucioles BP 93 06902 Sophia Antipolis - France)","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085721523","display_name":"Giovanni Neglia","orcid":"https://orcid.org/0000-0001-8779-0620"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Giovanni Neglia","raw_affiliation_strings":["Inria, Universit&#x00E9; C&#x00F4;te d&#x0027;Azur","NEO - Network Engineering and Operations (2004 route des Lucioles BP 93 06902 Sophia Antipolis - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Inria, Universit&#x00E9; C&#x00F4;te d&#x0027;Azur","institution_ids":[]},{"raw_affiliation_string":"NEO - Network Engineering and Operations (2004 route des Lucioles BP 93 06902 Sophia Antipolis - France)","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0494,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.7382942,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"26","issue":null,"first_page":"6243","last_page":"6248"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":1.0,"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/T11478","display_name":"Caching and Content Delivery","score":1.0,"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/T12288","display_name":"Optimization and Search Problems","score":0.9987000226974487,"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/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9735000133514404,"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.8824324011802673},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.8418134450912476},{"id":"https://openalex.org/keywords/cache-algorithms","display_name":"Cache algorithms","score":0.6056265830993652},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.530056893825531},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.493294894695282},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.4848669469356537},{"id":"https://openalex.org/keywords/cpu-cache","display_name":"CPU cache","score":0.3884390592575073},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.34789228439331055},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2312324047088623}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8824324011802673},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.8418134450912476},{"id":"https://openalex.org/C38556500","wikidata":"https://www.wikidata.org/wiki/Q13404475","display_name":"Cache algorithms","level":4,"score":0.6056265830993652},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.530056893825531},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.493294894695282},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.4848669469356537},{"id":"https://openalex.org/C189783530","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"CPU cache","level":3,"score":0.3884390592575073},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.34789228439331055},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2312324047088623},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icc45041.2023.10278692","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/icc45041.2023.10278692","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICC 2023 - IEEE International Conference on Communications","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-04367129v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-04367129","pdf_url":"https://inria.hal.science/hal-04367129/document","source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://ieeexplore.ieee.org/xpl/conhome/10278505/proceeding","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-04367129v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-04367129","pdf_url":"https://inria.hal.science/hal-04367129/document","source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://ieeexplore.ieee.org/xpl/conhome/10278505/proceeding","raw_type":"info:eu-repo/semantics/conferenceObject"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2113015678","display_name":"3IA C\u00f4te d'Azur","funder_award_id":"ANR-19-P3IA-0002","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320313934","display_name":"Institut national de recherche en informatique et en automatique (INRIA)","ror":"https://ror.org/02kvxyf05"},{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4387869699.pdf","grobid_xml":"https://content.openalex.org/works/W4387869699.grobid-xml"},"referenced_works_count":25,"referenced_works":["https://openalex.org/W1988834815","https://openalex.org/W2055639053","https://openalex.org/W2093825590","https://openalex.org/W2130356538","https://openalex.org/W2143343660","https://openalex.org/W2148825261","https://openalex.org/W2345784579","https://openalex.org/W2352999452","https://openalex.org/W2404272329","https://openalex.org/W2919316173","https://openalex.org/W2947759080","https://openalex.org/W2964323557","https://openalex.org/W2996103499","https://openalex.org/W3013381883","https://openalex.org/W3034766183","https://openalex.org/W3099257256","https://openalex.org/W3188959416","https://openalex.org/W4205841652","https://openalex.org/W4281691422","https://openalex.org/W4286571690","https://openalex.org/W4292022450","https://openalex.org/W6681110014","https://openalex.org/W6681723013","https://openalex.org/W6694693775","https://openalex.org/W6705697407"],"related_works":["https://openalex.org/W2147122795","https://openalex.org/W2061075966","https://openalex.org/W3147501184","https://openalex.org/W2167303720","https://openalex.org/W2109715593","https://openalex.org/W3161817247","https://openalex.org/W1918294866","https://openalex.org/W2012518269","https://openalex.org/W2068309140","https://openalex.org/W57688818"],"abstract_inverted_index":{"In":[0,57],"this":[1,58],"paper":[2],"we":[3,60],"study":[4],"online":[5,23],"caching":[6,105],"problems":[7],"where":[8],"predictions":[9],"of":[10,46,64],"future":[11],"requests,":[12],"e.g.,":[13],"provided":[14],"by":[15],"a":[16,53,70],"machine":[17],"learning":[18],"model,":[19],"are":[20,26],"available.":[21],"Typical":[22],"optimistic":[24,67,100],"policies":[25,68,106],"based":[27],"on":[28,108],"the":[29,47,62,75,85],"Follow-The-Regularized-Leader":[30],"algorithm":[31],"and":[32,110],"have":[33],"higher":[34],"computational":[35],"cost":[36,87],"than":[37],"classic":[38],"ones":[39],"like":[40],"LFU,":[41],"LRU,":[42],"as":[43],"each":[44],"update":[45,86],"cache":[48,76],"state":[49],"requires":[50],"to":[51,83],"solve":[52],"constrained":[54],"optimization":[55],"problem.":[56],"work":[59],"analysed":[61],"behaviour":[63],"two":[65],"different":[66],"in":[69,81],"batched":[71,101],"case,":[72],"i.e.,":[73],"when":[74],"is":[77],"updated":[78],"less":[79],"frequently":[80],"order":[82],"amortize":[84],"over":[88,91],"time":[89],"or":[90],"multiple":[92],"requests.":[93],"Experimental":[94],"results":[95],"show":[96],"that":[97],"such":[98],"an":[99],"approach":[102],"outperforms":[103],"classical":[104],"both":[107],"stationary":[109],"real":[111],"traces.":[112]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":2}],"updated_date":"2026-08-11T07:18:39.950985","created_date":"2025-10-10T00:00:00"}
