Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Various network monitoring and performance evaluation schemes generate considerable amount of traf- fic, which affects network performance.   describe a method for minimizing network monitoring overhead based on Shortest Path Tree (SPT) protocol.  describe two different variations of the problem: the   A Problem and the  E -Problem and prove that finding optimal solutions for both  A - and  E -problems is  NP -hard.  also show that in general, an  A -problem solution requires a significantly higher network overhead than an  E -problem solution.  propose optimal approximation algorithms for the  A - and  E -problems and few different heuristics for the  E -problem. Namely,  show that one can compute in polynomial time an  O(ln|V |) -approximate solution for each of these problems.  analyze the performance of our approximation algorithms and heuristics on large graphs generated using Por-Law model. Performance results show that our heuristic algorithms for both problems achieve from 50% to 90% improvement in the network overhead comparatively with earlier algorithms that appeared in literature.
['Yuri Breitbart', 'Feodor F. Dragan', 'Hassan Gobjuka']
I am writing a research paper on a idea Effective Monitor Placement in Internet Networks
[{"from": "human", "value": "I am writing a research paper on a idea Effective Monitor Placement in Internet Networks"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Various network monitoring and performance evaluation schemes generate considerable amount of traf- fic, which affects network performance.   describe a method for minimizing network monitoring overhead based on Shortest Path Tree (SPT) protocol.  describe two different variations of the problem: the   A Problem and the  E -Problem and prove that finding optimal solutions for both  A - and  E -problems is  NP -hard.  also show that in general, an  A -problem solution requires a significantly higher network overhead than an  E -problem solution.  propose optimal approximation algorithms for the  A - and  E -problems and few different heuristics for the  E -problem. Namely,  show that one can compute in polynomial time an  O(ln|V |) -approximate solution for each of these problems.  analyze the performance of our approximation algorithms and heuristics on large graphs generated using Por-Law model. Performance results show that our heuristic algorithms for both problems achieve from 50% to 90% improvement in the network overhead comparatively with earlier algorithms that appeared in literature."}]