• DocumentCode
    650647
  • Title

    Path Consolidation for Dynamic Right-Sizing of Data Center Networks

  • Author

    Adnan, Muhammad Abdullah ; Gupta, Rajesh

  • Author_Institution
    Univ. of California San Diego, La Jolla, CA, USA
  • fYear
    2013
  • fDate
    June 28 2013-July 3 2013
  • Firstpage
    581
  • Lastpage
    588
  • Abstract
    Data center topologies typically consist of multirooted 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, we exploit this opportunity and show that significant energy savings can be achieved via path consolidation in the network. We 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 our algorithm, we build a flow level simulator for a data center network. Our simulation on flow traces generated from MapReduce workload shows 80% reduction in network energy consumption in data center networks and ~25% more energy savings compared to the existing techniques for saving energy in data center networks.
  • Keywords
    computer centres; energy conservation; power aware computing; MapReduce workload; data center networks; data center topologies; dynamic right-sizing; energy savings; flow level simulator; flow trace generation; multirooted trees; path consolidation; power optimization techniques; power proportionality; Bandwidth; Data models; Energy consumption; Heuristic algorithms; Network topology; Power demand; Topology;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Cloud Computing (CLOUD), 2013 IEEE Sixth International Conference on
  • Conference_Location
    Santa Clara, CA
  • Print_ISBN
    978-0-7695-5028-2
  • Type

    conf

  • DOI
    10.1109/CLOUD.2013.106
  • Filename
    6676743