Improving Data Center Network Utilization Using Near-Optimal Traffic Engineering

• Published in: IEEE transactions on parallel and distributed systems Vol. 24; no. 6; pp. 1139 - 1148
• Main Authors: Fung Po Tso, Pezaros, D. P.
• Format: Journal Article
• Language: English
• Published: IEEE 01-06-2013
• Subjects: cloud computing; Data center routing; data center topology; load balancing; Mathematical model; multipath routing; Network topology; Optimization; Protocols; Routing; Servers; Topology; traffic engineering
• ISSN: 1045-9219; 1558-2183
• DOI: 10.1109/TPDS.2012.343

Equal cost multiple path (ECMP) forwarding is the most prevalent multipath routing used in data center (DC) networks today. However, it fails to exploit increased path diversity that can be provided by traffic engineering techniques through the assignment of nonuniform link weights to optimize network resource usage. To this extent, constructing a routing algorithm that provides path diversity over nonuniform link weights (i.e., unequal cost links), simplicity in path discovery and optimality in minimizing maximum link utilization (MLU) is nontrivial. In this paper, we have implemented and evaluated the Penalizing Exponential Flow-spliTing (PEFT) algorithm in a cloud DC environment based on two dominant topologies, canonical and fat tree. In addition, we have proposed a new cloud DC topology which, with only a marginal modification of the current canonical tree DC architecture, can further reduce MLU and increase overall network capacity utilization through PEFT routing.