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

This paper describes an approximation procedure for determining the throughput time distribution of material handling and service systems modeled as queuing networks. We consider finite buffer capacities and general distributed processing times in terms of discrete probability functions. In order to quantify the influence of blocking caused by finite buffers, we present a decomposition approach...

This paper defines the building blocks of and derives basic queuing systems. It begins with a review of some probability theory and then defines processes used to analyze queuing systems, in particular the birth-death process. A few simple queues are analyzed in terms of steady-state derivation before the paper discusses some attempted field research on the topic.

Queuing theory is the formal study of waiting in line and is an entire discipline in operations management. This article will give the reader a general background into queuing theory, its associated terminology, and its relationship to patient satisfaction. Queuing theory has been used in the past to assess such things as staff schedules, working environment, productivity, customer waiting time...