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:
“Hidden away amongst Aschenbach’s writing was a passage directly asserting that nearly all the great things that exist owe their existence to a defiant despite: it is despite grief and anguish, despite poverty, loneliness, bodily weakness, vice and passion and a thousand inhibitions, that they have come into being at all. But this was more than an observation, it was an experience, it was positively the formula of his life and his fame, the key to his work.”
—Thomas Mann (18751955)