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. Key words: queueing theory, D-BMAP/D/1 system, Markov-modulated process, Markov chain PACS: 02.50.Ga, 02.50.r, 07.05.Tp
Richard G. Clegg