English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

We study the scheduling problem for a multi-source single-servergenerate-at-will (GAW) status update system with sources having heterogeneousservice times and weights, with the goal of minimizing the weighted sum age ofinformation (AoI). In particular, we study \emph{age-agnostic} schedulers whichrely only on the first two moments of the source service times and they arerelatively easier to implement than their age-aware counterparts which make useof the actual realizations of the service times. In particular, we focus onage-agnostic cyclic schedulers with $O(1)$ runtime complexity where statusupdates from multiple sources are scheduled according to a fixed finitetransmission pattern. We first develop an analytical method to obtain the exactaverage AoI of each source when a transmission pattern is given. Then, wederive the optimum transmission pattern in closed form for the specific case oftwo sources. For general number of sources, we propose a novel algorithm,called IS (Insertion Search), for constructing transmission patterns, and weshow that IS is capable of producing the optimum pattern for two-sourcesystems, and it outperforms other existing age-agnostic schemes, for the caseof more than two sources. Numerical examples are presented to showcase theeffectiveness of the proposed approach.

Minimizing Age of Information with Generate at Will Status Updates and Age-Agnostic Cyclic Scheduling