Advances in Computer Science : an International Journal (ACSIJ)
At the age of multimedia communications and high speed networks, multicast is one of the mechanisms which the users 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. Two important parameters in QoS-supported multicast communications are bandwidth and end-to-end delay. The main goal of multicast routing is finding a least-cost tree which is called Steiner Tree. This problem belongs to NPComplete problems, so it is necessary to use heuristic-based or artificial intelligence - based algorithms to solve it.