Minimizing Age of Information with Generate at Will Status Updates and Age-Agnostic Cyclic Scheduling
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913467971141632 |
|---|---|
| author | Gamgam, Ege Orkun Akar, Nail Ulukus, Sennur |
| author_facet | Gamgam, Ege Orkun Akar, Nail Ulukus, Sennur |
| contents | We study the scheduling problem for a multi-source single-server generate-at-will (GAW) status update system with sources having heterogeneous service times and weights, with the goal of minimizing the weighted sum age of information (AoI). In particular, we study \emph{age-agnostic} schedulers which rely only on the first two moments of the source service times and they are relatively easier to implement than their age-aware counterparts which make use of the actual realizations of the service times. In particular, we focus on age-agnostic cyclic schedulers with $O(1)$ runtime complexity where status updates from multiple sources are scheduled according to a fixed finite transmission pattern. We first develop an analytical method to obtain the exact average AoI of each source when a transmission pattern is given. Then, we derive the optimum transmission pattern in closed form for the specific case of two sources. For general number of sources, we propose a novel algorithm, called IS (Insertion Search), for constructing transmission patterns, and we show that IS is capable of producing the optimum pattern for two-source systems, and it outperforms other existing age-agnostic schemes, for the case of more than two sources. Numerical examples are presented to showcase the effectiveness of the proposed approach. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2311_18791 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Minimizing Age of Information with Generate at Will Status Updates and Age-Agnostic Cyclic Scheduling Gamgam, Ege Orkun Akar, Nail Ulukus, Sennur Information Theory Networking and Internet Architecture We study the scheduling problem for a multi-source single-server generate-at-will (GAW) status update system with sources having heterogeneous service times and weights, with the goal of minimizing the weighted sum age of information (AoI). In particular, we study \emph{age-agnostic} schedulers which rely only on the first two moments of the source service times and they are relatively easier to implement than their age-aware counterparts which make use of the actual realizations of the service times. In particular, we focus on age-agnostic cyclic schedulers with $O(1)$ runtime complexity where status updates from multiple sources are scheduled according to a fixed finite transmission pattern. We first develop an analytical method to obtain the exact average AoI of each source when a transmission pattern is given. Then, we derive the optimum transmission pattern in closed form for the specific case of two sources. For general number of sources, we propose a novel algorithm, called IS (Insertion Search), for constructing transmission patterns, and we show that IS is capable of producing the optimum pattern for two-source systems, and it outperforms other existing age-agnostic schemes, for the case of more than two sources. Numerical examples are presented to showcase the effectiveness of the proposed approach. |
| title | Minimizing Age of Information with Generate at Will Status Updates and Age-Agnostic Cyclic Scheduling |
| topic | Information Theory Networking and Internet Architecture |
| url | https://arxiv.org/abs/2311.18791 |