• DocumentCode
    566475
  • Title

    Traffic merging for energy-efficient datacenter networks

  • Author

    Carrega, Alessandro ; Singh, Suresh ; Bruschi, Roberto ; Bolla, Raffaele

  • Author_Institution
    Univ. of Genoa, Genoa, Italy
  • fYear
    2012
  • fDate
    8-11 July 2012
  • Firstpage
    1
  • Lastpage
    5
  • Abstract
    Numerous studies have shown that datacenter networks typically see loads of between 5% - 25% but the energy draw of these networks is equal to operating them at maximum load. In this paper, we propose a novel way to make these networks more energy proportional - that is, the energy draw scales with the network load. We propose the idea of traffic aggregation, in which low traffic from N links is combined together to create H <; N streams of high traffic. These streams are fed to H switch interfaces which run at maximum rate while the remaining interfaces are switched to the lowest possible one. We show that this merging can be accomplished with minimal latency and energy costs (less than 0.1W) while simultaneously allowing us a deterministic way of switching link rates between maximum and minimum. Using simulations based on previously developed traffic models, we show that 49% energy savings are obtained for 5% of the load while we get an energy savings of 22% for a 50% load. Hence, forasmuch as the packet losses are statistically insignificant, the results show that energy-proportional datacenter networks are indeed possible.
  • Keywords
    computer centres; energy conservation; power aware computing; energy costs; energy savings; energy-efficient datacenter networks; network load; switch interface; traffic aggregation; traffic merging; traffic models; Energy consumption; Merging; Network topology; Peer to peer computing; Switches; Topology; USA Councils;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Performance Evaluation of Computer and Telecommunication Systems (SPECTS), 2012 International Symposium on
  • Conference_Location
    Genoa
  • Print_ISBN
    978-1-4673-2235-5
  • Type

    conf

  • Filename
    6267016