Pith. sign in

REVIEW

Age of Information With Non-Poisson Updates in Cache-Updating Networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2301.13830 v1 pith:RRMZPW6P submitted 2023-01-31 cs.IT cs.NIeess.SPmath.IT

classification cs.ITcs.NIeess.SPmath.IT
keywords informationnetworksexpectedinter-updatemulti-hoptimesdistributionsinstantaneous
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We study age of information in multi-hop multi-cast cache-enabled networks where the inter-update times on the links are not necessarily exponentially distributed. We focus on the set of non-arithmetic distributions for inter-update times, which includes continuous probability distributions as a subset. We first characterize instantaneous age of information at each node for arbitrary networks. We then explicate the recursive equations for instantaneous age of information in multi-hop networks and derive closed form expressions for expected age of information at an end-user. We show that expected age in multi-hop networks exhibits an additive structure. Further, we show that the expected age at each user is directly proportional to the variance of inter-update times at all links between a user and the source. We expect the analysis in this work to help alleviate the over-dependence on Poisson processes for future work in age of information.

Discussion (0). Continue with ORCID to comment.

Pith tools