The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
On the Age of Information With Packet Deadlines
Abstract
We study the age of information, which is a measure of the freshness of a continually updated piece of information as observed at a remote monitor. The age of information metric has been studied for a variety of different queueing systems, and in this paper, we introduce a packet deadline as a control mechanism to study its impact on the average age of information for an M/M/1/2 queueing system. We analyze the system for the cases of a fixed deadline and a random exponential deadline and derive closed-form expressions for the average age. We also derive a closed-form expression for the optimal average deadline for the random exponential case. Our numerical results show the relationship of the age performance to that of the M/M/1/1 and M/M/1/2 systems, and we demonstrate that using a deadline can outperform both the M/M/1/1 and M/M/1/2 without deadline.
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
Scheduling algorithms for multiprogramming in a hard-real-time environment
Liu, C. L., & Layland, J. W. (1973) · Journal of the ACM · doi:10.1145/321738.321743 · Cited by 8,433 · cited 1×
“, [17], [18]).”
Cited by
Beyond Transmitting Bits: Context, Semantics, and Task-Oriented Communications
Gunduz, D., Qin, Z., Aguerri, I. E., Dhillon, H. S., Yang, Z., Yener, A., Wong, K. K., & Chae, C.-B. (2023) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2022.3223408 · Cited by 776
She, C., Sun, C., Gu, Z., Li, Y., Yang, C., Poor, H. V., & Vucetic, B. (2021) · Proceedings of the IEEE · doi:10.1109/jproc.2021.3053601 · Cited by 405
Metadata
- Authors
- Kam, C., Kompella, S., Nguyen, G. D., Wieselthier, J. E., & Ephremides, A.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2018-09
- Volume
- 64
- Issue
- 9
- Pages
- 6419-6428
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2792823915
- Cited by
- 163
- References
- 1
- FWCI
- 12.14
- Type
- journal article
- Language
- en
- Open access
- closed
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On the Age of Information With Packet Deadlines. https://app.cochat.ai/papers/10.1109/tit.2018.2818739
- The paper
- Kam, C., Kompella, S., Nguyen, G. D., Wieselthier, J. E., & Ephremides, A. (2018). On the Age of Information With Packet Deadlines. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2018.2818739
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.