Contribution to Unreliable M/M/1/m Queueing Systems Modelling
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27230%2F09%3A00020342" target="_blank" >RIV/61989100:27230/09:00020342 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Contribution to Unreliable M/M/1/m Queueing Systems Modelling
Original language description
In the queueing theory we usually assume that a server breakdown can not occur. In other words a utility server works without failures. But in practice this assumption is not correct, the server is often a technical device and every technical device canbe broken. During the breakdown the server can not work which means that the consideration of server failures has got an effect on performance measures of studied queueing system. We can say that queueing models with unreliable servers are more closely to a reality than models with reliable servers. On the other hand unreliable queueing models are more complicated. This paper presents two models of Markov queueing systems with an unreliable server.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
AP - Municipal, regional and transportation planning
OECD FORD branch
—
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2009
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Sborník vědeckých prací Vysoké školy báňské - Technické univerzity Ostrava. Řada strojní
ISSN
1210-0471
e-ISSN
—
Volume of the periodical
LV
Issue of the periodical within the volume
3
Country of publishing house
CZ - CZECH REPUBLIC
Number of pages
6
Pages from-to
31-36
UT code for WoS article
—
EID of the result in the Scopus database
—