no code implementations • 22 Apr 2024 • Vishakha Ramani, Ivan Seskar, Roy D. Yates
This paper investigates the optimization of memory sampling in status updating systems, where source updates are published in shared memory, and reader process samples the memory for source updates by paying a sampling cost.
no code implementations • 31 May 2022 • Nitya Sathyavageesran, Roy D. Yates, Anand D. Sarwate, Narayan Mandayam
We analyze the trade-off between the age of information (AoI) and the maximal leakage for systems in which the source generates updates as a Bernoulli process.
no code implementations • 9 Oct 2020 • Haoyue Tang, Philippe Ciblat, Jintao Wang, Michele Wigger, Roy D. Yates
Inspired by this solution for the relaxed problem, we propose a practical cache updating strategy that meets all the constraints of the original problem.
Information Theory Information Theory
