Status Updates through Networks of Parallel Servers

Abstract

A source submits status updates to a network for delivery to a destination monitor. Updates follow independent routes such that updates may arrive out of order. Each network route is modeled as a memoryless preemptive last-come-first-served queue. Using a stochastic hybrid systems approach, we evaluate the average age of information at the monitor, including a simplified characterization of the benefits of route and server diversity.