Path Consolidation for Dynamic Right-Sizing of Data Center Networks

Data center topologies typically consist of multi-rooted trees with many equal-cost paths between a given pair of hosts. Existing power optimization techniques do not utilize this property of data center networks for power proportionality. In this paper, the authors exploit this opportunity and show that significant energy savings can be achieved via path consolidation in the network. They present an offline formulation for the flow assignment in a data center network and develop an online algorithm by path consolidation for dynamic right-sizing of the network to save energy. To validate their algorithm, they build a flow level simulator for a data center network.

Provided by: University of Calgary Topic: Data Centers Date Added: Feb 2013 Format: PDF

Find By Topic