Gamgam, Ege OrkunAkar, Nail2023-02-252023-02-252022-05-27http://hdl.handle.net/11693/111717We 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.EnglishAge of Information (AoI)Buffer managementMarkov fluid queues (MFQs)Multisource queueing modelSchedulingArticle10.1109/JIOT.2022.31786572327-4662