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

被引:1
|
作者
Wang, Chunzhi [1 ]
Cao, Weidong [1 ]
Hu, Yalin [1 ]
Liu, Jinhang [1 ]
机构
[1] Hubei Univ Technol, Sch Comp Sci, Wuhan 430068, Peoples R China
来源
CMC-COMPUTERS MATERIALS & CONTINUA | 2023年 / 75卷 / 02期
基金
中国国家自然科学基金;
关键词
Software-defined network; data center network; OpenFlow; network congestion; quality of service; SOFTWARE DEFINED NETWORKING; SDN;
D O I
10.32604/cmc.2023.037625
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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 net-work. 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.
引用
收藏
页码:4377 / 4393
页数:17
相关论文
共 50 条
  • [1] Guaranteeing quality of service to peering traffic
    Zhang-Shen, Rui
    McKeown, Nick
    [J]. 27TH IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (INFOCOM), VOLS 1-5, 2008, : 2146 - +
  • [2] Data sharing strategy for guaranteeing quality-of-service in VoD application
    Sujatha, D. N.
    Girish, K.
    Venugopal, K. R.
    Patnaik, L. M.
    [J]. FOURTH INTERNATIONAL CONFERENCE ON INTELLIGENT SENSING AND INFORMATION PROCESSSING, PROCEEDINGS, 2006, : 59 - +
  • [3] Strategy of Data Manage Center Network Traffic Scheduling Based on SDN
    Li Cong
    Wu Yong-Hao
    [J]. 2016 INTERNATIONAL CONFERENCE ON INTELLIGENT TRANSPORTATION, BIG DATA & SMART CITY (ICITBS), 2017, : 29 - 34
  • [4] SCED: A generalized scheduling policy for guaranteeing quality-of-service
    Sariowan, H
    Cruz, RL
    Polyzos, GC
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 1999, 7 (05) : 669 - 684
  • [5] Power control and scheduling for guaranteeing quality of service in cellular networks
    Wu, Dapeng
    Negi, Rohit
    [J]. WIRELESS COMMUNICATIONS & MOBILE COMPUTING, 2008, 8 (01): : 75 - 92
  • [6] A Traffic Scheduling Algorithm for Bandwidth Fragmentation Minimization and QoS Guarantee in Data Center Network
    Tang Hong
    Wang Xinxin
    Liu Yixing
    [J]. JOURNAL OF ELECTRONICS & INFORMATION TECHNOLOGY, 2019, 41 (04) : 987 - 994
  • [7] Data center traffic scheduling strategy based on Fibonacci tree optimization algorithm
    Wang, Yaomin
    Wang, Xia
    Dong, Yi
    Zhang, Songhai
    Shi, Xinling
    [J]. Tongxin Xuebao/Journal on Communications, 2020, 41 (06): : 112 - 127
  • [8] Modelling and guaranteeing quality of service over data streams
    Wu, Shanshan
    Gu, Yu
    Lv, Yanfei
    Yu, Ge
    [J]. WEB INFORMATION SYSTEMS - WISE 2006 WORKSHOPS, PROCEEDINGS, 2006, 4256 : 13 - 24
  • [9] Traffic Optimization and Congestion Prevention Strategy Based on Hierarchical Temporal Memory of Data Center Optical Network
    Xu, Ting
    Yang, Hui
    Yu, Ao
    Bao, Bowen
    Guo, Huifeng
    Jiang, Yong
    [J]. 2020 OPTO-ELECTRONICS AND COMMUNICATIONS CONFERENCE (OECC 2020), 2020,
  • [10] Optimal Data Center Scheduling for Quality of Service Management in Sensor-Cloud
    Chatterjee, Subarna
    Misra, Sudip
    Khan, Samee U.
    [J]. IEEE TRANSACTIONS ON CLOUD COMPUTING, 2019, 7 (01) : 89 - 101