论文标题
在多源M/g/1/1排队系统中，信息年龄的瞬间生成函数
Moment Generating Function of Age of Information in Multi-Source M/G/1/1 Queueing Systems
论文作者
论文摘要
我们考虑一个多源状态更新系统，每个源将根据泊松过程生成状态更新数据包，然后根据普遍分布的服务时间进行服务。对于此多源M/G/1/1排队模型，我们引入了源吸引的先发制数据包管理策略，并得出每个源的信息时代（AOI）和峰值AOI的生成力矩生成功能（MGFS）。根据该政策，到达的新数据包可以抢占系统中同一源的可能数据包。此外，我们为源侵犯和非抢先的政策得出了AOI和峰值AOI的MGF，只有平均AOI和峰值AOI才较早得出。最后，我们使用MGF在每个策略下以两源M/g/1/1排队模型来得出平均AOI和峰值AOI。数值结果表明，服务时间分布参数对平均AOI的影响：对于给定的服务率，当服务时间分配的尾巴足够沉重时，源侵犯的先发制性策略是最佳政策，而对于充分轻轻的尾巴分布，非优先权政策是最好的政策。结果还突出了AOI较高时刻的重要性。
We consider a multi-source status update system, where each source generates status update packets according to a Poisson process which are then served according to a generally distributed service time. For this multi-source M/G/1/1 queueing model, we introduce a source-aware preemptive packet management policy and derive the moment generating functions (MGFs) of the age of information (AoI) and peak AoI of each source. According to the policy, an arriving fresh packet preempts the possible packet of the same source in the system. Furthermore, we derive the MGFs of the AoI and peak AoI for the source-agnostic preemptive and non-preemptive policy, for which only the average AoI and peak AoI have been derived earlier. Finally, we use the MGFs to derive the average AoI and peak AoI in a two-source M/G/1/1 queueing model under each policy. Numerical results show the effect of the service time distribution parameters on the average AoI: for a given service rate, when the tail of the service time distribution is sufficiently heavy, the source-agnostic preemptive policy is the best policy, whereas for a sufficiently light tailed distribution, the non-preemptive policy is the best policy. The results also highlight the importance of higher moments of the AoI.
