A Preemptive Scheduling for Bursty Flow in Data Center

Data centers provide services for various real-time applications, such as social networks, instance message, which produce a large number of bursty and urgent mice flow. However, the traditional flow queuing model cannot schedule these flow effectively, which leading the performance loss for some important applications. In this paper, a preemptive scheduling in data center for bursty flow (PSBF) was proposed. The scheduling leverage the preemptive scheduling for more critical flow and set the right queue for other data flow to keep the high aggregated throughput. The experiment and analysis show that our scheduling can handle bursty flow better than traditional flow scheduling for data center.