Multicast Routing Based on Genetic Algorithms

Abstract

Due to the advent of many new multimedia applications in high speed networks, the issue of multicast routing has become more and more important. The multicast routing problem in computer networks is also known as the Stenier tree problem which has been shown to be NP-complete. In this paper, we propose a new multicast routing algorithm based on Genetic Algorithms. Computer simulations are conducted to evaluate the performance of the proposed algorithm. Our numerical results show that , under non-fully connected networks, our algorithm is able to find a better solution very promising heuristic algorithm for the Steiner tree problem.