Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: 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. ,  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,  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.
['Mahsa Armaghan', 'Abolfazl Toroghi Haghighat']
I am writing a research paper on a idea QoS Multicast Routing Algorithms Based on Tabu Search with Hybrid Candidate List
[{"from": "human", "value": "I am writing a research paper on a idea QoS Multicast Routing Algorithms Based on Tabu Search with Hybrid Candidate List"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: 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. ,  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,  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."}]