Abstract: The problem of QoS multicast routing is to find a multicast tree with the least expense/cost which would meet the limitations such as band width, delay and loss rate. This is a NP-Complete problem. To solve the problem of multicast routing, the entire routes from the source node to every destination node are often recognized. Then the routes are integrated and changed into a single multicast tree. But they are slow and complicated methods. The present paper introduces a new tree-based optimization method to overcome such weaknesses. The recommended method directly optimizes the multicast tree. Therefore a tree-based typology including several spanning trees is created which combines the trees two by two. For this purpose, the Cuckoo Algorithm is used which is proved to be well converged and makes quick calculations. The simulation conducted on different types of network typologies proved that it is a practical and influential algorithm

Mahmood Sardarpour, Hasan Hosseinzadeh and Mehdi Effatparvar, “Multicast Routing Problem Using Tree-Based Cuckoo Optimization Algorithm” International Journal of Advanced Computer Science and Applications(IJACSA), 7(6), 2016. http://dx.doi.org/10.14569/IJACSA.2016.070618

@article{Sardarpour2016,
title = {Multicast Routing Problem Using Tree-Based Cuckoo Optimization Algorithm},
journal = {International Journal of Advanced Computer Science and Applications}
doi = {10.14569/IJACSA.2016.070618},
url = {http://dx.doi.org/10.14569/IJACSA.2016.070618},
year = {2016},
publisher = {The Science and Information Organization},
volume = {7},
number = {6},
author = {Mahmood Sardarpour and Hasan Hosseinzadeh and Mehdi Effatparvar},
}