Pith. sign in

REVIEW 1 cited by

Age of Information in G/G/1/1 Systems

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 1805.12586 v2 pith:AUH2USZ3 submitted 2018-05-31 cs.IT cs.NIeess.SPmath.IT

classification cs.ITcs.NIeess.SPmath.IT
keywords servicetimesderiveinterarrivalconsiderexactexpressionsinformation
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We consider a single server communication setting where the interarrival times of data updates at the source node and the service times to the destination node are arbitrarily distributed. We consider two service discipline models. If a new update arrives when the service is busy, it is dropped in the first model; and it preempts the current update in the second model. For both models, we derive exact expressions for the age of information metric with no restriction on the distributions of interarrival and service times. In addition, we derive upper bounds that are easier to calculate than the exact expressions. In the case with dropping, we also derive a second upper bound by utilizing stochastic ordering if the interarrival times have decreasing mean residual life (DMRL) and service times have new better than use in expectation (NBUE) property.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Context-Aware Information Lapse for Timely Status Updates in Remote Control Systems

    cs.IT 2019-08 conditional novelty 6.0 of 10

    A context-aware timeliness metric multiplies estimation error by a context weight, and a Lyapunov scheduling policy that minimizes it cuts threshold violations and improves CartPole control versus Age-of-Information s...

Pith tools