Water-filling-based scheduling for weighted binary freshness in cache update systems

Simple item page
buir.contributor.authorGamgam, Ege Orkun
buir.contributor.authorAkar, Nail
buir.contributor.orcidGamgam, Ege Orkun|0000-0001-8770-7524
buir.contributor.orcidAkar, Nail|0000-0001-8143-1379
dc.citation.epage8972en_US
dc.citation.issueNumber5
dc.citation.spage8961
dc.citation.volumeNumber11
dc.contributor.authorGamgam, Ege Orkun
dc.contributor.authorAkar, Nail
dc.date.accessioned2024-03-12T11:46:46Z
dc.date.available2024-03-12T11:46:46Z
dc.date.issued2023-10-09
dc.departmentDepartment of Electrical and Electronics Engineering
dc.description.abstractWe consider a cache update system with a remote server delivering time-varying contents of multiple Internet of Things (IoT) items with heterogeneous popularities and service times to a local cache so as to keep the items as fresh as possible at the cache. New content for an item arrives at the server according to a Poisson process and the server is equipped with multiple queues each of which holds the most up-to-date content for the corresponding item. In this setting, we study several scheduling policies employed at the server so as to maximize the popularity-weighted binary freshness across the items. The scheduling problem is first formulated as an infinite-horizon average-reward Markov decision process (MDP) which suffers from the curse of dimensionality when the number of items is large. We then propose a water-filling-based scheduling (WFS) policy and its extension, namely, extended WFS (E-WFS) policy, with worst case complexities being quadratic and cubic in the number of items, respectively, based on convex optimization applied to a relaxation of the original system. Simulation results are provided to validate the effectiveness of the proposed policies.
dc.description.provenanceMade available in DSpace on 2024-03-12T11:46:46Z (GMT). No. of bitstreams: 1 Water-Filling-Based_Scheduling_for_Weighted_Binary_Freshness_in_Cache_Update_Systems.pdf: 1026340 bytes, checksum: 2fb189ed12bc59df27c0ebe9d8bd5e07 (MD5) Previous issue date: 2023-10-09en
dc.identifier.doi10.1109/JIOT.2023.3322360
dc.identifier.issn2327-4662
dc.identifier.urihttps://hdl.handle.net/11693/114596
dc.language.isoen
dc.publisherInstitute of Electrical and Electronics Engineers
dc.relation.isversionofhttps://dx.doi.org/10.1109/JIOT.2023.3322360
dc.rightsCC BY
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/
dc.source.titleIEEE Internet of Things Journal
dc.subjectBinary freshness
dc.subjectCache update system
dc.subjectMarkov decision processes (MDPs)
dc.subjectScheduling; water-filling
dc.titleWater-filling-based scheduling for weighted binary freshness in cache update systems
dc.typeArticle

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Water-Filling-Based_Scheduling_for_Weighted_Binary_Freshness_in_Cache_Update_Systems.pdf
Size:
1002.29 KB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
2.01 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Scholarly Publications - Electrical and Electronics Engineering