The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Optimizing age-of-information in a multi-class queueing system
Open accessAbstract
We consider the age-of-information in a multi-class M/G/1 queueing system, where each class generates packets containing status information. Age of information is a relatively new metric that measures the amount of time that elapsed between status updates, thus accounting for both the queueing delay and the delay between packet generation. This gives rise to a tradeoff between frequency of status updates, and queueing delay. In this paper, we study this tradeoff in a system with heterogenous users modeled as a multi-class M/G/1 queue. To this end, we derive the exact peak age-of-Information (PAoI) profile of the system, which measures the “freshness” of the status information. We then seek to optimize the age of information, by formulating the problem using quasiconvex optimization, and obtain structural properties of the optimal solution.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cited by
Update or Wait: How to Keep Your Data Fresh
Sun, Y., Uysal-Biyikoglu, E., Yates, R. D., Koksal, C. E., & Shroff, N. B. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2735804 · Cited by 817
Optimal Status Update for Age of Information Minimization With an Energy Harvesting Source
Wu, X., Yang, J., & Wu, J. (2018) · IEEE Transactions on Green Communications and Networking · doi:10.1109/tgcn.2017.2778501 · Cited by 313
Metadata
- Authors
- Huang, L., & Modiano, E.
- Venue
- 2015 IEEE International Symposium on Information Theory (ISIT)
- Publisher
- IEEE
- Published
- 2015-06
- Pages
- 1681-1685
- OpenAlex
- W1677318746
- Cited by
- 334
- References
- 1
- FWCI
- 14.73
- Type
- conference paper
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Optimizing age-of-information in a multi-class queueing system. https://app.cochat.ai/papers/10.1109/isit.2015.7282742
- The paper
- Huang, L., & Modiano, E. (2015). Optimizing age-of-information in a multi-class queueing system. 2015 IEEE International Symposium on Information Theory (ISIT). https://doi.org/10.1109/isit.2015.7282742
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.
