Age of Information in a Network of Preemptive Servers
Information Theory
2018-03-22 v1 Networking and Internet Architecture
math.IT
Abstract
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.
Keywords
Cite
@article{arxiv.1803.07993,
title = {Age of Information in a Network of Preemptive Servers},
author = {Roy D. Yates},
journal= {arXiv preprint arXiv:1803.07993},
year = {2018}
}
Comments
This work was supported by NSF award CNS-1422988 and will be presented at the 2018 IEEE Infocom Age of Information workshop