Multicast routing for multimedia communication
IEEE/ACM Transactions on Networking (TON)
Tabu Search
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
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
TSDLMRA: an efficient multicast routing algorithm based on tabu search
Journal of Network and Computer Applications
Metaheuristics for optimization problems in computer communications
Computer Communications
QoS-driven multicast tree generation using Tabu search
Computer Communications
Evaluation of multicast routing algorithms for real-time communication on high-speed networks
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
Multicast routing with Quality-of-Service constraints is one of the most important problems in computer networks as constrained Steiner tree problem. It is a well-known NP-complete problem, which has various real-time multimedia applications in high-speed networks. In this paper, we propose algorithms to solve the bandwidth-delay-constrained least-cost multicast routing problem based on Tabu Search. The main feature of proposed TS-based algorithms is use of an effective candidate list strategy. By the use of this strategy not only search speed but also solution quality will be improved. We evaluate the performance and efficiency of the proposed algorithms on a variety of random generated networks. Evaluation results indicate that the proposed algorithms overcome the other existing short-term memory version of TS-based algorithms and heuristics.