Ant colony based self-adaptive energy saving routing for energy efficient Internet

  • Authors:
  • Young-Min Kim;Eun-Jung Lee;Hea-Sook Park;Jun-Kyun Choi;Hong-Shik Park

  • Affiliations:
  • Electronics and Telecommunications Research Institute (ETRI), Republic of Korea;Electrical Engineering Department, Korea Advanced Institute of Science and Technology (KAIST), Republic of Korea;Electronics and Telecommunications Research Institute (ETRI), Republic of Korea;Electrical Engineering Department, Korea Advanced Institute of Science and Technology (KAIST), Republic of Korea;Electrical Engineering Department, Korea Advanced Institute of Science and Technology (KAIST), Republic of Korea

  • Venue:
  • Computer Networks: The International Journal of Computer and Telecommunications Networking
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

According to recent research, the current Internet wastes energy due to an un-optimized network design, which does not consider the energy consumption of network elements such as routers and switches. Looking toward energy saving networks, a generalized problem called the energy consumption minimized network (EMN) had been proposed. However, due to the NP-completeness of this problem, it requires a considerable amount of time to obtain the solution, making it practically intractable for large-scale networks. In this paper, we re-formulate the NP-complete EMN problem into a simpler one using a newly defined concept called 'traffic centrality'. We then propose a new ant colony-based self-adaptive energy saving routing scheme, referred to as A-ESR, which exploits the ant colony optimization (ACO) method to make the Internet more energy efficient. The proposed A-ESR algorithm heuristically solves the re-formulated problem without any supervised control by allowing the incoming flows to be autonomously aggregated on specific heavily-loaded links and switching off the other lightly-loaded links. Additionally, the A-ESR algorithm adjusts the energy consumption by tuning the aggregation parameter @b, which can dramatically reduce the energy consumption during nighttime hours (at the expense of tolerable network delay performance). Another promising capability of this algorithm is that it provides a high degree of self-organizing capabilities due to the amazing advantages of the swarm intelligence of artificial ants. The simulation results in real IP networks show that the proposed A-ESR algorithm performs better than previous algorithms in terms of its energy efficiency. The results also show that this efficiency can be adjusted by tuning @b.