Erlang B Finite-Server Loss
Fill a finite set of servers and see when arrivals are lost instead of queued.
Free theory articleFill a finite set of servers and see when arrivals are lost instead of queued.
Concept & interpretation
This module demonstrates the Erlang B formula for calculating the blocking probability of a finite-capacity system with Poisson arrivals and exponential service times.
Experiment
To explore the Erlang B model, use the interactive module at https://riano.app/module/erlang-b-finite-server-loss.
- Change the Offered load select to observe how increasing the traffic increases the blocking probability.
- Change the Servers select to see how adding capacity reduces the blocking probability and increases the carried load.