Bibliographic Details
| Title: |
Multi-Agent Deep Reinforcement Learning-Based Fine-Grained Traffic Scheduling in Data Center Networks. |
| Authors: |
Wang, Huiting1 (AUTHOR) 18322498530@163.com, Liu, Yazhi1 (AUTHOR) liuyazhi@ncst.edu.cn, Li, Wei1 (AUTHOR), Yang, Zhigang2 (AUTHOR) yzg@ncst.edu.cn |
| Superior Title: |
Future Internet. Apr2024, Vol. 16 Issue 4, p119. 17p. |
| Subject Terms: |
*DEEP reinforcement learning, *SERVER farms (Computer network management), *REINFORCEMENT learning, *MACHINE learning, *NETWORK performance |
| Abstract: |
In data center networks, when facing challenges such as traffic volatility, low resource utilization, and the difficulty of a single traffic scheduling strategy to meet demands, it is necessary to introduce intelligent traffic scheduling mechanisms to improve network resource utilization, optimize network performance, and adapt to the traffic scheduling requirements in a dynamic environment. This paper proposes a fine-grained traffic scheduling scheme based on multi-agent deep reinforcement learning (MAFS). This approach utilizes In-Band Network Telemetry to collect real-time network states on the programmable data plane, establishes the mapping relationship between real-time network state information and the forwarding efficiency on the control plane, and designs a multi-agent deep reinforcement learning algorithm to calculate the optimal routing strategy under the current network state. The experimental results demonstrate that compared to other traffic scheduling methods, MAFS can effectively enhance network throughput. It achieves a 1.2× better average throughput and achieves a 1.4–1.7× lower packet loss rate. [ABSTRACT FROM AUTHOR] |
|
Copyright of Future Internet is the property of MDPI and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Academic Search Premier |
|
Full text is not displayed to guests. |
Login for full access.
|