Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The NP-hard QoS Multicast Routing (QoSMR) is one of the most challenging problems in recent networks. ,  investigate the QoSMR problem as ll as its different existing formulations.  analyze the limitations of these formulations and propose a novel one. The main advantage of our formulation is that it considers not only the quality of the multicast subgraph formed by the computed paths, but also takes into account the end-to-end quality of each of these paths. Moreover,  study the state of the art proposal for solving the QoSMR problem and show that the ll-known MAMCRA algorithm can be very expensive in computation time. Therefore,  propose two efficient heuristics based on the computation of shortest paths. Extensive simulations are performed, and obtained results prove that these fast heuristics have bounded computation time and find satisfying solutions for the QoS requirements.
['Alia Bellabas', 'Samer Lahoud', 'Miklos Molnar']
I am writing a research paper on a idea Fast Heuristics for the QoS Multicast Routing Problem
[{"from": "human", "value": "I am writing a research paper on a idea Fast Heuristics for the QoS Multicast Routing Problem"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The NP-hard QoS Multicast Routing (QoSMR) is one of the most challenging problems in recent networks. ,  investigate the QoSMR problem as ll as its different existing formulations.  analyze the limitations of these formulations and propose a novel one. The main advantage of our formulation is that it considers not only the quality of the multicast subgraph formed by the computed paths, but also takes into account the end-to-end quality of each of these paths. Moreover,  study the state of the art proposal for solving the QoSMR problem and show that the ll-known MAMCRA algorithm can be very expensive in computation time. Therefore,  propose two efficient heuristics based on the computation of shortest paths. Extensive simulations are performed, and obtained results prove that these fast heuristics have bounded computation time and find satisfying solutions for the QoS requirements."}]