最优抢占:保障平均年龄及更广范围内的信息新鲜度
Optimal Preemption: Guaranteeing Information Freshness in Mean Age and Beyond
Aimin Li, Yiğit İnce, Elif Uysal
AI 速读 基于摘要
该论文提出允许发送方抢占正在服务的状态更新并重新采样的框架,在一般服务时间分布和显式动作成本下,证明有限平均延迟足以保证有限平均AoI,并研究VaR/CVaR优化及TAILOR算法。
cs.IT
查看原文摘要
Once a status update enters service, age-optimal policies must wait for it, even when heavy-tailed delays inflate the Age of Information (AoI). We develop a framework in which the sender may preempt the update in service and sample a fresh one, under general service-time distributions and explicit action costs. Our framework covers sources that generate updates at will as well as random update arrivals. Under nondecreasing age costs, we prove that, with preemption, a finite mean delay suffices for a finite average age even under infinite delay variance. We show the optimality of constant service-age thresholds from prior work for exponential service, and exhibit numerically that for general delays the optimal preemption rule depends on both the AoI and the elapsed service time. Under an action-cost budget, we further minimize the Value at Risk (VaR), which bounds the AoI except for a prescribed fraction of time, and the Conditional Value at Risk (CVaR), the mean AoI over that fraction. We reduce both to the same optimality equations without enlarging the state space. Under Pareto and log-normal delays, our algorithm TAILOR keeps the average cost bounded as delay variance grows, while optimal non-preemptive sampling diverges. With optimal preemption, a more variable network can allow fresher data than a steadier one of equal mean delay.