Pith. sign in

REVIEW

Choosing Outdated Information to Achieve Reliability in Age-Based Gossiping

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 2311.08383 v1 pith:2TYXZXRU submitted 2023-11-14 cs.IT cs.NIeess.SPmath.IT

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

We consider a system model with two sources, a reliable source and an unreliable source, who are responsible for disseminating updates regarding a process to an age-based gossip network of $n$ nodes. Nodes wish to have fresh information, however, they have preference for packets that originated at the reliable source and are willing to sacrifice their version age of information by up to $G$ versions to switch from an unreliable packet to a reliable packet. We study how this protocol impacts the prevalence of unreliable packets at nodes in the network and their version age. Using a stochastic hybrid system (SHS) framework, we formulate analytical equations to characterize two quantities: expected fraction of nodes with unreliable packets and expected version age of information at network nodes. We show that as $G$ increases, fewer nodes have unreliable packet, however, their version age increases as well, thereby inducing a freshness-reliability trade-off in the network. We present numerical results to support our findings.

Discussion (0). Continue with ORCID to comment.

Pith tools