GA-based heuristic algorithms for QoS based multicast routing

Y Ghahremani - Knowledge-Based Systems, 2003 - Elsevier
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 …
被引用次数：92 相关文章
[PDF] researchgate.net

[PDF][PDF] GA-Based Heuristic Algorithms for QoS Based Multicast Routing

AT Haghighat, K Faez, M Dehghanc… - Knowledge-Based …, 2003 - researchgate.net
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 …
[PDF] psu.edu

[PDF][PDF] GA-Based Heuristic Algorithms for QoS Based Multicast Routing

AT Haghighat, K Faez, M Dehghanc, A Mowlaei… - Knowledge-Based …, 2003 - Citeseer
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 …

GA-based heuristic algorithms for QoS based multicast routing

AT Haghighat, K Faez, M Dehghan, A Mowlaei… - Knowledge-Based …, 2003 - dl.acm.org
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 …

GA-Based Heuristic Algorithms for QoS Based Multicast Routing

AT Haghighat, K Faez, M Dehghan, A Mowlaei… - Knowledge-Based …, 2003 - infona.pl
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 …