journal article·2023Open access

Data Center Traffic Scheduling Strategy for Minimization Congestion and Quality of Service Guaranteeing

Chunzhi Wang, Weidong Cao, Yalin Hu, Jinhang Liu

Computers, Materials & Continua· Volume 75· Issue 2

Abstract

According to Cisco’s Internet Report 2020 white paper, there will be 29.3 billion connected devices worldwide by 2023, up from 18.4 billion in 2018. 5G connections will generate nearly three times more traffic than 4G connections. While bringing a boom to the network, it also presents unprecedented challenges in terms of flow forwarding decisions. The path assignment mechanism used in traditional traffic scheduling methods tends to cause local network congestion caused by the concentration of elephant flows, resulting in unbalanced network load and degraded quality of service. Using the centralized control of software-defined networks, this study proposes a data center traffic scheduling strategy for minimization congestion and quality of service guaranteeing (MCQG). The ideal transmission path is selected for data flows while considering the network congestion rate and quality of service. Different traffic scheduling strategies are used according to the characteristics of different service types in data centers. Reroute scheduling for elephant flows that tend to cause local congestion. The path evaluation function is formed by the maximum link utilization on the path, the number of elephant flows and the time delay, and the fast merit-seeking capability of the sparrow search algorithm is used to find the path with the lowest actual link overhead as the rerouting path for the elephant flows. It is used to reduce the possibility of local network congestion occurrence. Equal cost multi-path (ECMP) protocols with faster response time are used to schedule mouse flows with shorter duration. Used to guarantee the quality of service of the network. To achieve isolated transmission of various types of data streams. The experimental results show that the proposed strategy has higher throughput, better network load balancing, and better robustness compared to ECMP under different traffic models. In addition, because it can fully utilize the resources in the network, MCQG also outperforms another traffic scheduling strategy that does rerouting for elephant flows (namely Hedera). Compared with ECMP and Hedera, MCQG improves average throughput by 11.73% and 4.29%, and normalized total throughput by 6.74% and 2.64%, respectively; MCQG improves link utilization by 23.25% and 15.07%; in addition, the average round-trip delay and packet loss rate fluctuate significantly less than the two compared strategies.
Source: openalex_inverted_index · Quality: baseline

Research context

OpenAlex topics: Software-Defined Networks and 5G · Advanced Optical Network Technologies · Cloud Computing and Resource Management

SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.

References (27)

Show source-provided references
1. Challenges and solutions in software defined networking: A survey10.1016/j.jnca.2019.04.020 ↗
2. Cisco, “Cisco annual internet report 2018–2023 white paper,” 2020, [Online]. Available: https://www.cisco.com/c/en/us/solutions/collateral/executive-perspectives/annual-internet-report/white-paper-c11-741490.html
3. Edge–Cloud resource scheduling in space–Air–Ground-integrated networks for internet of vehicles10.1109/JIOT.2021.3065583 ↗
4. Software-defined networking (SDN) and distributed denial of service (DDoS) attacks in cloud computing environments: A survey, some research issues, and challenges10.1109/COMST.2015.2487361 ↗
5. Network innovation using openflow: A survey10.1109/SURV.2013.081313.00105 ↗
6. Improvement in quality of service against doppelganger attacks for connected network10.9781/ijimai.2022.08.003 ↗
7. Flow-aware elephant flow detection for software-defined networks10.1109/ACCESS.2020.2987977 ↗
8. SDN partitioning: A centralized control plane for distributed routing protocols10.1109/TNSM.2016.2585759 ↗
9. Load balancing in data center networks: A survey10.1109/COMST.2018.2816042 ↗
10. Multi-path allocation scheduling optimization algorithm for network data traffic based on SDN architecture10.1093/imamci/dnaa011 ↗
11. Quality of service (QoS) in software defined networking (SDN): A survey10.1016/j.jnca.2016.12.019 ↗
12. Hybrid SDN networks: A survey of existing approaches10.1109/COMST.2018.2837161 ↗
13. A novel swarm intelligence optimization approach: Sparrow search algorithm10.1080/21642583.2019.1708830 ↗
14. Hedera: Dynamic flow scheduling for data center networks
15. The strategy of path determination and traffic scheduling in private campus networks based on SDN10.1007/s12083-017-0623-z ↗
16. Flow-aware forwarding in SDN datacenters using a knapsack-PSO-based solution10.1109/TNSM.2021.3064974 ↗
17. QOGMP: QoS-oriented global multi-path traffic scheduling algorithm in software defined network
18. Sieve: A flow scheduling framework in SDN based data center networks10.1016/j.comcom.2021.02.013 ↗
19. DTE-SDN: A dynamic traffic engineering engine for delay-sensitive transfer10.1109/JIOT.2018.2872439 ↗
20. Deep reinforcement learning based multi-layered traffic scheduling scheme in data center networks10.1007/s11276-021-02883-w ↗
21. MTSS: Multi-path traffic scheduling mechanism based on SDN10.21629/JSEE.2019.05.14 ↗
22. A data center load balancing algorithm based on artificial bee colony algorithm
23. SLDP: A secure and lightweight link discovery protocol for software defined networking10.1016/j.comnet.2018.12.014 ↗
24. Finding the k shortest loopless paths in a network10.1287/mnsc.17.11.712 ↗
25. Capture and replay: Reproducible network experiments in mininet
26. On-line multicast scheduling with bounded congestion in fat-tree data center networks10.1109/JSAC.2014.140110 ↗
27. Node to node performance evaluation through RYU SDN controller10.1007/s11277-020-07060-4 ↗