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

DOI10.1007/S11134-013-9384-4zbMATH Open1307.60138arXiv1310.5973OpenAlexW2136968435MaRDI QIDQ475089FDOQ475089

Authors: A. Yu. Veretennikov 

Publication date: 25 November 2014

Published in: Queueing Systems (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1310.5973

Recommendations

• On some extended Erlang-Sevastyanov queueing system and its convergence rate
• On the speed of convergence to stationarity of the Erlang loss system
• On the rate of convergence to the stationary distribution in the single-server queuing systems
• A note on the rate of convergence to equilibrium for Erlang's model in the subcritical case
• On the rates of convergence of Erlang's model

zbMATH Keywords

infinite number of serversErlang-Sevastyanov problempolynomial convergence rate

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Continuous-time Markov processes on discrete state spaces (60J27)

Cites Work

• Applied Probability and Queues
• Title not available (Why is that?)
• Title not available (Why is that?)
• On polynomial mixing and convergence rate for stochastic difference and differential equations
• Title not available (Why is that?)
• Title not available (Why is that?)
• Stability of regime-switching stochastic differential equations
• Title not available (Why is that?)
• Insensitive bandwidth sharing in data networks
• Structural properties of proportional fairness: stability and insensitivity
• Insensitive, maximum stable allocations converge to proportional fairness
• On the estimation of mixing coefficients for a multiphase service system
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Work-modulated queues with applications to storage processes
• Title not available (Why is that?)
• On the rate of convergence of waiting times
• On the speed of convergence to stationarity of the Erlang loss system
• Title not available (Why is that?)
• A Note on Insensitivity in Stochastic Networks
• Title not available (Why is that?)
• AN OVERVIEW OF SOME STOCHASTIC STABILITY METHODS(<Special Issue>Network Design, Control and Optimization)
• On stability of state-dependent queues and acyclic queueing networks
• Exponential ergodicity in Markovian queueing and dam models
• On the rate of convergence to the stationary distribution in the single-server queuing systems
• Geometric ergodicity in a class of denumerable Markov chains
• Exponential Ergodicity of the $M/G/1$ Queue
• The queue GI/G/1: Finite moments of the cycle variables and uniform rates of convergence
• Ergodicity, stability, and insensitivity for one class of circuit switching networks
• The ergodicity of queueing systems with an infinite number of servers
• Ergodicity and invariance principle for multiphase queueing systems
• Insensitivity of steady-state distributions of generalized semi-Markov processes. I
• Insensitivity of steady-state distributions of generalized semi-Markov processes. Part II
• T. E. Harris's contributions to recurrent Markov processes and stochastic flows
• A note on Erlang's formulas
• Simple proof of Dynkin's formula for single-server systems and polynomial convergence rates
• Title not available (Why is that?)
• P433-444
• Title not available (Why is that?)
• On a Condition of Invariance of Stationary Probabilities for Queueing Networks
• Eine Invarianzeigenschaft zufälliger Bedienungsprozesse mit positiven Geschwindigkeiten
• Title not available (Why is that?)
• Certain Properties of Piecewise-Linear Markov Processes
• Ergodicity and stability of systems with repeated calls
• A loss system with skill-based servers under assign to longest idle server policy
• Partial balance and insensitivity
• Erlang’s Formulas in the Theory of Mass Service
• Title not available (Why is that?)
• Sur deux problèmes de M. Kolmogoroff concernant les chaînes dénombrables
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the rate of beta-mixing and convergence to a stationary distribution in continuous-time Erlang-type systems

Cited In (8)

• On Strong Bounds of Rate of Convergence for Regenerative Processes
• On the speed of convergence to stationarity of the Erlang loss system
• An open problem about the rate of convergence in Erlang-Sevastyanov's model
• On some extended Erlang-Sevastyanov queueing system and its convergence rate
• Coupling Method for Backward Renewal Process and Lorden’s Inequality
• On the convergence rate for queueing and reliability models described by regenerative processes
• On the rate of beta-mixing and convergence to a stationary distribution in continuous-time Erlang-type systems
• A note on the rate of convergence to equilibrium for Erlang's model in the subcritical case

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)