Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: ,  consider the problem of protection of multi- cast connections against single link or node failures using redundant mul- ticast trees (RMTs). RMTs connect the source node of a multicast connec- tion to all its destinations in such a way that in the event of a single link or node failure in the network, every destination node is still connected to the source node in at least one of the two trees. Construction of RMTs has been studied extensively for undirected graphs, but not for directed graphs. Computing RMTs in directed graphs can be important in networks, for in- stance, where link capacity is available in one direction but not the other. Also, none of the schemes proposed in previous work provide a solution for finding optimal (minimal-cost) RMTs even for ighted undirected graphs.  show that a whole class of earlier schemes that are based on the concept of ear-decomposition cannot find optimal redundant trees in certain net- work topologies. To our knowledge,  are the first to consider the problem of finding optimal RMTs in directed graphs.  present a novel efficient scheme for construction of optimal RMTs in networks modeled as ighted undirected as ll as directed graphs.
['Yigal Bejerano', 'Pramod V. Koppol']
I am writing a research paper on a idea Optimal Construction of Redundant Multicast Trees in Directed Graphs
[{"from": "human", "value": "I am writing a research paper on a idea Optimal Construction of Redundant Multicast Trees in Directed Graphs"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: ,  consider the problem of protection of multi- cast connections against single link or node failures using redundant mul- ticast trees (RMTs). RMTs connect the source node of a multicast connec- tion to all its destinations in such a way that in the event of a single link or node failure in the network, every destination node is still connected to the source node in at least one of the two trees. Construction of RMTs has been studied extensively for undirected graphs, but not for directed graphs. Computing RMTs in directed graphs can be important in networks, for in- stance, where link capacity is available in one direction but not the other. Also, none of the schemes proposed in previous work provide a solution for finding optimal (minimal-cost) RMTs even for ighted undirected graphs.  show that a whole class of earlier schemes that are based on the concept of ear-decomposition cannot find optimal redundant trees in certain net- work topologies. To our knowledge,  are the first to consider the problem of finding optimal RMTs in directed graphs.  present a novel efficient scheme for construction of optimal RMTs in networks modeled as ighted undirected as ll as directed graphs."}]