Stochastic comparisons for single-server queues

We consider single-server queueing systems with the queue discipline “first come, first served,” interarrival times {u_k, k ≥ l}, and service times {u_k, k ≥ l}, where the {u_k} and {u_k} are independent sequences of non-negative random variables that are independently but not necessarily identically distributed. Let X_k = u_k − u_k (k ≥ 1), S₀ 0, S_n = X₁ + X₂ … + X_n(n≥1). It is known that the (possibly nonhomogeneous) random walk {S_n} determines the behavior of the system. In this paper we make stochastic comparisons of two such systems σ₁,σ₂ whose basic random variables X and X are stochastically ordered. The corresponding random walks are also similarly ordered, and this leads to stochastic comparisons of idle times, duration of busy period and busy cycles, number of customers served during a busy period, and output from the system. In the classical case of identical distributions of {u_k} and {u_k} we obtain further comparisons. Our results are for the transient behavior of the systems, not merely for steady state.