Multicast routing for multimedia communication
IEEE/ACM Transactions on Networking (TON)
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
Routing and admission control algorithms for multimedia traffic
Computer Communications
Evaluation of multicast routing algorithms for real-time communication on high-speed networks
IEEE Journal on Selected Areas in Communications
Routing of multipoint connections
IEEE Journal on Selected Areas in Communications
A comparison of two optimal approaches for the MCOP problem
Journal of Network and Computer Applications
Applying tabu search to backup path planning for multicast networks
Computers and Operations Research
Dynamic multicast routing algorithm for delay and delay variation-bounded Steiner tree problem
Knowledge-Based Systems
A Tabu Clustering algorithm for Intrusion Detection
Intelligent Data Analysis
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
Cost-Constrained minimum-delay multicasting
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Hi-index | 0.24 |
Many multimedia communication applications require a source to transmit messages to multiple destinations subject to Quality-of-Service (QoS) delay constraint. The problem to be solved is to find a minimum cost multicast tree where each source to destination path is constrained by a delay bound. This problem has been proven to be NP-complete. In this paper, we present a Tabu Search (TS) algorithm to construct a minimum cost delay bounded multicast tree. The proposed algorithm is then compared with many existing multicast algorithms. Results show that on almost all test cases, TS algorithm exhibits more intelligent search of the solution subspace and is able to find better solutions than other reported multicast algorithms.