Age of Gossip with the Push-Pull Protocol
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909330926731264 |
|---|---|
| author | Srivastava, Arunabh Maranzatto, Thomas Jacob Ulukus, Sennur |
| author_facet | Srivastava, Arunabh Maranzatto, Thomas Jacob Ulukus, Sennur |
| contents | We consider a wireless network where a source generates packets and forwards them to a network containing $n$ nodes. The nodes in the network use the asynchronous push, pull or push-pull gossip communication protocols to maintain the most recent updates from the source. We use the version age of information metric to quantify the freshness of information in the network. Prior to this work, only the push gossiping protocol has been studied for age of information analysis. In this paper, we use the stochastic hybrid systems (SHS) framework to obtain recursive equations for the expected version age of sets of nodes in the time limit. We then show that the pull and push-pull protocols can achieve constant version age, while it is already known that the push protocol can only achieve logarithmic version age. We then show that the push-pull protocol performs better than the push and the pull protocol. Finally, we carry out numerical simulations to evaluate these results. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_20490 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Age of Gossip with the Push-Pull Protocol Srivastava, Arunabh Maranzatto, Thomas Jacob Ulukus, Sennur Information Theory Networking and Internet Architecture Signal Processing We consider a wireless network where a source generates packets and forwards them to a network containing $n$ nodes. The nodes in the network use the asynchronous push, pull or push-pull gossip communication protocols to maintain the most recent updates from the source. We use the version age of information metric to quantify the freshness of information in the network. Prior to this work, only the push gossiping protocol has been studied for age of information analysis. In this paper, we use the stochastic hybrid systems (SHS) framework to obtain recursive equations for the expected version age of sets of nodes in the time limit. We then show that the pull and push-pull protocols can achieve constant version age, while it is already known that the push protocol can only achieve logarithmic version age. We then show that the push-pull protocol performs better than the push and the pull protocol. Finally, we carry out numerical simulations to evaluate these results. |
| title | Age of Gossip with the Push-Pull Protocol |
| topic | Information Theory Networking and Internet Architecture Signal Processing |
| url | https://arxiv.org/abs/2409.20490 |