Utilizing the Perceived Age to Maximize Freshness in Query-Based Update Systems
For system designers of pull-based update systems, this work provides optimal sampling policies under more realistic delay distributions, improving freshness.
This paper relaxes assumptions of exponential query delay and instantaneous feedback in query-based sampling for monitoring Markov sources, and shows that a waiting-based strategy yields significant gains in mean binary freshness.
Query-based sampling has become an increasingly popular technique for monitoring Markov sources in pull-based update systems. However, most of the contemporary literature on this assumes an exponential distribution for query delay and often relies on the assumption that the feedback or replies to the queries are instantaneous. In this work, we relax both of these assumptions and find optimal sampling policies for monitoring continuous-time Markov chains (CTMC) under generic delay distributions. In particular, we show that one can obtain significant gains in terms of mean binary freshness (MBF) by employing a waiting based strategy for query-based sampling.