Title :
Blocking formulae for the Engset model
Author :
Pinsky, E. ; Conway, Adam ; Wei Liu
Author_Institution :
Lab. for Inf. & Decision Syst., MIT, Cambridge, MA
fDate :
6/1/1994 12:00:00 AM
Abstract :
Presents simple recursive algorithms for computing call and time congestion in the classical Engset model with M sources and N servers. The first recursion has the complexity of O(MN) and gives the blocking probabilities for all intermediate values of M and N. The second recursion assumes a particular value of M and has the complexity of O(N). It gives the blocking probabilities for all intermediate values of N. Both recursions are similar to the well-known recurrence for computing the Erlang loss function
Keywords :
information theory; probability; telecommunication traffic; Engset model; Erlang loss function; blocking probabilities; call congestion; recursive algorithms; servers; sources; time congestion; Communications Society; Computer networks; Computer science; Laboratories; Loss measurement; Network servers; Steady-state;
Journal_Title :
Communications, IEEE Transactions on
