论文标题
棕榈计算方法分布信息时代
A Palm Calculus Approach to the Distribution of the Age of Information
论文作者
论文摘要
表达对延迟敏感网络系统中状态更新的及时性的关键指标是信息时代（AOI），即是自上次收到的信息状态消息以来所经过的时间。该指标允许研究许多应用程序，包括网络物理系统和车辆网络中的感觉和控制信息的更新，以及云簇中的工作和资源分配。分析AOI的最先进方法依赖于由一个或多个带有服务顺序的排队系统组成的排队模型，例如FIFO，LIFO或最后一生的第一个订单。在这些分析方法中产生的一个主要困难是在交付是非抢先和非fifo时捕获在消息重新排序的AOI，即当消息可以互相超越并且接收信息性消息的接收可能会淘汰一些正在进行的消息。在本文中，我们得出了一个精确的公式，用于在非抢先的非fifo系统中分布AOI，其中我们分析的主要成分是棕榈计算和时间反演。由于在我们的方法中使用的拉普拉斯 - 斯蒂尔杰斯变换的合理性，我们获得了可计算的精确表达式，以分布AOI。
A key metric to express the timeliness of status updates in latency-sensitive networked systems is the age of information (AoI), i.e., the time elapsed since the generation of the last received informative status message. This metric allows studying a number of applications including updates of sensory and control information in cyber-physical systems and vehicular networks as well as, job and resource allocation in cloud clusters. State-of-the-art approaches to analyzing the AoI rely on queueing models that are composed of one or many queuing systems endowed with service order, e.g., FIFO, LIFO, or last-generated-first-out order. A major difficulty arising in these analysis methods is capturing the AoI under message reordering when the delivery is non-preemptive and non-FIFO, i.e., when messages can overtake each other and the reception of informative messages may obsolete some messages that are underway. In this paper, we derive an exact formulation for the distribution of AoI in non-preemptive, non-FIFO systems where the main ingredients of our analysis are Palm calculus and time inversion. Owing to the rationality of the Laplace-Stieltjes transforms that are used in our approach, we obtain computable exact expressions for the distribution of AoI.
