Distribution of time to buffer overflow in a finite-buffer manufacturing model with unreliable machine

One of the most important characteristic of each queueing model is time to buffer overflow. In the paper the distribution of that time in a single-channel manufacturing system, modelled by a Markovian finite-buffer queue with machine breakdowns, is studied. By using the analytical approach based on...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:MATEC web of conferences Ročník 112; s. 5005
Hlavní autori: Kempa, Wojciech M., Paprocka, Iwona, Grabowik, Cezary, Kalinowski, Krzysztof, Krenczyk, Damian
Médium: Journal Article Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: Les Ulis EDP Sciences 01.01.2017
Predmet:
Buffers
Cybersecurity
Linear algebra
Markov analysis
Markov chains
Queues
Queuing theory
ISSN:2261-236X, 2274-7214, 2261-236X
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:One of the most important characteristic of each queueing model is time to buffer overflow. In the paper the distribution of that time in a single-channel manufacturing system, modelled by a Markovian finite-buffer queue with machine breakdowns, is studied. By using the analytical approach based on the idea of embedded Markov chain, total probability law and linear algebra, the formula for Laplace transform of the time to buffer overflow conditional distribution is found. Numerical illustration is presented.
Bibliografia:ObjectType-Conference Proceeding-1
SourceType-Conference Papers & Proceedings-1
content type line 21
ISSN:2261-236X
2274-7214
2261-236X
DOI:10.1051/matecconf/201711205005