Approximation of multiserver retrial queues by means of generalized truncated models
Date
2002
Authors
Anisimov, V. V.
Artalejo, J. R.
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
BUIR Usage Stats
1
views
views
16
downloads
downloads
Citation Stats
Series
Abstract
It is well-known that an analytical solution of multiserver retrial queues is difficult and does not lead to numerical implementation. Thus, many papers approximate the original intractable system by the so-called generalized truncated systems which are simpler and converge to the original model. Most papers assume heuristically the convergence but do not provide a rigorous mathematical proof. In this paper, we present a proof based on a synchronization procedure. To this end, we concentrate on the M/M/c retrial queue and the approximation developed by Neuts and Rao (1990). However, the methodology can be employed to establish the convergence of several generalized truncated systems and a variety of Markovian multiserver retrial queues.
Source Title
TOP
Publisher
Springer
Course
Other identifiers
Book Title
Degree Discipline
Degree Level
Degree Name
Citation
Permalink
Published Version (Please cite this version)
Language
English