The authors analyse steady state waiting time probabilities in an infinite buffer which has a synchronous, discrete time server, constant service times and in which arrivals have an arbitrary number of static priority levels. Such a queueing model is frequently used to model asynchronous time division multiplexed communication systems. The approach developed here yields a direct algorithm which allows the calculation of the waiting time distributions for cells of any priority levels.