Multicast Routing Algorithm Based On Genetic Algorithm
نویسندگان
چکیده
منابع مشابه
Multicast Routing Algorithm Based On Genetic Algorithm
MRAGA (Multicast Routing Algorithm based on Genetic algorithm) for the DelayConstrained Minimum-Energy Multicast Routing problem was presented. The genetic operators of this algorithm reduce the transmission delay and energy consumption of multicast trees, thus accelerating the convergence speed of the algorithm. Experiment results show that the multicast tree found by this algorithm not only g...
متن کاملMulticast computer network routing using genetic algorithm and ant colony
Due to the growth and development of computer networks, the importance of the routing topic has been increased. The importance of the use of multicast networks is not negligible nowadays. Many of multimedia programs need to use a communication link to send a packet from a sender to several receivers. To support such programs, there is a need to make an optimal multicast tree to indicate the opt...
متن کاملQoS Multicast Routing Algorithm Based on Crowding Ant Colony Algorithm
The basic ant colony algorithm is easy to fall into local optimum and its convergent speed is slow for solving multiple QoS multicast routing problems. Therefore, a crowding ant colony algorithm is proposed in this paper to solve the problems. Crowded degree in artificial fish swarm algorithm is used to adjust nodes transition strategy dynamically according to the congestion of nodes. Stagnatio...
متن کاملMultiple constraints QoS multicast routing optimization algorithm based on Genetic Tabu Search Algorithm
With the fast evolution of real time and multimedia applications, some quality of service (QoS) constraints need to be guaranteed in the underlying network. In this paper, we present a new method for least-cost QoS multicast routing problem based on genetic algorithm and tabu search. This problem has been proven to be NP-complete. The proposed genetic tabu search algorithm (GTS) combine Genetic...
متن کاملMultiobjective Multicast Routing Algorithm
This paper presents a new multiobjective multicast routing algorithm (MMA) based on the Strength Pareto Evolutionary Algorithm (SPEA), which simultaneously optimizes the cost of the tree, the maximum end-to-end delay, the average delay and the maximum link utilization. In this way, a set of optimal solutions, known as Pareto set, is calculated in only one run, without a priori restrictions. Sim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Future Generation Communication and Networking
سال: 2015
ISSN: 2233-7857
DOI: 10.14257/ijfgcn.2015.8.6.08