Hi, my name is Felipe . I work in the IT Services monitoring project. We developed a patch to Zabbix using Prefuse (a Java library for information visualization) to view the IT services tree created in Zabbix.
For status propagation from lower branches towards the root of the tree we created a weight and threshold algorithm for each service. In our implementation, each service have a weight for each status it may assume, and a service status is given by comparing the thresholds (also, one value for each status) to the sum of the weight of all its children, so, if the total weight is greater than an specific threshold, the service assume the associated status, and the parent node is re-calculated (thus, propagating).
We also wrote a daemon service in C to calculate the weight and threshold periodically.
Coming Soon, I post the source code.
thanks.
For status propagation from lower branches towards the root of the tree we created a weight and threshold algorithm for each service. In our implementation, each service have a weight for each status it may assume, and a service status is given by comparing the thresholds (also, one value for each status) to the sum of the weight of all its children, so, if the total weight is greater than an specific threshold, the service assume the associated status, and the parent node is re-calculated (thus, propagating).
We also wrote a daemon service in C to calculate the weight and threshold periodically.
Coming Soon, I post the source code.
thanks.


Comment