Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: When paths share a common congested link, they will all suffer from a performance degradation. Boolean tomography exploits these performance-level correlations beten different paths to identify the congested links. It is clear that the congestion of a path will be distinctly intensive when it traverses multiple congested links.  adopt an enlarged state space model to mirror different congestion levels and employ a system of integer equations, instead of Boolean equations, to describe relationships beten the path states and the link states.  recast the problem of identifying congested links into a constraint optimization problem, including Boolean tomography as a special case. For a logical tree,  propose an up-to-bottom algorithm and prove that it always achieves a solution to the problem. Compared with existing algorithms, the simulation results show that our proposed algorithm achieves a higher detection rate while keeping a low false positive rate.
['Shengli Pan', 'Zhiyong Zhang', 'Yingjie Zhou', 'Feng Qian', 'Guangmin Hu']
I am writing a research paper on a idea Identify Congested Links Based on Enlarged State Space
[{"from": "human", "value": "I am writing a research paper on a idea Identify Congested Links Based on Enlarged State Space"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: When paths share a common congested link, they will all suffer from a performance degradation. Boolean tomography exploits these performance-level correlations beten different paths to identify the congested links. It is clear that the congestion of a path will be distinctly intensive when it traverses multiple congested links.  adopt an enlarged state space model to mirror different congestion levels and employ a system of integer equations, instead of Boolean equations, to describe relationships beten the path states and the link states.  recast the problem of identifying congested links into a constraint optimization problem, including Boolean tomography as a special case. For a logical tree,  propose an up-to-bottom algorithm and prove that it always achieves a solution to the problem. Compared with existing algorithms, the simulation results show that our proposed algorithm achieves a higher detection rate while keeping a low false positive rate."}]