Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2601.14075 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908974714978304 |
|---|---|
| author | Liyanaarachchi, Sahan Ulukus, Sennur Akar, Nail |
| author_facet | Liyanaarachchi, Sahan Ulukus, Sennur Akar, Nail |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_14075 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Utilizing the Perceived Age to Maximize Freshness in Query-Based Update Systems Liyanaarachchi, Sahan Ulukus, Sennur Akar, Nail Information Theory Systems and Control 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. |
| title | Utilizing the Perceived Age to Maximize Freshness in Query-Based Update Systems |
| topic | Information Theory Systems and Control |
| url | https://arxiv.org/abs/2601.14075 |