Theory and numerical solution of a discrete queueing problem

A queueing problem is considered with one server, independent discrete inter-arrival times, and independent discrete service times. The steady state distribution of the waiting time is approximated by means of the solution of certain linear equations and applying a generalization of the Lin-Bairstow method for finding quadratic factors of polynomials.