Determining the steady-state probabilities of an embedded Markov chain in a retrial queuing system with a flow of demands of different types

Authors:
O. N. Dyshliuk;E. V. Koba
Affiliations:
National Aviation Univetsity, Kyiv, Ukraine;V. M. Glushkov Institute of Cybernetics, National Academy of Sciences of Ukraine, Kyiv, Ukraine
Venue:
Cybernetics and Systems Analysis
Year:
2012

Citing 5
Cited 0

A survey on retrial queues

Queueing Systems: Theory and Applications
A survey of retrial queues

Queueing Systems: Theory and Applications - Special issue of queueing systems, theory and applications
Some Markovian Queuing Retrial Systems under Light-Traffic Conditions

Cybernetics and Systems Analysis
A retrial BMAP/SM/1 system with linear repeated requests

Queueing Systems: Theory and Applications
Cyclic-waiting systems

Cybernetics and Systems Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

A single-channel retrial queuing system with the input flow of demands of different types is considered. The sojourn time in the orbit of a demand of any type is exponentially distributed. An embedded Markov chain is set up. The explicit and approximate formulas for the transition probabilities of the chain are derived and are used to determine the steady-state probabilities.