The performance of a link with multipriority traffic

This letter discusses the performance of a link carrying calls of preemptive priorities. General /spl kappa/-dimensional steady-state balance equations are deduced and the computational complexity of two solution methods are compared through an example of three priorities. The performance of the link is studied through two conventional metrics for blocking probabilities and preempting probabilities. The "peaking" phenomenon of the preempting line discussed can be used in the design of switches and networks. The coincidence of the preempting probability line with the blocking probability line, displayed in the discussion of numerical results, suggests that better metrics for preemptive performance must be found.