Akar, NailLiyanaarachchi, SahanUlukus, Sennur2025-02-142025-02-142024979-8-3503-8448-22159-4228https://hdl.handle.net/11693/116264Date of Conference: 20 May 2024Conference Name: 2024 IEEE Conference on Computer Communications Workshops, INFOCOM WKSHPS 2024We study open-loop cyclic scheduling for generate-at-will (GAW) multi-source status update systems with heteroge-neous service times and packet drop probabilities, with the goal of minimizing the weighted sum age of information (AoI), called system AoI, or the weighted sum peak AoI (PAoI), called system PAoI. In particular, we propose an offline method to obtain a well-performing cyclic schedule, which can scale to very large number of information sources. Moreover, the proposed schedule has a very low online implementation complexity. The proposed schedules are comparatively studied against existing age-agnostic scheduling algorithms in terms of computational load and system AoI/PAoI performance, to validate their effectivenessEnglishSchedulesScheduling algorithmsConferencesInformation ageSchedulingComplexity theoryOptimizationConference Paper10.1109/INFOCOMWKSHPS61880.2024.10620720979-8-3503-8447-52833-0587