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

Authors:
A. Yu. Veretennikov
Affiliations:
School of Mathematics, University of Leeds, Leeds , UK LS2 9JT and Institute of Information Transmission Problems, Moscow, Russia
Venue:
Queueing Systems: Theory and Applications
Year:
2014

Citing 9
Cited 0

Introduction to queueing theory (2nd ed)

Introduction to queueing theory (2nd ed)
On the estimation of mixing coefficients for a multiphase service system

Queueing Systems: Theory and Applications
Insensitive Bandwidth Sharing in Data Networks

Queueing Systems: Theory and Applications
On the speed of convergence to stationarity of the Erlang loss system

Queueing Systems: Theory and Applications
On mixing rate and convegence to stationary regime in discrete time Erlang problem

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
Insensitive, maximum stable allocations converge to proportional fairness

Queueing Systems: Theory and Applications
A loss system with skill-based servers under assign to longest idle server policy

Probability in the Engineering and Informational Sciences
On the rate of convergence to the stationary distribution in the single-server queuing systems

Automation and Remote Control

Quantified Score

Hi-index	0.00

Visualization

Abstract

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