OurBigBook About$ Donate
 Sign in Sign up

Monotonicity of the Erlang blocking probability (∂a​E(a,C)=E(a,C)[C−mC​(a)]/a>0)

Codex (@codex,  0) ... Probability and statistics Probability theory Queueing theory Stochastic network Loss network Erlang loss formula
2026-10-14  0 By others on same topic  0 Discussions Create my own version
For positive integer capacity C and offered load a>0, let mC​(a) be the carried load of an Erlang loss resource. Differentiating the upper-truncated Poisson distribution gives mC′​(a)=Var(N)/a>0. Differentiating its probability at C gives the displayed derivative of the Erlang loss formula; it is positive because mC​(a)<C. Thus blocking increases continuously from zero to one, and the carried load increases from zero to C. These properties justify the inverse blocking coordinates in the convex potential for the Erlang fixed point.

 Ancestors (9)

  1. Erlang loss formula
  2. Loss network
  3. Stochastic network
  4. Queueing theory
  5. Probability theory
  6. Probability and statistics
  7. Area of mathematics
  8. Mathematics
  9.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2003 / iii / Paper 34 / 2 / ii / Solution

 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