Title :
Improving Data Center Network Utilization Using Near-Optimal Traffic Engineering
Author :
Fung Po Tso ; Pezaros, Dimitrios P.
Author_Institution :
Sch. of Comput. Sci., Univ. of Glasgow, Glasgow, UK
Abstract :
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.
Keywords :
computer centres; computer networks; resource allocation; telecommunication network routing; telecommunication network topology; DC network; ECMP forwarding; MLU; PEFT algorithm; canonical topology; cloud DC topology; data center network utilization; equal cost multiple path forwarding; fat tree topology; minimizing maximum link utilization; near-optimal traffic engineering; network capacity utilization; network resource usage; nonuniform link weight; path discovery; penalizing exponential flow-spliting algorithm; routing algorithm; Mathematical model; Network topology; Optimization; Protocols; Routing; Servers; Topology; Data center routing; cloud computing; data center topology; load balancing; multipath routing; traffic engineering;
Journal_Title :
Parallel and Distributed Systems, IEEE Transactions on
DOI :
10.1109/TPDS.2012.343