On the speed of convergence to stationarity of the Erlang loss system

Authors:
Erik A. Doorn;Alexander I. Zeifman
Affiliations:
Department of Applied Mathematics, University of Twente, Enschede, The Netherlands 7500 AE;Institute of Informatics Problems RAS, VSCC CEMI RAS, and Vologda State Pedagogical University, Vologda, Russia
Venue:
Queueing Systems: Theory and Applications
Year:
2009

Citing 5
Cited 7

Representations and bounds for zeros of Orthogonal polynomials and eigenvalues of sign-symmetric tri-diagonal matrices

Journal of Approximation Theory
On the transient behaviour of the Erlang loss model: heavy usage asymptotics

SIAM Journal on Applied Mathematics
Matrix analysis and applied linear algebra

Matrix analysis and applied linear algebra
Nonstationary Queues: Estimation of the Rate of Convergence

Queueing Systems: Theory and Applications
Representations for the extreme zeros of orthogonal polynomials

Journal of Computational and Applied Mathematics

On the nonstationary Erlang loss model

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

Problems of Information Transmission
M/G/∞ transience, and its applications to overload detection

Performance Evaluation
Stability bounds for Mt/Mt/N/N + R queue

Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
Full length article: Asymptotics for the ratio and the zeros of multiple Charlier polynomials

Journal of Approximation Theory
Full length article: Asymptotics for the ratio and the zeros of multiple Charlier polynomials

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

Queueing Systems: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the Erlang loss system, characterized by N servers, Poisson arrivals and exponential service times, and allow the arrival rate to be a function of N. We discuss representations and bounds for the rate of convergence to stationarity of the number of customers in the system, and display some bounds for the total variation distance between the time-dependent and stationary distributions. We also pay attention to time-dependent rates.