Queues Solvable without Rouché's Theorem

We give a novel analysis of the steady-state probabilities of a class of infinite Markov chains. Markov chains of this type appear in the study of bulk queues and a variety of other stochastic models. We present algorithms that involve only real arithmetic and avoid the traditional analysis based on Rouché's theorem.