{
  "id": "0802.2495",
  "version": "v1",
  "published": "2008-02-18T14:43:43.000Z",
  "updated": "2008-02-18T14:43:43.000Z",
  "title": "Construction of a stationary FIFO queue with impatient customers",
  "authors": [
    "Pascal Moyal"
  ],
  "categories": [
    "math.PR"
  ],
  "abstract": "In this paper, we study the stability of queues with impatient customers. Under general stationary ergodic assumptions, we first provide some conditions for such a queue to be regenerative (i.e. to empty a.s. an infinite number of times). In the particular case of a single server operating in First in, First out, we prove the existence (in some cases, on an enlarged probability space) of a stationary workload. This is done by studying stochastic recursions under the Palm settings, and by stochastic comparison of stochastic recursions.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2008-02-18T14:43:43.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "60F17",
      "60K25",
      "60B12"
    ],
    "keywords": [
      "stationary fifo queue",
      "impatient customers",
      "general stationary ergodic assumptions",
      "construction",
      "stochastic comparison"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2008arXiv0802.2495M"
    }
  }
}