zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Structural perturbation analysis of a single server queue with breakdowns. (English) Zbl 1193.60105
Summary: This paper studies perturbations of the single server queue with breakdowns, where the perturbations consist of introducing dependent breakdowns. Problems that are modeled by queueing models with breakdowns and repairs are often very complicated, and they are resolved only through approximations. Therefore, it is very important to justify these approximations and to estimate the resultant error. For this purpose, we use the strong stability method to approximate the characteristics of the $M/G/1$ queue with dependent breakdowns by those of the $M/G/1$ queue with classical (constant) breakdowns. This latter queue is simpler and more exploitable in practice. Thus, we prove the stability conditions and next obtain stability inequalities with exactly computing of the constants. These results give with precision the error, on the queue size stationary distribution, due to the approximation. For this, we elaborate from the obtained theoretical results an algorithm allowing one to verify the approximation conditions and to provide the made numerical error. The accuracy of the approach is evaluated by comparison with true distance values.

60K25Queueing theory
68M20Performance evaluation of computer systems; queueing; scheduling
90B22Queues and service (optimization)
60J10Markov chains (discrete-time Markov processes on discrete state spaces)
Full Text: DOI