Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  investigate the allocation of multicast nodes and formalize it as splitter placement in wavelength-routed networks (SP-WRN) problem. The SP-WRN problem entails the placement of multicast nodes so that the overall network blocking probability is minimized. To gain a deeper insight into the computational complexity of the SP-WRN problem,  define a graph-theoretic version of the splitter placement problem (SPG), and show that even SPG is NP-complete.  develop three heuristics for the SP-WRN problem with different degrees of trade-off beten computation time an quality of solution. The first heuristic uses CPLEX, the second heuristic is based on a greedy approach, and the third heuristic employs simulated annealing. Numerical examples demonstrate that: (i) no more than 50% of the cross-connects need to be multi-case capable, and (ii) the iterative simulated annealing heuristic provides fast near-optimal solutions.
['Maher Ali', 'Jitender S. Deogun']
I am writing a research paper on a idea Allocation of multicast nodes in wavelength-routed networks
[{"from": "human", "value": "I am writing a research paper on a idea Allocation of multicast nodes in wavelength-routed networks"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  investigate the allocation of multicast nodes and formalize it as splitter placement in wavelength-routed networks (SP-WRN) problem. The SP-WRN problem entails the placement of multicast nodes so that the overall network blocking probability is minimized. To gain a deeper insight into the computational complexity of the SP-WRN problem,  define a graph-theoretic version of the splitter placement problem (SPG), and show that even SPG is NP-complete.  develop three heuristics for the SP-WRN problem with different degrees of trade-off beten computation time an quality of solution. The first heuristic uses CPLEX, the second heuristic is based on a greedy approach, and the third heuristic employs simulated annealing. Numerical examples demonstrate that: (i) no more than 50% of the cross-connects need to be multi-case capable, and (ii) the iterative simulated annealing heuristic provides fast near-optimal solutions."}]