What About Peak Age? Average vs. Peak AoI Minimization in Finite-Horizon Scheduling

Current communication standards typically emphasize latency, reliability, and throughput as the main performance metrics. However, a promising line of research is adopting age of information (AoI) as a more direct measure of data freshness, which is key for real-time applications and ambient sensing. In particular, industrial or mission-critical scenarios would likely require an AoI minimization over a finite horizon, e.g., corresponding to the duration of an intended observation window, under the constraint of a limited number of updates being exchanged. From the standpoint of a standard to be implemented in future communications and networking platforms, the choice would further be conflicted between minimizing the average or peak value of AoI. Anticipating this conundrum, we explore an optimization approach based on dynamic programming recursion, where we consider both average and peak AoI as possible objectives; we also evaluate one metric when the other is optimized. We further consider both independent and correlated errors. In all these cases, we are able to show that minimizing either AoI-related metric over a relatively short horizon often converges to similar threshold-based criteria. From a practical standpoint, this supports the insertion of either AoI-related metric in future standards, making further debates over average versus peak AoI minimization amount to just semantic distinctions with negligible practical impact.

Authors

Institutions

Publication Details

Published
2025-09-15
DOI
https://doi.org/10.1109/cscn67557.2025.11230708
Primary Topic
Age of Information Optimization
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

What About Peak Age? Average vs. Peak AoI Minimization in Finite-Horizon Scheduling

Leonardo Badia, Beyza Türk
Age of Information Optimization
article

What About Peak Age? Average vs. Peak AoI Minimization in Finite-Horizon Scheduling

Leonardo Badia, Beyza Türk
article en

Abstract

Current communication standards typically emphasize latency, reliability, and throughput as the main performance metrics. However, a promising line of research is adopting age of information (AoI) as a more direct measure of data freshness, which is key for real-time applications and ambient sensing. In particular, industrial or mission-critical scenarios would likely require an AoI minimization over a finite horizon, e.g., corresponding to the duration of an intended observation window, under the constraint of a limited number of updates being exchanged. From the standpoint of a standard to be implemented in future communications and networking platforms, the choice would further be conflicted between minimizing the average or peak value of AoI. Anticipating this conundrum, we explore an optimization approach based on dynamic programming recursion, where we consider both average and peak AoI as possible objectives; we also evaluate one metric when the other is optimized. We further consider both independent and correlated errors. In all these cases, we are able to show that minimizing either AoI-related metric over a relatively short horizon often converges to similar threshold-based criteria. From a practical standpoint, this supports the insertion of either AoI-related metric in future standards, making further debates over average versus peak AoI minimization amount to just semantic distinctions with negligible practical impact.

University of Padua (IT), Istanbul Technical University (TR)
Openalex Percentile: Top 60%
Age of Information Optimization
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.