Age of Information in Multi-Hop Connections with Tributary Traffic and no Preemption

Abstract

Age of Information (AoI) has gained significant attention from the research community because of its applications to Internet of Things (IoT) monitoring and control. In this work, we treat multihop connections over queuing networks with tributary flows and non-preemptive service: packets cannot be discarded because they are utilized for other system objectives, such as data analytics. Without preemption, the key tool for optimizing AoI is then the scheduling policy between the different data flows at each intermediate node. This is the subject of our analysis, along with the impact of packet erasure on the age. We derive upper and lower bounds for the average AoI considering several queuing policies in arbitrary network topologies, and present the results in different scenarios. Network topology, tributary traffic load, and link characteristics such as packet erasure generate complex trade-offs, which affect the optimal operation point and the age performance. The scheduling strategy at each node can also affect performance and fairness among users, particularly at critical bottleneck links, which have a significant impact on the overall performance of the whole network.