├── LICENSE
├── README.md
├── deploy_zabbix.sh
├── elasix
├── elasix.conf.example
├── elasix.sh
└── zabbix_agentd.conf
└── zbx3.4_template_db_elasticsearch.xml
/LICENSE:
--------------------------------------------------------------------------------
1 | GNU GENERAL PUBLIC LICENSE
2 | Version 3, 29 June 2007
3 |
4 | Copyright (C) 2007 Free Software Foundation, Inc.
5 | Everyone is permitted to copy and distribute verbatim copies
6 | of this license document, but changing it is not allowed.
7 |
8 | Preamble
9 |
10 | The GNU General Public License is a free, copyleft license for
11 | software and other kinds of works.
12 |
13 | The licenses for most software and other practical works are designed
14 | to take away your freedom to share and change the works. By contrast,
15 | the GNU General Public License is intended to guarantee your freedom to
16 | share and change all versions of a program--to make sure it remains free
17 | software for all its users. We, the Free Software Foundation, use the
18 | GNU General Public License for most of our software; it applies also to
19 | any other work released this way by its authors. You can apply it to
20 | your programs, too.
21 |
22 | When we speak of free software, we are referring to freedom, not
23 | price. Our General Public Licenses are designed to make sure that you
24 | have the freedom to distribute copies of free software (and charge for
25 | them if you wish), that you receive source code or can get it if you
26 | want it, that you can change the software or use pieces of it in new
27 | free programs, and that you know you can do these things.
28 |
29 | To protect your rights, we need to prevent others from denying you
30 | these rights or asking you to surrender the rights. Therefore, you have
31 | certain responsibilities if you distribute copies of the software, or if
32 | you modify it: responsibilities to respect the freedom of others.
33 |
34 | For example, if you distribute copies of such a program, whether
35 | gratis or for a fee, you must pass on to the recipients the same
36 | freedoms that you received. You must make sure that they, too, receive
37 | or can get the source code. And you must show them these terms so they
38 | know their rights.
39 |
40 | Developers that use the GNU GPL protect your rights with two steps:
41 | (1) assert copyright on the software, and (2) offer you this License
42 | giving you legal permission to copy, distribute and/or modify it.
43 |
44 | For the developers' and authors' protection, the GPL clearly explains
45 | that there is no warranty for this free software. For both users' and
46 | authors' sake, the GPL requires that modified versions be marked as
47 | changed, so that their problems will not be attributed erroneously to
48 | authors of previous versions.
49 |
50 | Some devices are designed to deny users access to install or run
51 | modified versions of the software inside them, although the manufacturer
52 | can do so. This is fundamentally incompatible with the aim of
53 | protecting users' freedom to change the software. The systematic
54 | pattern of such abuse occurs in the area of products for individuals to
55 | use, which is precisely where it is most unacceptable. Therefore, we
56 | have designed this version of the GPL to prohibit the practice for those
57 | products. If such problems arise substantially in other domains, we
58 | stand ready to extend this provision to those domains in future versions
59 | of the GPL, as needed to protect the freedom of users.
60 |
61 | Finally, every program is threatened constantly by software patents.
62 | States should not allow patents to restrict development and use of
63 | software on general-purpose computers, but in those that do, we wish to
64 | avoid the special danger that patents applied to a free program could
65 | make it effectively proprietary. To prevent this, the GPL assures that
66 | patents cannot be used to render the program non-free.
67 |
68 | The precise terms and conditions for copying, distribution and
69 | modification follow.
70 |
71 | TERMS AND CONDITIONS
72 |
73 | 0. Definitions.
74 |
75 | "This License" refers to version 3 of the GNU General Public License.
76 |
77 | "Copyright" also means copyright-like laws that apply to other kinds of
78 | works, such as semiconductor masks.
79 |
80 | "The Program" refers to any copyrightable work licensed under this
81 | License. Each licensee is addressed as "you". "Licensees" and
82 | "recipients" may be individuals or organizations.
83 |
84 | To "modify" a work means to copy from or adapt all or part of the work
85 | in a fashion requiring copyright permission, other than the making of an
86 | exact copy. The resulting work is called a "modified version" of the
87 | earlier work or a work "based on" the earlier work.
88 |
89 | A "covered work" means either the unmodified Program or a work based
90 | on the Program.
91 |
92 | To "propagate" a work means to do anything with it that, without
93 | permission, would make you directly or secondarily liable for
94 | infringement under applicable copyright law, except executing it on a
95 | computer or modifying a private copy. Propagation includes copying,
96 | distribution (with or without modification), making available to the
97 | public, and in some countries other activities as well.
98 |
99 | To "convey" a work means any kind of propagation that enables other
100 | parties to make or receive copies. Mere interaction with a user through
101 | a computer network, with no transfer of a copy, is not conveying.
102 |
103 | An interactive user interface displays "Appropriate Legal Notices"
104 | to the extent that it includes a convenient and prominently visible
105 | feature that (1) displays an appropriate copyright notice, and (2)
106 | tells the user that there is no warranty for the work (except to the
107 | extent that warranties are provided), that licensees may convey the
108 | work under this License, and how to view a copy of this License. If
109 | the interface presents a list of user commands or options, such as a
110 | menu, a prominent item in the list meets this criterion.
111 |
112 | 1. Source Code.
113 |
114 | The "source code" for a work means the preferred form of the work
115 | for making modifications to it. "Object code" means any non-source
116 | form of a work.
117 |
118 | A "Standard Interface" means an interface that either is an official
119 | standard defined by a recognized standards body, or, in the case of
120 | interfaces specified for a particular programming language, one that
121 | is widely used among developers working in that language.
122 |
123 | The "System Libraries" of an executable work include anything, other
124 | than the work as a whole, that (a) is included in the normal form of
125 | packaging a Major Component, but which is not part of that Major
126 | Component, and (b) serves only to enable use of the work with that
127 | Major Component, or to implement a Standard Interface for which an
128 | implementation is available to the public in source code form. A
129 | "Major Component", in this context, means a major essential component
130 | (kernel, window system, and so on) of the specific operating system
131 | (if any) on which the executable work runs, or a compiler used to
132 | produce the work, or an object code interpreter used to run it.
133 |
134 | The "Corresponding Source" for a work in object code form means all
135 | the source code needed to generate, install, and (for an executable
136 | work) run the object code and to modify the work, including scripts to
137 | control those activities. However, it does not include the work's
138 | System Libraries, or general-purpose tools or generally available free
139 | programs which are used unmodified in performing those activities but
140 | which are not part of the work. For example, Corresponding Source
141 | includes interface definition files associated with source files for
142 | the work, and the source code for shared libraries and dynamically
143 | linked subprograms that the work is specifically designed to require,
144 | such as by intimate data communication or control flow between those
145 | subprograms and other parts of the work.
146 |
147 | The Corresponding Source need not include anything that users
148 | can regenerate automatically from other parts of the Corresponding
149 | Source.
150 |
151 | The Corresponding Source for a work in source code form is that
152 | same work.
153 |
154 | 2. Basic Permissions.
155 |
156 | All rights granted under this License are granted for the term of
157 | copyright on the Program, and are irrevocable provided the stated
158 | conditions are met. This License explicitly affirms your unlimited
159 | permission to run the unmodified Program. The output from running a
160 | covered work is covered by this License only if the output, given its
161 | content, constitutes a covered work. This License acknowledges your
162 | rights of fair use or other equivalent, as provided by copyright law.
163 |
164 | You may make, run and propagate covered works that you do not
165 | convey, without conditions so long as your license otherwise remains
166 | in force. You may convey covered works to others for the sole purpose
167 | of having them make modifications exclusively for you, or provide you
168 | with facilities for running those works, provided that you comply with
169 | the terms of this License in conveying all material for which you do
170 | not control copyright. Those thus making or running the covered works
171 | for you must do so exclusively on your behalf, under your direction
172 | and control, on terms that prohibit them from making any copies of
173 | your copyrighted material outside their relationship with you.
174 |
175 | Conveying under any other circumstances is permitted solely under
176 | the conditions stated below. Sublicensing is not allowed; section 10
177 | makes it unnecessary.
178 |
179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law.
180 |
181 | No covered work shall be deemed part of an effective technological
182 | measure under any applicable law fulfilling obligations under article
183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or
184 | similar laws prohibiting or restricting circumvention of such
185 | measures.
186 |
187 | When you convey a covered work, you waive any legal power to forbid
188 | circumvention of technological measures to the extent such circumvention
189 | is effected by exercising rights under this License with respect to
190 | the covered work, and you disclaim any intention to limit operation or
191 | modification of the work as a means of enforcing, against the work's
192 | users, your or third parties' legal rights to forbid circumvention of
193 | technological measures.
194 |
195 | 4. Conveying Verbatim Copies.
196 |
197 | You may convey verbatim copies of the Program's source code as you
198 | receive it, in any medium, provided that you conspicuously and
199 | appropriately publish on each copy an appropriate copyright notice;
200 | keep intact all notices stating that this License and any
201 | non-permissive terms added in accord with section 7 apply to the code;
202 | keep intact all notices of the absence of any warranty; and give all
203 | recipients a copy of this License along with the Program.
204 |
205 | You may charge any price or no price for each copy that you convey,
206 | and you may offer support or warranty protection for a fee.
207 |
208 | 5. Conveying Modified Source Versions.
209 |
210 | You may convey a work based on the Program, or the modifications to
211 | produce it from the Program, in the form of source code under the
212 | terms of section 4, provided that you also meet all of these conditions:
213 |
214 | a) The work must carry prominent notices stating that you modified
215 | it, and giving a relevant date.
216 |
217 | b) The work must carry prominent notices stating that it is
218 | released under this License and any conditions added under section
219 | 7. This requirement modifies the requirement in section 4 to
220 | "keep intact all notices".
221 |
222 | c) You must license the entire work, as a whole, under this
223 | License to anyone who comes into possession of a copy. This
224 | License will therefore apply, along with any applicable section 7
225 | additional terms, to the whole of the work, and all its parts,
226 | regardless of how they are packaged. This License gives no
227 | permission to license the work in any other way, but it does not
228 | invalidate such permission if you have separately received it.
229 |
230 | d) If the work has interactive user interfaces, each must display
231 | Appropriate Legal Notices; however, if the Program has interactive
232 | interfaces that do not display Appropriate Legal Notices, your
233 | work need not make them do so.
234 |
235 | A compilation of a covered work with other separate and independent
236 | works, which are not by their nature extensions of the covered work,
237 | and which are not combined with it such as to form a larger program,
238 | in or on a volume of a storage or distribution medium, is called an
239 | "aggregate" if the compilation and its resulting copyright are not
240 | used to limit the access or legal rights of the compilation's users
241 | beyond what the individual works permit. Inclusion of a covered work
242 | in an aggregate does not cause this License to apply to the other
243 | parts of the aggregate.
244 |
245 | 6. Conveying Non-Source Forms.
246 |
247 | You may convey a covered work in object code form under the terms
248 | of sections 4 and 5, provided that you also convey the
249 | machine-readable Corresponding Source under the terms of this License,
250 | in one of these ways:
251 |
252 | a) Convey the object code in, or embodied in, a physical product
253 | (including a physical distribution medium), accompanied by the
254 | Corresponding Source fixed on a durable physical medium
255 | customarily used for software interchange.
256 |
257 | b) Convey the object code in, or embodied in, a physical product
258 | (including a physical distribution medium), accompanied by a
259 | written offer, valid for at least three years and valid for as
260 | long as you offer spare parts or customer support for that product
261 | model, to give anyone who possesses the object code either (1) a
262 | copy of the Corresponding Source for all the software in the
263 | product that is covered by this License, on a durable physical
264 | medium customarily used for software interchange, for a price no
265 | more than your reasonable cost of physically performing this
266 | conveying of source, or (2) access to copy the
267 | Corresponding Source from a network server at no charge.
268 |
269 | c) Convey individual copies of the object code with a copy of the
270 | written offer to provide the Corresponding Source. This
271 | alternative is allowed only occasionally and noncommercially, and
272 | only if you received the object code with such an offer, in accord
273 | with subsection 6b.
274 |
275 | d) Convey the object code by offering access from a designated
276 | place (gratis or for a charge), and offer equivalent access to the
277 | Corresponding Source in the same way through the same place at no
278 | further charge. You need not require recipients to copy the
279 | Corresponding Source along with the object code. If the place to
280 | copy the object code is a network server, the Corresponding Source
281 | may be on a different server (operated by you or a third party)
282 | that supports equivalent copying facilities, provided you maintain
283 | clear directions next to the object code saying where to find the
284 | Corresponding Source. Regardless of what server hosts the
285 | Corresponding Source, you remain obligated to ensure that it is
286 | available for as long as needed to satisfy these requirements.
287 |
288 | e) Convey the object code using peer-to-peer transmission, provided
289 | you inform other peers where the object code and Corresponding
290 | Source of the work are being offered to the general public at no
291 | charge under subsection 6d.
292 |
293 | A separable portion of the object code, whose source code is excluded
294 | from the Corresponding Source as a System Library, need not be
295 | included in conveying the object code work.
296 |
297 | A "User Product" is either (1) a "consumer product", which means any
298 | tangible personal property which is normally used for personal, family,
299 | or household purposes, or (2) anything designed or sold for incorporation
300 | into a dwelling. In determining whether a product is a consumer product,
301 | doubtful cases shall be resolved in favor of coverage. For a particular
302 | product received by a particular user, "normally used" refers to a
303 | typical or common use of that class of product, regardless of the status
304 | of the particular user or of the way in which the particular user
305 | actually uses, or expects or is expected to use, the product. A product
306 | is a consumer product regardless of whether the product has substantial
307 | commercial, industrial or non-consumer uses, unless such uses represent
308 | the only significant mode of use of the product.
309 |
310 | "Installation Information" for a User Product means any methods,
311 | procedures, authorization keys, or other information required to install
312 | and execute modified versions of a covered work in that User Product from
313 | a modified version of its Corresponding Source. The information must
314 | suffice to ensure that the continued functioning of the modified object
315 | code is in no case prevented or interfered with solely because
316 | modification has been made.
317 |
318 | If you convey an object code work under this section in, or with, or
319 | specifically for use in, a User Product, and the conveying occurs as
320 | part of a transaction in which the right of possession and use of the
321 | User Product is transferred to the recipient in perpetuity or for a
322 | fixed term (regardless of how the transaction is characterized), the
323 | Corresponding Source conveyed under this section must be accompanied
324 | by the Installation Information. But this requirement does not apply
325 | if neither you nor any third party retains the ability to install
326 | modified object code on the User Product (for example, the work has
327 | been installed in ROM).
328 |
329 | The requirement to provide Installation Information does not include a
330 | requirement to continue to provide support service, warranty, or updates
331 | for a work that has been modified or installed by the recipient, or for
332 | the User Product in which it has been modified or installed. Access to a
333 | network may be denied when the modification itself materially and
334 | adversely affects the operation of the network or violates the rules and
335 | protocols for communication across the network.
336 |
337 | Corresponding Source conveyed, and Installation Information provided,
338 | in accord with this section must be in a format that is publicly
339 | documented (and with an implementation available to the public in
340 | source code form), and must require no special password or key for
341 | unpacking, reading or copying.
342 |
343 | 7. Additional Terms.
344 |
345 | "Additional permissions" are terms that supplement the terms of this
346 | License by making exceptions from one or more of its conditions.
347 | Additional permissions that are applicable to the entire Program shall
348 | be treated as though they were included in this License, to the extent
349 | that they are valid under applicable law. If additional permissions
350 | apply only to part of the Program, that part may be used separately
351 | under those permissions, but the entire Program remains governed by
352 | this License without regard to the additional permissions.
353 |
354 | When you convey a copy of a covered work, you may at your option
355 | remove any additional permissions from that copy, or from any part of
356 | it. (Additional permissions may be written to require their own
357 | removal in certain cases when you modify the work.) You may place
358 | additional permissions on material, added by you to a covered work,
359 | for which you have or can give appropriate copyright permission.
360 |
361 | Notwithstanding any other provision of this License, for material you
362 | add to a covered work, you may (if authorized by the copyright holders of
363 | that material) supplement the terms of this License with terms:
364 |
365 | a) Disclaiming warranty or limiting liability differently from the
366 | terms of sections 15 and 16 of this License; or
367 |
368 | b) Requiring preservation of specified reasonable legal notices or
369 | author attributions in that material or in the Appropriate Legal
370 | Notices displayed by works containing it; or
371 |
372 | c) Prohibiting misrepresentation of the origin of that material, or
373 | requiring that modified versions of such material be marked in
374 | reasonable ways as different from the original version; or
375 |
376 | d) Limiting the use for publicity purposes of names of licensors or
377 | authors of the material; or
378 |
379 | e) Declining to grant rights under trademark law for use of some
380 | trade names, trademarks, or service marks; or
381 |
382 | f) Requiring indemnification of licensors and authors of that
383 | material by anyone who conveys the material (or modified versions of
384 | it) with contractual assumptions of liability to the recipient, for
385 | any liability that these contractual assumptions directly impose on
386 | those licensors and authors.
387 |
388 | All other non-permissive additional terms are considered "further
389 | restrictions" within the meaning of section 10. If the Program as you
390 | received it, or any part of it, contains a notice stating that it is
391 | governed by this License along with a term that is a further
392 | restriction, you may remove that term. If a license document contains
393 | a further restriction but permits relicensing or conveying under this
394 | License, you may add to a covered work material governed by the terms
395 | of that license document, provided that the further restriction does
396 | not survive such relicensing or conveying.
397 |
398 | If you add terms to a covered work in accord with this section, you
399 | must place, in the relevant source files, a statement of the
400 | additional terms that apply to those files, or a notice indicating
401 | where to find the applicable terms.
402 |
403 | Additional terms, permissive or non-permissive, may be stated in the
404 | form of a separately written license, or stated as exceptions;
405 | the above requirements apply either way.
406 |
407 | 8. Termination.
408 |
409 | You may not propagate or modify a covered work except as expressly
410 | provided under this License. Any attempt otherwise to propagate or
411 | modify it is void, and will automatically terminate your rights under
412 | this License (including any patent licenses granted under the third
413 | paragraph of section 11).
414 |
415 | However, if you cease all violation of this License, then your
416 | license from a particular copyright holder is reinstated (a)
417 | provisionally, unless and until the copyright holder explicitly and
418 | finally terminates your license, and (b) permanently, if the copyright
419 | holder fails to notify you of the violation by some reasonable means
420 | prior to 60 days after the cessation.
421 |
422 | Moreover, your license from a particular copyright holder is
423 | reinstated permanently if the copyright holder notifies you of the
424 | violation by some reasonable means, this is the first time you have
425 | received notice of violation of this License (for any work) from that
426 | copyright holder, and you cure the violation prior to 30 days after
427 | your receipt of the notice.
428 |
429 | Termination of your rights under this section does not terminate the
430 | licenses of parties who have received copies or rights from you under
431 | this License. If your rights have been terminated and not permanently
432 | reinstated, you do not qualify to receive new licenses for the same
433 | material under section 10.
434 |
435 | 9. Acceptance Not Required for Having Copies.
436 |
437 | You are not required to accept this License in order to receive or
438 | run a copy of the Program. Ancillary propagation of a covered work
439 | occurring solely as a consequence of using peer-to-peer transmission
440 | to receive a copy likewise does not require acceptance. However,
441 | nothing other than this License grants you permission to propagate or
442 | modify any covered work. These actions infringe copyright if you do
443 | not accept this License. Therefore, by modifying or propagating a
444 | covered work, you indicate your acceptance of this License to do so.
445 |
446 | 10. Automatic Licensing of Downstream Recipients.
447 |
448 | Each time you convey a covered work, the recipient automatically
449 | receives a license from the original licensors, to run, modify and
450 | propagate that work, subject to this License. You are not responsible
451 | for enforcing compliance by third parties with this License.
452 |
453 | An "entity transaction" is a transaction transferring control of an
454 | organization, or substantially all assets of one, or subdividing an
455 | organization, or merging organizations. If propagation of a covered
456 | work results from an entity transaction, each party to that
457 | transaction who receives a copy of the work also receives whatever
458 | licenses to the work the party's predecessor in interest had or could
459 | give under the previous paragraph, plus a right to possession of the
460 | Corresponding Source of the work from the predecessor in interest, if
461 | the predecessor has it or can get it with reasonable efforts.
462 |
463 | You may not impose any further restrictions on the exercise of the
464 | rights granted or affirmed under this License. For example, you may
465 | not impose a license fee, royalty, or other charge for exercise of
466 | rights granted under this License, and you may not initiate litigation
467 | (including a cross-claim or counterclaim in a lawsuit) alleging that
468 | any patent claim is infringed by making, using, selling, offering for
469 | sale, or importing the Program or any portion of it.
470 |
471 | 11. Patents.
472 |
473 | A "contributor" is a copyright holder who authorizes use under this
474 | License of the Program or a work on which the Program is based. The
475 | work thus licensed is called the contributor's "contributor version".
476 |
477 | A contributor's "essential patent claims" are all patent claims
478 | owned or controlled by the contributor, whether already acquired or
479 | hereafter acquired, that would be infringed by some manner, permitted
480 | by this License, of making, using, or selling its contributor version,
481 | but do not include claims that would be infringed only as a
482 | consequence of further modification of the contributor version. For
483 | purposes of this definition, "control" includes the right to grant
484 | patent sublicenses in a manner consistent with the requirements of
485 | this License.
486 |
487 | Each contributor grants you a non-exclusive, worldwide, royalty-free
488 | patent license under the contributor's essential patent claims, to
489 | make, use, sell, offer for sale, import and otherwise run, modify and
490 | propagate the contents of its contributor version.
491 |
492 | In the following three paragraphs, a "patent license" is any express
493 | agreement or commitment, however denominated, not to enforce a patent
494 | (such as an express permission to practice a patent or covenant not to
495 | sue for patent infringement). To "grant" such a patent license to a
496 | party means to make such an agreement or commitment not to enforce a
497 | patent against the party.
498 |
499 | If you convey a covered work, knowingly relying on a patent license,
500 | and the Corresponding Source of the work is not available for anyone
501 | to copy, free of charge and under the terms of this License, through a
502 | publicly available network server or other readily accessible means,
503 | then you must either (1) cause the Corresponding Source to be so
504 | available, or (2) arrange to deprive yourself of the benefit of the
505 | patent license for this particular work, or (3) arrange, in a manner
506 | consistent with the requirements of this License, to extend the patent
507 | license to downstream recipients. "Knowingly relying" means you have
508 | actual knowledge that, but for the patent license, your conveying the
509 | covered work in a country, or your recipient's use of the covered work
510 | in a country, would infringe one or more identifiable patents in that
511 | country that you have reason to believe are valid.
512 |
513 | If, pursuant to or in connection with a single transaction or
514 | arrangement, you convey, or propagate by procuring conveyance of, a
515 | covered work, and grant a patent license to some of the parties
516 | receiving the covered work authorizing them to use, propagate, modify
517 | or convey a specific copy of the covered work, then the patent license
518 | you grant is automatically extended to all recipients of the covered
519 | work and works based on it.
520 |
521 | A patent license is "discriminatory" if it does not include within
522 | the scope of its coverage, prohibits the exercise of, or is
523 | conditioned on the non-exercise of one or more of the rights that are
524 | specifically granted under this License. You may not convey a covered
525 | work if you are a party to an arrangement with a third party that is
526 | in the business of distributing software, under which you make payment
527 | to the third party based on the extent of your activity of conveying
528 | the work, and under which the third party grants, to any of the
529 | parties who would receive the covered work from you, a discriminatory
530 | patent license (a) in connection with copies of the covered work
531 | conveyed by you (or copies made from those copies), or (b) primarily
532 | for and in connection with specific products or compilations that
533 | contain the covered work, unless you entered into that arrangement,
534 | or that patent license was granted, prior to 28 March 2007.
535 |
536 | Nothing in this License shall be construed as excluding or limiting
537 | any implied license or other defenses to infringement that may
538 | otherwise be available to you under applicable patent law.
539 |
540 | 12. No Surrender of Others' Freedom.
541 |
542 | If conditions are imposed on you (whether by court order, agreement or
543 | otherwise) that contradict the conditions of this License, they do not
544 | excuse you from the conditions of this License. If you cannot convey a
545 | covered work so as to satisfy simultaneously your obligations under this
546 | License and any other pertinent obligations, then as a consequence you may
547 | not convey it at all. For example, if you agree to terms that obligate you
548 | to collect a royalty for further conveying from those to whom you convey
549 | the Program, the only way you could satisfy both those terms and this
550 | License would be to refrain entirely from conveying the Program.
551 |
552 | 13. Use with the GNU Affero General Public License.
553 |
554 | Notwithstanding any other provision of this License, you have
555 | permission to link or combine any covered work with a work licensed
556 | under version 3 of the GNU Affero General Public License into a single
557 | combined work, and to convey the resulting work. The terms of this
558 | License will continue to apply to the part which is the covered work,
559 | but the special requirements of the GNU Affero General Public License,
560 | section 13, concerning interaction through a network will apply to the
561 | combination as such.
562 |
563 | 14. Revised Versions of this License.
564 |
565 | The Free Software Foundation may publish revised and/or new versions of
566 | the GNU General Public License from time to time. Such new versions will
567 | be similar in spirit to the present version, but may differ in detail to
568 | address new problems or concerns.
569 |
570 | Each version is given a distinguishing version number. If the
571 | Program specifies that a certain numbered version of the GNU General
572 | Public License "or any later version" applies to it, you have the
573 | option of following the terms and conditions either of that numbered
574 | version or of any later version published by the Free Software
575 | Foundation. If the Program does not specify a version number of the
576 | GNU General Public License, you may choose any version ever published
577 | by the Free Software Foundation.
578 |
579 | If the Program specifies that a proxy can decide which future
580 | versions of the GNU General Public License can be used, that proxy's
581 | public statement of acceptance of a version permanently authorizes you
582 | to choose that version for the Program.
583 |
584 | Later license versions may give you additional or different
585 | permissions. However, no additional obligations are imposed on any
586 | author or copyright holder as a result of your choosing to follow a
587 | later version.
588 |
589 | 15. Disclaimer of Warranty.
590 |
591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
599 |
600 | 16. Limitation of Liability.
601 |
602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
610 | SUCH DAMAGES.
611 |
612 | 17. Interpretation of Sections 15 and 16.
613 |
614 | If the disclaimer of warranty and limitation of liability provided
615 | above cannot be given local legal effect according to their terms,
616 | reviewing courts shall apply local law that most closely approximates
617 | an absolute waiver of all civil liability in connection with the
618 | Program, unless a warranty or assumption of liability accompanies a
619 | copy of the Program in return for a fee.
620 |
621 | END OF TERMS AND CONDITIONS
622 |
623 | How to Apply These Terms to Your New Programs
624 |
625 | If you develop a new program, and you want it to be of the greatest
626 | possible use to the public, the best way to achieve this is to make it
627 | free software which everyone can redistribute and change under these terms.
628 |
629 | To do so, attach the following notices to the program. It is safest
630 | to attach them to the start of each source file to most effectively
631 | state the exclusion of warranty; and each file should have at least
632 | the "copyright" line and a pointer to where the full notice is found.
633 |
634 |
635 | Copyright (C)
636 |
637 | This program is free software: you can redistribute it and/or modify
638 | it under the terms of the GNU General Public License as published by
639 | the Free Software Foundation, either version 3 of the License, or
640 | (at your option) any later version.
641 |
642 | This program is distributed in the hope that it will be useful,
643 | but WITHOUT ANY WARRANTY; without even the implied warranty of
644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
645 | GNU General Public License for more details.
646 |
647 | You should have received a copy of the GNU General Public License
648 | along with this program. If not, see .
649 |
650 | Also add information on how to contact you by electronic and paper mail.
651 |
652 | If the program does terminal interaction, make it output a short
653 | notice like this when it starts in an interactive mode:
654 |
655 | Copyright (C)
656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
657 | This is free software, and you are welcome to redistribute it
658 | under certain conditions; type `show c' for details.
659 |
660 | The hypothetical commands `show w' and `show c' should show the appropriate
661 | parts of the General Public License. Of course, your program's commands
662 | might be different; for a GUI interface, you would use an "about box".
663 |
664 | You should also get your employer (if you work as a programmer) or school,
665 | if any, to sign a "copyright disclaimer" for the program, if necessary.
666 | For more information on this, and how to apply and follow the GNU GPL, see
667 | .
668 |
669 | The GNU General Public License does not permit incorporating your program
670 | into proprietary programs. If your program is a subroutine library, you
671 | may consider it more useful to permit linking proprietary applications with
672 | the library. If this is what you want to do, use the GNU Lesser General
673 | Public License instead of this License. But first, please read
674 | .
675 |
--------------------------------------------------------------------------------
/README.md:
--------------------------------------------------------------------------------
1 | # elasix
2 | Zabbix Agent - Elasticsearch
3 |
4 | # Dependencies
5 | ## Packages
6 | * ksh
7 | * jq
8 | * curl
9 |
10 | __**Debian/Ubuntu**__
11 |
12 | ```
13 | #~ sudo apt install ksh jq curl
14 | #~
15 | ```
16 | __**Red Hat**__
17 | ```
18 | #~ sudo yum install ksh jq curl
19 | #~
20 | ```
21 | # Deploy
22 | Default variables:
23 |
24 | NAME|VALUE
25 | ----|-----
26 | ELASTIC_URL|http://localhost:9022
27 | ELASTIC_USER|monitor
28 | ELASTIC_PASS|xxxxxxx
29 | CACHE_DIR|
30 | CACHE_TTL|
31 |
32 | *Note: this variables has to be saved in the config file (elasix.conf) in the same directory than the script.*
33 |
34 | ## Zabbix
35 | Then you can run the deploy_zabbix script
36 | ```
37 | #~ git clone https://github.com/sergiotocalini/elasix.git
38 | #~ sudo ./elasix/deploy_zabbix.sh "" \
39 | "" "" "" ""
40 | #~ sudo systemctl restart zabbix-agent
41 | ```
42 | *Note: the installation has to be executed on the zabbix agent host and you have to import the template on the zabbix web. The default installation directory is /etc/zabbix/scripts/agentd/elasix*
43 |
--------------------------------------------------------------------------------
/deploy_zabbix.sh:
--------------------------------------------------------------------------------
1 | #!/usr/bin/env ksh
2 | SOURCE_DIR=$(dirname $0)
3 | ZABBIX_DIR=/etc/zabbix
4 |
5 | ELASTIC_URL=${1:-'http://localhost:9022'}
6 | ELASTIC_USER=${2:-monitor}
7 | ELASTIC_PASS=${3:-m0n1t0r}
8 |
9 | mkdir -p ${ZABBIX_DIR}/scripts/agentd/elasix
10 |
11 | SCRIPT_CONFIG=${ZABBIX_DIR}/scripts/agentd/elasix/elasix.conf
12 | if [[ -f ${SCRIPT_CONFIG} ]]; then
13 | SCRIPT_CONFIG=${ZABBIX_DIR}/scripts/agentd/elasix/elasix.conf.new
14 | fi
15 |
16 | cp -rpv ${SOURCE_DIR}/elasix/elasix.conf.example ${SCRIPT_CONFIG}
17 | cp -rpv ${SOURCE_DIR}/elasix/elasix.sh ${ZABBIX_DIR}/scripts/agentd/elasix/
18 | cp -rpv ${SOURCE_DIR}/elasix/zabbix_agentd.conf ${ZABBIX_DIR}/zabbix_agentd.d/elasix.conf
19 |
20 | regex_array[0]="s|ELASTIC_URL=.*|ELASTIC_URL=\"${ELASTIC_URL}\"|g"
21 | regex_array[1]="s|ELASTIC_USER=.*|ELASTIC_USER=\"${ELASTIC_USER}\"|g"
22 | regex_array[2]="s|ELASTIC_PASS=.*|ELASTIC_PASS=\"${ELASTIC_PASS}\"|g"
23 | for index in ${!regex_array[*]}; do
24 | sed -i "${regex_array[${index}]}" ${SCRIPT_CONFIG}
25 | done
26 |
27 |
--------------------------------------------------------------------------------
/elasix/elasix.conf.example:
--------------------------------------------------------------------------------
1 | ELASTIC_URL="http://localhost:9200"
2 | ELASTIC_USER=
3 | ELASTIC_PASS=
4 | CACHE_TTL=1
5 |
--------------------------------------------------------------------------------
/elasix/elasix.sh:
--------------------------------------------------------------------------------
1 | #!/usr/bin/env ksh
2 | rcode=0
3 | PATH=/usr/local/bin:${PATH}
4 |
5 | #################################################################################
6 |
7 | #################################################################################
8 | #
9 | # Variable Definition
10 | # ---------------------
11 | #
12 | APP_NAME=$(basename $0)
13 | APP_DIR=$(dirname $0)
14 | APP_VER="0.0.1"
15 | APP_WEB="http://www.sergiotocalini.com.ar/"
16 | TIMESTAMP=`date '+%s'`
17 | CACHE_DIR=${APP_DIR}/tmp
18 | CACHE_TTL=5 # IN MINUTES
19 | #
20 | #################################################################################
21 |
22 | #################################################################################
23 | #
24 | # Load Environment
25 | # ------------------
26 | #
27 | [[ -f ${APP_DIR}/${APP_NAME%.*}.conf ]] && . ${APP_DIR}/${APP_NAME%.*}.conf
28 |
29 | #
30 | #################################################################################
31 |
32 | #################################################################################
33 | #
34 | # Function Definition
35 | # ---------------------
36 | #
37 | usage() {
38 | echo "Usage: ${APP_NAME%.*} [Options]"
39 | echo ""
40 | echo "Options:"
41 | echo " -a Query arguments."
42 | echo " -h Displays this help message."
43 | echo " -j Jsonify output."
44 | echo " -s ARG(str) Section (default=stat)."
45 | echo " -v Show the script version."
46 | echo ""
47 | echo "Please send any bug reports to sergiotocalini@gmail.com"
48 | exit 1
49 | }
50 |
51 | version() {
52 | echo "${APP_NAME%.*} ${APP_VER}"
53 | exit 1
54 | }
55 |
56 | refresh_cache() {
57 | [[ -d ${CACHE_DIR} ]] || mkdir -p ${CACHE_DIR}
58 | type=${1:-'cluster'}
59 | file=${CACHE_DIR}/${type}.json
60 | if [[ $(( `stat -c '%Y' "${file}" 2>/dev/null`+60*${CACHE_TTL} )) -le ${TIMESTAMP} ]]; then
61 | if [[ ${type} == 'cluster' ]]; then
62 | RESOURCE="_cluster/stats"
63 | elif [[ ${type} == 'nodes' ]]; then
64 | RESOURCE="_nodes/stats"
65 | elif [[ ${type} == 'health' ]]; then
66 | RESOURCE="_cluster/health"
67 | elif [[ ${type} == 'indices' ]]; then
68 | RESOURCE="_stats"
69 | elif [[ ${type} == 'root' ]]; then
70 | RESOURCE=""
71 | else
72 | return 1
73 | fi
74 | if ! [[ -z ${ELASTIC_USER} && -z ${ELASTIC_PASS} ]]; then
75 | CURL_AUTH_FLAG="--user"
76 | CURL_AUTH_ATTR+="${ELASTIC_USER}:${ELASTIC_PASS}"
77 | fi
78 | curl -s ${CURL_AUTH_FLAG} "${CURL_AUTH_ATTR}" \
79 | "${ELASTIC_URL}/${RESOURCE}" 2>/dev/null | jq '.' 2>/dev/null > ${file}
80 | fi
81 | echo "${file}"
82 | }
83 |
84 | discovery() {
85 | resource=${1}
86 | json=$(refresh_cache ${resource})
87 | if [[ ${resource} == 'nodes' ]]; then
88 | IFS="," nodes=`jq -r '.nodes|keys|@csv' ${json} 2>/dev/null`
89 | for item in ${nodes[@]}; do
90 | nodeuuid=`echo "${item}" | awk '{print substr($0, 2, length($0) - 2)}'`
91 | nodename=`jq -r ".nodes.\"${nodeuuid}\".name" ${json} 2>/dev/null`
92 | echo "${nodeuuid}|${nodename}"
93 | done
94 | elif [[ ${resource} == 'indices' ]]; then
95 | IFS="," indices=`jq -r '.indices|keys|@csv' ${json} 2>/dev/null`
96 | for item in ${indices[@]}; do
97 | echo "${item}" | awk '{print substr($0, 2, length($0) - 2)}'
98 | done
99 | fi
100 | }
101 |
102 | get_stat() {
103 | type=${1}
104 | name=${2}
105 | resource=${3}
106 | json=$(refresh_cache ${type})
107 | if [[ ${type} =~ (health|cluster|root) ]]; then
108 | res=`jq -r ".${name}" ${json} 2>/dev/null`
109 | elif [[ ${type} == 'indices' && ${name} == '_all' ]]; then
110 | res=`jq -r ".\"${name}\".${resource}" ${json} 2>/dev/null`
111 | else
112 | res=`jq -r ".${type}.\"${name}\".${resource}" ${json} 2>/dev/null`
113 | fi
114 | echo ${res}
115 | }
116 | #
117 | #################################################################################
118 |
119 | #################################################################################
120 | while getopts "s::a:s:uphvj:" OPTION; do
121 | case ${OPTION} in
122 | h)
123 | usage
124 | ;;
125 | s)
126 | SECTION="${OPTARG}"
127 | ;;
128 | j)
129 | JSON=1
130 | IFS=":" JSON_ATTR=(${OPTARG//p=})
131 | ;;
132 | a)
133 | ARGS[${#ARGS[*]}]=${OPTARG//p=}
134 | ;;
135 | v)
136 | version
137 | ;;
138 | \?)
139 | exit 1
140 | ;;
141 | esac
142 | done
143 |
144 | if [[ ${JSON} -eq 1 ]]; then
145 | rval=$(discovery ${ARGS[*]})
146 | echo '{'
147 | echo ' "data":['
148 | count=1
149 | while read line; do
150 | if [[ ${line} != '' ]]; then
151 | IFS="|" values=(${line})
152 | output='{ '
153 | for val_index in ${!values[*]}; do
154 | output+='"'{#${JSON_ATTR[${val_index}]:-${val_index}}}'":"'${values[${val_index}]}'"'
155 | if (( ${val_index}+1 < ${#values[*]} )); then
156 | output="${output}, "
157 | fi
158 | done
159 | output+=' }'
160 | if (( ${count} < `echo ${rval}|wc -l` )); then
161 | output="${output},"
162 | fi
163 | echo " ${output}"
164 | fi
165 | let "count=count+1"
166 | done <<< ${rval}
167 | echo ' ]'
168 | echo '}'
169 | else
170 | if [[ ${SECTION} == 'stat' ]]; then
171 | rval=$( get_stat ${ARGS[*]} )
172 | rcode="${?}"
173 | elif [[ ${SECTION} == 'discovery' ]]; then
174 | rval=$(discovery ${ARGS[*]})
175 | rcode="${?}"
176 | fi
177 | echo "${rval:-0}" | sed "s/null/0/g"
178 | fi
179 |
180 | exit ${rcode}
181 |
--------------------------------------------------------------------------------
/elasix/zabbix_agentd.conf:
--------------------------------------------------------------------------------
1 | UserParameter=elasix[*],/etc/zabbix/scripts/agentd/elasix/elasix.sh -s $1 -a p=$2 -a p=$3 -a p=$4 -a p=$5
2 | UserParameter=elasix.discovery[*],/etc/zabbix/scripts/agentd/elasix/elasix.sh -a $1 -j p=$2 -a p=$3
3 | UserParameter=elasix.version,/etc/zabbix/scripts/agentd/elasix/elasix.sh -v short
4 |
--------------------------------------------------------------------------------
/zbx3.4_template_db_elasticsearch.xml:
--------------------------------------------------------------------------------
1 |
2 |
3 | 3.4
4 | 2019-02-17T17:57:13Z
5 |
6 |
7 | Templates
8 |
9 |
10 |
11 |
12 | Template DB Elasticsearch
13 | Template DB Elasticsearch
14 |
15 |
16 |
17 | Templates
18 |
19 |
20 |
21 |
22 | Elasticsearch
23 |
24 |
25 |
26 | -
27 | [Elasticsearch] Cluster: Indices count
28 | 0
29 |
30 |
31 | elasix[stat, cluster, indices.count]
32 | 1m
33 | 7d
34 | 90d
35 | 0
36 | 3
37 |
38 |
39 |
40 |
41 | 0
42 | 0
43 |
44 | 0
45 |
46 |
47 |
48 | 0
49 |
50 |
51 |
52 |
53 |
54 |
55 | 0
56 |
57 |
58 | Elasticsearch
59 |
60 |
61 |
62 |
63 |
64 |
65 |
66 |
67 | -
68 | [Elasticsearch] Cluster: Documents per second
69 | 0
70 |
71 |
72 | elasix[stat, cluster, indices.docs.count]
73 | 1m
74 | 7d
75 | 90d
76 | 0
77 | 3
78 |
79 |
80 |
81 |
82 | 0
83 | 0
84 |
85 | 0
86 |
87 |
88 |
89 | 0
90 |
91 |
92 |
93 |
94 |
95 |
96 | 0
97 |
98 |
99 | Elasticsearch
100 |
101 |
102 |
103 |
104 |
105 |
106 | 10
107 |
108 |
109 |
110 |
111 |
112 |
113 | -
114 | [Elasticsearch] Cluster: Field data evictions
115 | 0
116 |
117 |
118 | elasix[stat, cluster, indices.fielddata.evictions]
119 | 1m
120 | 7d
121 | 90d
122 | 0
123 | 3
124 |
125 |
126 |
127 |
128 | 0
129 | 0
130 |
131 | 0
132 |
133 |
134 |
135 | 0
136 |
137 |
138 |
139 |
140 |
141 |
142 | 0
143 |
144 |
145 | Elasticsearch
146 |
147 |
148 |
149 |
150 |
151 |
152 |
153 |
154 | -
155 | [Elasticsearch] Cluster: Field data size
156 | 0
157 |
158 |
159 | elasix[stat, cluster, indices.fielddata.memory_size_in_bytes]
160 | 1m
161 | 7d
162 | 90d
163 | 0
164 | 3
165 |
166 | b
167 |
168 |
169 | 0
170 | 0
171 |
172 | 0
173 |
174 |
175 |
176 | 0
177 |
178 |
179 |
180 |
181 |
182 |
183 | 0
184 |
185 |
186 | Elasticsearch
187 |
188 |
189 |
190 |
191 |
192 |
193 |
194 |
195 | -
196 | [Elasticsearch] Cluster: Query cache evictions
197 | 0
198 |
199 |
200 | elasix[stat, cluster, indices.query_cache.evictions]
201 | 1m
202 | 7d
203 | 90d
204 | 0
205 | 3
206 |
207 |
208 |
209 |
210 | 0
211 | 0
212 |
213 | 0
214 |
215 |
216 |
217 | 0
218 |
219 |
220 |
221 |
222 |
223 |
224 | 0
225 |
226 |
227 | Elasticsearch
228 |
229 |
230 |
231 |
232 |
233 |
234 |
235 |
236 | -
237 | [Elasticsearch] Cluster: Query cache size
238 | 0
239 |
240 |
241 | elasix[stat, cluster, indices.query_cache.memory_size_in_bytes]
242 | 1m
243 | 7d
244 | 90d
245 | 0
246 | 3
247 |
248 | b
249 |
250 |
251 | 0
252 | 0
253 |
254 | 0
255 |
256 |
257 |
258 | 0
259 |
260 |
261 |
262 |
263 |
264 |
265 | 0
266 |
267 |
268 | Elasticsearch
269 |
270 |
271 |
272 |
273 |
274 |
275 |
276 |
277 | -
278 | [Elasticsearch] Cluster: Shards count
279 | 0
280 |
281 |
282 | elasix[stat, cluster, indices.shards.total]
283 | 1m
284 | 7d
285 | 90d
286 | 0
287 | 3
288 |
289 |
290 |
291 |
292 | 0
293 | 0
294 |
295 | 0
296 |
297 |
298 |
299 | 0
300 |
301 |
302 |
303 |
304 |
305 |
306 | 0
307 |
308 |
309 | Elasticsearch
310 |
311 |
312 |
313 |
314 |
315 |
316 |
317 |
318 | -
319 | [Elasticsearch] Cluster: Nodes data
320 | 0
321 |
322 |
323 | elasix[stat, cluster, nodes.count.data]
324 | 1m
325 | 7d
326 | 90d
327 | 0
328 | 3
329 |
330 |
331 |
332 |
333 | 0
334 | 0
335 |
336 | 0
337 |
338 |
339 |
340 | 0
341 |
342 |
343 |
344 |
345 |
346 |
347 | 0
348 |
349 |
350 | Elasticsearch
351 |
352 |
353 |
354 |
355 |
356 |
357 |
358 |
359 | -
360 | [Elasticsearch] Cluster: Nodes total
361 | 0
362 |
363 |
364 | elasix[stat, cluster, nodes.count.total]
365 | 1m
366 | 7d
367 | 90d
368 | 0
369 | 3
370 |
371 |
372 |
373 |
374 | 0
375 | 0
376 |
377 | 0
378 |
379 |
380 |
381 | 0
382 |
383 |
384 |
385 |
386 |
387 |
388 | 0
389 |
390 |
391 | Elasticsearch
392 |
393 |
394 |
395 |
396 |
397 |
398 |
399 |
400 | -
401 | [Elasticsearch] Health: Active primary shards
402 | 0
403 |
404 |
405 | elasix[stat, health, active_primary_shards]
406 | 1m
407 | 7d
408 | 90d
409 | 0
410 | 3
411 |
412 |
413 |
414 |
415 | 0
416 | 0
417 |
418 | 0
419 |
420 |
421 |
422 | 0
423 |
424 |
425 |
426 |
427 |
428 |
429 | 0
430 |
431 |
432 | Elasticsearch
433 |
434 |
435 |
436 |
437 |
438 |
439 |
440 |
441 | -
442 | [Elasticsearch] Health: Active shards
443 | 0
444 |
445 |
446 | elasix[stat, health, active_shards]
447 | 1m
448 | 7d
449 | 90d
450 | 0
451 | 3
452 |
453 |
454 |
455 |
456 | 0
457 | 0
458 |
459 | 0
460 |
461 |
462 |
463 | 0
464 |
465 |
466 |
467 |
468 |
469 |
470 | 0
471 |
472 |
473 | Elasticsearch
474 |
475 |
476 |
477 |
478 |
479 |
480 |
481 |
482 | -
483 | [Elasticsearch] Health: Initializing shards
484 | 0
485 |
486 |
487 | elasix[stat, health, initializing_shards]
488 | 1m
489 | 7d
490 | 90d
491 | 0
492 | 3
493 |
494 |
495 |
496 |
497 | 0
498 | 0
499 |
500 | 0
501 |
502 |
503 |
504 | 0
505 |
506 |
507 |
508 |
509 |
510 |
511 | 0
512 |
513 |
514 | Elasticsearch
515 |
516 |
517 |
518 |
519 |
520 |
521 |
522 |
523 | -
524 | [Elasticsearch] Health: Pending tasks
525 | 0
526 |
527 |
528 | elasix[stat, health, number_of_pending_tasks]
529 | 1m
530 | 7d
531 | 90d
532 | 0
533 | 3
534 |
535 |
536 |
537 |
538 | 0
539 | 0
540 |
541 | 0
542 |
543 |
544 |
545 | 0
546 |
547 |
548 |
549 |
550 |
551 |
552 | 0
553 |
554 |
555 | Elasticsearch
556 |
557 |
558 |
559 |
560 |
561 |
562 |
563 |
564 | -
565 | [Elasticsearch] Health: Relocating shards
566 | 0
567 |
568 |
569 | elasix[stat, health, relocating_shards]
570 | 1m
571 | 7d
572 | 90d
573 | 0
574 | 3
575 |
576 |
577 |
578 |
579 | 0
580 | 0
581 |
582 | 0
583 |
584 |
585 |
586 | 0
587 |
588 |
589 |
590 |
591 |
592 |
593 | 0
594 |
595 |
596 | Elasticsearch
597 |
598 |
599 |
600 |
601 |
602 |
603 |
604 |
605 | -
606 | [Elasticsearch] Health: Cluster status
607 | 0
608 |
609 |
610 | elasix[stat, health, status]
611 | 1m
612 | 7d
613 | 0
614 | 0
615 | 1
616 |
617 |
618 |
619 |
620 | 0
621 | 0
622 |
623 | 0
624 |
625 |
626 |
627 | 0
628 |
629 |
630 |
631 |
632 |
633 |
634 | 0
635 |
636 |
637 | Elasticsearch
638 |
639 |
640 |
641 |
642 |
643 |
644 |
645 |
646 | -
647 | [Elasticsearch] Health: Unassigned shards
648 | 0
649 |
650 |
651 | elasix[stat, health, unassigned_shards]
652 | 1m
653 | 7d
654 | 90d
655 | 0
656 | 3
657 |
658 |
659 |
660 |
661 | 0
662 | 0
663 |
664 | 0
665 |
666 |
667 |
668 | 0
669 |
670 |
671 |
672 |
673 |
674 |
675 | 0
676 |
677 |
678 | Elasticsearch
679 |
680 |
681 |
682 |
683 |
684 |
685 |
686 |
687 | -
688 | [Elasticsearch] Indices: Total flush rate
689 | 0
690 |
691 |
692 | elasix[stat, indices, _all, total.flush.total]
693 | 1m
694 | 7d
695 | 90d
696 | 0
697 | 3
698 |
699 |
700 |
701 |
702 | 0
703 | 0
704 |
705 | 0
706 |
707 |
708 |
709 | 0
710 |
711 |
712 |
713 |
714 |
715 |
716 | 0
717 |
718 |
719 | Elasticsearch
720 |
721 |
722 |
723 |
724 |
725 |
726 | 10
727 |
728 |
729 |
730 |
731 |
732 |
733 | -
734 | [Elasticsearch] Indices: Average flush latency
735 | 0
736 |
737 |
738 | elasix[stat, indices, _all, total.flush.total_time_in_millis]
739 | 1m
740 | 7d
741 | 90d
742 | 0
743 | 3
744 |
745 | ms
746 |
747 |
748 | 0
749 | 0
750 |
751 | 0
752 |
753 |
754 |
755 | 0
756 |
757 |
758 |
759 |
760 |
761 |
762 | 0
763 |
764 |
765 | Elasticsearch
766 |
767 |
768 |
769 |
770 |
771 |
772 | 10
773 |
774 |
775 |
776 |
777 |
778 |
779 | -
780 | [Elasticsearch] Indices: Average get latency
781 | 0
782 |
783 |
784 | elasix[stat, indices, _all, total.get.time_in_millis]
785 | 1m
786 | 7d
787 | 90d
788 | 0
789 | 3
790 |
791 | ms
792 |
793 |
794 | 0
795 | 0
796 |
797 | 0
798 |
799 |
800 |
801 | 0
802 |
803 |
804 |
805 |
806 |
807 |
808 | 0
809 |
810 |
811 | Elasticsearch
812 |
813 |
814 |
815 |
816 |
817 |
818 | 10
819 |
820 |
821 |
822 |
823 |
824 |
825 | -
826 | [Elasticsearch] Indices: Total get rate
827 | 0
828 |
829 |
830 | elasix[stat, indices, _all, total.get.total]
831 | 1m
832 | 7d
833 | 90d
834 | 0
835 | 3
836 |
837 |
838 |
839 |
840 | 0
841 | 0
842 |
843 | 0
844 |
845 |
846 |
847 | 0
848 |
849 |
850 |
851 |
852 |
853 |
854 | 0
855 |
856 |
857 | Elasticsearch
858 |
859 |
860 |
861 |
862 |
863 |
864 | 10
865 |
866 |
867 |
868 |
869 |
870 |
871 | -
872 | [Elasticsearch] Indices: Average indexing latency
873 | 0
874 |
875 |
876 | elasix[stat, indices, _all, total.indexing.index_time_in_millis]
877 | 1m
878 | 7d
879 | 90d
880 | 0
881 | 3
882 |
883 | ms
884 |
885 |
886 | 0
887 | 0
888 |
889 | 0
890 |
891 |
892 |
893 | 0
894 |
895 |
896 |
897 |
898 |
899 |
900 | 0
901 |
902 |
903 | Elasticsearch
904 |
905 |
906 |
907 |
908 |
909 |
910 | 10
911 |
912 |
913 |
914 |
915 |
916 |
917 | -
918 | [Elasticsearch] Indices: Total indexing rate
919 | 0
920 |
921 |
922 | elasix[stat, indices, _all, total.indexing.index_total]
923 | 1m
924 | 7d
925 | 90d
926 | 0
927 | 3
928 |
929 |
930 |
931 |
932 | 0
933 | 0
934 |
935 | 0
936 |
937 |
938 |
939 | 0
940 |
941 |
942 |
943 |
944 |
945 |
946 | 0
947 |
948 |
949 | Elasticsearch
950 |
951 |
952 |
953 |
954 |
955 |
956 | 10
957 |
958 |
959 |
960 |
961 |
962 |
963 | -
964 | [Elasticsearch] Indices: Total merge rate
965 | 0
966 |
967 |
968 | elasix[stat, indices, _all, total.merges.total]
969 | 1m
970 | 7d
971 | 90d
972 | 0
973 | 3
974 |
975 |
976 |
977 |
978 | 0
979 | 0
980 |
981 | 0
982 |
983 |
984 |
985 | 0
986 |
987 |
988 |
989 |
990 |
991 |
992 | 0
993 |
994 |
995 | Elasticsearch
996 |
997 |
998 |
999 |
1000 |
1001 |
1002 | 10
1003 |
1004 |
1005 |
1006 |
1007 |
1008 |
1009 | -
1010 | [Elasticsearch] Indices: Average merge latency
1011 | 0
1012 |
1013 |
1014 | elasix[stat, indices, _all, total.merges.total_time_in_millis]
1015 | 1m
1016 | 7d
1017 | 90d
1018 | 0
1019 | 3
1020 |
1021 | ms
1022 |
1023 |
1024 | 0
1025 | 0
1026 |
1027 | 0
1028 |
1029 |
1030 |
1031 | 0
1032 |
1033 |
1034 |
1035 |
1036 |
1037 |
1038 | 0
1039 |
1040 |
1041 | Elasticsearch
1042 |
1043 |
1044 |
1045 |
1046 |
1047 |
1048 | 10
1049 |
1050 |
1051 |
1052 |
1053 |
1054 |
1055 | -
1056 | [Elasticsearch] Indices: Total refresh rate
1057 | 0
1058 |
1059 |
1060 | elasix[stat, indices, _all, total.refresh.total]
1061 | 1m
1062 | 7d
1063 | 90d
1064 | 0
1065 | 3
1066 |
1067 |
1068 |
1069 |
1070 | 0
1071 | 0
1072 |
1073 | 0
1074 |
1075 |
1076 |
1077 | 0
1078 |
1079 |
1080 |
1081 |
1082 |
1083 |
1084 | 0
1085 |
1086 |
1087 | Elasticsearch
1088 |
1089 |
1090 |
1091 |
1092 |
1093 |
1094 | 10
1095 |
1096 |
1097 |
1098 |
1099 |
1100 |
1101 | -
1102 | [Elasticsearch] Indices: Average refresh latency
1103 | 0
1104 |
1105 |
1106 | elasix[stat, indices, _all, total.refresh.total_time_in_millis]
1107 | 1m
1108 | 7d
1109 | 90d
1110 | 0
1111 | 3
1112 |
1113 | ms
1114 |
1115 |
1116 | 0
1117 | 0
1118 |
1119 | 0
1120 |
1121 |
1122 |
1123 | 0
1124 |
1125 |
1126 |
1127 |
1128 |
1129 |
1130 | 0
1131 |
1132 |
1133 | Elasticsearch
1134 |
1135 |
1136 |
1137 |
1138 |
1139 |
1140 | 10
1141 |
1142 |
1143 |
1144 |
1145 |
1146 |
1147 | -
1148 | [Elasticsearch] Indices: Average search latency
1149 | 0
1150 |
1151 |
1152 | elasix[stat, indices, _all, total.search.query_time_in_millis]
1153 | 1m
1154 | 7d
1155 | 90d
1156 | 0
1157 | 3
1158 |
1159 | ms
1160 |
1161 |
1162 | 0
1163 | 0
1164 |
1165 | 0
1166 |
1167 |
1168 |
1169 | 0
1170 |
1171 |
1172 |
1173 |
1174 |
1175 |
1176 | 0
1177 |
1178 |
1179 | Elasticsearch
1180 |
1181 |
1182 |
1183 |
1184 |
1185 |
1186 | 10
1187 |
1188 |
1189 |
1190 |
1191 |
1192 |
1193 | -
1194 | [Elasticsearch] Indices: Total search rate
1195 | 0
1196 |
1197 |
1198 | elasix[stat, indices, _all, total.search.query_total]
1199 | 1m
1200 | 7d
1201 | 90d
1202 | 0
1203 | 3
1204 |
1205 |
1206 |
1207 |
1208 | 0
1209 | 0
1210 |
1211 | 0
1212 |
1213 |
1214 |
1215 | 0
1216 |
1217 |
1218 |
1219 |
1220 |
1221 |
1222 | 0
1223 |
1224 |
1225 | Elasticsearch
1226 |
1227 |
1228 |
1229 |
1230 |
1231 |
1232 | 10
1233 |
1234 |
1235 |
1236 |
1237 |
1238 |
1239 | -
1240 | [Elasticsearch] Indices: Warmer rate
1241 | 0
1242 |
1243 |
1244 | elasix[stat, indices, _all, total.warmer.total]
1245 | 1m
1246 | 7d
1247 | 90d
1248 | 0
1249 | 3
1250 |
1251 |
1252 |
1253 |
1254 | 0
1255 | 0
1256 |
1257 | 0
1258 |
1259 |
1260 |
1261 | 0
1262 |
1263 |
1264 |
1265 |
1266 |
1267 |
1268 | 0
1269 |
1270 |
1271 | Elasticsearch
1272 |
1273 |
1274 |
1275 |
1276 |
1277 |
1278 | 10
1279 |
1280 |
1281 |
1282 |
1283 |
1284 |
1285 | -
1286 | [Elasticsearch] Server: Version
1287 | 0
1288 |
1289 |
1290 | elasix[stat, root, version.number]
1291 | 24h
1292 | 1w
1293 | 0
1294 | 0
1295 | 1
1296 |
1297 |
1298 |
1299 |
1300 | 0
1301 | 0
1302 |
1303 | 0
1304 |
1305 |
1306 |
1307 | 0
1308 |
1309 |
1310 |
1311 |
1312 |
1313 |
1314 | 0
1315 |
1316 |
1317 | Elasticsearch
1318 |
1319 |
1320 |
1321 |
1322 |
1323 |
1324 |
1325 |
1326 |
1327 |
1328 |
1329 | Elasticsearch: Index discovery
1330 | 0
1331 |
1332 |
1333 | elasix.discovery[indices,INDEX_NAME]
1334 | 1h
1335 | 0
1336 |
1337 |
1338 |
1339 | 0
1340 | 0
1341 |
1342 | 0
1343 |
1344 |
1345 |
1346 | 0
1347 |
1348 |
1349 |
1350 |
1351 |
1352 |
1353 | 0
1354 |
1355 |
1356 |
1357 | 1d
1358 |
1359 |
1360 |
1361 | [Elasticsearch] Index: {#INDEX_NAME} - Docs count
1362 | 0
1363 |
1364 |
1365 | elasix[stat, indices, {#INDEX_NAME}, primaries.docs.count]
1366 | 30m
1367 | 30d
1368 | 90d
1369 | 0
1370 | 3
1371 |
1372 |
1373 |
1374 |
1375 | 0
1376 | 0
1377 |
1378 | 0
1379 |
1380 |
1381 |
1382 | 0
1383 |
1384 |
1385 |
1386 |
1387 |
1388 |
1389 | 0
1390 |
1391 |
1392 | Elasticsearch
1393 |
1394 |
1395 |
1396 |
1397 |
1398 |
1399 |
1400 |
1401 |
1402 |
1403 | [Elasticsearch] Index: {#INDEX_NAME} - Searches
1404 | 0
1405 |
1406 |
1407 | elasix[stat, indices, {#INDEX_NAME}, total.search.query_total]
1408 | 5m
1409 | 30d
1410 | 90d
1411 | 0
1412 | 3
1413 |
1414 |
1415 |
1416 |
1417 | 0
1418 | 0
1419 |
1420 | 0
1421 |
1422 |
1423 |
1424 | 0
1425 |
1426 |
1427 |
1428 |
1429 |
1430 |
1431 | 0
1432 |
1433 |
1434 | Elasticsearch
1435 |
1436 |
1437 |
1438 |
1439 |
1440 |
1441 | 9
1442 |
1443 |
1444 |
1445 |
1446 |
1447 |
1448 |
1449 |
1450 |
1451 |
1452 |
1453 |
1454 |
1455 |
1456 | Elasticsearch: Node discovery
1457 | 0
1458 |
1459 |
1460 | elasix.discovery[nodes,NODE_UUID:NODE_NAME]
1461 | 1h
1462 | 0
1463 |
1464 |
1465 |
1466 | 0
1467 | 0
1468 |
1469 | 0
1470 |
1471 |
1472 |
1473 | 0
1474 |
1475 |
1476 |
1477 |
1478 |
1479 |
1480 | 0
1481 |
1482 |
1483 |
1484 | 1d
1485 |
1486 |
1487 |
1488 | [Elasticsearch] Node {#NODE_NAME}: Breakers - Fielddata Tripped
1489 | 0
1490 |
1491 |
1492 | elasix[stat, nodes, {#NODE_UUID}, breakers.fielddata.tripped]
1493 | 1m
1494 | 7d
1495 | 90d
1496 | 0
1497 | 3
1498 |
1499 |
1500 |
1501 |
1502 | 0
1503 | 0
1504 |
1505 | 0
1506 |
1507 |
1508 |
1509 | 0
1510 |
1511 |
1512 |
1513 |
1514 |
1515 |
1516 | 0
1517 |
1518 |
1519 | Elasticsearch
1520 |
1521 |
1522 |
1523 |
1524 |
1525 |
1526 | 9
1527 |
1528 |
1529 |
1530 |
1531 |
1532 |
1533 |
1534 |
1535 | [Elasticsearch] Node {#NODE_NAME}: Breakers - Parent Tripped
1536 | 0
1537 |
1538 |
1539 | elasix[stat, nodes, {#NODE_UUID}, breakers.parent.tripped]
1540 | 1m
1541 | 7d
1542 | 90d
1543 | 0
1544 | 3
1545 |
1546 |
1547 |
1548 |
1549 | 0
1550 | 0
1551 |
1552 | 0
1553 |
1554 |
1555 |
1556 | 0
1557 |
1558 |
1559 |
1560 |
1561 |
1562 |
1563 | 0
1564 |
1565 |
1566 | Elasticsearch
1567 |
1568 |
1569 |
1570 |
1571 |
1572 |
1573 | 9
1574 |
1575 |
1576 |
1577 |
1578 |
1579 |
1580 |
1581 |
1582 | [Elasticsearch] Node {#NODE_NAME}: Breakers - Request Tripped
1583 | 0
1584 |
1585 |
1586 | elasix[stat, nodes, {#NODE_UUID}, breakers.request.tripped]
1587 | 1m
1588 | 7d
1589 | 90d
1590 | 0
1591 | 3
1592 |
1593 |
1594 |
1595 |
1596 | 0
1597 | 0
1598 |
1599 | 0
1600 |
1601 |
1602 |
1603 | 0
1604 |
1605 |
1606 |
1607 |
1608 |
1609 |
1610 | 0
1611 |
1612 |
1613 | Elasticsearch
1614 |
1615 |
1616 |
1617 |
1618 |
1619 |
1620 | 9
1621 |
1622 |
1623 |
1624 |
1625 |
1626 |
1627 |
1628 |
1629 | [Elasticsearch] Node {#NODE_NAME}: Indices - Docs Count
1630 | 0
1631 |
1632 |
1633 | elasix[stat, nodes, {#NODE_UUID}, indices.docs.count]
1634 | 1m
1635 | 7d
1636 | 90d
1637 | 0
1638 | 3
1639 |
1640 |
1641 |
1642 |
1643 | 0
1644 | 0
1645 |
1646 | 0
1647 |
1648 |
1649 |
1650 | 0
1651 |
1652 |
1653 |
1654 |
1655 |
1656 |
1657 | 0
1658 |
1659 |
1660 | Elasticsearch
1661 |
1662 |
1663 |
1664 |
1665 |
1666 |
1667 |
1668 |
1669 |
1670 |
1671 | [Elasticsearch] Node {#NODE_NAME}: Indices - Docs Deleted
1672 | 0
1673 |
1674 |
1675 | elasix[stat, nodes, {#NODE_UUID}, indices.docs.deleted]
1676 | 1m
1677 | 7d
1678 | 90d
1679 | 0
1680 | 3
1681 |
1682 |
1683 |
1684 |
1685 | 0
1686 | 0
1687 |
1688 | 0
1689 |
1690 |
1691 |
1692 | 0
1693 |
1694 |
1695 |
1696 |
1697 |
1698 |
1699 | 0
1700 |
1701 |
1702 | Elasticsearch
1703 |
1704 |
1705 |
1706 |
1707 |
1708 |
1709 |
1710 |
1711 |
1712 |
1713 | [Elasticsearch] Node {#NODE_NAME}: JVM - Mem Heap Max
1714 | 0
1715 |
1716 |
1717 | elasix[stat, nodes, {#NODE_UUID}, jvm.mem.heap_max_in_bytes]
1718 | 1h
1719 | 7d
1720 | 90d
1721 | 0
1722 | 3
1723 |
1724 | b
1725 |
1726 |
1727 | 0
1728 | 0
1729 |
1730 | 0
1731 |
1732 |
1733 |
1734 | 0
1735 |
1736 |
1737 |
1738 |
1739 |
1740 |
1741 | 0
1742 |
1743 |
1744 | Elasticsearch
1745 |
1746 |
1747 |
1748 |
1749 |
1750 |
1751 |
1752 |
1753 |
1754 |
1755 | [Elasticsearch] Node {#NODE_NAME}: JVM - Mem Heap Used
1756 | 0
1757 |
1758 |
1759 | elasix[stat, nodes, {#NODE_UUID}, jvm.mem.heap_used_percent]
1760 | 1m
1761 | 7d
1762 | 90d
1763 | 0
1764 | 3
1765 |
1766 | %
1767 |
1768 |
1769 | 0
1770 | 0
1771 |
1772 | 0
1773 |
1774 |
1775 |
1776 | 0
1777 |
1778 |
1779 |
1780 |
1781 |
1782 |
1783 | 0
1784 |
1785 |
1786 | Elasticsearch
1787 |
1788 |
1789 |
1790 |
1791 |
1792 |
1793 |
1794 |
1795 |
1796 |
1797 | [Elasticsearch] Node {#NODE_NAME}: JVM - Mem Pools Old Used
1798 | 0
1799 |
1800 |
1801 | elasix[stat, nodes, {#NODE_UUID}, jvm.mem.pools.old.used_in_bytes]
1802 | 1m
1803 | 7d
1804 | 90d
1805 | 0
1806 | 3
1807 |
1808 | b
1809 |
1810 |
1811 | 0
1812 | 0
1813 |
1814 | 0
1815 |
1816 |
1817 |
1818 | 0
1819 |
1820 |
1821 |
1822 |
1823 |
1824 |
1825 | 0
1826 |
1827 |
1828 | Elasticsearch
1829 |
1830 |
1831 |
1832 |
1833 |
1834 |
1835 |
1836 |
1837 |
1838 |
1839 | [Elasticsearch] Node {#NODE_NAME}: JVM - Mem Pools Survivor Used
1840 | 0
1841 |
1842 |
1843 | elasix[stat, nodes, {#NODE_UUID}, jvm.mem.pools.survivor.used_in_bytes]
1844 | 1m
1845 | 7d
1846 | 90d
1847 | 0
1848 | 3
1849 |
1850 | b
1851 |
1852 |
1853 | 0
1854 | 0
1855 |
1856 | 0
1857 |
1858 |
1859 |
1860 | 0
1861 |
1862 |
1863 |
1864 |
1865 |
1866 |
1867 | 0
1868 |
1869 |
1870 | Elasticsearch
1871 |
1872 |
1873 |
1874 |
1875 |
1876 |
1877 |
1878 |
1879 |
1880 |
1881 | [Elasticsearch] Node {#NODE_NAME}: JVM - Mem Pools Young Used
1882 | 0
1883 |
1884 |
1885 | elasix[stat, nodes, {#NODE_UUID}, jvm.mem.pools.young.used_in_bytes]
1886 | 1m
1887 | 7d
1888 | 90d
1889 | 0
1890 | 3
1891 |
1892 | b
1893 |
1894 |
1895 | 0
1896 | 0
1897 |
1898 | 0
1899 |
1900 |
1901 |
1902 | 0
1903 |
1904 |
1905 |
1906 |
1907 |
1908 |
1909 | 0
1910 |
1911 |
1912 | Elasticsearch
1913 |
1914 |
1915 |
1916 |
1917 |
1918 |
1919 |
1920 |
1921 |
1922 |
1923 | [Elasticsearch] Node {#NODE_NAME}: Thread pool - Bulk Completed
1924 | 0
1925 |
1926 |
1927 | elasix[stat, nodes, {#NODE_UUID}, thread_pool.bulk.completed]
1928 | 1m
1929 | 7d
1930 | 90d
1931 | 0
1932 | 3
1933 |
1934 |
1935 |
1936 |
1937 | 0
1938 | 0
1939 |
1940 | 0
1941 |
1942 |
1943 |
1944 | 0
1945 |
1946 |
1947 |
1948 |
1949 |
1950 |
1951 | 0
1952 |
1953 |
1954 | Elasticsearch
1955 |
1956 |
1957 |
1958 |
1959 |
1960 |
1961 | 10
1962 |
1963 |
1964 |
1965 |
1966 |
1967 |
1968 |
1969 |
1970 | [Elasticsearch] Node {#NODE_NAME}: Thread pool - Get Completed
1971 | 0
1972 |
1973 |
1974 | elasix[stat, nodes, {#NODE_UUID}, thread_pool.get.completed]
1975 | 1m
1976 | 7d
1977 | 90d
1978 | 0
1979 | 3
1980 |
1981 |
1982 |
1983 |
1984 | 0
1985 | 0
1986 |
1987 | 0
1988 |
1989 |
1990 |
1991 | 0
1992 |
1993 |
1994 |
1995 |
1996 |
1997 |
1998 | 0
1999 |
2000 |
2001 | Elasticsearch
2002 |
2003 |
2004 |
2005 |
2006 |
2007 |
2008 | 10
2009 |
2010 |
2011 |
2012 |
2013 |
2014 |
2015 |
2016 |
2017 | [Elasticsearch] Node {#NODE_NAME}: Thread pool - Index Completed
2018 | 0
2019 |
2020 |
2021 | elasix[stat, nodes, {#NODE_UUID}, thread_pool.index.completed]
2022 | 1m
2023 | 7d
2024 | 90d
2025 | 0
2026 | 3
2027 |
2028 |
2029 |
2030 |
2031 | 0
2032 | 0
2033 |
2034 | 0
2035 |
2036 |
2037 |
2038 | 0
2039 |
2040 |
2041 |
2042 |
2043 |
2044 |
2045 | 0
2046 |
2047 |
2048 | Elasticsearch
2049 |
2050 |
2051 |
2052 |
2053 |
2054 |
2055 | 10
2056 |
2057 |
2058 |
2059 |
2060 |
2061 |
2062 |
2063 |
2064 | [Elasticsearch] Node {#NODE_NAME}: Thread pool - Listener Completed
2065 | 0
2066 |
2067 |
2068 | elasix[stat, nodes, {#NODE_UUID}, thread_pool.listener.completed]
2069 | 1m
2070 | 7d
2071 | 90d
2072 | 0
2073 | 3
2074 |
2075 |
2076 |
2077 |
2078 | 0
2079 | 0
2080 |
2081 | 0
2082 |
2083 |
2084 |
2085 | 0
2086 |
2087 |
2088 |
2089 |
2090 |
2091 |
2092 | 0
2093 |
2094 |
2095 | Elasticsearch
2096 |
2097 |
2098 |
2099 |
2100 |
2101 |
2102 | 10
2103 |
2104 |
2105 |
2106 |
2107 |
2108 |
2109 |
2110 |
2111 | [Elasticsearch] Node {#NODE_NAME}: Thread pool - Refresh Completed
2112 | 0
2113 |
2114 |
2115 | elasix[stat, nodes, {#NODE_UUID}, thread_pool.refresh.completed]
2116 | 1m
2117 | 7d
2118 | 90d
2119 | 0
2120 | 3
2121 |
2122 |
2123 |
2124 |
2125 | 0
2126 | 0
2127 |
2128 | 0
2129 |
2130 |
2131 |
2132 | 0
2133 |
2134 |
2135 |
2136 |
2137 |
2138 |
2139 | 0
2140 |
2141 |
2142 | Elasticsearch
2143 |
2144 |
2145 |
2146 |
2147 |
2148 |
2149 | 10
2150 |
2151 |
2152 |
2153 |
2154 |
2155 |
2156 |
2157 |
2158 | [Elasticsearch] Node {#NODE_NAME}: Thread pool - Search Completed
2159 | 0
2160 |
2161 |
2162 | elasix[stat, nodes, {#NODE_UUID}, thread_pool.search.completed]
2163 | 1m
2164 | 7d
2165 | 90d
2166 | 0
2167 | 3
2168 |
2169 |
2170 |
2171 |
2172 | 0
2173 | 0
2174 |
2175 | 0
2176 |
2177 |
2178 |
2179 | 0
2180 |
2181 |
2182 |
2183 |
2184 |
2185 |
2186 | 0
2187 |
2188 |
2189 | Elasticsearch
2190 |
2191 |
2192 |
2193 |
2194 |
2195 |
2196 | 10
2197 |
2198 |
2199 |
2200 |
2201 |
2202 |
2203 |
2204 |
2205 | [Elasticsearch] Node {#NODE_NAME}: Thread pool - Snapshot Completed
2206 | 0
2207 |
2208 |
2209 | elasix[stat, nodes, {#NODE_UUID}, thread_pool.snapshot.completed]
2210 | 1m
2211 | 7d
2212 | 90d
2213 | 0
2214 | 3
2215 |
2216 |
2217 |
2218 |
2219 | 0
2220 | 0
2221 |
2222 | 0
2223 |
2224 |
2225 |
2226 | 0
2227 |
2228 |
2229 |
2230 |
2231 |
2232 |
2233 | 0
2234 |
2235 |
2236 | Elasticsearch
2237 |
2238 |
2239 |
2240 |
2241 |
2242 |
2243 | 10
2244 |
2245 |
2246 |
2247 |
2248 |
2249 |
2250 |
2251 |
2252 | [Elasticsearch] Node {#NODE_NAME}: Thread pool - Warmer Completed
2253 | 0
2254 |
2255 |
2256 | elasix[stat, nodes, {#NODE_UUID}, thread_pool.warmer.completed]
2257 | 1m
2258 | 7d
2259 | 90d
2260 | 0
2261 | 3
2262 |
2263 |
2264 |
2265 |
2266 | 0
2267 | 0
2268 |
2269 | 0
2270 |
2271 |
2272 |
2273 | 0
2274 |
2275 |
2276 |
2277 |
2278 |
2279 |
2280 | 0
2281 |
2282 |
2283 | Elasticsearch
2284 |
2285 |
2286 |
2287 |
2288 |
2289 |
2290 | 10
2291 |
2292 |
2293 |
2294 |
2295 |
2296 |
2297 |
2298 |
2299 | [Elasticsearch] Node {#NODE_NAME}: Transport - Incoming traffic
2300 | 0
2301 |
2302 |
2303 | elasix[stat, nodes, {#NODE_UUID}, transport.rx_size_in_bytes]
2304 | 1m
2305 | 7d
2306 | 90d
2307 | 0
2308 | 3
2309 |
2310 | bps
2311 |
2312 |
2313 | 0
2314 | 0
2315 |
2316 | 0
2317 |
2318 |
2319 |
2320 | 0
2321 |
2322 |
2323 |
2324 |
2325 |
2326 |
2327 | 0
2328 |
2329 |
2330 | Elasticsearch
2331 |
2332 |
2333 |
2334 |
2335 |
2336 |
2337 | 10
2338 |
2339 |
2340 |
2341 |
2342 |
2343 |
2344 |
2345 |
2346 | [Elasticsearch] Node {#NODE_NAME}: Transport - Outgoing traffic
2347 | 0
2348 |
2349 |
2350 | elasix[stat, nodes, {#NODE_UUID}, transport.tx_size_in_bytes]
2351 | 1m
2352 | 7d
2353 | 90d
2354 | 0
2355 | 3
2356 |
2357 | bps
2358 |
2359 |
2360 | 0
2361 | 0
2362 |
2363 | 0
2364 |
2365 |
2366 |
2367 | 0
2368 |
2369 |
2370 |
2371 |
2372 |
2373 |
2374 | 0
2375 |
2376 |
2377 | Elasticsearch
2378 |
2379 |
2380 |
2381 |
2382 |
2383 |
2384 | 10
2385 |
2386 |
2387 |
2388 |
2389 |
2390 |
2391 |
2392 |
2393 |
2394 |
2395 | {Template DB Elasticsearch:elasix[stat, nodes, {#NODE_UUID}, breakers.fielddata.tripped].last()}>0
2396 | 0
2397 |
2398 | ElasticSearch: Node {#NODE_NAME} - Breakers fielddata tripped
2399 | 0
2400 |
2401 |
2402 | 0
2403 | 1
2404 |
2405 | 0
2406 | 0
2407 |
2408 |
2409 |
2410 |
2411 | {Template DB Elasticsearch:elasix[stat, nodes, {#NODE_UUID}, breakers.parent.tripped].last()}>0
2412 | 0
2413 |
2414 | ElasticSearch: Node {#NODE_NAME} - Breakers parent tripped
2415 | 0
2416 |
2417 |
2418 | 0
2419 | 1
2420 |
2421 | 0
2422 | 0
2423 |
2424 |
2425 |
2426 |
2427 | {Template DB Elasticsearch:elasix[stat, nodes, {#NODE_UUID}, breakers.request.tripped].last()}>0
2428 | 0
2429 |
2430 | ElasticSearch: Node {#NODE_NAME} - Breakers request tripped
2431 | 0
2432 |
2433 |
2434 | 0
2435 | 1
2436 |
2437 | 0
2438 | 0
2439 |
2440 |
2441 |
2442 |
2443 | {Template DB Elasticsearch:elasix[stat, nodes, {#NODE_UUID}, jvm.mem.heap_used_percent].last()}>85
2444 | 0
2445 |
2446 | ElasticSearch: Node {#NODE_NAME} - Heap is over 85%
2447 | 0
2448 |
2449 |
2450 | 0
2451 | 4
2452 |
2453 | 0
2454 | 0
2455 |
2456 |
2457 |
2458 |
2459 |
2460 |
2461 | [Elasticsearch] Node {#NODE_NAME}: Indices Documents
2462 | 900
2463 | 200
2464 | 0.0000
2465 | 100.0000
2466 | 1
2467 | 1
2468 | 0
2469 | 1
2470 | 0
2471 | 0.0000
2472 | 0.0000
2473 | 0
2474 | 0
2475 | 0
2476 | 0
2477 |
2478 |
2479 | 0
2480 | 0
2481 | 000000
2482 | 1
2483 | 2
2484 | 0
2485 | -
2486 | Template DB Elasticsearch
2487 | elasix[stat, nodes, {#NODE_UUID}, indices.docs.count]
2488 |
2489 |
2490 |
2491 | 1
2492 | 0
2493 | C80000
2494 | 1
2495 | 2
2496 | 0
2497 | -
2498 | Template DB Elasticsearch
2499 | elasix[stat, nodes, {#NODE_UUID}, indices.docs.deleted]
2500 |
2501 |
2502 |
2503 |
2504 |
2505 | [Elasticsearch] Node {#NODE_NAME}: JVM Heap
2506 | 900
2507 | 200
2508 | 0.0000
2509 | 100.0000
2510 | 1
2511 | 1
2512 | 1
2513 | 1
2514 | 0
2515 | 0.0000
2516 | 0.0000
2517 | 0
2518 | 2
2519 | 0
2520 |
2521 | Template DB Elasticsearch
2522 | elasix[stat, nodes, {#NODE_UUID}, jvm.mem.heap_max_in_bytes]
2523 |
2524 |
2525 |
2526 | 0
2527 | 0
2528 | FF6666
2529 | 1
2530 | 2
2531 | 0
2532 | -
2533 | Template DB Elasticsearch
2534 | elasix[stat, nodes, {#NODE_UUID}, jvm.mem.pools.old.used_in_bytes]
2535 |
2536 |
2537 |
2538 | 1
2539 | 0
2540 | 33FF33
2541 | 1
2542 | 2
2543 | 0
2544 | -
2545 | Template DB Elasticsearch
2546 | elasix[stat, nodes, {#NODE_UUID}, jvm.mem.pools.survivor.used_in_bytes]
2547 |
2548 |
2549 |
2550 | 2
2551 | 0
2552 | EEEE00
2553 | 1
2554 | 2
2555 | 0
2556 | -
2557 | Template DB Elasticsearch
2558 | elasix[stat, nodes, {#NODE_UUID}, jvm.mem.pools.young.used_in_bytes]
2559 |
2560 |
2561 |
2562 |
2563 |
2564 | [Elasticsearch] Node {#NODE_NAME}: Thread Pool
2565 | 900
2566 | 200
2567 | 0.0000
2568 | 100.0000
2569 | 1
2570 | 1
2571 | 0
2572 | 1
2573 | 0
2574 | 0.0000
2575 | 0.0000
2576 | 0
2577 | 0
2578 | 0
2579 | 0
2580 |
2581 |
2582 | 0
2583 | 0
2584 | 00C800
2585 | 0
2586 | 2
2587 | 0
2588 | -
2589 | Template DB Elasticsearch
2590 | elasix[stat, nodes, {#NODE_UUID}, thread_pool.bulk.completed]
2591 |
2592 |
2593 |
2594 | 1
2595 | 0
2596 | C80000
2597 | 0
2598 | 2
2599 | 0
2600 | -
2601 | Template DB Elasticsearch
2602 | elasix[stat, nodes, {#NODE_UUID}, thread_pool.get.completed]
2603 |
2604 |
2605 |
2606 | 2
2607 | 0
2608 | 0000C8
2609 | 0
2610 | 2
2611 | 0
2612 | -
2613 | Template DB Elasticsearch
2614 | elasix[stat, nodes, {#NODE_UUID}, thread_pool.index.completed]
2615 |
2616 |
2617 |
2618 | 3
2619 | 0
2620 | C800C8
2621 | 0
2622 | 2
2623 | 0
2624 | -
2625 | Template DB Elasticsearch
2626 | elasix[stat, nodes, {#NODE_UUID}, thread_pool.listener.completed]
2627 |
2628 |
2629 |
2630 | 5
2631 | 0
2632 | C8C800
2633 | 0
2634 | 2
2635 | 0
2636 | -
2637 | Template DB Elasticsearch
2638 | elasix[stat, nodes, {#NODE_UUID}, thread_pool.refresh.completed]
2639 |
2640 |
2641 |
2642 | 6
2643 | 0
2644 | 777777
2645 | 0
2646 | 2
2647 | 0
2648 | -
2649 | Template DB Elasticsearch
2650 | elasix[stat, nodes, {#NODE_UUID}, thread_pool.search.completed]
2651 |
2652 |
2653 |
2654 | 7
2655 | 0
2656 | 009600
2657 | 0
2658 | 2
2659 | 0
2660 | -
2661 | Template DB Elasticsearch
2662 | elasix[stat, nodes, {#NODE_UUID}, thread_pool.snapshot.completed]
2663 |
2664 |
2665 |
2666 | 9
2667 | 0
2668 | 000096
2669 | 0
2670 | 2
2671 | 0
2672 | -
2673 | Template DB Elasticsearch
2674 | elasix[stat, nodes, {#NODE_UUID}, thread_pool.warmer.completed]
2675 |
2676 |
2677 |
2678 |
2679 |
2680 | [Elasticsearch] Node {#NODE_NAME}: Transport Traffic
2681 | 900
2682 | 200
2683 | 0.0000
2684 | 100.0000
2685 | 1
2686 | 1
2687 | 0
2688 | 1
2689 | 0
2690 | 0.0000
2691 | 0.0000
2692 | 0
2693 | 0
2694 | 0
2695 | 0
2696 |
2697 |
2698 | 0
2699 | 5
2700 | 00AA00
2701 | 1
2702 | 2
2703 | 0
2704 | -
2705 | Template DB Elasticsearch
2706 | elasix[stat, nodes, {#NODE_UUID}, transport.rx_size_in_bytes]
2707 |
2708 |
2709 |
2710 | 1
2711 | 5
2712 | 3333FF
2713 | 1
2714 | 2
2715 | 0
2716 | -
2717 | Template DB Elasticsearch
2718 | elasix[stat, nodes, {#NODE_UUID}, transport.tx_size_in_bytes]
2719 |
2720 |
2721 |
2722 |
2723 |
2724 |
2725 |
2726 |
2727 |
2728 |
2729 |
2730 |
2731 |
2732 |
2733 |
2734 |
2735 |
2736 | {Template DB Elasticsearch:elasix[stat, health, status].str(red)}=1
2737 | 0
2738 |
2739 | ElasticSearch: Cluster Status is Red
2740 | 0
2741 |
2742 |
2743 | 0
2744 | 4
2745 |
2746 | 0
2747 | 0
2748 |
2749 |
2750 |
2751 |
2752 | {Template DB Elasticsearch:elasix[stat, health, status].str(yellow)}=1
2753 | 0
2754 |
2755 | ElasticSearch: Cluster Status is Yellow
2756 | 0
2757 |
2758 |
2759 | 0
2760 | 2
2761 |
2762 | 0
2763 | 0
2764 |
2765 |
2766 |
2767 |
2768 | {Template DB Elasticsearch:elasix[stat, health, unassigned_shards].last()}>0
2769 | 0
2770 |
2771 | Elasticsearch: Unassigned Shards
2772 | 0
2773 |
2774 |
2775 | 0
2776 | 2
2777 |
2778 | 0
2779 | 0
2780 |
2781 |
2782 |
2783 |
2784 |
2785 |
2786 | [Elasticsearch] Cluster Nodes
2787 | 900
2788 | 200
2789 | 0.0000
2790 | 100.0000
2791 | 1
2792 | 1
2793 | 0
2794 | 1
2795 | 0
2796 | 0.0000
2797 | 0.0000
2798 | 1
2799 | 0
2800 | 0
2801 | 0
2802 |
2803 |
2804 | 0
2805 | 4
2806 | 000000
2807 | 0
2808 | 2
2809 | 0
2810 | -
2811 | Template DB Elasticsearch
2812 | elasix[stat, cluster, nodes.count.total]
2813 |
2814 |
2815 |
2816 | 1
2817 | 1
2818 | 0000DD
2819 | 0
2820 | 2
2821 | 0
2822 | -
2823 | Template DB Elasticsearch
2824 | elasix[stat, cluster, nodes.count.data]
2825 |
2826 |
2827 |
2828 |
2829 |
2830 | [Elasticsearch] Doc index rate
2831 | 900
2832 | 200
2833 | 0.0000
2834 | 100.0000
2835 | 1
2836 | 1
2837 | 0
2838 | 1
2839 | 0
2840 | 0.0000
2841 | 0.0000
2842 | 0
2843 | 0
2844 | 0
2845 | 0
2846 |
2847 |
2848 | 0
2849 | 0
2850 | 00C800
2851 | 0
2852 | 2
2853 | 0
2854 | -
2855 | Template DB Elasticsearch
2856 | elasix[stat, cluster, indices.docs.count]
2857 |
2858 |
2859 |
2860 |
2861 |
2862 | [Elasticsearch] Field data performance
2863 | 900
2864 | 200
2865 | 0.0000
2866 | 100.0000
2867 | 1
2868 | 1
2869 | 0
2870 | 1
2871 | 0
2872 | 0.0000
2873 | 0.0000
2874 | 0
2875 | 0
2876 | 0
2877 | 0
2878 |
2879 |
2880 | 0
2881 | 0
2882 | C80000
2883 | 0
2884 | 2
2885 | 0
2886 | -
2887 | Template DB Elasticsearch
2888 | elasix[stat, cluster, indices.fielddata.memory_size_in_bytes]
2889 |
2890 |
2891 |
2892 | 1
2893 | 0
2894 | 00C800
2895 | 0
2896 | 2
2897 | 0
2898 | -
2899 | Template DB Elasticsearch
2900 | elasix[stat, cluster, indices.fielddata.evictions]
2901 |
2902 |
2903 |
2904 |
2905 |
2906 | [Elasticsearch] Filter cache performance
2907 | 900
2908 | 200
2909 | 0.0000
2910 | 100.0000
2911 | 1
2912 | 1
2913 | 0
2914 | 1
2915 | 0
2916 | 0.0000
2917 | 0.0000
2918 | 0
2919 | 0
2920 | 0
2921 | 0
2922 |
2923 |
2924 | 0
2925 | 0
2926 | C80000
2927 | 0
2928 | 2
2929 | 0
2930 | -
2931 | Template DB Elasticsearch
2932 | elasix[stat, cluster, indices.query_cache.memory_size_in_bytes]
2933 |
2934 |
2935 |
2936 | 1
2937 | 0
2938 | 00C800
2939 | 0
2940 | 2
2941 | 0
2942 | -
2943 | Template DB Elasticsearch
2944 | elasix[stat, cluster, indices.query_cache.evictions]
2945 |
2946 |
2947 |
2948 |
2949 |
2950 | [Elasticsearch] Index Latency
2951 | 900
2952 | 200
2953 | 0.0000
2954 | 100.0000
2955 | 1
2956 | 1
2957 | 0
2958 | 1
2959 | 0
2960 | 0.0000
2961 | 0.0000
2962 | 0
2963 | 0
2964 | 0
2965 | 0
2966 |
2967 |
2968 | 0
2969 | 0
2970 | 00C800
2971 | 0
2972 | 2
2973 | 0
2974 | -
2975 | Template DB Elasticsearch
2976 | elasix[stat, indices, _all, total.flush.total_time_in_millis]
2977 |
2978 |
2979 |
2980 | 1
2981 | 0
2982 | C80000
2983 | 0
2984 | 2
2985 | 0
2986 | -
2987 | Template DB Elasticsearch
2988 | elasix[stat, indices, _all, total.get.time_in_millis]
2989 |
2990 |
2991 |
2992 | 2
2993 | 0
2994 | 0000C8
2995 | 0
2996 | 2
2997 | 0
2998 | -
2999 | Template DB Elasticsearch
3000 | elasix[stat, indices, _all, total.indexing.index_time_in_millis]
3001 |
3002 |
3003 |
3004 | 3
3005 | 0
3006 | C800C8
3007 | 0
3008 | 2
3009 | 0
3010 | -
3011 | Template DB Elasticsearch
3012 | elasix[stat, indices, _all, total.merges.total_time_in_millis]
3013 |
3014 |
3015 |
3016 | 4
3017 | 0
3018 | 00C8C8
3019 | 0
3020 | 2
3021 | 0
3022 | -
3023 | Template DB Elasticsearch
3024 | elasix[stat, indices, _all, total.refresh.total_time_in_millis]
3025 |
3026 |
3027 |
3028 | 5
3029 | 0
3030 | C8C800
3031 | 0
3032 | 2
3033 | 0
3034 | -
3035 | Template DB Elasticsearch
3036 | elasix[stat, indices, _all, total.search.query_time_in_millis]
3037 |
3038 |
3039 |
3040 |
3041 |
3042 | [Elasticsearch] Index Operations
3043 | 900
3044 | 200
3045 | 0.0000
3046 | 100.0000
3047 | 1
3048 | 1
3049 | 0
3050 | 1
3051 | 0
3052 | 0.0000
3053 | 0.0000
3054 | 0
3055 | 0
3056 | 0
3057 | 0
3058 |
3059 |
3060 | 0
3061 | 0
3062 | 00C800
3063 | 0
3064 | 2
3065 | 0
3066 | -
3067 | Template DB Elasticsearch
3068 | elasix[stat, indices, _all, total.flush.total]
3069 |
3070 |
3071 |
3072 | 1
3073 | 0
3074 | C80000
3075 | 0
3076 | 2
3077 | 0
3078 | -
3079 | Template DB Elasticsearch
3080 | elasix[stat, indices, _all, total.get.total]
3081 |
3082 |
3083 |
3084 | 2
3085 | 0
3086 | 0000C8
3087 | 0
3088 | 2
3089 | 0
3090 | -
3091 | Template DB Elasticsearch
3092 | elasix[stat, indices, _all, total.indexing.index_total]
3093 |
3094 |
3095 |
3096 | 3
3097 | 0
3098 | C800C8
3099 | 0
3100 | 2
3101 | 0
3102 | -
3103 | Template DB Elasticsearch
3104 | elasix[stat, indices, _all, total.merges.total]
3105 |
3106 |
3107 |
3108 | 4
3109 | 0
3110 | 00C8C8
3111 | 0
3112 | 2
3113 | 0
3114 | -
3115 | Template DB Elasticsearch
3116 | elasix[stat, indices, _all, total.refresh.total]
3117 |
3118 |
3119 |
3120 | 5
3121 | 0
3122 | C8C800
3123 | 0
3124 | 2
3125 | 0
3126 | -
3127 | Template DB Elasticsearch
3128 | elasix[stat, indices, _all, total.search.query_total]
3129 |
3130 |
3131 |
3132 |
3133 |
3134 | [Elasticsearch] Query Performance
3135 | 900
3136 | 200
3137 | 0.0000
3138 | 100.0000
3139 | 1
3140 | 1
3141 | 0
3142 | 1
3143 | 0
3144 | 0.0000
3145 | 0.0000
3146 | 0
3147 | 0
3148 | 0
3149 | 0
3150 |
3151 |
3152 | 0
3153 | 0
3154 | C80000
3155 | 0
3156 | 2
3157 | 0
3158 | -
3159 | Template DB Elasticsearch
3160 | elasix[stat, indices, _all, total.search.query_total]
3161 |
3162 |
3163 |
3164 |
3165 |
3166 | [Elasticsearch] Shard Movement
3167 | 900
3168 | 200
3169 | 0.0000
3170 | 100.0000
3171 | 1
3172 | 1
3173 | 1
3174 | 1
3175 | 0
3176 | 0.0000
3177 | 0.0000
3178 | 0
3179 | 0
3180 | 0
3181 | 0
3182 |
3183 |
3184 | 0
3185 | 0
3186 | CC00CC
3187 | 0
3188 | 2
3189 | 0
3190 | -
3191 | Template DB Elasticsearch
3192 | elasix[stat, health, unassigned_shards]
3193 |
3194 |
3195 |
3196 | 1
3197 | 0
3198 | 00CCCC
3199 | 0
3200 | 2
3201 | 0
3202 | -
3203 | Template DB Elasticsearch
3204 | elasix[stat, health, initializing_shards]
3205 |
3206 |
3207 |
3208 | 2
3209 | 0
3210 | 00DD00
3211 | 0
3212 | 2
3213 | 0
3214 | -
3215 | Template DB Elasticsearch
3216 | elasix[stat, health, relocating_shards]
3217 |
3218 |
3219 |
3220 |
3221 |
3222 |
3223 |
--------------------------------------------------------------------------------