论文标题
带有数据包错误的多源先发制人M/pH/1/1队列:信息时代的精确分布及其峰值
The Multi-Source Preemptive M/PH/1/1 Queue with Packet Errors: Exact Distribution of the Age of Information and Its Peak
论文作者
论文摘要
信息年龄(AOI)和峰值AOI(PAOI)及其分析模型最近在信息理论和无线通信学科中引起了大量关注,在定性评估状态更新系统中信息新鲜度的背景下。我们采用排队理论方法,并研究一种概率的先发制人的$ m/pH/1/1 $排队系统,其到达系统来自$ n $单独的信息源,目的是建模通用状态更新系统。在此型号中,允许从源$ m $到达的新信息包到达,以从源$ n $的服务中抢占数据包,其概率取决于$ n $和$ m $。为了使模型比现有的模型更一般,对于每个信息源,我们假设pH型服务时间分布和不同的数据包误差概率。随后,我们使用矩阵分析算法,尤其是马尔可夫流体队列和示例路径参数的理论,以获取每个信息源的AOI和PAOI的精确分布。这与依靠随机混合系统(SHS)的现有方法形成鲜明对比,后者仅获得平均值和不太一般的设置。提供了数值示例,以验证提出的方法,并提供工程学的洞察力,了解先发制概率对某些AOI和PAOI性能的影响。
Age of Information (AoI) and Peak AoI (PAoI) and their analytical models have recently drawn substantial amount of attention in information theory and wireless communications disciplines, in the context of qualitative assessment of information freshness in status update systems. We take a queueing-theoretic approach and study a probabilistically preemptive bufferless $M/PH/1/1$ queueing system with arrivals stemming from $N$ separate information sources, with the aim of modeling a generic status update system. In this model, a new information packet arrival from source $m$ is allowed to preempt a packet from source $n$ in service, with a probability depending on $n$ and $m$. To make the model even more general than the existing ones, for each of the information sources, we assume a distinct PH-type service time distribution and a distinct packet error probability. Subsequently, we obtain the exact distributions of the AoI and PAoI for each of the information sources using matrix-analytical algorithms and in particular the theory of Markov fluid queues and sample path arguments. This is in contrast with existing methods that rely on Stochastic Hybrid Systems (SHS) which obtain only the average values and in less general settings. Numerical examples are provided to validate the proposed approach as well as to give engineering insight on the impact of preemption probabilities on certain AoI and PAoI performance figures.