By Topic

Load-balanced data aggregation tree construction for large scale cluster monitoring system

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Yuqian Xiao ; Sch. of Comput. Sci. & Eng., Beihang Univ., Beijing, China ; Mingfa Zhu ; Limin Xiao ; Li Ruan

The cluster monitoring system observes the operation of the system, analyzes the performance data, and displays results. It is crucial for cluster management and performance measurements as the monitoring data can be used to diagnose problems and to suggest remedies by both end users and system administrators. Scalable resource monitoring is essential to the cluster management. This paper proposes a scalable cluster monitoring architecture that builds a structured data aggregation tree(DAT) of master monitoring nodes by using the Chord P2P algorithm. The DAT leverages the Chord topology and routing mechanisms and it is implicitly constructed from native Chord routing paths without previous monitoring nodes membership and topology configuration. To balance the storage space used by monitoring data and computing load of the monitoring node, we propose a balanced routing algorithm that dynamically selects the parent of a node from its finger nodes by its distance to the root. We have evaluated the performance and scalability of our DAT-based monitoring system with up to 2500 nodes in a simulated environment. Our experiments results show that the balanced DAT scheme monitoring system scales well to a large number of nodes. Without explicitly configuring parent-child relationship, it is well adaptive to node arrival and departure and can be easily deployed.

Published in:

Information Networking and Automation (ICINA), 2010 International Conference on  (Volume:2 )

Date of Conference:

18-19 Oct. 2010