摘要
Modern data center networks for a fat-tree topology typically adopt a multirooted hierarchical tree structure to achieve multiple-path capability and increase bisection bandwidth. However, the performance of a data center network highly depends on the routing protocols. Conventional routing protocols are unsuitable for modern data center topologies because they lack multiple-path routing support. Another crucial concern in data center networks is load balancing. Certain routing protocol limitations could lead to overloaded or underloaded utilization of a link, thereby considerably reducing the performance of a data center network. Therefore, we present a genetic algorithm (GA)-based dynamic load-balancing routing algorithm, which is heuristic and involves the use of a centralized scheduling technique. This algorithm mainly uses a GA to search for optimal solutions. We implement our algorithm in an OpenFlow controller RYU and Mininet emulator, which is based on software-defined networking architecture. Our evaluation results revealed that our algorithm can effectively achieve load balancing and increase bisection bandwidth.
| 原文 | 英語 |
|---|---|
| 頁(從 - 到) | 491-503 |
| 頁數 | 13 |
| 期刊 | International Journal of Performability Engineering |
| 卷 | 17 |
| 發行號 | 6 |
| DOIs | |
| 出版品狀態 | 已出版 - 06 2021 |
| 對外發佈 | 是 |
文獻附註
Publisher Copyright:© 2021 Totem Publisher, Inc. All rights reserved.
指紋
深入研究「Dynamic flow scheduling technique for load balancing in fat-tree data center networks」主題。共同形成了獨特的指紋。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver