New Look at Finite Single Server Queue with Poisson Input and Semi-Markov Service Times
classification
🧮 math.PR
keywords
queuefiniteinputpoissonsemi-markovserverservicesingle
read the original abstract
The mathematics of the finite single server queue with Poisson input and semi-Markov service times($M/SM/1/b$) is similar to that used for $BMAP/G/1/b$ systems. This observation results in new analytical formulas for a queue size in the $M/SM/1/b$ system. Both stationary and the transient solutions are considered
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.