On rate of convergence for infinite server Erlang-Sevastyanov's problem

Abstract

Polynomial convergence rates in total variation are established in Erlang-Sevastyanov's type problem with an infinite number of servers and a general distribution of service under assumptions on the intensity of serving.

24 pages; several typos corrected

References in corpus (3)

• Structural properties of proportional fairness: stability and insensitivity
• Simple proof of Dynkin's formula for single-server systems and polynomial convergence rates
• T. E. Harris's contributions to recurrent Markov processes and stochastic flows

Cited by in corpus (2)

• Simple proof of Dynkin's formula for single-server systems and polynomial convergence rates
• About some extended Erlang-Sevast'yanov queueing system and its convergence rate (English and Russian versions)