In this paper a method is stated to conclude that the output of given queueing system is POISSON from the steady-state probabilities and from the behavior of the queueing system at jump epochs, i.e. at epochs when the system state can be changed. The corresponding statement for queueing systems described by Markov processes with denumber-able state space will be generalized to systems which can have arbitrary service time distributions if the steady-state probabilities are insensitive with respect to these distributions.