Pith. sign in

REVIEW 1 cited by

Age of Information in Gossip Networks: A Friendly Introduction and Literature Survey

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2312.16163 v1 pith:DZHRM5LW submitted 2023-12-26 cs.IT cs.NIeess.SPmath.IT

classification cs.ITcs.NIeess.SPmath.IT
keywords gossipinginformationnetworknetworksgossiptimelyarticlecontext
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Gossiping is a communication mechanism, used for fast information dissemination in a network, where each node of the network randomly shares its information with the neighboring nodes. To characterize the notion of fastness in the context of gossip networks, age of information (AoI) is used as a timeliness metric. In this article, we summarize the recent works related to timely gossiping in a network. We start with the introduction of randomized gossip algorithms as an epidemic algorithm for database maintenance, and how the gossiping literature was later developed in the context of rumor spreading, message passing and distributed mean estimation. Then, we motivate the need for timely gossiping in applications such as source tracking and decentralized learning. We evaluate timeliness scaling of gossiping in various network topologies, such as, fully connected, ring, grid, generalized ring, hierarchical, and sparse asymmetric networks. We discuss age-aware gossiping and the higher order moments of the age process. We also consider different variations of gossiping in networks, such as, file slicing and network coding, reliable and unreliable sources, information mutation, different adversarial actions in gossiping, and energy harvesting sensors. Finally, we conclude this article with a few open problems and future directions in timely gossiping.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Distributed Mixture-of-Agents for Edge Inference with Large Language Models

    cs.IT 2024-12 conditional novelty 4.0 of 10

    Distributed LLM agents can gossip prompts and keep queues bounded when α((k+1)M+1)λ < 1, a condition the paper derives and tests in a small pilot.

Pith tools