Peak Age of Information in Priority Queuing Systems

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