# Gossiping with Binary Freshness Metric

@article{Bastopcu2021GossipingWB, title={Gossiping with Binary Freshness Metric}, author={Melih Bastopcu and Baturalp Buyukates and Sennur Ulukus}, journal={ArXiv}, year={2021}, volume={abs/2107.14218} }

We consider the binary freshness metric for gossip networks that consist of a single source and n end-nodes, where the end-nodes are allowed to share their stored versions of the source information with the other nodes. We develop recursive equations that characterize binary freshness in arbitrarily connected gossip networks using the stochastic hybrid systems (SHS) approach. Next, we study binary freshness in several structured gossip networks, namely disconnected, ring and fully connected… Expand

#### One Citation

Version Age of Information in Clustered Gossip Networks

- Computer Science, Engineering
- ArXiv
- 2021

This work considers a network consisting of a single source and n receiver nodes that are grouped into equal-sized clusters, and introduces hierarchy to the considered clustered gossip network model and shows that when the authors employ two levels of hierarchy, the network can achieve the same version age scaling without using dedicated cluster heads. Expand

#### References

SHOWING 1-10 OF 20 REFERENCES

Status updates through multicast networks

- Computer Science, Mathematics
- 2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
- 2017

A multicast network in which real-time status updates are generated by the source and sent to a group of n interested receivers is examined, and it is found that waiting for the acknowledgements from the earliest k out of n nodes leads to lower average age than waiting for a pre-selected group of k nodes. Expand

The Age of Gossip in Networks

- Computer Science, Mathematics
- 2021 IEEE International Symposium on Information Theory (ISIT)
- 2021

This work introduces a method for evaluating the average version age at each node in the network when nodes forward updates using a memoryless gossip protocol and it is shown that each node has average age that grows as the logarithm of the network size. Expand

Age of information in multihop multicast networks

- Computer Science, Engineering
- Journal of Communications and Networks
- 2019

We consider the age of information in a multihop multicast network where there is a single source node sending time-sensitive updates to nL end nodes, and L denotes the number of hops. In the first… Expand

Freshness Based Cache Updating in Parallel Relay Networks

- Computer Science, Engineering
- 2021 IEEE International Symposium on Information Theory (ISIT)
- 2021

An analytical expression for information freshness at the user is derived and it is observed that freshness for a file increases with increase in consolidation of rates across caches and an upper bound on the gap between the sub-optimal solution and the optimal solution is provided. Expand

Age of Information in Two-Hop Multicast Networks

- Computer Science
- 2018 52nd Asilomar Conference on Signals, Systems, and Computers
- 2018

It is shown that, using an earliest k transmission scheme, the age of information at the end nodes can be made a constant independent of n. Expand

Two Freshness Metrics for Local Cache Refresh

- Computer Science
- 2018 IEEE International Symposium on Information Theory (ISIT)
- 2018

The AoI optimal policy is derived, which depends only on the square root of the source popularity, and an AoS near-optimal rate allocation policy is proposed that is proportional to the cube root of both the source update rate and the sources popularity. Expand

Age of Information in Multicast Networks with Multiple Update Streams

- Computer Science, Engineering
- 2019 53rd Asilomar Conference on Signals, Systems, and Computers
- 2019

It is shown that using an earliest k1 and k2 transmission scheme for type I and type II updates, respectively, the age of information of both update streams at the receiver nodes can be made a constant independent of n. Expand

Multicast with Prioritized Delivery: How Fresh is Your Data?

- Computer Science, Mathematics
- 2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)
- 2018

This work considers a multicast network in which real-time status updates generated by a source are replicated and sent to multiple interested receiving nodes through independent links and analyzes the time-averaged age at both priority and non-priority nodes. Expand

Fresh Caching for Dynamic Content

- Computer Science
- IEEE INFOCOM 2021 - IEEE Conference on Computer Communications
- 2021

A framework and provably-efficient schemes for ‘fresh’ caching at the (front-end) local cache of content that is subject to ‘dynamic’ updates at the back-end database and an approach to the cache-unconstrained case, which reveals how the refresh dynamics and popularity of content affect the optimal caching. Expand

Effective page refresh policies for Web crawlers

- Computer Science
- TODS
- 2003

This article proposes various refresh policies and studies their effectiveness, and shows that a Poisson process is a good model to describe the changes of Web pages and improves the "freshness" of data very significantly. Expand