A discrete-time Markov modulated queuing system with batched arrivals
classification
🧮 math.PR
math.DSmath.STstat.TH
keywords
givenprocessqueuesystemarrivalbatcheddiscrete-timelength
read the original abstract
This paper examines a discrete-time queuing system with applications to telecommunications traffic. The arrival process is a particular Markov modulated process which belongs to the class of discrete batched Markovian arrival processes. The server process is a single server deterministic queue. A closed form exact solution is given for the expected queue length and delay. A simple system of equations is given for the probability of the queue exceeding a given length.
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.