Abstract : A discussion is presented of a single-server queue with Poisson input and general service times and illustrates that all important problems concerning the queue size, the waiting time and the busy period can be solved in an elementary way by using only two generalizations of the classical ballot theorem. (Author)