Online Scheduling of Transmission and Processing for AoI Minimization with Edge Computing
Jianhang Zhu, Jie Gong

TL;DR
This paper investigates online scheduling policies for minimizing Age of Information in an edge computing system, proposing and comparing three policies with numerical evaluations to optimize real-time status updates.
Contribution
It introduces and analyzes three novel online scheduling policies for AoI minimization in edge computing, including a new postponed plan to improve peak age threshold policy.
Findings
Peak age threshold policy outperforms the optimal long wait policy.
Postponed plan reduces waiting time and improves AoI.
Numerical results demonstrate the effectiveness of proposed policies.
Abstract
Age of Information (AoI), which measures the time elapsed since the generation of the last received packet at the destination, is a new metric for real-time status update tracking applications. In this paper, we consider a status-update system in which a source node samples updates and sends them to an edge server over a delay channel. The received updates are processed by the server with an infinite buffer and then delivered to a destination. The channel can send only one update at a time, and the server can process one at a time as well. The source node applies generate-at-will model according to the state of the channel, the edge server, and the buffer. We aim to minimize the average AoI with \emph{independent and identically distributed} transmission time and processing time. We consider three online scheduling policies. The first one is the optimal long wait policy, under which the…
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.
Taxonomy
TopicsAge of Information Optimization · IoT Networks and Protocols
