GA-based heuristic algorithms for bandwidth-delay-constrained least-cost multicast routing

  • Authors:

  • A. T. Haghighat;K. Faez;M. Dehghan;A. Mowlaei;Y. Ghahremani

  • Affiliations:

  • Department of Electrical Engineering, Amirkabir University of Technology, Tehran 15914, Iran and Atomic Energy Organization of Iran (AEOI), Tehran, Iran;Department of Electrical Engineering, Amirkabir University of Technology, Tehran 15914, Iran;Iran Telecommunication research Center (ITRC), Tehran, Iran and Department of Computer Engineering, Iran University of Science and Technology, Tehran, Iran;Department of Electrical Engineering, Amirkabir University of Technology, Tehran 15914, Iran;Iran Telecommunication research Center (ITRC), Tehran, Iran

  • Venue:
  • Computer Communications
  • Year:
  • 2004

Quantified Score

Hi-index 0.25

Visualization

Abstract

The bandwidth-delay-constrained least-cost multicast routing is a challenging problem in high-speed multimedia networks. Computing such a constrained Steiner tree is an NP-complete problem. In this paper, we propose several novel solutions to this problem based on genetic algorithms (GA). The proposed solutions consist of six different schemes for genotype representation, and also several new heuristic algorithms for mutation, crossover, and creation of random individuals. We evaluate the performance and efficiency of the proposed algorithms in comparison with other existing heuristic and GA-based algorithms using simulation results. The most efficient combination of various proposed alternative algorithms is selected as our final solution by the simulation results. This proposed GA-based algorithm has overcome the existing algorithms considering average tree cost and running time.