Age Analysis of Status Updating System with Probabilistic Packet Preemption

被引:5
|
作者
Zhang, Jixiang [1 ]
Xu, Yinfei [1 ]
机构
[1] Southeast Univ, Sch Informat Sci & Engn, Nanjing 210096, Peoples R China
基金
中国国家自然科学基金;
关键词
age of information; discrete time status updating system; probabilistic preemption; probability generation function; stationary distribution; STATISTICAL GUARANTEE OPTIMIZATION; OPTIMIZING INFORMATION FRESHNESS; STATIONARY DISTRIBUTION; MINIMIZING AGE; NETWORKS; QUEUE; AOI;
D O I
10.3390/e24060785
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
The age of information (AoI) metric was proposed to measure the freshness of messages obtained at the terminal node of a status updating system. In this paper, the AoI of a discrete time status updating system with probabilistic packet preemption is investigated by analyzing the steady state of a three-dimensional discrete stochastic process. We assume that the queue used in the system is Ber/Geo/1/2*/eta, which represents that the system size is 2 and the packet in the buffer can be preempted by a fresher packet with probability eta. Instead of considering the system's AoI separately, we use a three-dimensional state vector (n, m, l) to simultaneously track the real-time changes of the AoI, the age of a packet in the server, and the age of a packet waiting in the buffer. We give the explicit expression of the system's average AoI and show that the average AoI of the system without packet preemption is obtained by letting eta = 0. When eta is set to 1, the mean of the AoI of the system with a Ben/Geo/1/2* queue is obtained as well. Combining the results we have obtained and comparing them with corresponding average continuous AoIs, we propose a possible relationship between the average discrete AoI with the Ber/Geo/1/c queue and the average continuous AoI with the M/M/1/c queue. For each of two extreme cases where eta = 0 and eta = 1, we also determine the stationary distribution of AoI using the probability generation function (PGF) method. The relations between the average AoI and the packet preemption probability eta, as well as the AoI's distribution curves in two extreme cases, are illustrated by numerical simulations. Notice that the probabilistic packet preemption may occur, for example, in an energy harvest (EH) node of a wireless sensor network, where the packet in the buffer can be replaced only when the node collects enough energy. In particular, to exhibit the usefulness of our idea and methods and highlight the merits of considering discrete time systems, in this paper, we provide detailed discussions showing how the results about continuous AoI are derived by analyzing the corresponding discrete time system and how the discrete age analysis is generalized to the system with multiple sources. In terms of packet service process, we also propose an idea to analyze the AoI of a system when the service time distribution is arbitrary.
引用
收藏
页数:36
相关论文
共 50 条
  • [1] Dynamic probabilistic packet marking with partial non-preemption
    Yen, Wei
    Sung, Jeng-Shian
    [J]. UBIQUITOUS INTELLIGENCE AND COMPUTING, PROCEEDINGS, 2008, 5061 : 732 - 745
  • [2] Analysis and Implementation of Packet Preemption for Time Sensitive Networks
    Zhou, Zifan
    Yan, Ying
    Ruepp, Sarah
    Berger, Michael
    [J]. 2017 IEEE 18TH INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE SWITCHING AND ROUTING (IEEE HPSR), 2017,
  • [3] Game Theoretic Analysis of an Adversarial Status Updating System
    Banerjee, Subhankar
    Ulukus, Sennur
    [J]. IEEE International Symposium on Information Theory - Proceedings, 2022, 2022-June : 2070 - 2075
  • [4] On Age of Information for Discrete Time Status Updating System With Infinite Size
    Zhang, Jixiang
    Xu, Yinfei
    [J]. 2022 IEEE INFORMATION THEORY WORKSHOP (ITW), 2022, : 392 - 397
  • [5] PROBABILISTIC CONSOLIDATION ANALYSIS WITH MODEL UPDATING
    RONOLD, KO
    [J]. JOURNAL OF GEOTECHNICAL ENGINEERING-ASCE, 1989, 115 (02): : 199 - 210
  • [6] Analysis of adjusted probabilistic packet marking
    Rizvi, B
    Fernandez-Gaucherand, E
    [J]. PROCEEDINGS OF THE 3RD IEEE WORKSHOP ON IP OPERATIONS & MANAGEMENT (IPOM2003), 2003, : 9 - 13
  • [7] Probabilistic Response Time Analysis for Fixed Preemption Point Selection
    Markovic, Filip
    Carlson, Jan
    Dobrin, Radu
    Lisper, Bjorn
    Thekkilakattil, Abhilash
    [J]. 2018 IEEE 13TH INTERNATIONAL SYMPOSIUM ON INDUSTRIAL EMBEDDED SYSTEMS (SIES), 2018, : 114 - 123
  • [8] On Age of Information for Discrete Time Status Updating System With Ber/G/1/1 Queues
    Zhang, Jixiang
    Xu, Yinfei
    [J]. 2021 IEEE INFORMATION THEORY WORKSHOP (ITW), 2021,
  • [9] On the Age of Information in Status Update Systems With Packet Management
    Costa, Maice
    Codreanu, Marian
    Ephremides, Anthony
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2016, 62 (04) : 1897 - 1910
  • [10] Analysis of Probabilistic Preemption-based Mechanism for QoS Provision in OBS Networks
    Orawiwattanakul, Tananun
    Ji, Yusheng
    [J]. ICOIN: 2009 INTERNATIONAL CONFERENCE ON INFORMATION NETWORKING, 2009, : 256 - 259