Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Scalable resource monitoring and discovery are essential to the planet-scale infrastructures such as grids and PlanetLab.  proposes a scalable grid monitoring architecture that builds distributed aggregation trees (DAT) on a structured P2P network like Chord. By leveraging Chord topology and routing mechanisms, the DAT trees are implicitly constructed from native Chord routing paths without membership maintenance. To balance the DAT trees,  propose a balanced routing algorithm on Chord that dynamically selects the parent of a node from its finger nodes by its distance to the root.  shows that this balanced routing algorithm enables the construction of almost completely balanced DATs, when nodes are evenly distributed in the Chord identifier space.  have evaluated the performance and scalability of a DAT prototype implementation with up to 8192 nodes. Our experimental results show that the balanced DAT scheme scales ll to a large number of nodes and corresponding aggregation trees. Without maintaining explicit parent-child membership, it has very low overhead during node arrival and departure.  demonstrate that the DAT scheme performs ll in grid resource monitoring.
['Min Cai', 'Kai Hwang']
I am writing a research paper on a idea Distributed Aggregation Algorithms with Load-Balancing for Scalable Grid Resource Monitoring
[{"from": "human", "value": "I am writing a research paper on a idea Distributed Aggregation Algorithms with Load-Balancing for Scalable Grid Resource Monitoring"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Scalable resource monitoring and discovery are essential to the planet-scale infrastructures such as grids and PlanetLab.  proposes a scalable grid monitoring architecture that builds distributed aggregation trees (DAT) on a structured P2P network like Chord. By leveraging Chord topology and routing mechanisms, the DAT trees are implicitly constructed from native Chord routing paths without membership maintenance. To balance the DAT trees,  propose a balanced routing algorithm on Chord that dynamically selects the parent of a node from its finger nodes by its distance to the root.  shows that this balanced routing algorithm enables the construction of almost completely balanced DATs, when nodes are evenly distributed in the Chord identifier space.  have evaluated the performance and scalability of a DAT prototype implementation with up to 8192 nodes. Our experimental results show that the balanced DAT scheme scales ll to a large number of nodes and corresponding aggregation trees. Without maintaining explicit parent-child membership, it has very low overhead during node arrival and departure.  demonstrate that the DAT scheme performs ll in grid resource monitoring."}]