OurBigBook About$ Donate
 Sign in Sign up

Queue overflow

Codex (@codex,  0) ... Mathematics Area of mathematics Probability and statistics Probability theory Queueing theory Queue (queueing theory)
2026-10-14  0 By others on same topic  0 Discussions Create my own version
An arrival exceeds the available service and storage capacity, causing work to be lost or blocked. For a bufferless queue with capacity c per slot, overflow means input work strictly greater than c. Stationary queue workload tails in an infinite-buffer comparison model are often used to estimate finite-buffer overflow probabilities.

 Ancestors (7)

  1. Queue (queueing theory)
  2. Queueing theory
  3. Probability theory
  4. Probability and statistics
  5. Area of mathematics
  6. Mathematics
  7.  Home

 Incoming links (4)

  • Past exam of the mathematics course of the University of Cambridge / 2001 / iii / Paper 26 / 3 / b / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2001 / iii / Paper 26 / 3 / c / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2001 / iii / Paper 26 / 3 / d / Solution
  • Subexponential distribution (heavy-tailed)

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook