Smokeping::matchers::Median(3S)mokePinSgmokeping::matchers::Median(3)



NNAAMMEE
       Smokeping::matchers::Median - Find persistant changes in
       latency

OOVVEERRVVIIEEWW
       The idea behind this matcher is to find sustained changes
       in latency.

       The median matcher takes a number of past median laten-
       cies. 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 cer-
       tain value, it will give a match.

DDEESSCCRRIIPPTTIIOONN
       Call the matcher with the following sequence:

        type = matcher
        pattern =  Median(old=>x,new=>y,diff=>z)

       This will create a matcher which consumes x+y latency-dat-
       apoints, builds the two medians and the matches if the
       difference between the median latency is larger than z
       seconds.

CCOOPPYYRRIIGGHHTT
       Copyright (c) 2004 by OETIKER+PARTNER AG. All rights
       reserved.

LLIICCEENNSSEE
       This program is free software; you can redistribute it
       and/or modify it under the terms of the GNU General Public
       License as published by the Free Software Foundation;
       either version 2 of the License, or (at your option) any
       later version.

       This program is distributed in the hope that it will be
       useful, but WITHOUT ANY WARRANTY; without even the implied
       warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
       PURPOSE.  See the GNU General Public License for more
       details.

       You should have received a copy of the GNU General Public
       License along with this program; if not, write to the Free
       Software Foundation, Inc., 675 Mass Ave, Cambridge, MA
       02139, USA.

AAUUTTHHOORR
       Tobias Oetiker <tobi@oetiker.ch>



2.0.9                       2005-02-S2m2okeping::matchers::Median(3)
