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/

Global: Zendy Plus annual

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

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We consider a multi-source network with a common monitor, where fresh updatesare generated at each source, following a Poisson process. At any time, at mostone source can transmit its update to the monitor, and transmission time forupdates of each source follows some general distribution. The goal is to find acausal scheduling policy such that at any time, the latest update available ateach source is fresh. In this paper, we quantify freshness using the age ofinformation (AoI) metric, and propose a randomized policy, which we show is3-competitive with respect to Pareto-optimal policies (that minimize theexpected average AoI of each source). We also show that for a particular choiceof the randomization parameter, the proposed randomized policy is 3-competitivewith respect to an optimal policy that minimizes the weighted sum of theexpected average AoI of all sources.

3-Competitive Policy for Minimizing Age of Information in Multi-Source M/G/1 Queuing Model