The Age of Information in Multihop Networks
Ahmed M. Bedewy, Yin Sun, and Ness B. Shroff

TL;DR
This paper investigates age minimization strategies in multihop networks, demonstrating optimal policies under various conditions and distributions, with implications for IoT and transportation systems.
Contribution
It introduces and analyzes the effectiveness of the Last-Generated, First-Served (LGFS) policy in minimizing age across multihop networks under different preemption and distribution scenarios.
Findings
Preemptive LGFS outperforms other policies with exponential transmission times.
Non-preemptive LGFS is near-optimal for NBU distributions within a constant age gap.
Non-preemptive LGFS minimizes age among work-conserving policies without preemption.
Abstract
Information updates in multihop networks such as Internet of Things (IoT) and intelligent transportation systems have received significant recent attention. In this paper, we minimize the age of a single information flow in interference-free multihop networks. When preemption is allowed and the packet transmission times are exponentially distributed, we prove that a preemptive Last-Generated, First-Served (LGFS) policy results in smaller age processes across all nodes in the network than any other causal policy (in a stochastic ordering sense). In addition, for the class of New-Better-than-Used (NBU) distributions, we show that the non-preemptive LGFS policy is within a constant age gap from the optimum average age. In contrast, our numerical result shows that the preemptive LGFS policy can be very far from the optimum for some NBU transmission time distributions. Finally, when…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
