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

  • Authors:

  • Mahsa Armaghan;Abolfazl T. Haghighat

  • Affiliations:

  • Department of Electrical, Computer & IT, Islamic Azad University, Qazvin Branch, Qazvin, Iran;Department of Electrical, Computer & IT, Islamic Azad University, Qazvin Branch, Qazvin, Iran

  • Venue:
  • FGIT '09 Proceedings of the 1st International Conference on Future Generation Information Technology
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Many multimedia network applications require multicast routing with certain Quality-of-Service (QoS) constraints. As constrained minimum Steiner tree problem, QoS multicast routing problem is known to be NP-Complete. The bandwidth constraint and the end-to-end delay constraint are two important QoS constraints. In this paper, we propose algorithms to solve the bandwidth-delay constrained least-cost multicast routing problem based on Tabu Search (TS) with an efficient candidate list strategy, which produces a good solution faster than the traditional simple TS-based algorithms. In addition, we use a simple form of systematic dynamic tabu tenure. Computational results for various random generated networks show that the proposed algorithms in comparison with the other existing short-term memory version of TS-based algorithms and heuristics are faster, more effective, and more suitable for large scale networks.