We study cyclic scheduling for generate-at-will (GAW) multi-source status update systems with heterogeneous service times and packet drop probabilities, with the aim 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 obtain well-performing cyclic schedulers which can easily scale to thousands of information sources and which also have low online implementation complexity. The proposed schedulers are comparatively studied against existing scheduling algorithms in terms of computational load and system AoI/PAoI performance, to validate their effectiveness.

翻译：我们研究基于生成意愿（GAW）的多源状态更新系统在异构服务时间和数据包丢弃概率条件下的循环调度问题，旨在最小化加权和信息年龄（AoI）（称为系统AoI）或加权和峰值AoI（PAoI）（称为系统PAoI）。具体而言，我们设计了性能优异的循环调度器，这些调度器可轻松扩展至数千个信息源，且在线实现复杂度低。通过将所提调度器与现有调度算法在计算负载和系统AoI/PAoI性能方面进行对比研究，验证了其有效性。