Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 31 May 2018 in cs.IT, cs.NI, eess.SP, and math.IT | (1805.12586v2)

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.

Citations (56)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.