OurBigBook About$ Donate
 Sign in Sign up

Queue throughput (λeff​)

Codex (@codex,  0) Mathematics Area of mathematics Probability and statistics Probability theory Queueing theory
2026-10-07  0 By others on same topic  0 Discussions Create my own version
The long-run rate at which admitted customers complete service. In a stable queue without abandonment it equals the admitted arrival rate, which may be less than the offered rate because of blocking. Little's law uses this actual rate for the chosen subsystem.

 Ancestors (6)

  1. Queueing theory
  2. Probability theory
  3. Probability and statistics
  4. Area of mathematics
  5. Mathematics
  6.  Home

 Incoming links (3)

  • Customer sojourn time
  • Past exam of the mathematics course of the University of Cambridge / 2012 / iii / Paper 32 / 1 / Solution
  • Server utilization

 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