Age of information using Markov-renewal methods (Q6163556): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Applied Probability and Queues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4485682 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the Age of Information Through Queues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4109064 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Age of Information in Status Update Systems With Packet Management / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Formula for the Stationary Distribution of the Age of Information and Its Application to Single-Server Queues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Joint Performance Analysis of Ages of Information in a Multi-Source Pushout Server / rank
 
Normal rank
Property / cites work
 
Property / cites work: The distribution of age-of-information performance measures for message processing systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sensitivity analysis for stationary and ergodic queues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Age of Information: A New Concept, Metric, and Tool / rank
 
Normal rank

Latest revision as of 12:57, 1 August 2024

scientific article; zbMATH DE number 7702256
Language Label Description Also known as
English
Age of information using Markov-renewal methods
scientific article; zbMATH DE number 7702256

    Statements

    Age of information using Markov-renewal methods (English)
    0 references
    0 references
    0 references
    0 references
    26 June 2023
    0 references
    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.
    0 references
    0 references
    freshness of information
    0 references
    age of information
    0 references
    Markov renewal
    0 references
    palm probability
    0 references
    Laplace transform
    0 references
    queueing
    0 references

    Identifiers