Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Age of $k$-out-of-$n$ Systems on a Gossip Network (2402.11462v2)

Published 18 Feb 2024 in cs.IT, cs.NI, cs.SY, eess.SY, and math.IT

Abstract: We consider information update systems on a gossip network, which consists of a single source and $n$ receiver nodes. The source encrypts the information into $n$ distinct keys with version stamps, sending a unique key to each node. For decoding the information in a $k$-out-of-$n$ system, each receiver node requires at least $k+1$ different keys with the same version, shared over peer-to-peer connections. Each node determines $k$ based on a given function, ensuring that as $k$ increases, the precision of the decoded information also increases. We consider two different schemes: a memory scheme (in which the nodes keep the source's current and previous encrypted messages) and a memoryless scheme (in which the nodes are allowed to only keep the source's current message). We measure the ''timeliness'' of information updates by using the $k$-keys version age of information. Our work focuses on determining closed-form expressions for the time average age of information in a heterogeneous random graph under both with memory and memoryless schemes.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (33)
  1. D. Shah, “Gossip algorithms,” Foundations and Trends in Networking, vol. 3, no. 1, pp. 1–125, 2009.
  2. E. Bayram, M.-A. Belabbas, and T. Başar, “Vector-valued gossip over w𝑤witalic_w-holonomic networks,” arXiv preprint arXiv:2311.04455, 2023.
  3. F. Gustafsson and F. Gunnarsson, “Positioning using time-difference of arrival measurements,” in 2003 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2003. Proceedings.(ICASSP’03)., vol. 6.   IEEE, 2003, pp. VI–553.
  4. V. Varadharajan, P. Allen, and S. Black, “An analysis of the proxy problem in distributed systems,” in Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy.   IEEE Computer Society, 1991, pp. 255–255.
  5. M.-S. Hwang, E. J.-L. Lu, and I.-C. Lin, “A practical (t, n) threshold proxy signature scheme based on the rsa cryptosystem,” IEEE Transactions on knowledge and data Engineering, vol. 15, no. 6, pp. 1552–1560, 2003.
  6. A. Shamir, “How to share a secret,” Communications of the ACM, vol. 22, no. 11, pp. 612–613, 1979.
  7. G. R. Blakley, “Safeguarding cryptographic keys,” in Managing Requirements Knowledge, International Workshop on.   IEEE Computer Society, 1979, pp. 313–313.
  8. S. K. Kaul, R. D. Yates, and M. Gruteser, “Real-time status: How often should one update?” in IEEE Infocom, March 2012.
  9. A. Soysal and S. Ulukus, “Age of information in G/G/1/1 systems: Age expressions, bounds, special cases, and optimization,” IEEE Transactions on Information Theory, vol. 67, no. 11, pp. 7477–7489, 2021.
  10. B. T. Bacinoglu, E. T. Ceran, and E. Uysal-Biyikoglu, “Age of information under energy replenishment constraints,” in UCSD ITA, February 2015.
  11. A. Arafa, J. Yang, S. Ulukus, and H. V. Poor, “Age-minimal transmission for energy harvesting sensors with finite batteries: Online policies,” IEEE Transactions on Information Theory, vol. 66, no. 1, pp. 534–556, January 2020.
  12. M. Bastopcu and S. Ulukus, “Information freshness in cache updating systems,” IEEE Transactions on Wireless Communications, vol. 20, no. 3, pp. 1861–1874, 2021.
  13. Y. Sun, Y. Polyanskiy, and E. Uysal, “Sampling of the wiener process for remote estimation over a channel with random delay,” IEEE Transactions on Information Theory, vol. 66, no. 2, pp. 1118–1135, February 2020.
  14. B. Buyukates and S. Ulukus, “Timely distributed computation with stragglers,” IEEE Transactions on Communications, vol. 68, no. 9, pp. 5273–5282, 2020.
  15. M. A. Abd-Elmagid, H. S. Dhillon, and N. Pappas, “A reinforcement learning framework for optimizing age of information in rf-powered communication systems,” IEEE Transactions on Communications, vol. 68, no. 8, pp. 4747–4760, August 2020.
  16. R. D. Yates, Y. Sun, D. R. Brown, S. K. Kaul, E. Modiano, and S. Ulukus, “Age of information: An introduction and survey,” IEEE Journal on Selected Areas in Communications, vol. 39, no. 5, pp. 1183–1210, May 2021.
  17. R. D. Yates, “The age of gossip in networks,” in IEEE ISIT, July 2021, pp. 2984–2989.
  18. B. Abolhassani, J. Tadrous, A. Eryilmaz, and E. Yeh, “Fresh caching for dynamic content,” in IEEE Infocom, May 2021, pp. 1–10.
  19. B. E. Brewington and G. Cybenko, “Keeping up with the changing web,” Computer, vol. 33, no. 5, pp. 52–58, May 2000.
  20. 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, pp. 2215–2228, October 2020.
  21. E. Uysal, O. Kaya, A. Ephremides, J. Gross, M. Codreanu, P. Popovski, M. Assaad, G. Liva, A. Munari, B. Soret, T. Soleymani, and K. H. Johansson, “Semantic communications in networked systems: A data significance perspective,” IEEE Network, vol. 36, no. 4, pp. 233–240, 2022.
  22. J. Zhong, E. Soljanin, and R. D. Yates, “Status updates through multicast networks,” in Allerton Conference, October 2017.
  23. R. D. Yates and S. K. Kaul, “The age of information: Real-time status updating by multiple sources,” IEEE Transactions on Information Theory, vol. 65, no. 3, pp. 1807–1827, 2019.
  24. B. Buyukates, M. Bastopcu, and S. Ulukus, “Version age of information in clustered gossip networks,” IEEE Journal on Selected Areas in Information Theory, vol. 3, no. 1, pp. 85–97, March 2022.
  25. M. Bastopcu, B. Buyukates, and S. Ulukus, “Gossiping with binary freshness metric,” in 2021 IEEE Globecom, December 2021.
  26. P. Mitra and S. Ulukus, “Age-aware gossiping in network topologies,” April 2023.
  27. E. Delfani and N. Pappas, “Version age-optimal cached status updates in a gossiping network with energy harvesting sensor,” 2023.
  28. P. Kaswan and S. Ulukus, “Timestomping vulnerability of age-sensitive gossip networks,” IEEE Transactions on Communications, pp. 1–1, January 2024.
  29. ——, “Choosing outdated information to achieve reliability in age-based gossiping,” 2023.
  30. M. Bastopcu, S. R. Etesami, and T. Başar, “The role of gossiping in information dissemination over a network of agents,” Entropy, vol. 26, no. 1, 2024. [Online]. Available: https://www.mdpi.com/1099-4300/26/1/9
  31. P. Kaswan and S. Ulukus, “Information mutation and spread of misinformation in timely gossip networks,” 2023.
  32. P. Kaswan, P. Mitra, A. Srivastava, and S. Ulukus, “Age of information in gossip networks: A friendly introduction and literature survey,” 2023.
  33. R. G. Gallager, “Discrete stochastic processes,” Journal of the Operational Research Society, vol. 48, no. 1, pp. 103–103, 1997.
Citations (1)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now