# Age of Information in a Network of Preemptive Servers

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

## Key facts

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

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

- [Learning-based Scheduling for Information Accuracy and Freshness in Wireless Networks](https://mlsanity.com/paper/2310.15705/) (2023)

## Abstract (arXiv)

A source submits status updates to a network for delivery to a destination monitor. Updates follow a route through a series of network nodes. Each node is a last-come-first-served queue supporting preemption in service. We characterize the average age of information at the input and output of each node in the route induced by the updates passing through. For Poisson arrivals to a line network of preemptive memoryless servers, we show that average age accumulates through successive network nodes.