Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Optimizing age-of-information in a multi-class queueing system

Optimizing age-of-information in a multi-class queueing system

Thumbnail Image
Download
Name

age-of-info-ISIT-arXiv-v1.pdf

Size

1.14 MB

Format

Adobe PDF

Checksum (MD5)

c2c85ddbc489d59d9bc2eb37b13f8be2

Author(s)
Huang, Longbo
•
Modiano, Eytan H.
Date Issued
June 2015
Journal
Proceedings of the 2015 IEEE International Symposium on Information Theory (ISIT)
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Huang, Longbo, and Eytan Modiano. “Optimizing Age-of-Information in a Multi-Class Queueing System,” 1681–85. IEEE, 2015.
Version
Author's final manuscript
Abstract
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.
MIT Department
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
http://creativecommons.org/licenses/by-nc-sa/4.0/
Persistent DSpace Link
http://hdl.handle.net/1721.1/100411
DOI of Published Version
https://doi.org/10.1109/ISIT.2015.7282742
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.