The Age of Gossip in Networks
Not on the map. Why?
Abstract (arXiv)
A source node updates its status as a point process and also forwards its updates to a network of observer nodes. Within the network of observers, these updates are forwarded as point processes from node to node. Each node wishes its knowledge of the source to be as timely as possible. In this network, timeliness is measured by a discrete form of age of information: each status change at the source is referred to as a version and the age at a node is how many versions out of date is its most recent update from the source. This work introduces a method for evaluating the average version age at each node in the network when nodes forward updates using a memoryless gossip protocol. This method is then demonstrated by version age analysis for a collection of simple networks. For gossip on a complete graph with symmetric updating rates, it is shown that each node has average age that grows as the logarithm of the network size.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). First posted on arXiv 4 Feb 2021.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 1; 2024: 4; 2025: 1; 2026: 1.
7 papers.
- 2024Version age-based client scheduling policy for federated learningcited by 5
- 2024Distributed Mixture-of-Agents for Edge Inference with Large Language Modelscited by 4
- 2024Scale-Robust Timely Asynchronous Decentralized Learningcited by 1
- 2026Diffusion Model-based Reinforcement Learning for Version Age of Information Scheduling: Average and Tail-Risk-Sensitive Controlcited by 1
- 2023A Learning Based Scheme for Fair Timeliness in Sparse Gossip Networkscited by 0
- 2024Towards efficient compression and communication for prototype-based decentralized learningcited by 0
- 2025Feature-Based Semantics-Aware Scheduling for Energy-Harvesting Federated Learningcited by 0
- 2026Diffusion Model-based Reinforcement Learning for Version Age of Information Scheduling: Average and Tail-Risk-Sensitive Control26 Jan 2026
- 2025Feature-Based Semantics-Aware Scheduling for Energy-Harvesting Federated Learning1 Dec 2025
- 2024Distributed Mixture-of-Agents for Edge Inference with Large Language Models30 Dec 2024
- 2024Towards efficient compression and communication for prototype-based decentralized learning14 Nov 2024
- 2024Scale-Robust Timely Asynchronous Decentralized Learning30 Apr 2024
- 2024Version age-based client scheduling policy for federated learning8 Feb 2024
- 2023A Learning Based Scheme for Fair Timeliness in Sparse Gossip Networks2 Oct 2023