In this paper, we study an age of information minimization problem in continuous-time and discrete-time status updating systems that involve multiple packet flows, multiple servers, and transmission errors. Four scheduling policies are proposed. We develop a unifying sample-path approach and use it to show that, when the packet generation and arrival times are synchronized across the flows, the proposed policies are (near) optimal for minimizing any time-dependent, symmetric, and non-decreasing penalty function of the ages of the flows over time in a stochastic ordering sense.

翻译：本文研究连续时间和离散时间状态更新系统中的信息年龄最小化问题，该系统涉及多数据包流、多服务器以及传输错误。我们提出了四种调度策略。通过开发统一的样本路径方法，我们证明：当数据包生成和到达时间在各流之间同步时，所提策略在随机序意义下能够（近似）最优地最小化各流年龄随时间变化的任意时间依赖、对称且非递减的惩罚函数。