Age-Delay Tradeoffs in Single Server Systems
Name
1901.04167.pdf
Description
Submitted version
Size
398.64 KB
Format
Adobe PDF
Checksum (MD5)
27f0b94488e0f2e134440674119164cf
Author(s)
Talak, Rajat Rajendra
Modiano, Eytan H
Date Issued
September 2019
Journal
IEEE International Symposium on Information Theory - Proceedings
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Talak, Rajat Rajendra and Modiano, Eytan H. 2019. "Age-Delay Tradeoffs in Single Server Systems." IEEE International Symposium on Information Theory - Proceedings, 2019-July.
Version
Original manuscript
Abstract
© 2019 IEEE. Information freshness and low latency communication is important to many emerging applications. While Age of Information (AoI) serves as a metric of information freshness, packet delay is a traditional metric of communication latency. We prove that there is a natural tradeoff between the AoI and packet delay. We consider a single server system, in which at most one update packet can be serviced at a time. The system designer controls the order in which the packets get serviced and the service time distribution, with a given service rate. We analyze two tradeoff problems that minimize packet delay and the variance in packet delay, respectively, subject to an average age constraint. We prove a strong age-delay and age-delay variance tradeoff, wherein, as the average age approaches its minimum, the delay and its variance approach infinity. We show that the service time distribution that minimizes average age, must necessarily have an unbounded-second moment.
MIT Department
Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/ISIT.2019.8849670
