TY - GEN
T1 - CAFT
T2 - 16th IEEE International Wireless Communications and Mobile Computing Conference, IWCMC 2020
AU - Alanazi, Sultan
AU - Hamdaoui, Bechir
N1 - Publisher Copyright:
© 2020 IEEE.
PY - 2020/6
Y1 - 2020/6
N2 - Production data centers operate under various workload sizes ranging from latency-sensitive mice flows to long-lived elephant flows. However, the predominant load balancing scheme in data center networks, equal-cost multi-path (ECMP), is agnostic to path conditions and performs poorly in asymmetric topologies, resulting in low throughput and high latencies. In this paper, we propose CAFT, a distributed congestion-aware fault-tolerant load balancing protocol for 3-tier data center networks. It first collects, in real time, the complete congestion information of two subsets from the set of all possible paths between any two hosts. Then, the best path congestion information from each subset is carried across the switches, during the Transport Control Protocol (TCP) connection process, to make path selection decision. Having two candidate paths improve the robustness of CAFT to asymmetries caused by link failures. Large-scale ns-3 simulations show that CAFT outperforms Expeditus in mean flow completion time (FCT) and network throughput for both symmetric and asymmetric scenarios.
AB - Production data centers operate under various workload sizes ranging from latency-sensitive mice flows to long-lived elephant flows. However, the predominant load balancing scheme in data center networks, equal-cost multi-path (ECMP), is agnostic to path conditions and performs poorly in asymmetric topologies, resulting in low throughput and high latencies. In this paper, we propose CAFT, a distributed congestion-aware fault-tolerant load balancing protocol for 3-tier data center networks. It first collects, in real time, the complete congestion information of two subsets from the set of all possible paths between any two hosts. Then, the best path congestion information from each subset is carried across the switches, during the Transport Control Protocol (TCP) connection process, to make path selection decision. Having two candidate paths improve the robustness of CAFT to asymmetries caused by link failures. Large-scale ns-3 simulations show that CAFT outperforms Expeditus in mean flow completion time (FCT) and network throughput for both symmetric and asymmetric scenarios.
KW - Load balancing
KW - data center networks
KW - distributed routing
KW - network congestion
UR - http://www.scopus.com/inward/record.url?scp=85089706427&partnerID=8YFLogxK
U2 - 10.1109/IWCMC48107.2020.9148271
DO - 10.1109/IWCMC48107.2020.9148271
M3 - Conference contribution
AN - SCOPUS:85089706427
T3 - 2020 International Wireless Communications and Mobile Computing, IWCMC 2020
SP - 1746
EP - 1751
BT - 2020 International Wireless Communications and Mobile Computing, IWCMC 2020
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 15 June 2020 through 19 June 2020
ER -