When a Heavy Tailed Service Minimizes Age of Information
When a Heavy Tailed Service Minimizes Age of Information
复制标题
当重尾服务最小化信息时代时
DOI：
10.1109/isit.2019.8849697
复制
发表时间：
2019
期刊：
影响因子：
--
通讯作者：
E. Modiano
中科院分区：
文献类型：
--
作者：
Rajat Talak;S. Karaman;E. Modiano
信息年龄(AOI)是一种新提出的衡量信息新鲜度的性能指标。它与传统的延迟度量不同，因为它是以目的地为中心的，并且测量自最后一次接收的最新信息更新在源处生成以来所经过的时间。我们证明了在某些系统中AOI和分组时延有一个根本的不同，即最小化一个就意味着最大化另一个。我们考虑了两个排队系统，即具有抢占服务的单服务器后到先服务队列(LCFSP)和G/G/∞队列，并且证明了分别导致最坏情况下的分组时延或分组时延变化的重尾服务分布使AOI最小化。对于M/G/1LCFSp和G/G/∞排队的具体情况，我们还证明了分别最小化分组时延和分组时延方差的确定性服务会导致最坏的AOI。
Age-of-information (AoI) is a newly proposed performance metric of information freshness. It differs from the traditional delay metric, because it is destination centric and measures the time that elapsed since the last received fresh information update was generated at the source. We show that AoI and packet delay differ in a fundamental way in certain systems, i.e. minimizing one can imply maximizing the other.We consider two queueing systems, namely a single server last come first serve queue with preemptive service (LCFSp) and G/G/∞ queue, and show that a heavy tailed service distribution, that results in the worst case packet delay or variance in packet delay, respectively, minimizes AoI. For the specific case of M/G/1 LCFSp and G/G/∞ queue, we also prove that deterministic service, that minimizes packet delay and variance in packet delay, respectively, results in the worst case AoI.
影响因子：
2.5
作者：
R. Yates
通讯作者：
R. Yates