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 network consisting of a single source and $n$ receiver nodesthat are grouped into equal-sized clusters. We use cluster heads in eachcluster to facilitate communication between the source and the nodes withinthat cluster. Inside clusters, nodes are connected to each other according to agiven network topology. Based on the connectivity among the nodes, each noderelays its current stored version of the source update to its neighboring nodesby $local$ $gossiping$. We use the $version$ $age$ metric to assess informationfreshness at the nodes. We consider disconnected, ring, and fully connectednetwork topologies for each cluster. For each network topology, we characterizethe average version age at each node and find the average version age scalingas a function of the network size $n$. Our results indicate that per nodeaverage version age scalings of $O(\sqrt{n})$, $O(n^{\frac{1}{3}})$, and$O(\log n)$ are achievable in disconnected, ring, and fully connected clustermodels, respectively. Next, we increase connectivity in the network and allowgossiping among the cluster heads to improve version age at the nodes. Withthat, we show that when the cluster heads form a ring network among themselves,we obtain per node average version age scalings of $O(n^{\frac{1}{3}})$,$O(n^{\frac{1}{4}})$, and $O(\log n)$ in disconnected, ring, and fullyconnected cluster models, respectively. Next, focusing on a ring networktopology in each cluster, we introduce hierarchy to the considered clusteredgossip network model and show that when we employ two levels of hierarchy, wecan achieve the same $O(n^{\frac{1}{4}})$ scaling without using dedicatedcluster heads. We generalize this result for $h$ levels of hierarchy and showthat per user average version age scaling of $O(n^{\frac{1}{2h}})$ isachievable in the case of a ring network in each cluster across all hierarchylevels.

Version Age of Information in Clustered Gossip Networks