New Look at Finite Single Server Queue with Poisson Input and Semi-Markov Service Times
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
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.