The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Update or Wait: How to Keep Your Data Fresh
Open accessAbstract
In this paper, we study how to optimally manage the freshness of information updates sent from a source node to a destination via a channel. A proper metric for data freshness at the destination is the age-of-information, or simply age, which is defined as how old the freshest received update is, since the moment that this update was generated at the source node (e.g., a sensor). A reasonable update policy is the zero-wait policy, i.e., the source node submits a fresh update once the previous update is delivered, which achieves the maximum throughput and the minimum delay. Surprisingly, this zero-wait policy does not always minimize the age. This counter-intuitive phenomenon motivates us to study how to optimally control information updates to keep the data fresh and to understand when the zero-wait policy is optimal. We introduce a general age penalty function to characterize the level of dissatisfaction on data staleness and formulate the average age penalty minimization problem as a constrained semi-Markov decision problem with an uncountable state space. We develop efficient algorithms to find the optimal update policy among all causal policies and establish sufficient and necessary conditions for the optimality of the zero-wait policy. Our investigation shows that the zero-wait policy is far from the optimum if: 1) the age penalty function grows quickly with respect to the age; 2) the packet transmission times over the channel are positively correlated over time; or 3) the packet transmission times are highly random (e.g., following a heavy-tail distribution).
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Garreau, G. A., & Rudin, W. (1987) · The Statistician · doi:10.2307/2348852 · Cited by 10,622
(1995) · Cited by 10,558
Probability: Theory and Examples.
Prewitt, K., & Durrett, R. (1992) · Journal of the American Statistical Association · doi:10.2307/2290301 · Cited by 3,085
Real-time status: How often should one update?
Kaul, S., Yates, R., & Gruteser, M. (2012) · 2012 Proceedings IEEE INFOCOM · doi:10.1109/infcom.2012.6195689 · Cited by 2,360
Self-citationStochastic Network Optimization with Application to Communication and Queueing Systems
Neely, M. J. (2010) · Synthesis lectures on communication networks · doi:10.2200/s00271ed1v01y201006cnt007 · Cited by 2,218
Applied Probability Models with Optimization Applications.
Gani, J., & Ross, S. M. (1971) · Journal of the American Statistical Association · doi:10.2307/2284258 · Cited by 2,195
Parlar, M. (2000) · Interactive Operations Research with Maple · doi:10.1007/978-1-4612-1356-7_5 · Cited by 1,741
Constrained Markov Decision Processes: Stochastic Modeling
Altman, E. (2021) · Routledge eBooks · doi:10.1201/9781315140223 · Cited by 1,693
Stochastic Network Optimization with Application to Communication and Queueing Systems
Neely, M. J. (2010) · Synthesis Lectures on Learning, Networks, and Algorithms · doi:10.1007/978-3-031-79995-2 · Cited by 1,473
Probability: Theory and Examples
Durrett, R. (2010) · Cambridge University Press eBooks · doi:10.1017/cbo9780511779398 · Cited by 1,251
Online Learning and Online Convex Optimization
Shalev-Shwartz, S. (2012) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000018 · Cited by 1,246
Real and complex analisis / Walter Rudin
Rudin, W. (1987) · McGraw-Hill, Inc. eBooks · Cited by 1,117
Online Learning and Online Convex Optimization
Shalev-Shwartz, S. (2011) · now publishers, Inc. eBooks · doi:10.1561/9781601985477 · Cited by 1,095
Practical Lessons from Predicting Clicks on Ads at Facebook
He, X., Pan, J., Jin, O., Xu, T., Liu, B., Xu, T., Shi, Y., Atallah, A., Herbrich, R., Bowers, S., et al. (2014) · Proceedings of the Eighth International Workshop on Data Mining for Online Advertising · doi:10.1145/2648584.2648589 · Cited by 869
Finite State Markovian Decision Processes
Derman, C. (1970) · Cited by 853
Wide-Area Monitoring, Protection, and Control of Future Electric Power Networks
Terzija, V., Valverde, G., Cai, D., Regulski, P., Madani, V., Fitch, J., Skok, S., Begovic, M. M., & Phadke, A. (2011) · Proceedings of the IEEE · doi:10.1109/jproc.2010.2060450 · Cited by 761
Pedestrian Protection Systems: Issues, Survey, and Challenges
Gandhi, T., & Trivedi, M. M. (2007) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2007.903444 · Cited by 546
A Mobile GPRS-Sensors Array for Air Pollution Monitoring
Al-Ali, A. R., Zualkernan, I., & Aloul, F. (2010) · IEEE Sensors Journal · doi:10.1109/jsen.2010.2045890 · Cited by 361
Synchronizing a database to improve freshness
Cho, J., & Garcia-Molina, H. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335391 · Cited by 346
Optimizing age-of-information in a multi-class queueing system
Huang, L., & Modiano, E. (2015) · 2015 IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2015.7282742 · Cited by 334
Update or wait: How to keep your data fresh
Sun, Y. J., Uysal‐Biyikoglu, E., Yates, R. D., Koksal, C. E., & Shroff, N. B. (2016) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infocom.2016.7524524 · Cited by 217
Self-citationTwo-tiered wireless sensor network architecture for structural health monitoring
Kottapalli, V. A., Kiremidjian, A. S., Lynch, J. P., Carryer, E., Kenny, T. W., Law, K. H., & Lei, Y. (2003) · SPIE Proceedings · doi:10.1117/12.482717 · Cited by 205
Synchronizing a database to improve freshness
Cho, J. J., & García-Molina, H. (2000) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/342009.335391 · Cited by 170
Constrained Semi-Markov decision processes with average rewards
Feinberg, E. A. (1994) · Mathematical Methods of Operations Research · doi:10.1007/bf01435458 · Cited by 97
Time-average optimal constrained semi-Markov decision processes
Beutler, F. J., & Ross, K. W. (1986) · Advances in Applied Probability · doi:10.2307/1427303 · Cited by 84
Performance of multiversion concurrency control algorithms in maintaining temporal consistency
Song, X., & Liu, J. W. S. (2002) · IEEE Annual International Computer Software and Applications Conference (COMPSAC) · doi:10.1109/cmpsac.1990.139341 · Cited by 70
Optimal Update Policies for Distributed Materialized Views
Segev, A., & Fang, W. (1991) · Management Science · doi:10.1287/mnsc.37.7.851 · Cited by 49
Cited by
Age of Information: An Introduction and Survey
Yates, R. D., Sun, Y., Brown, D. R., Kaul, S. K., Modiano, E., & Ulukus, S. (2021) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2021.3065072 · Cited by 1,160
Self-citationOn the Role of Age of Information in the Internet of Things
Abd-Elmagid, M. A., Pappas, N., & Dhillon, H. S. (2019) · IEEE Communications Magazine · doi:10.1109/mcom.001.1900041 · Cited by 377
Metadata
- Authors
- Sun, Y., Uysal-Biyikoglu, E., Yates, R. D., Koksal, C. E., & Shroff, N. B.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2017-11
- Volume
- 63
- Issue
- 11
- Pages
- 7492-7508
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2744248483
- Cited by
- 817
- References
- 28
- FWCI
- 53.02
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.