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

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 t...

Full description

Saved in:
Bibliographic Details
Published in:Cybernetics and systems analysis 2012-07, Vol.48 (4), p.601-604
Main Authors: Dyshliuk, O. N., Koba, E. V.
Format: Article
Language:English
Subjects:
Approximation
Artificial Intelligence
Chains
Control
Cybernetics
Demand
Marketing
Markov analysis
Markov chains
Markov processes
Mathematical models
Mathematics
Mathematics and Statistics
Orbits
Probability
Processor Architectures
Queues
Queuing
Queuing theory
Software Engineering/Programming and Operating Systems
Studies
System theory
Systems analysis
Systems Theory
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1060-0396
1573-8337
DOI:10.1007/s10559-012-9440-9