Bandwidth Preemption for Data Transfer Request with Higher Priority

In this paper, we study the bandwidth preemption on one link of a scheduling HPN for one bandwidth reservation request with higher priority following two different constraints: (i) minimize the number and then the total bandwidth of existing bandwidth reservations to be preempted, and (ii) minimize the total bandwidth and then the number of existing bandwidth reservations to be preempted. We prove above two problems are NP-complete, and propose two heuristic algorithms. Extensive simulation results show the improved heuristic algorithm has much better preemption performance than a basic algorithm.