Gossiping with Binary Freshness Metric
Melih Bastopcu, Baturalp Buyukates, Sennur Ulukus

TL;DR
This paper analyzes the binary freshness metric in various gossip network topologies, developing recursive equations via SHS, and explores how network structure and size affect information freshness.
Contribution
It introduces a recursive SHS-based framework for binary freshness in arbitrary gossip networks and characterizes its behavior in different structured topologies.
Findings
Binary freshness decreases as n^{-1} in disconnected and ring networks.
In ring networks, binary freshness remains strictly larger than in disconnected networks.
Fully connected networks exhibit a slower decay, approximately n^{- ho} with bla<1, under high update rates.
Abstract
We consider the binary freshness metric for gossip networks that consist of a single source and end-nodes, where the end-nodes are allowed to share their stored versions of the source information with the other nodes. We develop recursive equations that characterize binary freshness in arbitrarily connected gossip networks using the stochastic hybrid systems (SHS) approach. Next, we study binary freshness in several structured gossip networks, namely disconnected, ring and fully connected networks. We show that for both disconnected and ring network topologies, when the number of nodes gets large, the binary freshness of a node decreases down to 0 as , but the freshness is strictly larger for the ring topology. We also show that for the fully connected topology, the rate of decrease to 0 is slower, and it takes the form of for a smaller than 1, when 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.
