Age of Information in Gossip Networks: A Friendly Introduction and Literature Survey (2312.16163v1)
Abstract: Gossiping is a communication mechanism, used for fast information dissemination in a network, where each node of the network randomly shares its information with the neighboring nodes. To characterize the notion of fastness in the context of gossip networks, age of information (AoI) is used as a timeliness metric. In this article, we summarize the recent works related to timely gossiping in a network. We start with the introduction of randomized gossip algorithms as an epidemic algorithm for database maintenance, and how the gossiping literature was later developed in the context of rumor spreading, message passing and distributed mean estimation. Then, we motivate the need for timely gossiping in applications such as source tracking and decentralized learning. We evaluate timeliness scaling of gossiping in various network topologies, such as, fully connected, ring, grid, generalized ring, hierarchical, and sparse asymmetric networks. We discuss age-aware gossiping and the higher order moments of the age process. We also consider different variations of gossiping in networks, such as, file slicing and network coding, reliable and unreliable sources, information mutation, different adversarial actions in gossiping, and energy harvesting sensors. Finally, we conclude this article with a few open problems and future directions in timely gossiping.
- Minimizing age of information in vehicular networks. In IEEE Infocom, March 2011.
- Real-time status: How often should one update? In IEEE Infocom, March 2012.
- Distributed multi-hop scheduling and medium access with delay and throughput constraints. In IEEE MobiCom, July 2001.
- Throughput-delay trade-off in wireless networks. In IEEE Infocom, March 2004.
- N. Bisnik and A. Abouzeid. Delay and throughput in random access wireless mesh networks. In IEEE ICC, June 2006.
- Throughput, delay, and mobility in wireless ad hoc networks. In IEEE Infocom, March 2010.
- N. Lu and X. S. Shen. Scaling laws for throughput capacity and delay in wireless networks — A survey. IEEE Communications Surveys & Tutorials, 16(2):642–657, August 2013.
- A comprehensive survey on age of information in massive IoT networks. Computer Communications, 197:199–213, January 2023.
- Web crawler - An overview. International Journal of Computer Science and Communication, 2(1):265–267, January 2011.
- Age of information: An introduction and survey. IEEE Journal on Selected Areas in Communication, 39(5):1183–1210, May 2020.
- Age of information: A new concept, metric, and tool. Foundations and Trends in Networking, 12(3):162–259, November 2017.
- Age of information: A new metric for information freshness. Springer Nature, 2022.
- M. Bastopcu and S. Ulukus. Who should Google Scholar update more often? In IEEE Infocom, July 2020.
- Fresh caching for dynamic content. In IEEE Infocom, May 2021.
- R. D. Yates. The age of gossip in networks. In IEEE ISIT, July 2021.
- L. Chettri and R. Bera. A comprehensive survey on internet of things (IoT) toward 5G wireless systems. IEEE Internet of Things Journal, 7(1):16–32, October 2019.
- An empirical study on system level aspects of internet of things (IoT). IEEE Access, 8:188082–188134, October 2020.
- K. Akkaya and M. Younis. A survey on routing protocols for wireless sensor networks. Ad Hoc Networks, 3(3):325–349, May 2005.
- Routing protocols in wireless sensor networks. Sensors, 9(11):8399–8421, October 2009.
- Distributed estimation over a low-cost sensor network: A review of state-of-the-art. Information Fusion, 54:21–43, February 2020.
- Survey of multipath routing protocols for mobile ad hoc networks. Journal of Network and Computer Applications, 32(6):1125–1143, November 2009.
- P. Ruiz and P. Bouvry. Survey on broadcast algorithms for mobile ad hoc networks. ACM Computing Surveys, 48(1):1–35, July 2015.
- B. Li and H. Yin. Peer-to-peer live video streaming on the internet: issues, existing approaches, and challenges. IEEE Communications Magazine, 45(6):94–99, June 2007.
- Building a peer-to-peer content distribution network with high performance, scalability and robustness. Information Systems, 36(2):222–247, April 2011.
- D. Coileain and D. O’Mahony. Accounting and accountability in content distribution architectures: A survey. ACM Computing Surveys, 47(4):1–35, May 2015.
- A survey on vehicular edge computing: architecture, applications, technical issues, and future directions. Wireless Communications and Mobile Computing, February 2019.
- Gossip learning as a decentralized alternative to federated learning. In Distributed Applications and Interoperable Systems, pages 74–90. Springer, June 2019.
- Decentralized learning works: An empirical comparison of gossip learning and federated learning. Journal of Parallel and Distributed Computing, 148:109–124, February 2021.
- Towards 6G hyper-connectivity: Vision, challenges, and key enabling technologies. Journal of Communications and Networks, 25(3):344–354, June 2023.
- Epidemic algorithms for replicated database maintenance. In ACM PODC, August 1987.
- B. G. Pittel. On spreading a rumor. SIAM Journal on Applied Mathematics, 47(1):213–223, February 1987.
- Randomized rumor spreading. In FOCS, November 2000.
- Y. Minsky. Spreading Rumors Cheaply, Quickly, and Reliably. PhD thesis, Cornell University, March 2002.
- Algebraic gossip: a network coding approach to optimal multiple rumor mongering. IEEE Transactions on Information Theory, 52(6):2486–2507, June 2006.
- D. Mosk-Aoyama and D. Shah. Information dissemination via network coding. In IEEE ISIT, July 2006.
- Gossiping with multiple messages. IEEE Transactions on Information Theory, 53(12):4640–4654, December 2007.
- Gossip algorithms: Design, analysis and applications. In IEEE Annual Joint Conference: Infocom, IEEE Computer and Communications Societies, March 2005.
- D. Shah. Gossip algorithms. Foundations and Trends in Networking, 3(1):1–125, 2008.
- A. Nedic and A. Ozdaglar. Distributed subgradient methods for multi-agent optimization. IEEE Transactions on Automatic Control, 54(1):48–61, January 2009.
- Constrained consensus and optimization in multi-agent networks. IEEE Transactions on Automatic Control, 55(4):922–938, April 2010.
- On distributed averaging algorithms and quantization effects. IEEE Transactions on Automatic Control, 54(11):2506–2517, November 2009.
- Dynamo: Amazon’s highly available key-value store. ACM SIGOPS Operating Systems Review, 41(6):205–220, 2007.
- A. Lakshman and P. Malik. Cassandra: A decentralized structured storage system. ACM SIGOPS Operating Systems Review, 44(2):35–40, 2010.
- Asynchronous decentralized parallel stochastic gradient descent. In ICML, July 2018.
- Asynchronous gossip algorithms for stochastic optimization. In IEEE CDC, December 2009.
- How to scale distributed deep learning? In NeurIPS, November 2016.
- M. Glasgow and M. Wootters. Asynchronous distributed optimization with stochastic delays. In AISTAT, May 2022.
- R. D. Yates. Timely gossip. In IEEE SPAWC, September 2021.
- The age of information: Real-time status updating by multiple sources. IEEE Transactions on Information Theory, 65(3):1807–1827, March 2019.
- J. Hespanha. Modeling and analysis of stochastic hybrid systems. IEEE Proceedings - Control Theory & Applications, Special Issue on Hybrid Systems, 153:520–535, January 2007.
- Version age of information in clustered gossip networks. IEEE Journal on Selected Areas in Information Theory, 3(1):85–97, March 2022.
- D. Ellis. The expansion of random regular graphs. Lecture notes. Stanford University, 2011.
- A. Srivastava and S. Ulukus. Age of gossip on a grid. In Allerton Conference, September 2023.
- F. Harary and H. Harborth. Extremal animals. Journal of Combinatorics, Information and System Sciences, 1(1):1–8, January 1976.
- Conjoining speeds up information diffusion in overlaying social-physical networks. IEEE Journal on Selected Areas in Communications, 31(6):1038–1048, 2013.
- P. Kaswan and S. Ulukus. How robust are timely gossip networks to jamming attacks? IEEE Journal on Selected Areas in Information Theory. To appear. Also available at arXiv:2303.11310.
- A. Srivastava and S. Ulukus. Age of gossip on generalized rings. In IEEE MILCOM, October 2023.
- P. Mitra and S. Ulukus. ASUMAN: Age Sense Updating Multiple Access in Networks. In Allerton Conference, September 2022.
- P. Mitra and S. Ulukus. Age-aware gossiping in network topologies. April 2023. Available at arXiv:2304.03249.
- P. Mitra and S. Ulukus. Timely opportunistic gossiping in dense networks. In IEEE Infocom, May 2023.
- Distribution of the age of gossip in networks. Entropy, 25(2):364, February 2023.
- P. Mitra and S. Ulukus. A learning based scheme for fair timeliness in sparse gossip networks. In IEEE ICMLCN, May 2024.
- Gaussian process optimization in the bandit setting: No regret and experimental design. ICML, June 2009.
- X𝑋{X}italic_X-armed bandits. Journal of Machine Learning Research, 12(5):1655–1695, May 2011.
- Taking the human out of the loop: A review of Bayesian optimization. Proceedings of the IEEE, 104(1):148–175, December 2015.
- Derivative-free optimization methods. Acta Numerica, 28:287–404, June 2019.
- P. Kaswan and S. Ulukus. Timely gossiping with file slicing and network coding. In IEEE ISIT, June 2022.
- P. Kaswan and S. Ulukus. Choosing outdated information to achieve reliability in age-based gossiping. Available at arXiv:2311.08383.
- P. Kaswan and S. Ulukus. Information mutation and spread of misinformation in timely gossip networks. In IEEE Globecom, December 2023.
- P. Kaswan and S. Ulukus. Timestomping vulnerability of age-sensitive gossip networks. IEEE Transactions on Communications. To appear. Also available at arXiv:2212.14421.
- W. Minnaard. Timestomping NFTS. Master’s thesis, University of Amsterdam, July 2014.
- P. Kaswan and S. Ulukus. Age of information with non-Poisson updates in cache-updating networks. In IEEE ISIT, June 2023.
- P. Kaswan and S. Ulukus. Timely tracking of a remote dynamic source via multi-hop renewal updates. In IEEE CDC, December 2023.
- S. M. Samuels. A characterization of the Poisson process. Journal of Applied Probability, 11(1):72–85, 1974.
- E. Delfani and N. Pappas. Version Age-Optimal Cached Status Updates in a Gossiping Network with Energy Harvesting Sensor. Available at arXiv:2311.01909.