Energy-efficient multicast routing by using genetic local search

Katerinchuk, Valeri, Albrecht, Andreas A. and Steinhofel, Kathleen (2014) Energy-efficient multicast routing by using genetic local search. In: 6th International Conference on Agents and Artificial Intelligence, 06-08 Mar 2014, Angers, France.

Full text is not in this repository.

Abstract

Energy-efficient multicast routing algorithms have predominantly focused on wireless or ad-hoc mobile networks. However, since the turn of the century the need for energy efficient approaches to routing in wired networks has been steadily rising. In this paper, we introduce an objective function for multicast routing in wired networks taking energy consumption into consideration. A number of hybrid Genetic and Simulated Annealing based algorithms have been shown to be able to find better solutions to the multicast routing problem compared to solely Genetic or Simulated Annealing based algorithms. Our approach adapts a population-based hybrid algorithm for routing multiple simultaneous multicast requests. We examine the performance in terms of energy efficiency against solutions found by Logarithmic Simulated Annealing and Genetic based algorithms. We find that the hybrid approach, in 87% of instances, was able to find superior solutions, and in 96% of instances, solutions superior or equal to the best solution given by either Simulated Annealing or Genetic approaches. The extent of the improvement however varied greatly from a few hundred to within ten Joules, with the improvement on the best solution ranging from 5.6 to 531.5 Joules.

Item Type: Conference or Workshop Item (Paper)
Research Areas: A. > School of Science and Technology > Computer Science
Item ID: 13131
Depositing User: Andreas Albrecht
Date Deposited: 20 Mar 2014 16:27
Last Modified: 12 Jun 2019 12:50
URI: https://eprints.mdx.ac.uk/id/eprint/13131

Actions (login required)

Edit Item Edit Item