Age of information (AoI) is an effective performance metric measuring the freshness of information and is popular for applications involving status update. Most of the existing works have adopted average AoI as the metric, which cannot provide strict performance guarantees. In this work, the outage probability of the peak AoI exceeding a given threshold is analyzed in a multi-source system under round robin scheduling. Two queueing disciplines are considered, namely the first-come-first-serve (FCFS) queue and the single packet queue. For FCFS, upper and lower bounds on the outage probability are derived which coincides asymptotically, characterizing its true scaling. For the single packet queue, an upper bound is derived whose effectiveness is validated by the simulation results. The analysis concretizes the common belief that single packet queueing has a better AoI performance than FCFS. Moreover, it also reveals that the two disciplines would have similar asymptotic performance when the inter-arrival time is much larger than the total transmission time.
翻译:信息年龄( AoI) 是衡量信息新鲜度的有效性能衡量标准, 并且对涉及状态更新的应用程序很受欢迎。 大多数现有作品都采用平均 AoI作为衡量标准, 无法提供严格的绩效保障。 在这项工作中, 在一个多源系统中, 以轮轮轮轮盘列表方式分析峰值超过给定阈值的可能性。 考虑了两个排队学科, 即先到先得的队列和单包队列。 对于 FCFS 来说, 外出概率的上限和下限是随机得出的, 其特征是真实的缩放。 对于单组合队列, 其有效性由模拟结果验证。 分析将单列队列比 FCFS 效果更好的共同信念具体化了。 此外, 它还表明, 当阵列时间比总传输时间大得多时, 这两种学科的性能也相似。