In ring networks with independent non-identical renewal processes on edges, the version age of information at any node is stochastically equivalent to sqrt(n) after the first source update.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
cs.IT 3years
2026 3verdicts
UNVERDICTED 3representative citing papers
Waiting-based query policies for CTMC monitoring under general delay distributions produce higher mean binary freshness than policies assuming exponential delays and instant feedback.
In drone-assisted cellular gossip networks, version age scales as the inverse of the slower of mobility rate λ_m(n) and dissemination rate λ_d(n).
citing papers explorer
-
Age of Gossip in Ring Networks With Non-Poisson Updates
In ring networks with independent non-identical renewal processes on edges, the version age of information at any node is stochastically equivalent to sqrt(n) after the first source update.
-
Utilizing the Perceived Age to Maximize Freshness in Query-Based Update Systems
Waiting-based query policies for CTMC monitoring under general delay distributions produce higher mean binary freshness than policies assuming exponential delays and instant feedback.
-
Age of Gossip With Cellular Drone Mobility
In drone-assisted cellular gossip networks, version age scales as the inverse of the slower of mobility rate λ_m(n) and dissemination rate λ_d(n).