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

May 31, 2018 Β· Declared Dead Β· πŸ› Asilomar Conference on Signals, Systems and Computers

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Alkan Soysal, Sennur Ulukus arXiv ID 1805.12586 Category cs.IT: Information Theory Cross-listed cs.NI, eess.SP Citations 58 Venue Asilomar Conference on Signals, Systems and Computers Last Checked 5 months ago
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Information Theory

Died the same way β€” πŸ‘» Ghosted