Smokeping::matchers::Median3
Find persistant changes in latency
Overview
The idea behind this matcher is to find sustained changes in latency.
The median matcher takes a number of past median latencies. It splits the latencies into two groups (old and new) and again finds the median for each groups. If the difference between the two medians is bigger than a certain value, it will give a match.
Overview
Call the matcher with the following sequence:
type = matcherpattern = Median(old=>x,new=>y,diff=>z)
This will create a matcher which consumes x+y latency-datapoints, builds the two medians and the matches if the difference between the median latency is larger than z seconds.
Releases
3 releases since Debian 4.0 (Etch); the text changed 2 times.