QoS Routing in Multicast Networks Based on Imperialism Competition Algorithm

At the age of multimedia communications and high speed networks, multicast is one of the mechanisms which we can employ to enjoy the power of internet. On the other hand,increase in real-time multimedia applications, has emerged the need for Quality of Service (QoS) in multicast routing. Twoimportant parameters in QoS-supported multicast communications are bandwidth and end- to-end delay. The main goal of multicast routing is finding a least-cost treewhich is called Steiner Tree. This problem belongs to NPComplete problems, so it is necessary to use heuristic-based orartificial intelligence – based algorithms to solve it. Imperialism Competition Algorithm (ICA) is a method in evolutionary mathematics which finds the optimum solutionfor different optimization problems. In this paper, we use ICA to solve QoS multicast routing problem and create the minimum Steiner tree whileconsidering QoS parameters such as end-to-end delay and bandwidth

QoS Routing in Multicast Networks Based on Imperialism Competition Algorithm Keywords:

Multicast , Quality of Service , Minimum Steiner Tree , Imperialism Competition Algorithm