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

From MaRDI portal
(Redirected from Publication:475089)




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.



Cites work







This page was built for publication: On the rate of convergence for infinite server Erlang-Sevastyanov's problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q475089)