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

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...

Full description

Bibliographic Details
Main Authors: Huang, Longbo (Author), Modiano, Eytan H. (Contributor)
Other Authors: Massachusetts Institute of Technology. Department of Aeronautics and Astronautics (Contributor)
Format: Article
Language:English
Published: Institute of Electrical and Electronics Engineers (IEEE), 2015-12-17T13:10:56Z.
Subjects:
Online Access:Get fulltext
LEADER 02248 am a22002893u 4500
001 100411
042 |a dc 
100 1 0 |a Huang, Longbo  |e author 
100 1 0 |a Massachusetts Institute of Technology. Department of Aeronautics and Astronautics  |e contributor 
100 1 0 |a Modiano, Eytan H.  |e contributor 
700 1 0 |a Modiano, Eytan H.  |e author 
245 0 0 |a Optimizing age-of-information in a multi-class queueing system 
260 |b Institute of Electrical and Electronics Engineers (IEEE),   |c 2015-12-17T13:10:56Z. 
856 |z Get fulltext  |u http://hdl.handle.net/1721.1/100411 
520 |a 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. 
520 |a National Basic Research Program of China (973 Program) (Grant 2011CBA00300) 
520 |a National Basic Research Program of China (973 Program) (Grant 2011CBA00301) 
520 |a National Natural Science Foundation (China) (Grant 61033001) 
520 |a National Natural Science Foundation (China) (Grant 61361136003) 
520 |a National Natural Science Foundation (China) (Grant 61303195) 
520 |a Tsinghua University (Beijing, China) (Initiative Research Grant) 
520 |a China Youth 1000-talent Grant 
520 |a National Science Foundation (U.S.) (Grant CNS-1217048) 
520 |a United States. Office of Naval Research (N00014-12-1-0064) 
546 |a en_US 
655 7 |a Article 
773 |t Proceedings of the 2015 IEEE International Symposium on Information Theory (ISIT)