1
matchers::median(3) SmokePing matchers::median(3)
6
matchers::median - Find persistant change in latency
9
The idea behind this matcher is to find sustained changes
12
The median matcher takes a number of past median laten-
13
cies. It splits the latencies into two groups (old and
14
new) and again finds the median for each groups. If the
15
difference between the two medians is bigger than a cer-
16
tain value, it will give a match.
18
DDEESSCCRRIIPPTTIIOONN
19
Call the matcher with the following sequence:
22
pattern = median(old=>x,new=>y,diff=>z)
24
This will create a matcher which consumes x+y latency-dat-
25
apoints, builds the two medians and the matches if the
26
difference between the median latency is larger than z
30
Copyright (c) 2004 by OETIKER+PARTNER AG. All rights
34
This program is free software; you can redistribute it
35
and/or modify it under the terms of the GNU General Public
36
License as published by the Free Software Foundation;
37
either version 2 of the License, or (at your option) any
40
This program is distributed in the hope that it will be
41
useful, but WITHOUT ANY WARRANTY; without even the implied
42
warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
43
PURPOSE. See the GNU General Public License for more
46
You should have received a copy of the GNU General Public
47
License along with this program; if not, write to the Free
48
Software Foundation, Inc., 675 Mass Ave, Cambridge, MA
52
Tobias Oetiker <tobi@oetiker.ch>
56
1.33 2004-11-07 matchers::median(3)