# On Age of Information for Discrete Time Status Updating System With Ber/G/1/1 Queues

@article{Zhang2021OnAO, title={On Age of Information for Discrete Time Status Updating System With Ber/G/1/1 Queues}, author={Jixiang Zhang and Yinfei Xu}, journal={2021 IEEE Information Theory Workshop (ITW)}, year={2021}, pages={1-6} }

In this paper, we consider the age of information (AoI) of a discrete time status updating system, focusing on finding the stationary AoI distribution assuming that the Ber/G/1/1 queue is used. Following the standard queueing theory, we show that by invoking a two-dimensional state vector which tracks the AoI and packet age in system simultaneously, the stationary AoI distribution can be derived by analyzing the steady state of the constituted two-dimensional stochastic process. We give the…

## 4 Citations

### Age Analysis of Status Updating System with Probabilistic Packet Preemption

- Computer ScienceEntropy
- 2022

Detailed discussions are provided 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.

### On Discrete Age of Information of Infinite Size Status Updating System

- Computer ScienceArXiv
- 2022

This paper derives the explicit expression of average age of information (AoI), and the AoI’s stationary distribution, and successfully characterize the random dynamics of system’S AoI using a two-dimensional state vector.

### On Age of Information for Discrete Time Status Updating System With Infinite Size

- Mathematics2022 IEEE Information Theory Workshop (ITW)
- 2022

In this paper, for discrete time status updating system with infinite size, we derive the explicit expression of average age of information (AoI) and its stationary distribution. Notice that there is…

### Status Update Control and Analysis under Two-Way Delay

- Computer ScienceArXiv
- 2022

This paper develops optimal control policies to minimize the average age of information (AoI) using the tools of Markov decision processes in two scenarios and conducts AoI analysis by deriving the average AoI expressions for the Zero-Wait-1, Zero- wait-2, and Wait-1 policies.

## References

SHOWING 1-10 OF 13 REFERENCES

### Non-linear Age of Information in a Discrete Time Queue: Stationary Distribution and Average Performance Analysis

- Computer ScienceICC 2020 - 2020 IEEE International Conference on Communications (ICC)
- 2020

This paper considers a status update communication system consisting of a source-destination link with timeliness requirements and obtains a general formula of the stationary distribution of the AoI and a methodology for analyzing general non-linear age functions for this type of systems.

### A General Formula for the Stationary Distribution of the Age of Information and Its Application to Single-Server Queues

- Computer Science, MathematicsIEEE Transactions on Information Theory
- 2019

A general formula is derived that the stationary distribution of the AoI is given in terms of the stationary distributions of the system delay and the peak AoI, which holds for a wide class of information update systems.

### Age of Information for Discrete Time Queues

- Mathematics, Computer ScienceArXiv
- 2019

This work builds upon proof techniques from earlier results, and also presents new techniques that might be of independent interest in analyzing age in discrete time queuing systems.

### Discrete-Time Queueing Model of Age of Information With Multiple Information Sources

- MathematicsIEEE Internet of Things Journal
- 2021

A discrete-time server arising in multi-source IoT systems which accepts incoming information packets from multiple information sources so as to be forwarded to a remote monitor for status update purposes is studied.

### The Age of Information: Real-Time Status Updating by Multiple Sources

- Computer ScienceIEEE Transactions on Information Theory
- 2019

An age of information timeliness metric is formulated and a general result for the AoI that is applicable to a wide variety of multiple source service systems is derived that makes AoI evaluation to be comparable in complexity to finding the stationary distribution of a finite-state Markov chain.

### The Multi-Source Preemptive M/PH/1/1 Queue with Packet Errors: Exact Distribution of the Age of Information and Its Peak

- Computer ScienceArXiv
- 2020

A queueing-theoretic approach is taken and a probabilistically preemptive bufferless queueing system with arrivals stemming from $N$ separate information sources is studied, with the aim of modeling a generic status update system.

### Effect of Message Transmission Path Diversity on Status Age

- Computer ScienceIEEE Transactions on Information Theory
- 2016

A system in which a sensor sends random status updates over a dynamic network to a monitor is studied, and an approximation that is shown to be close to the simulated age of the status age is provided.

### Age of Information: An Introduction and Survey

- Computer ScienceIEEE Journal on Selected Areas in Communications
- 2021

The current state of the art in the design and optimization of low-latency cyberphysical systems and applications in which sources send time-stamped status updates to interested recipients is described and AoI timeliness metrics are described.

### Age of information with packet management

- Computer Science2014 IEEE International Symposium on Information Theory
- 2014

The average of a new metric, called peak age, is investigated, which provides information about the maximum value of the Age, achieved immediately before receiving an update, which is modeled as an exponentially distributed service time.

### Finding the Exact Distribution of (Peak) Age of Information for Queues of PH/PH/1/1 and M/PH/1/2 Type

- Computer ScienceIEEE Transactions on Communications
- 2020

The proposed exact models are based on the well-established theory of Markov Fluid Queues (MFQ) and the numerical algorithms are matrix-analytical and they rely on numerically stable and efficient vector-matrix operations.