{
  "id": "2002.05711",
  "version": "v1",
  "published": "2020-02-13T18:52:13.000Z",
  "updated": "2020-02-13T18:52:13.000Z",
  "title": "Age of Information with Gilbert-Elliot Servers and Samplers",
  "authors": [
    "Baturalp Buyukates",
    "Sennur Ulukus"
  ],
  "categories": [
    "cs.IT",
    "cs.NI",
    "eess.SP",
    "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}$ state $b$ and ${good}$ state $g$ where the server is faster in state $g$. We determine the time average age experienced by the monitor node and characterize the age-optimal state transition matrix $P$ 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}$ state $b$ and ${good}$ state $g$ where samples are more frequent in state $g$. We find the time average age experienced by the monitor node and characterize the age-optimal state transition matrix $P$.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2020-02-13T18:52:13.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "gilbert-elliot servers",
      "age-optimal state transition matrix",
      "finite state markov chain",
      "time average age",
      "monitor node"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}