• DocumentCode
    1938105
  • Title

    Heuristics for dynamic topologies to reduce power consumption of networks

  • Author

    Aldraho, Abdelnour ; Kist, Alexander A.

  • Author_Institution
    Univ. of Southern Queensland, Toowoomba, QLD, Australia
  • fYear
    2010
  • fDate
    Oct. 31 2010-Nov. 3 2010
  • Firstpage
    31
  • Lastpage
    36
  • Abstract
    Energy consumption of communication networks is an important contributor to the ICT sector´s greenhouse gas emission footprint. This research project focuses on power consumption reduction of communication networks by dynamically adapting network configuration to traffic demands. This is promising as networks are often under utilised over long periods. In the context of this work, dynamic topologies refers to a method of changing network links and nodes according to traffic loads. In this paper preliminary results are introduced and two simple heuristics are investigated: the Lightest Node First and the Least Loaded Node algorithms. Both generate reduced topologies for given traffic loads with smaller energy footprints than unmodified networks. Initial numerical results are presented for a small sample network of eight nodes with a large set of traffic demands. Depending on overall network utilisation, the algorithms are able to reduce the average network power consumption by up to 50% for this sample network.
  • Keywords
    air pollution; energy consumption; telecommunication network topology; telecommunication traffic; ICT sector; communication network; dynamic topology; energy consumption; greenhouse gas emission footprint; heuristics; least loaded node algorithm; lightest node first algorithm; network utilisation; power consumption reduction; traffic demands; Context; Heuristic algorithms; Network topology; Optimization; Power demand; Routing; Topology;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Telecommunication Networks and Applications Conference (ATNAC), 2010 Australasian
  • Conference_Location
    Auckland
  • Print_ISBN
    978-1-4244-8173-6
  • Electronic_ISBN
    978-1-4244-8171-2
  • Type

    conf

  • DOI
    10.1109/ATNAC.2010.5680252
  • Filename
    5680252