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.>

A dynamic priority discipline called head-of-the-line with priority jumps is proposed as an efficient link schedule for a packet switch serving multiple classes of delay-sensitive traffic. Implementation of this discipline is considered to be relatively simple, and the processing overhead relatively small. It is shown that, by properly adjusting the control parameters, the discipline can: (i) satisfy any relative average delay requirements for the different classes, thus bringing fairness of service, and resulting in resource saving, and (ii) make the tail probability of the delay distributions for the different classes beyond their targeted maximum delays approximately the same, thus approximately minimizing the overall maximum tail probability in the system.>