Scalable Cyclic Schedulers for Age of Information Optimization in Large-Scale Status Update Systems
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866913191364132864 |
|---|---|
| author | Akar, Nail Liyanaarachchi, Sahan Ulukus, Sennur |
| author_facet | Akar, Nail Liyanaarachchi, Sahan Ulukus, Sennur |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_04904 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Scalable Cyclic Schedulers for Age of Information Optimization in Large-Scale Status Update Systems Akar, Nail Liyanaarachchi, Sahan Ulukus, Sennur Information Theory Networking and Internet Architecture Performance 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. |
| title | Scalable Cyclic Schedulers for Age of Information Optimization in Large-Scale Status Update Systems |
| topic | Information Theory Networking and Internet Architecture Performance |
| url | https://arxiv.org/abs/2401.04904 |