跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv: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
arXiv ↗PDF ↗

摘要

We study a time-slotted generate-at-will status-update system over an erasure channel with transmission success probability qq, subject to average sampling- and transmission-rate constraints fsf_s and frf_r, 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 44-approximation guarantee. The joint problem reduces to the sampling-constrained problem when fs≤qfrf_s\leq qf_r and the transmission-constrained problem when fs≥frf_s\geq f_r. For qfr<fs<frqf_r<f_s<f_r, we formulate a constrained Markov decision process (CMDP) and introduce the class Πˉ\barΠ of (W,R)(W,R) policies, where WW specifies a waiting threshold for transmission and RR 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 Πˉ\barΠ. We then formulate a linear program (LP) over distributions of (W,R)(W,R) 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 (W,R)(W,R) policies. Since Πˉ\barΠ is countably infinite, for every ε>0ε>0 we construct a finite subset Πˉε⊂Πˉ\barΠ_ε\subset\barΠ 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 (W,R)(W,R) policies with a 22-approximation guarantee for qfr<fs<frqf_r<f_s<f_r.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 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 qq, subject to average sampling- and transmission-rate constraints fsf_s and frf_r, 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 44-approximation guarantee. The joint problem reduces to the sampling-constrained problem when fs≤qfrf_s\leq qf_r and the transmission-constrained problem when fs≥frf_s\geq f_r. For qfr<fs<frqf_r<f_s<f_r, we formulate a constrained Markov decision process (CMDP) and introduce the class Πˉ\barΠ of (W,R)(W,R) policies, where WW specifies a waiting threshold for transmission and RR 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 Πˉ\barΠ. We then formulate a linear program (LP) over distributions of (W,R)(W,R) 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 (W,R)(W,R) policies. Since Πˉ\barΠ is countably infinite, for every ε>0ε>0 we construct a finite subset Πˉε⊂Πˉ\barΠ_ε\subset\barΠ 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 (W,R)(W,R) policies with a 22-approximation guarantee for qfr<fs<frqf_r<f_s<f_r.

查看此版本解读 →查看此版本原文 ↗