# Age of Information in G/G/1/1 Systems

arXiv: https://arxiv.org/abs/1805.12586 · HTML: https://mlsanity.com/paper/1805.12586/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 31 May 2018.

## Built on by (most cited first, 1 of 1)

- [Age-Based Scheduling for Mobile Edge Computing: A Deep Reinforcement Learning Approach](https://mlsanity.com/paper/2312.00279/) (2023)

## Abstract (arXiv)

We consider a single server communication setting where the interarrival times of data updates at the source node and the service times to the destination node are arbitrarily distributed. We consider two service discipline models. If a new update arrives when the service is busy, it is dropped in the first model; and it preempts the current update in the second model. For both models, we derive exact expressions for the age of information metric with no restriction on the distributions of interarrival and service times. In addition, we derive upper bounds that are easier to calculate than the exact expressions. In the case with dropping, we also derive a second upper bound by utilizing stochastic ordering if the interarrival times have decreasing mean residual life (DMRL) and service times have new better than use in expectation (NBUE) property.