  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.
