Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

Age Analysis of Status Updating System with Probabilistic Packet Preemption

Version 1 : Received: 1 May 2022 / Approved: 4 May 2022 / Online: 4 May 2022 (13:15:56 CEST)

A peer-reviewed article of this Preprint also exists.

Zhang, J.; Xu, Y. Age Analysis of Status Updating System with Probabilistic Packet Preemption. Entropy 2022, 24, 785. Zhang, J.; Xu, Y. Age Analysis of Status Updating System with Probabilistic Packet Preemption. Entropy 2022, 24, 785.

Abstract

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 discrete time status updating system with probabilistic packet preemption is investigated by analyzing the steady state of a three-dimensional discrete stochastic process. Assuming the queue used in system is Ber/Geo/1/2*/η, which represents that the system size is 2 and the packet in buffer can be preempted by fresher packet with probability η. Instead of considering 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 packet in server, and the age of packet waiting in buffer. We give the explicit expression of system’s average AoI, and show that the average AoI of system without packet preemption is obtained by letting η=0. When η is set to 1, the mean of AoI of system having Ber/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 average discrete AoI with Ber/Geo/1/c queue and the average continuous AoI with M/M/1/c queue. For each of two extreme cases where η=0 and η=1, we also determine the stationary distribution of AoI using the probability generation function (PGF) method. The relations between average AoI and the packet preemption probability η, as well as 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 wireless sensor network, where the packet in 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 give much more explanations showing that how the results about continuous AoI is 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 our idea to analyze system’s AoI when the service time distribution is relaxed to be arbitrary.

Keywords

age of information; discrete time status updating system; probabilistic preemption; probability generation function; stationary distribution

Subject

Engineering, Control and Systems Engineering

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.