Engset Formulas for Nonhomogeneous Non-Markov Queueing Systems and Their Application in Communication Networks

We consider a closed waiting-free queueing system (QS) with arbitrary distribution functions for the generating and servicing times of arrivals. The stationary probability distribution for the states of the system is found. Its various applications to communication networks are studied. In particular, Erlang problems are solved for different-type arrivals and for those that require a random number of servers in open systems. A channel-switching network is considered.