manual:config:triggers:prediction

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

Both sides previous revision Previous revision Next revision | Previous revision | ||

manual:config:triggers:prediction [2015/10/12 08:47] glebs.ivanovskis [2.3 Threshold to reach] fixed syntax in examples |
manual:config:triggers:prediction [2018/08/09 07:11] (current) martins-v autonumbering removal |
||
---|---|---|---|

Line 7: | Line 7: | ||

Zabbix has tools to predict the future behaviour of the monitored system based on historic data. These tools are realized through predictive trigger functions. | Zabbix has tools to predict the future behaviour of the monitored system based on historic data. These tools are realized through predictive trigger functions. | ||

- | === - 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 the system after "time to act" is expected to be in problem state. Second: trigger must fire when the 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. | 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 the system after "time to act" is expected to be in problem state. Second: trigger must fire when the 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 === | + | === Parameters === |

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

- | == - Time interval == | + | == 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. | 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 == | + | == 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. | (**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 == | + | == 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. | (**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. | ||

- | <note tip>When item values approach the threshold and then cross it, **timeleft** assumes that intersection is already in the past and therefore switches to the next intersection with ''threshold'' level, if any. Best practice should be to use predictions as a complement to ordinary problem diagnostics, not as a substitution.((For example, a simple trigger like <code>{host:item.timeleft(1h,,X)} < 1h</code> may go into problem state when the item value approaches X and then suddenly recover once value X is reached. If the problem is item value being below X use: <code>{host:item.last} < X or {host:item.timeleft(1h,,X)} < 1h</code> If the problem is item value being above X use: <code>{host:item.last} > X or {host:item.timeleft(1h,,X)} < 1h</code>))</note> | + | <note tip>When item values approach the threshold and then cross it, **timeleft** assumes that intersection is already in the past and therefore switches to the next intersection with ''threshold'' level, if any. Best practice should be to use predictions as a complement to ordinary problem diagnostics, not as a substitution.((For example, a simple trigger like <code>{host:item.timeleft(1h,,X)} < 1h</code> may go into problem state when the item value approaches X and then suddenly recover once value X is reached. If the problem is item value being below X use: <code>{host:item.last()} < X or {host:item.timeleft(1h,,X)} < 1h</code> If the problem is item value being above X use: <code>{host:item.last()} > X or {host:item.timeleft(1h,,X)} < 1h</code>))</note> |

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

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

Line 39: | Line 39: | ||

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

- | == - Modes == | + | == 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. | (**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. | ||

Line 50: | Line 50: | ||

|//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]] | | |//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 === | + | === 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. | 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 === | + | === Potential errors === |

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

Line 67: | Line 67: | ||

<note tip>No warnings or errors are flagged if chosen fit poorly describes provided data or there is just too few data for accurate prediction.</note> | <note tip>No warnings or errors are flagged if chosen fit poorly describes provided data or there is just too few data for accurate prediction.</note> | ||

- | === - Examples and dealing with errors === | + | === Examples and dealing with errors === |

To get a warning when you are about to run out of free disk space on your host you may use a trigger expression like this: | To get a warning when you are about to run out of free disk space on your host you may use a trigger expression like this: |

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.