A rearrangeable algorithm for the construction delay-constrained dynamic multicast trees
IEEE/ACM Transactions on Networking (TON)
Future Generation Computer Systems
Expert Systems with Applications: An International Journal
Review: A review of ant algorithms
Expert Systems with Applications: An International Journal
MOEAQ: A QoS-Aware Multicast Routing algorithm for MANET
Expert Systems with Applications: An International Journal
Expert Systems with Applications: An International Journal
Efficient Multicast Algorithms for Multichannel Wireless Mesh Networks
IEEE Transactions on Parallel and Distributed Systems
A survey of multicast routing protocols for mobile Ad-Hoc networks
IEEE Communications Surveys & Tutorials
An orthogonal genetic algorithm for multimedia multicast routing
IEEE Transactions on Evolutionary Computation
Ant system: optimization by a colony of cooperating agents
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
GA-based heuristic algorithms for bandwidth-delay-constrained least-cost multicast routing
Computer Communications
Evaluation of multicast routing algorithms for real-time communication on high-speed networks
IEEE Journal on Selected Areas in Communications
A swarm intelligence based algorithm for qos multicast routing problem
SEMCCO'11 Proceedings of the Second international conference on Swarm, Evolutionary, and Memetic Computing - Volume Part II
Hi-index | 12.05 |
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, and delay jitter. This problem is NP-complete. The solution to such problems is often to search first for paths from the source node to each destination node and then integrate these paths into a multicast tree. Such a method, however, is slow and complex. To overcome these shortcomings, we propose a new method for tree-based optimization. Our algorithm optimizes the multicast tree directly, unlike the conventional solutions to finding paths and integrating them to generate a multicast tree. It applies ant colony optimization to control the tree growth in order to generate a multicast tree. Via orthogonal experiments, the most efficient combination of various parameters is selected so that the quality of optimization is improved. We then evaluate the performance and efficiency of the proposed algorithm in comparison with other existing algorithms. Simulation results show that our algorithm performs well in searching, converging speed and adaptability scale.