论文标题
3竞争性政策，以最大程度地减少多源M/g/1排队模型的信息年龄
3-Competitive Policy for Minimizing Age of Information in Multi-Source M/G/1 Queuing Model
论文作者
论文摘要
我们考虑了一个具有通用监视器的多源网络，该网络在泊松过程之后在每个来源生成新的更新。在任何时候，最多有一个来源可以将其更新传输到监视器，并且每个源更新的传输时间遵循一般分布。目的是找到一项因果计划策略，以便任何时候，每个来源可用的最新更新是新鲜的。在本文中，我们使用信息时代（AOI）度量来量化新鲜度，并提出了一项随机策略，我们表明，相对于帕累托（Pareto）最佳策略，该策略具有3竞争力（可以最大程度地减少每个来源的预期平均AOI）。我们还表明，对于随机参数的特定选择，相对于最佳策略，提出的随机策略是3竞争性的，该策略将所有来源的预期平均AOI的加权总和最小化。
We consider a multi-source network with a common monitor, where fresh updates are generated at each source, following a Poisson process. At any time, at most one source can transmit its update to the monitor, and transmission time for updates of each source follows some general distribution. The goal is to find a causal scheduling policy such that at any time, the latest update available at each source is fresh. In this paper, we quantify freshness using the age of information (AoI) metric, and propose a randomized policy, which we show is 3-competitive with respect to Pareto-optimal policies (that minimize the expected average AoI of each source). We also show that for a particular choice of the randomization parameter, the proposed randomized policy is 3-competitive with respect to an optimal policy that minimizes the weighted sum of the expected average AoI of all sources.
