# A Learning Based Scheme for Fair Timeliness in Sparse Gossip Networks

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

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 8 of its 16 references that are in the map.
- First posted on arXiv 2 Oct 2023.

## Builds on (most cited first, 8 of 8)

- [Age of Information: An Introduction and Survey](https://mlsanity.com/paper/2007.08564/) (2020)
- [The Age of Gossip in Networks](https://mlsanity.com/paper/2102.02893/) (2021)
- [Version Age of Information in Clustered Gossip Networks](https://mlsanity.com/paper/2109.08669/) (2021)
- [ASUMAN: Age Sense Updating Multiple Access in Networks](https://mlsanity.com/paper/2207.07094/) (2022)
- [Timely Opportunistic Gossiping in Dense Networks](https://mlsanity.com/paper/2301.00798/) (2023)
- [Timely Gossiping with File Slicing and Network Coding](https://mlsanity.com/paper/2202.00649/) (2022)
- [Age of Gossip in Ring Networks in the Presence of Jamming Attacks](https://mlsanity.com/paper/2205.03328/) (2022)
- [Susceptibility of Age of Gossip to Timestomping](https://mlsanity.com/paper/2205.08510/) (2022)

## Abstract (arXiv)

We consider a gossip network, consisting of n nodes, which tracks the information at a source. The source updates its information with a Poisson arrival process and also sends updates to the nodes in the network. The nodes themselves can exchange information among themselves to become as timely as possible. However, the network structure is sparse and irregular, i.e., not every node is connected to every other node in the network, rather, the order of connectivity is low, and varies across different nodes. This asymmetry of the network implies that the nodes in the network do not perform equally in terms of timelines. Due to the gossiping nature of the network, some nodes are able to track the source very timely, whereas, some nodes fall behind versions quite often. In this work, we investigate how the rate-constrained source should distribute its update rate across the network to maintain fairness regarding timeliness, i.e., the overall worst case performance of the network can be minimized. Due to the continuous search space for optimum rate allocation, we formulate this problem as a continuum-armed bandit problem and employ Gaussian process based Bayesian optimization to meet a trade-off between exploration and exploitation sequentially.