Abstract
A dynamic packet transmission priority discipline, head-of-the-line with priority jumps, is proposed and analyzed for a packet switch serving multiple classes of delay-sensitive traffic. It is shown that, under realistic traffic conditions, the discipline can make the tail probabilities of the delay distributions for the different classes of traffic, in excess of their respective delay requirements, approximately the same, thus resulting in fairness of service and minimization of the maximum tail probability among the different classes. Implementation of the discipline is considered to be relatively simple, and involved processing overhead is minimal.<>