Bandwidth preemption algorithms for differentiated service aware traffic engineering

This paper presents two bandwidth preemption algorithms for two widely deployed bandwidth constraint models supporting differentiated service aware traffic engineering: the maximum allocation model and the Russian doll model. Our designs aim at achieving preemption fairness and performance robustness, in addition to the objectives of minimizing the preemption disruption to the existing connections. We propose that the preemption decision be made not only on the basis of priority level, but also on the basis of the bandwidth reservation status and bandwidth constraint model characteristics. Simulation results show that the proposed preemption algorithms achieve significant performance improvement in terms of both bandwidth blocking and preemption rate and bandwidth utilization.