Multicast routing for delay variation bound using a modified ant colony algorithm

Authors:
Hua Wang;Zhao Shi;Shuai Li
Affiliations:
School of Computer Science and Technology, Shandong University, Jinan, Shandong Province, PR China;School of Computer Science and Technology, Shandong University, Jinan, Shandong Province, PR China;School of Computer Science and Technology, Shandong University, Jinan, Shandong Province, PR China
Venue:
Journal of Network and Computer Applications
Year:
2009

Citing 7
Cited 1

Multicast routing for multimedia communication

IEEE/ACM Transactions on Networking (TON)
The ant colony optimization meta-heuristic

New ideas in optimization
Computers and Intractability; A Guide to the Theory of NP-Completeness

Computers and Intractability; A Guide to the Theory of NP-Completeness
BRITE: An Approach to Universal Topology Generation

MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Ant colony optimization theory: a survey

Theoretical Computer Science
A heuristic ant algorithm for solving QoS multicast routing problem

CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
Ant colony optimization for routing and load-balancing: survey and new directions

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans

QoS multicast tree construction in IP/DWDM optical internet by bio-inspired algorithms

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The delay and delay variation-bounded Steiner tree problem is an important multicast routing problem in real-time multimedia networks. Such a constrained Steiner tree problem is known to be NP-complete. This paper proposes an ant colony algorithm with orientation factor and applies it to multicast routing problem with the constraints of delay variation bound. The orientation factor enables the ant to get rid of the initial blindness when searching paths, makes use of the search results and reduces the misguiding effect of pheromone on irrelevant paths, thus overcoming the drawbacks of slow convergence existing in the basic ant colony algorithm, increasing the speed of convergence and speeding up the finding of feasible solution to the problem. The simulation results show that the modified algorithm makes it possible to find a feasible solution to the multicast routing problem with delay variation bound. Compared with the conventional ant colony algorithm, the convergence speed of the modified algorithm is improved.