The Erlang C formula expresses the probability that an arriving customer will need to queue (as opposed to immediately being served). Just as the Erlang B formula, Erlang C assumes an infinite population of sources, which jointly offer traffic of A erlangs to N servers. However, if all the servers are busy when a request arrives from a source, the request is queued. An unlimited number of requests may be held in the queue in this way simultaneously. This formula calculates the probability of queuing offered traffic, assuming that blocked calls stay in the system until they can be handled. This formula is used to determine the number of agents or customer service representatives needed to staff a call centre, for a specified desired probability of queuing.
where:
- A is the total traffic offered in units of erlangs
- N is the number of servers
- PW is the probability that a customer has to wait for service
It is assumed that the call arrivals can be modeled by a Poisson process and that call holding times are described by a negative exponential distribution. A common use for Erlang C is modeling and dimensioning call center agents in a call center environment.
Read more about this topic: Erlang (unit)
Famous quotes containing the word formula:
“Given for one instant an intelligence which could comprehend all the forces by which nature is animated and the respective positions of the beings which compose it, if moreover this intelligence were vast enough to submit these data to analysis, it would embrace in the same formula both the movements of the largest bodies in the universe and those of the lightest atom; to it nothing would be uncertain, and the future as the past would be present to its eyes.”
—Pierre Simon De Laplace (1749–1827)