English

Status Updates Through Multicast Networks

Information Theory 2018-09-25 v4 Networking and Internet Architecture math.IT

Abstract

Using age of information as the freshness metric, we examine a multicast network in which real-time status updates are generated by the source and sent to a group of nn interested receivers. We show that in order to keep the information freshness at each receiver, the source should terminate the transmission of the current update and start sending a new update packet as soon as it receives the acknowledgements back from any kk out of nn nodes. As the source stopping threshold kk increases, a node is more likely to get the latest generated update, but the age of the most recent update is more likely to become outdated. We derive the age minimized stopping threshold kk that balances the likelihood of getting the latest update and the freshness of the latest update for shifted exponential link delay. Through numerical evaluations for different stopping strategies, we find that waiting for the acknowledgements from the earliest kk out of nn nodes leads to lower average age than waiting for a pre-selected group of kk nodes. We also observe that a properly chosen threshold kk can prevent information staleness for increasing number of nodes nn in the multicast network.

Keywords

Cite

@article{arxiv.1709.02427,
  title  = {Status Updates Through Multicast Networks},
  author = {Jing Zhong and Emina Soljanin and Roy D. Yates},
  journal= {arXiv preprint arXiv:1709.02427},
  year   = {2018}
}

Comments

55th Allerton Conference on Communication, Control and Computing, 2017

R2 v1 2026-06-22T21:36:30.135Z