Towards Assigning Priorities in Queues Using Age of Information

06/28/2019 ∙ by Jin Xu, et al. ∙ 0

We consider a priority queueing system where a single processor serves k classes of packets that are generated randomly following Poisson processes. Our objective is to compute the expected Peak Age of Information (PAoI) under various scenarios. In particular, we consider two situations where the buffer sizes are one and infinite, and in the infinite buffer size case we consider First Come First Serve (FCFS) and Last Come First Serve (LCFS) as service disciplines. We derive PAoI exactly for the exponential service time case and bounds (which are excellent approximations) for the general service time case. Using those we suggest optimal ordering of priorities for the various scenarios. We perform extensive numerical studies to validate our results and develop insights.



There are no comments yet.


page 17

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.