Scalable cyclic shedulers for age of information optimization in large-scale status update systems
Date
2024
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
BUIR Usage Stats
1
views
views
15
downloads
downloads
Citation Stats
Series
Abstract
We 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 effectiveness
Source Title
IEEE INFOCOM 2024 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)
Publisher
IEEE
Course
Other identifiers
Book Title
Degree Discipline
Degree Level
Degree Name
Citation
Permalink
Published Version (Please cite this version)
Language
English