To ensure the overall quality of traffic forwarding in a data center scenario,a traffic scheduling method that can differentiate between elephant flows and mice flows is required on data center switches.Currently,there is no distinction made on the devices,and all traffic is treated equally,which cannot guarantee a satisfactory user experience.This paper proposes an implementation scheme for elephant flow and mice flow identification called Multi-hash Scheduling(MHS).The links are pre-planned as low-latency links and high-throughput links.The data center switches record the traffic using a multi-level,unequal hash table,and set a threshold to filter out the elephant flows.With the help of the scheduling strategy,these flows are redirected to high-throughput links,reducing the mutu-al interference between elephant flows and mice flows.Experiments conducted on programmable switches demonstrate that this method achieves better results in high-performance data center networks.When compared to Equal-Cost Multi-Path Routing(ECMP)in high-speed networks,this method shows significant performance improvements with a 16％reduction in queue length and a 20％reduction in latency.
traffic schedulingflow identificationprogrammablemulti-level hashingdata center
维普
万方数据
