Waiting-Time Distribution of a Multi-Server, Priority Queuing System

An explicit formula is given for the waiting-time distribution of any number of parallel, negative-exponential servers subject to Poisson demands from any number of priority classes. The demand rates may be different for the priority classes, but the service rate is the same for all classes. The queue discipline is first-come-within-priority class sequence.