Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Network tomography has been proposed to ascertain internal network performances from end-to-end measurements. In this work,  present \emph{priority probing}, an optimal probing scheme for unicast network delay tomography that is proven to provide the most accurate estimation.  first demonstrate that the Fisher information matrix in unicast network delay tomography can be decomposed into an additive form where each term can be obtained numerically. This establishes the space over which  can design the optimal probing scheme. Then,  formulate the optimal probing problem into a semi-definite programming (SDP) problem. High computation complexity constrains the SDP solution to only small scale scenarios. In response,  propose a greedy algorithm that approximates the optimal solution. Evaluations through simulation demonstrate that priority probing effectively increases estimation accuracy with a fixed number of probes.
['Yu Gu 0004', 'Guofei Jiang', 'Vishal Singh', 'Yueping Zhang']
I am writing a research paper on a idea Optimal Probing for Unicast Network Delay Tomography
[{"from": "human", "value": "I am writing a research paper on a idea Optimal Probing for Unicast Network Delay Tomography"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Network tomography has been proposed to ascertain internal network performances from end-to-end measurements. In this work,  present \\emph{priority probing}, an optimal probing scheme for unicast network delay tomography that is proven to provide the most accurate estimation.  first demonstrate that the Fisher information matrix in unicast network delay tomography can be decomposed into an additive form where each term can be obtained numerically. This establishes the space over which  can design the optimal probing scheme. Then,  formulate the optimal probing problem into a semi-definite programming (SDP) problem. High computation complexity constrains the SDP solution to only small scale scenarios. In response,  propose a greedy algorithm that approximates the optimal solution. Evaluations through simulation demonstrate that priority probing effectively increases estimation accuracy with a fixed number of probes."}]