Admission control and preemption policy design of multi-class computer networks

Abstract

The subject of optimal admission control for maximizing revenue in multiclass loss networks has been well studied. Preemption policies, employed in the Differentiated Services network architecture, serve as an additional type of loss network control, where active low priority calls may be selectively preempted upon the arrival of a high priority call. This paper studies the joint use of admission control and preemption for a two class loss link where per-class revenues are earned per unit time for each active call, and an instantaneous preemption cost is incurred whenever the preemption mechanism is employed. Our main result is if the preemption cost is not too high then the system revenue under the optimal preemption policy with no admission control (complete sharing) exceeds that of the optimal admission control policy with no preemption. That is, preemption control is superior to admission control provided the preemption cost is not too high. Results are established via dynamic programming.