RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive

Probl. Peredachi Inf., 2010 Volume 46, Issue 4, Pages 122–129 (Mi ppi2030)

This article is cited in 2 papers

Communication Network Theory

On the rate of beta-mixing and convergence to a stationary distribution in continuous-time Erlang-type systems

A. Yu. Veretennikovab

a School of Mathematics, University of Leeds, UK
b A. A. Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences

Abstract: We establish sufficient conditions for polynomial rate of convergence to a stationary distribution and of beta-mixing in continuous-time Erlang-type systems. Our results are a natural complement both to results of Erlang himself, dating back to the beginning of the 20th century, and to exponential estimates established later.

UDC: 621.395.1+519.2

Received: 28.06.2010
Revised: 20.10.2010


 English version:
Problems of Information Transmission, 2010, 46:4, 382–389

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025