Network Connectivity--Information Freshness Tradeoff in Information Dissemination Over Networks
Arunabh Srivastava, Sennur Ulukus

TL;DR
This paper investigates how different network structures affect the timeliness of information dissemination, using version age as a metric, and provides new scaling results for various graph topologies beyond the known extremes.
Contribution
It introduces a general upper bound for average version age and derives new age scaling laws for multiple network graphs, bridging the gap between ring and fully-connected networks.
Findings
Age scales as O(n^{1/2}) on rings
Age scales as O(log n) on fully-connected graphs
Intermediate network structures exhibit distinct age scaling behaviors
Abstract
We consider a gossip network consisting of a source generating updates and nodes connected according to a given graph structure. The source keeps updates of a process, that might be generated or observed, and shares them with the gossiping network. The nodes in the network communicate with their neighbors and disseminate these version updates using a push-style gossip strategy. We use the version age metric to quantify the timeliness of information at the nodes. We first find an upper bound for the average version age for a set of nodes in a general network. Using this, we find the average version age scaling of a node in several network graph structures, such as two-dimensional grids, generalized rings and hyper-cubes. Prior to our work, it was known that when nodes are connected on a ring the version age scales as , and when they are connected on a…
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.
Taxonomy
TopicsIoT and Edge/Fog Computing · Distributed systems and fault tolerance · Opportunistic and Delay-Tolerant Networks
