← 研踪 PaperTrailarXiv:2611.21547 · v1
Fundamental Tradeoffs in Sampling, Transmission and Information Freshness: Instantaneous Feedback
首次提交 2026-11-17 02:31
版本更新 2026-11-17 02:31
雷达观测 2026-11-17 16:10
摘要
We study a time-slotted generate-at-will status-update system over an erasure channel with transmission success probability , subject to average sampling- and transmission-rate constraints and , respectively. The sampler-transmitter pair jointly decides whether to idle, retransmit a stale packet, or replace it with a fresh sample. We derive a universal lower bound on the optimal average age of information, analyze a class of stationary randomized policies, and obtain an optimal policy within this class that provides a -approximation guarantee. The joint problem reduces to the sampling-constrained problem when and the transmission-constrained problem when . For , we formulate a constrained Markov decision process (CMDP) and introduce the class of policies, where specifies a waiting threshold for transmission and specifies a packet-replacement threshold. We prove that, for every choice of Lagrange multipliers, the corresponding Lagrangian-relaxed Markov decision process admits an optimal policy in . We then formulate a linear program (LP) over distributions of policies and prove that choosing a policy according to an optimal LP solution yields an optimal CMDP policy. Moreover, there exists an optimal LP solution assigning positive probability to at most three policies. Since is countably infinite, for every we construct a finite subset and show that the LP restricted to this set yields an -optimal policy. Finally, we derive a stronger pair of lower bounds by considering systems with only the sampling-rate or transmission-rate constraint. Using these bounds, we construct a policy randomizing among four policies with a -approximation guarantee for .
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v1 · 2026-11-17 02:31 · 最新观测版本
Fundamental Tradeoffs in Sampling, Transmission and Information Freshness: Instantaneous Feedback
We study a time-slotted generate-at-will status-update system over an erasure channel with transmission success probability , subject to average sampling- and transmission-rate constraints and , respectively. The sampler-transmitter pair jointly decides whether to idle, retransmit a stale packet, or replace it with a fresh sample. We derive a universal lower bound on the optimal average age of information, analyze a class of stationary randomized policies, and obtain an optimal policy within this class that provides a -approximation guarantee. The joint problem reduces to the sampling-constrained problem when and the transmission-constrained problem when . For , we formulate a constrained Markov decision process (CMDP) and introduce the class of policies, where specifies a waiting threshold for transmission and specifies a packet-replacement threshold. We prove that, for every choice of Lagrange multipliers, the corresponding Lagrangian-relaxed Markov decision process admits an optimal policy in . We then formulate a linear program (LP) over distributions of policies and prove that choosing a policy according to an optimal LP solution yields an optimal CMDP policy. Moreover, there exists an optimal LP solution assigning positive probability to at most three policies. Since is countably infinite, for every we construct a finite subset and show that the LP restricted to this set yields an -optimal policy. Finally, we derive a stronger pair of lower bounds by considering systems with only the sampling-rate or transmission-rate constraint. Using these bounds, we construct a policy randomizing among four policies with a -approximation guarantee for .
查看此版本解读 →查看此版本原文 ↗