TSDLMRA: an efficient multicast routing algorithm based on tabu search

Authors:
Heng Wang;Jie Wang;Hua Wang;Ya-Min Sun
Affiliations:
Department of Computer Science and Technology, Nanjing University of Science and Technology, 608 Staff Room, Nanjing 210094, China;Department of Computer Science and Technology, Nanjing University of Science and Technology, 608 Staff Room, Nanjing 210094, China;Department of Computer Science and Technology, Nanjing University of Science and Technology, 608 Staff Room, Nanjing 210094, China;Department of Computer Science and Technology, Nanjing University of Science and Technology, 608 Staff Room, Nanjing 210094, China
Venue:
Journal of Network and Computer Applications
Year:
2004

Citing 6
Cited 8

Multicast routing for multimedia communication

IEEE/ACM Transactions on Networking (TON)
Introduction to Algorithms

Introduction to Algorithms
A source-based algorithm for delay-constrained minimum-cost multicasting

INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1
Multicast routing for real-time communication of high-speed networks

Multicast routing for real-time communication of high-speed networks
Evaluation of multicast routing algorithms for real-time communication on high-speed networks

IEEE Journal on Selected Areas in Communications
Destination-driven routing for low-cost multicast

IEEE Journal on Selected Areas in Communications

Landscape analysis for multicast routing

Computer Communications
Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing

Computers and Operations Research
Harmony search based algorithms for bandwidth-delay-constrained least-cost multicast routing

Computer Communications
QoS Multicast Routing Algorithms Based on Tabu Search with Hybrid Candidate List

FGIT '09 Proceedings of the 1st International Conference on Future Generation Information Technology
An effective candidate list strategy for tabu search based QoS multicast routing

SoftCOM'09 Proceedings of the 17th international conference on Software, Telecommunications and Computer Networks
Mobility-based multicast routing algorithm for wireless mobile Ad-hoc networks: A learning automata approach

Computer Communications
A hybrid scatter search meta-heuristic for delay-constrained multicast routing problems

Applied Intelligence
Particle swarm optimization for the Steiner tree in graph and delay-constrained multicast routing problems

Journal of Heuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

As a NP-Complete problem, multicast routing with delay constraint is a research difficulty in routing problem. Tabu Search is artificial intelligence algorithm, which is an extension of local search algorithm and has simple realization and well properties. In this paper, an efficient algorithm based on Tabu Search for Delay-Constrained Low-Cost Multicast Routing is proposed to solve delay-constrained multicast routing problem. This problem is known to be NP-Complete. The proposed heuristic algorithm makes use of the characteristics of flexible memory function and tabu rule in TS algorithm, generates neighborhood structure base on 'paths-switching' operations, and finds multicast tree satisfying constraint. A large number of simulations demonstrate that the algorithm performs excellent performance of cost, rapid convergence and stable performance of delay.