Age of information using Markov-renewal methods
Based on a message transmission and processing system, suppose that the incoming data items, labeled by an index \(j \in J\), pass through an inspection process, deciding whether a current information package \(j\) can be accepted, \(\phi(j)(j)=1\), for further use, or must be discarded, \(\phi(j)=0\). Here, the mapping \(f=f(j)\) denotes the corresponding decision operator. The whole transmission and processing model is assumed to involve different stochastic parameters and stochastic processes. An important concept for the analysis of message information and processing systems is the ``freshness of information, \(\alpha=\alpha(t)\), with respect to a reference time \(t\), also referred to as ``age of information \(AoI(t)\). A possible definition of \(\alpha(t)\) at a reference time point \(t\) reads: \[ \alpha(t) :=t-\max_{t_j \leq t, f(j)=1, j\in J}t_j, \] where \(t_j\) denotes the time of an information item \(j\) arriving and evaluated up to a reference time point \(t\). Under different assumptions on the stochastic information transmission and evaluation process, the properties of \(AoI(t)\), e.g., its probability distribution are considered. Moreover, several numerical examples are provided.
- Discrete time Markov chain model for age of information
- Age of Information in G/G/1/1 Systems: Age Expressions, Bounds, Special Cases, and Optimization
- The distribution of age-of-information performance measures for message processing systems
- A General Formula for the Stationary Distribution of the Age of Information and Its Application to Single-Server Queues
- scientific article; zbMATH DE number 4047580
- scientific article; zbMATH DE number 1358321
- The information in aggregate data from Markov chains
- The information in the marginal law of a Markov chain
- A General Formula for the Stationary Distribution of the Age of Information and Its Application to Single-Server Queues
- Age of information: a new concept, metric, and tool
- Applied Probability and Queues
- scientific article; zbMATH DE number 3532286 (Why is no real title available?)
- scientific article; zbMATH DE number 1460450 (Why is no real title available?)
- Joint Performance Analysis of Ages of Information in a Multi-Source Pushout Server
- Minimizing the Age of Information Through Queues
- On the Age of Information in Status Update Systems With Packet Management
- Sensitivity analysis for stationary and ergodic queues
- The distribution of age-of-information performance measures for message processing systems
This page was built for publication: Age of information using Markov-renewal methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6163556)