Exact analytical model of age of information in multi-source status update systems with per-source queueing

Date
2022-05-27
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
Source Title
IEEE Internet of Things Journal
Print ISSN
Electronic ISSN
2327-4662
Publisher
IEEE
Volume
9
Issue
20
Pages
20706 - 20718
Language
English
Type
Article
Journal Title
Journal ISSN
Volume Title
Series
Abstract

We study a multisource status update system with Poisson information packet arrivals and exponentially distributed service times. The server is equipped with a waiting room holding the freshest packet from each source referred to as single buffer per-source queueing (SBPSQ). The sources are assumed to be equally important, i.e., (nonweighted) average Age of Information (AoI) or average age violation probability are used as the information freshness metrics to optimize for, and subsequently, two symmetric SBPSQ-based scheduling policies are studied in this article, namely, first source first serve (FSFS) and the earliest served first serve (ESFS) policies. By employing the theory of Markov fluid queues (MFQs), an analytical model is proposed to obtain the exact distribution of the AoI for each source when the FSFS and ESFS policies are employed at the server. Additionally, a benchmark scheduling-free scheme named single buffer with replacement (SBR), which uses a single buffer to hold the freshest packet across all sources, is also studied with a similar but less complex analytical model. We comparatively study the performance of the three policies through numerical examples in terms of the average AoI and the age violation probability averaged across all sources, in a scenario of sources possessing different traffic intensities but sharing a common service time.

Course
Other identifiers
Book Title
Keywords
Age of Information (AoI), Buffer management, Markov fluid queues (MFQs), Multisource queueing model, Scheduling
Citation
Published Version (Please cite this version)