{
  "slug": "queueing-delay",
  "term": "Queueing delay",
  "aliases": [
    "queuing delay",
    "queueing time"
  ],
  "definition": "Queueing delay is the time a request spends waiting for service at a specified resource rather than receiving service there.",
  "note": "For one nonpreemptive stage, Q = service start - arrival. With preemption, waiting can recur after processing begins; elapsed time until the first start is then only part of the wait. [queueing-practitioners]\n\nQueue length counts requests, while queueing delay measures time. Little's law uses matching boundaries: an occupancy that includes requests being processed needs residence time, not waiting time alone. [little2011]\n\nIn the existing synthetic FIFO trace, the second independent arrival waits 101 - 10 = 91 ms and then takes 1 ms to complete. Its 92 ms response therefore does not mean 92 ms of processing. [hesela-timing]\n\nIn a constructed preempt-resume example, A waits 4 ms after first starting and B waits zero. Across both completed requests, mean total waiting is 2 ms, not 4 ms. Counting distinct requests and summing all their waiting intervals is different from counting queue visits. [hesela-timing]",
  "status": "shipping",
  "advantages": [],
  "limitations": [],
  "supersedes": [],
  "supersededBy": [],
  "firstSeen": null,
  "lastSeen": null,
  "updated": "2026-11-20",
  "related": [
    "service-time",
    "latency-storage",
    "completion-latency",
    "little-law",
    "pollaczek-khinchine-formula",
    "kingman-approximation",
    "first-come-first-served",
    "head-of-line-blocking",
    "burkes-theorem",
    "tandem-queue",
    "request-slowdown"
  ],
  "citations": [
    {
      "id": "queueing-practitioners",
      "title": "Harchol-Balter and Scully: The most common queueing theory questions asked by computer systems practitioners, sections 1 and 2.1.",
      "url": "https://www.cs.cmu.edu/~harchol/Papers/TeaPACS21.pdf",
      "accessed": "2026-11-18"
    },
    {
      "id": "little2011",
      "title": "John D. C. Little: Little's Law as Viewed on Its 50th Anniversary (2011), pp. 537-539.",
      "url": "https://people.cs.umass.edu/~emery/classes/cmpsci691st/readings/OS/Littles-Law-50-Years-Later.pdf",
      "accessed": "2026-11-18"
    },
    {
      "id": "hesela-timing",
      "title": "Hesela: separating waiting and processing in the existing synthetic FIFO trace.",
      "url": "https://hesela.com/analyses/storage-latency-coordinated-omission/#service-and-waiting",
      "accessed": "2026-11-18"
    }
  ]
}
