English

Age of Information with Gilbert-Elliot Servers and Samplers

Information Theory 2020-02-14 v1 Networking and Internet Architecture Signal Processing math.IT

Abstract

We study age of information in a status updating system that consists of a single sampler, i.e., source node, that sends time-sensitive status updates to a single monitor node through a server node. We first consider a Gilbert-Elliot service profile at the server node. In this model, service times at the server node follow a finite state Markov chain with two states: bad{bad} state bb and good{good} state gg where the server is faster in state gg. We determine the time average age experienced by the monitor node and characterize the age-optimal state transition matrix PP with and without an average cost constraint on the service operation. Next, we consider a Gilbert-Elliot sampling profile at the source. In this model, the interarrival times follow a finite state Markov chain with two states: bad{bad} state bb and good{good} state gg where samples are more frequent in state gg. We find the time average age experienced by the monitor node and characterize the age-optimal state transition matrix PP.

Keywords

Cite

@article{arxiv.2002.05711,
  title  = {Age of Information with Gilbert-Elliot Servers and Samplers},
  author = {Baturalp Buyukates and Sennur Ulukus},
  journal= {arXiv preprint arXiv:2002.05711},
  year   = {2020}
}