Age-Based Cache Updating Under Timestomping
Subhankar Banerjee, Priyanka Kaswan, Sennur Ulukus

TL;DR
This paper studies age-based cache updating in a communication system with an adversary manipulating timestamps, proposing algorithms to minimize user age despite adversarial timestomping.
Contribution
It introduces a new online learning framework for age minimization under adversarial timestomping and provides a deterministic algorithm with proven competitive ratio.
Findings
Established a lower bound on the competitive ratio for the problem.
Proposed a deterministic algorithm with guaranteed performance.
Analyzed the impact of adversarial timestomping on age of information.
Abstract
We consider a slotted communication system consisting of a source, a cache, a user and a timestomping adversary. The time horizon consists of total time slots, such that the source transmits update packets to the user directly over time slots and to the cache over time slots. We consider , , such that the source transmits to the user once between two consecutive cache updates. Update packets are marked with timestamps corresponding to their generation times at the source. All nodes have a buffer size of one and store the packet with the latest timestamp to minimize their age of information. In this setting, we consider the presence of an oblivious adversary that fully controls the communication link between the cache and the user. The adversary manipulates the timestamps of outgoing packets from the cache to the user, with the goal of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAge of Information Optimization · Cognitive Functions and Memory · Dementia and Cognitive Impairment Research
