# Age Debt: A General Framework For Minimizing Age of Information

arXiv: https://arxiv.org/abs/2101.10225 · HTML: https://mlsanity.com/paper/2101.10225/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 25 Jan 2021.

## Built on by (most cited first, 2 of 2)

- [Degree of Staleness-Aware Data Updating in Federated Learning](https://mlsanity.com/paper/2508.16931/) (2025)
- [A Survey of Freshness-Aware Wireless Networking with Reinforcement Learning](https://mlsanity.com/paper/2512.21412/) (2025)

## Abstract (arXiv)

We consider the problem of minimizing age of information in general single-hop and multihop wireless networks. First, we formulate a way to convert AoI optimization problems into equivalent network stability problems. Then, we propose a heuristic low complexity approach for achieving stability that can handle general network topologies; unicast, multicast and broadcast flows; interference constraints; link reliabilities; and AoI cost functions. We provide numerical results to show that our proposed algorithms behave as well as the best known scheduling and routing schemes available in the literature for a wide variety of network settings.