Name
Abstract | ||
|---|---|---|
We consider a cache refresh system where a local server is connected to multiple remote sources and maintains local copies of the data items at the sources. The data at each source is updated randomly and independently without notifying the local server, while the local server refreshes the corresponding cached data periodically. The freshness of the local cache is measured by two different freshness metrics, age of synchronization (AoS) and age of information (AoI). We address the following problem: given a constrained total refresh rate, how does the local server allocate the refresh rate for each source to maintain overall data freshness? We derive the AoI optimal policy which depends only on the square root of the source popularity. For a large refresh rate, we propose an AoS near-optimal rate allocation policy that is proportional to the cube root of both the source update rate and the source popularity. For small refresh rates, we also prove that the square root law with respect to the popularity minimizes both AoS and AoI. |
Year | Venue | Field |
|---|---|---|
2018 | 2018 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) | Discrete mathematics,Synchronization,Cache,Computer science,Popularity,Computer network,Cube root,Refresh rate,Penrose square root law,Square root |
DocType | Citations | PageRank |
Conference | 3 | 0.43 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jing Zhong | 1 | 47 | 6.21 |
| Roy D. Yates | 2 | 1889 | 266.12 |
| Emina Soljanin | 3 | 708 | 61.35 |