A tree-growth based ant colony algorithm for QoS multicast routing problem
H Wang, H Xu, S Yi, Z Shi - Expert Systems with Applications, 2011 - Elsevier
QoS multicast routing is a non-linear combinatorial optimization problem. It tries to find a
multicast routing tree with minimal cost that can satisfy constraints such as bandwidth, delay …
multicast routing tree with minimal cost that can satisfy constraints such as bandwidth, delay …
A tree-based particle swarm optimization for multicast routing
H Wang, X Meng, S Li, H Xu - Computer Networks, 2010 - Elsevier
QoS multicast routing is a non-linear combinatorial optimization problem. It tries to find a
multicast routing tree with minimal cost that can satisfy constraints such as bandwidth, delay …
multicast routing tree with minimal cost that can satisfy constraints such as bandwidth, delay …
Niched ant colony optimization with colony guides for QoS multicast routing
Abstract Quality-of-service (QoS) multicast routing is essential to many network applications
such as IPTV, Internet radio, multimedia broadcasting, and real-time telecommunication …
such as IPTV, Internet radio, multimedia broadcasting, and real-time telecommunication …
QoS multicast routing using teaching learning based optimization
The QoS multicast routing problem is to find a multicast routing tree with minimal cost that
can satisfy constraints such as bandwidth, delay. This problem is NP Complete. Hence, the …
can satisfy constraints such as bandwidth, delay. This problem is NP Complete. Hence, the …
A heuristic ant algorithm for solving QoS multicast routing problem
In this paper, we present an ant colony-based heuristic to solve QoS (quality of service)
constrained multicast routing problems. Our algorithm considers multiple QoS metrics, such …
constrained multicast routing problems. Our algorithm considers multiple QoS metrics, such …
GA-based heuristic algorithms for QoS based multicast routing
Computing the bandwidth-delay-constrained least-cost multicast routing tree is an NP-
complete problem. In this paper, we propose a novel QoS-based multicast routing algorithm …
complete problem. In this paper, we propose a novel QoS-based multicast routing algorithm …
Solving QoS multicast routing problem based on heuristic genetic algorithm
ZY Wang, BX Shi - CHINESE JOURNAL OF COMPUTERS-CHINESE …, 2001 - cjc.ict.ac.cn
Background In this paper, we study the bandwidth, delay, delay jitter, and packet loss-
constrained least-cost multicast routing problem which is known to be NP-complete, and …
constrained least-cost multicast routing problem which is known to be NP-complete, and …
[PDF][PDF] An improved discrete PSO with GA operators for efficient QoS-multicast routing
RF Abdel-Kader - International Journal of Hybrid Information Technology, 2011 - Citeseer
QoS multicast routing is a non-linear combinatorial optimization problem that arises in many
multimedia applications. Providing QoS support is crucial to guarantee effective …
multimedia applications. Providing QoS support is crucial to guarantee effective …
Study on QoS multicast routing based on ACO-PSO algorithm
X Chen, S Liu, J Guan, Q Liu - 2010 International Conference …, 2010 - ieeexplore.ieee.org
QoS multicast routing problem is a nonlinear combination optimization problem, which has
been proved to be a NP complete problem. a hybrid algorithm with ant colony optimization …
been proved to be a NP complete problem. a hybrid algorithm with ant colony optimization …
[PDF][PDF] Application of modified ant colony optimization (MACO) for multicast routing problem
SK Sahana, ALF Mohammad… - Int. J. Intell. Syst. Appl …, 2016 - academia.edu
It is well known that multicast routing is combinatorial problem finds the optimal path
between source destination pairs. Traditional approaches solve this problem by …
between source destination pairs. Traditional approaches solve this problem by …