This is not the latest version of this item. The latest version can be found here.
When a Heavy Tailed Service Minimizes Age of Information
Name
ISIT_2019b (rajat).pdf
Description
Accepted version
Size
305.03 KB
Format
Adobe PDF
Checksum (MD5)
c14d4b3a9a3446a35b3e86f07b9309d1
Author(s)
Talak, Rajat
Karaman, Sertac
Modiano, Eytan
Date Issued
2019
Journal
IEEE International Symposium on Information Theory - Proceedings
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Talak, Rajat, Karaman, Sertac and Modiano, Eytan. 2019. "When a Heavy Tailed Service Minimizes Age of Information." IEEE International Symposium on Information Theory - Proceedings, 2019-July.
Version
Author's final manuscript
Abstract
© 2019 IEEE. Age-of-information (AoI) is a newly proposed performance metric of information freshness. It differs from the traditional delay metric, because it is destination centric and measures the time that elapsed since the last received fresh information update was generated at the source. We show that AoI and packet delay differ in a fundamental way in certain systems, i.e. minimizing one can imply maximizing the other.We consider two queueing systems, namely a single server last come first serve queue with preemptive service (LCFSp) and G/G/∞ queue, and show that a heavy tailed service distribution, that results in the worst case packet delay or variance in packet delay, respectively, minimizes AoI. For the specific case of M/G/1 LCFSp and G/G/∞ queue, we also prove that deterministic service, that minimizes packet delay and variance in packet delay, respectively, results in the worst case AoI.
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
10.1109/ISIT.2019.8849697
