{
  "slug": "tandem-queue",
  "term": "Tandem queue",
  "aliases": [
    "queues in tandem",
    "serial queueing stages"
  ],
  "definition": "A tandem queue is a sequence of queues in which a departure from one stage becomes an arrival at the next.",
  "note": "Stage boundaries: a request can wait and receive service several times along a serial path. The downstream arrival process is the upstream departure process, not automatically the external input process shifted by a constant. Queueing time at one stage is not end-to-end latency. [martin]\n\nFor a stationary tandem with independent exponential servers, Poisson input of rate lambda and unlimited buffers, Burke's theorem propagates the Poisson output law when lambda is below every service rate. The independence assumptions concern the server processes, not two independent copies of the same request stream. [martin] [keane]\n\nWith nonpreemptive fixed serial service duration s, departure i obeys D_i = max(A_i, D_(i-1)) + s. Therefore D_i - D_(i-1) >= s. With s = 1 ms and Poisson input lambda = 0.5 per ms, utilization is 0.5, yet output gaps below 1 ms are impossible. A Poisson stream at that rate would have 1 - exp(-0.5) = 39.35% of its gaps below 1 ms. This is a constructed analytic comparison, not a fitted device model.\n\nFor storage modeling, retain the arrival and departure timestamps at each chosen stage. Batching, finite buffers, feedback and request-dependent processing can change downstream timing. The serial topology alone grants neither Poisson arrivals nor independent delays. [martin]",
  "status": "research",
  "advantages": [],
  "limitations": [],
  "related": [
    "burkes-theorem",
    "service-time",
    "queueing-delay"
  ],
  "supersedes": [],
  "supersededBy": [],
  "firstSeen": null,
  "lastSeen": null,
  "updated": "2026-11-20",
  "citations": [
    {
      "id": "martin",
      "title": "Martin and Prabhakar: Fixed points for multi-class queues (2010), sections 1-2; independent tandem servers and output processes.",
      "url": "https://arxiv.org/pdf/1003.3024v1",
      "accessed": "2026-11-20"
    },
    {
      "id": "keane",
      "title": "Keane and O'Connell: The M/M/1 queue is Bernoulli (2008), section 1; the stationary output theorem.",
      "url": "https://arxiv.org/pdf/0804.3935v1",
      "accessed": "2026-11-20"
    }
  ],
  "provenance": [
    "The fixed-duration recurrence and exponential-gap probability are exact illustrative mathematics. No storage trace or empirical distribution was estimated.",
    "A serial queue model omits parallel device execution unless that concurrency is explicitly represented."
  ]
}
