Age of Gossip in Random and Bipartite Networks
Abstract: In this paper we study gossip networks where a source observing a process sends updates to an underlying graph. Nodes in the graph communicate to their neighbors by randomly sending updates. Our interest is studying the version age of information (vAoI) metric over various classes of networks. It is known that the version age of $K_n$ is logarithmic, and the version age of $\overline{K_n}$ is linear. We study the question `how does the vAoI evolve as we interpolate between $K_n$ and $\overline{K_n}$' by studying Erd\H{o}s-Reyni random graphs, random $d$-regular graphs, and bipartite networks. Our main results are proving the existence of a threshold in $G(n,p)$ from rational to logarithmic average version age, and showing $G(n,d)$ almost surely has logarithmic version age for constant $d$. We also characterize the version age of complete bipartite graphs $K_{L,R}$, when we let $L$ vary from $O(1)$ to $O(n)$.
- M. Mohamed, H. ElSawy, and W. Mesbah, “Optimized degree-aware random patching for thwarting iot botnets,” IEEE Networking Letters, vol. 5, no. 1, pp. 59–63, 2023.
- B. Isik, F. Pase, D. Gunduz, T. Weissman, and Z. Michele, “Sparse random networks for communication-efficient federated learning,” in The Eleventh International Conference on Learning Representations, 2023. [Online]. Available: https://openreview.net/forum?id=k1FHgri5y3-
- D. Liu, Y. Xu, J. Wang, Y. Xu, A. Anpalagan, Q. Wu, H. Wang, and L. Shen, “Self-organizing relay selection in uav communication networks: A matching game perspective,” IEEE Wireless Communications, vol. 26, no. 6, p. 102–110, Dec. 2019. [Online]. Available: http://dx.doi.org/10.1109/MWC.001.1700434
- Y. Sun, I. Kadota, R. Talak, and E. H. Modiano, “Age of information: A new metric for information freshness,” Synthesis Lectures on Communication Networks, 2019. [Online]. Available: https://api.semanticscholar.org/CorpusID:213862731
- A. Maatouk, S. Kriouile, M. Assaad, and A. Ephremides, “The age of incorrect information: A new performance metric for status updates,” IEEE/ACM Transactions on Networking, vol. 28, no. 5, p. 2215–2228, Oct. 2020. [Online]. Available: http://dx.doi.org/10.1109/TNET.2020.3005549
- J. Zhong, R. D. Yates, and E. Soljanin, “Two freshness metrics for local cache refresh,” 2018 IEEE International Symposium on Information Theory (ISIT), pp. 1924–1928, 2018. [Online]. Available: https://api.semanticscholar.org/CorpusID:52020072
- R. D. Yates, “The age of gossip in networks,” in 2021 IEEE International Symposium on Information Theory (ISIT). IEEE, Jul. 2021. [Online]. Available: http://dx.doi.org/10.1109/ISIT45174.2021.9517796
- A. Srivastava and S. Ulukus, “Age of gossip on generalized rings,” in MILCOM 2023 - 2023 IEEE Military Communications Conference (MILCOM). IEEE, Oct. 2023. [Online]. Available: http://dx.doi.org/10.1109/MILCOM58377.2023.10356227
- ——, “Age of gossip on a grid,” in 2023 59th Annual Allerton Conference on Communication, Control, and Computing (Allerton). IEEE, Sep. 2023. [Online]. Available: http://dx.doi.org/10.1109/Allerton58177.2023.10313495
- ——, “Age of gossip on generalized rings,” in MILCOM 2023 - 2023 IEEE Military Communications Conference (MILCOM). IEEE, Oct. 2023. [Online]. Available: http://dx.doi.org/10.1109/MILCOM58377.2023.10356227
- E. Friedgut and G. Kalai, “Every monotone graph property has a sharp threshold,” 1996. [Online]. Available: https://api.semanticscholar.org/CorpusID:9721337
- B. Bollobás, “The isoperimetric number of random regular graphs,” European Journal of Combinatorics, vol. 9, no. 3, pp. 241–244, 1988. [Online]. Available: https://www.sciencedirect.com/science/article/pii/S0195669888800143
- M. Krivelevich and B. Sudakov, “The phase transition in random graphs: A simple proof,” Random Structures and Algorithms, vol. 43, no. 2, p. 131–138, Sep. 2012. [Online]. Available: http://dx.doi.org/10.1002/rsa.20470
- H. Srivastava and J. Choi, “Zeta and q-zeta functions and associated series and integrals,” in Zeta and q-Zeta Functions and Associated Series and Integrals, H. Srivastava and J. Choi, Eds. London: Elsevier, 2012, pp. 1–140. [Online]. Available: https://www.sciencedirect.com/science/article/pii/B9780123852182000013
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.