English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We consider a system with a source which maintains the most current versionof a file, and a ring network of $n$ user nodes that wish to acquire the latestversion of the file. The source gets updated with newer file versions as apoint process, and forwards them to the user nodes, which further forward themto their neighbors using a memoryless gossip protocol. We study the averageversion age of this network in the presence of $\tilde{n}$ jammers that disruptinter-node communications. To this purpose, we construct an alternate systemmodel of mini-rings and prove that the version age of the original model can besandwiched between constant multiples of the version age of the alternatemodel. We show that when the number of jammers scales as a fractional power ofthe network size, i.e., $\tilde n= cn^\alpha$, the version age scales as$\sqrt{n}$ when $\alpha < \frac{1}{2}$, and as $n^{\alpha}$ when $\alpha \geq\frac{1}{2}$. As the version age of a ring network without any jammers scalesas $\sqrt{n}$, our result implies that the version age with gossiping is robustagainst up to $\sqrt{n}$ jammers in a ring network.

Age of Gossip in Ring Networks in the Presence of Jamming Attacks