%0 Journal Article %A LIU Liang %A ZHANG Lin %A YANG Liu %A PANG Ruiqin %A WANG Tao %T Correlation-Aware Traffic Consolidation Algorithm in Data Center Networks %D 2019 %R 10.3778/j.issn.1002-8331.1810-0057 %J Computer Engineering and Applications %P 62-67 %V 55 %N 24 %X With big data and cloud computing continue to integrate into people’s daily lives, the energy consumption of data center networks, which are the infrastructure that underpins their development, is also rapidly increasing. To solve this problem, Energy-Aware Routing(EAR) is proposed. The main idea of EAR is that traffic demand are gathered over a subset of the network links, sleeping unused network equipment to save energy. However, during traffic peak time, network device patterns are switched frequently, which can cause network oscillation and performance degradation. Therefore, this paper proposes a Correlation-Aware Traffic Consolidation(CATC) algorithm in data center network. This paper proposes CATC model based on Software Defined Network(SDN), which considers the correlation between traffics during traffic consolidation and the adaptive link rate to save more energy. The CATC problem is formulated as an optimal traffic allocation problem subject to flow conservation constraint and link capacity constraint. Furthermore, the optimization problem is solved by the CATC algorithm. The simulation result shows, the CATC algorithm not only saves energy upto 45% at most for the data center network, but also increases little network delay compared with general centralized solutions. %U http://cea.ceaj.org/EN/10.3778/j.issn.1002-8331.1810-0057