manual:config:triggers:prediction

This shows you the differences between two versions of the page.

manual:config:triggers:prediction [2015/09/28 11:54] martins-v explaining what is meant by 'tools' |
manual:config:triggers:prediction [2018/08/09 07:11] |
||
---|---|---|---|

Line 1: | Line 1: | ||

- | ==== 8 Forecasting functions ==== | ||

- | === Overview === | ||

- | |||

- | Sometimes there are signs of the upcoming problem. These signs can be spotted so that actions may be taken in advance to prevent or at least minimize the impact of the problem. Zabbix has tools to predict the future behaviour of the monitored system based on historic data. These tools are realized as predictive trigger functions. | ||

- | |||

- | === - Functions === | ||

- | |||

- | Two things one needs to know is how to define a problem state and how much time is needed to take action. Then there are two ways to set up a trigger signalling about a potential unwanted situation. First: trigger must fire when system after "time to act" is expected to be in problem state. Second: trigger must fire when system is going to reach the problem state in less than "time to act". Corresponding trigger functions to use are **forecast** and **timeleft**. Note that underlying statistical analysis is basically identical for both functions. You may set up a trigger whichever way you prefer with similar results. | ||

- | |||

- | === - Parameters === | ||

- | |||

- | Both functions use almost the same set of parameters. Use the list of [[manual/appendix/triggers/functions|supported functions]] for reference. | ||

- | |||

- | == - Time interval == | ||

- | |||

- | First of all you should specify the historic period Zabbix should analyse to come up with prediction. You do it in a familiar way by means of ''sec'' or ''#num'' parameter and optional ''time_shift'' like you do it with **avg**, **count**, **delta**, **max**, **min** and **sum** functions. | ||

- | |||

- | == - Forecasting horizon == | ||

- | |||

- | (**forecast** only)\\ Parameter ''time'' specifies how far in the future Zabbix should extrapolate dependencies it finds in historic data. No matter if you use ''time_shift'' or not, ''time'' is always counted starting from the current moment. | ||

- | |||

- | == - Threshold to reach == | ||

- | |||

- | (**timeleft** only)\\ Parameter ''threshold'' specifies a value the analysed item has to reach, no difference if from above or from below. Once we have determined f(t) (see below) we should solve equation f(t) = ''threshold'' and return the root which is closer to now and to the right from now or 999999999999.9999 if there is no such root. | ||

- | |||

- | == - Fit functions == | ||

- | |||

- | Default ''fit'' is the //linear// function. But if your monitored system is more complicated you have more options to choose from. | ||

- | |||

- | ^ ''fit'' ^ x = f(t) ^ | ||

- | |//linear// |x = a + b*t | | ||

- | |//polynomialN//((Polynomial degree can be from 1 to 6, //polynomial1// is equivalent to //linear//. However, use higher degree polynomials with caution ([[https://en.wikipedia.org/wiki/Runge's_phenomenon|More info here]]). If the evaluation period contains less points than needed to determine polynomial coefficients, polynomial degree will be lowered (e.g //polynomial5// is requested, but there are only 4 points, therefore //polynomial3// will be fitted).)) |x = a<sub>0</sub> + a<sub>1</sub>*t + a<sub>2</sub>*t<sup>2</sup> + ... + a<sub>n</sub>*t<sup>n</sup> | | ||

- | |//exponential// |x = a*exp(b*t) | | ||

- | |//logarithmic// |x = a + b*log(t) | | ||

- | |//power// |x = a*t<sup>b</sup> | | ||

- | |||

- | == - Modes == | ||

- | |||

- | (**forecast** only)\\ Every time a trigger function is evaluated it gets data from the specified history period and fits a specified function to the data. So, if the data is slightly different the fitted function will be slightly different. If we simply calculate the value of the fitted function at a specified time in the future you will know nothing about how the analysed item is expected to behave between now and that moment in the future. For some ''fit'' options (like //polynomial//) a simple value from the future may be misleading. | ||

- | |||

- | ^ ''mode'' ^ **forecast** result ^ | ||

- | |//value// |f(now + ''time'') | | ||

- | |//max// |max<sub>now <nowiki><=</nowiki> t <nowiki><=</nowiki> now + ''time''</sub> f(t) | | ||

- | |//min// |min<sub>now <nowiki><=</nowiki> t <nowiki><=</nowiki> now + ''time''</sub> f(t) | | ||

- | |//delta// |//max// - //min// | | ||

- | |//avg// |average of f(t) (now <nowiki><=</nowiki> t <nowiki><=</nowiki> now + ''time'') according to [[https://en.wikipedia.org/wiki/Mean_of_a_function|definition]] | | ||

- | |||

- | === - Details === | ||

- | |||

- | To avoid calculations with huge numbers we consider the timestamp of the first value in specified period plus 1 ns as a new zero-time (current epoch time is of order 10<sup>9</sup>, epoch squared is 10<sup>18</sup>, double precision is about 10<sup>-16</sup>). 1 ns is added to provide all positive time values for //logarithmic// and //power// fits which involve calculating log(t). Time shift does not affect //linear//, //polynomial//, //exponential// (apart from easier and more precise calculations) but changes the shape of //logarithmic// and //power// functions. | ||

- | |||

- | === - Potential errors === | ||

- | |||

- | Functions return -1 in such situations: | ||

- | |||

- | * specified evaluation period contains no data; | ||

- | |||

- | * result of mathematical operation is not defined((For example fitting //exponential// or //power// functions involves calculating log() of item values. If data contains zeros or negative numbers you will get an error since log() is defined for positive values only.)); | ||

- | |||

- | * numerical complications (unfortunately, for some sets of input data range and precision of double-precision floating-point format become insufficient)((For //linear//, //exponential//, //logarithmic// and //power// fits all necessary calculations can be written explicitly. For //polynomial// only //value// can be calculated without any additional steps. Calculating //avg// involves computing polynomial antiderivative (analytically). Computing //max//, //min// and //delta// involves computing polynomial derivative (analytically) and finding its roots (numerically). Solving f(t) = 0 involves finding polynomial roots (numerically). | ||

- | )). | ||

- | |||

- | Note: No warnings or errors are flagged if chosen fit poorly describes provided data or there is just too few data for accurate prediction. | ||

- | |||

- | === See also === | ||

- | |||

- | - [[http://zabbix.org/mw/images/1/18/Prediction_docs.pdf|Forecasting trigger functions (pdf)]] on zabbix.org |

Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Noncommercial-Share Alike 4.0 International

© 2001-2019 by Zabbix SIA. All rights reserved.