Age of Gossip in Ring Networks in the Presence of Jamming Attacks
share
We consider a system with a source which maintains the most current version of a file, and a ring network of n user nodes that wish to acquire the latest version of the file. The source gets updated with newer file versions as a point process, and forwards them to the user nodes, which further forward them to their neighbors using a memoryless gossip protocol. We study the average version age of this network in the presence of ñ jammers that disrupt inter-node communications. To this purpose, we construct an alternate system model of mini-rings and prove that the version age of the original model can be sandwiched between constant multiples of the version age of the alternate model. We show that when the number of jammers scales as a fractional power of the network size, i.e., ñ= cn^α, the version age scales as √(n) when α < 1/2, and as n^α when α≥1/2. As the version age of a ring network without any jammers scales as √(n), our result implies that the version age with gossiping is robust against up to √(n) jammers in a ring network.
READ FULL TEXT
