{
  "slug": "burkes-theorem",
  "term": "Burke's theorem",
  "aliases": [
    "Burke output theorem",
    "Burkes theorem"
  ],
  "definition": "Burke's theorem states that departures from a stationary M/M/1 queue form a Poisson process with the same rate as its arrivals.",
  "note": "Scope: use a stable single-server queue with Poisson arrival rate lambda, iid exponential service times of rate mu independent of arrivals, unlimited waiting space and lambda < mu. The output law is a stationary result, not a claim about a queue just started empty. [keane]\n\nThe theorem preserves the distribution of the arrival stream through this queue, not its actual timestamps. Input and output are not independent copies: conservation gives departures = arrivals + initial occupancy - final occupancy over the same interval. Equal mean rates alone do not establish a Poisson output. [keane]\n\nIn a tandem of independent M/M/1 servers, departures can therefore feed the next stage as Poisson arrivals. Each stage must remain stable. Shared request sizes, backpressure or a non-exponential stage require a separate model; the theorem does not validate a storage pipeline merely because its external arrivals are Poisson. [martin]\n\nCounterexample: with one nonpreemptive serial server taking exactly 1 ms per request, consecutive departures are at least 1 ms apart even for Poisson input. A Poisson stream of positive rate has a positive probability of shorter gaps, so this fixed-duration output cannot be Poisson. This is a mathematical support argument, not a measured workload. [hesela-tandem]",
  "status": "research",
  "advantages": [],
  "limitations": [],
  "related": [
    "tandem-queue",
    "pasta",
    "queueing-delay"
  ],
  "supersedes": [],
  "supersededBy": [],
  "firstSeen": null,
  "lastSeen": null,
  "updated": "2026-11-20",
  "citations": [
    {
      "id": "keane",
      "title": "Keane and O'Connell: The M/M/1 queue is Bernoulli (2008), section 1; arXiv:0804.3935v1.",
      "url": "https://arxiv.org/pdf/0804.3935v1",
      "accessed": "2026-11-20"
    },
    {
      "id": "martin",
      "title": "Martin and Prabhakar: Fixed points for multi-class queues (2010), sections 1-2; arXiv:1003.3024v1.",
      "url": "https://arxiv.org/pdf/1003.3024v1",
      "accessed": "2026-11-20"
    },
    {
      "id": "burke1956",
      "title": "Paul J. Burke: The Output of a Queuing System, Operations Research 4(6), 699-704 (1956).",
      "url": "https://doi.org/10.1287/opre.4.6.699",
      "accessed": "2026-11-20"
    },
    {
      "id": "hesela-tandem",
      "title": "Hesela: tandem queues and the fixed-duration departure-gap counterexample.",
      "url": "https://hesela.dev/terms/tandem-queue/",
      "accessed": "2026-11-20"
    }
  ],
  "provenance": [
    "The original 1956 publisher record establishes attribution and scope; the open 2008 and 2010 research manuscripts supply the inspected mathematical formulation.",
    "The fixed-duration counterexample follows directly from serial service. It is not a simulation, hardware measurement or a novel theorem."
  ]
}
