CN104361713A - Index data monitoring method, device and server - Google Patents
Index data monitoring method, device and server Download PDFInfo
- Publication number
- CN104361713A CN104361713A CN201410540110.7A CN201410540110A CN104361713A CN 104361713 A CN104361713 A CN 104361713A CN 201410540110 A CN201410540110 A CN 201410540110A CN 104361713 A CN104361713 A CN 104361713A
- Authority
- CN
- China
- Prior art keywords
- queue
- rank
- residing
- alarm
- achievement data
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G08—SIGNALLING
- G08B—SIGNALLING OR CALLING SYSTEMS; ORDER TELEGRAPHS; ALARM SYSTEMS
- G08B21/00—Alarms responsive to a single specified undesired or abnormal condition and not otherwise provided for
- G08B21/18—Status alarms
- G08B21/182—Level alarms, e.g. alarms responsive to variables exceeding a threshold
-
- G—PHYSICS
- G08—SIGNALLING
- G08B—SIGNALLING OR CALLING SYSTEMS; ORDER TELEGRAPHS; ALARM SYSTEMS
- G08B29/00—Checking or monitoring of signalling or alarm systems; Prevention or correction of operating errors, e.g. preventing unauthorised operation
- G08B29/18—Prevention or correction of operating errors
- G08B29/185—Signal analysis techniques for reducing or preventing false alarms or for enhancing the reliability of the system
Landscapes
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Business, Economics & Management (AREA)
- Emergency Management (AREA)
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Alarm Systems (AREA)
Abstract
The invention provides an index data monitoring method, device and server. The method includes placing acquired index data into a preset queue; when the queue is full, determining the level of the queue currently according to the levels of the index data of the queue; determining whether the alarm is necessary or not and alarming as required in the manner determined by a strategy according to the current level of the queue, the level of the prior queue and the preset strategy. By the aid of the method, the problem of fault alarming since the index data are incorrect can be avoided; in addition, the problems of excessively frequent alarming and alarming source waste are avoided.
Description
Technical field
The present invention relates to technical field of information processing, particularly relate to a kind of monitoring method of achievement data, device and server.
Background technology
When monitoring achievement data, need real-time acquisition achievement data, this achievement data is the result of all data through calculating to (such as 10s) within the scope of a period of time.When monitored data volume is larger, the monitored data within the scope of possible a period of time are not also write in database completely, cause the achievement data calculated to be likely incorrect like this.
When monitoring achievement data, common way first arranges a threshold value, then obtain an achievement data that will monitor at every turn, just compare the magnitude relationship between this achievement data value and setting threshold value, the achievement data that such as regulation is greater than threshold value belongs to normal index data; Otherwise, belong to abnormal index data, will alarm be carried out to abnormal index data.When there is multiple continuous abnormal achievement data, so often occur that abnormal index data all will carry out alarm.
On the one hand, when judging for each achievement data respectively, because achievement data self may be incorrect, alarm by mistake can be caused like this.In addition on the one hand, often find that abnormal index data just carry out alarm, the problem of the too frequent and excess waste alarm resource of alarm can be caused.
Summary of the invention
In view of the above problems, the present invention is proposed to provide a kind of monitoring method, device and the server that overcome the problems referred to above or a kind of achievement data of solving the problem at least in part.
Based on the problems referred to above, the monitoring method of a kind of achievement data that the embodiment of the present invention provides, comprising:
In real time the achievement data of acquisition is put into the queue of setting;
When described queue is expired, according to the rank residing for achievement data each in described queue, determine the current residing rank of described queue;
According to the current residing rank of the queue determined and the rank residing for the previous queue of recording, and the strategy preset, determine whether that the mode needing alarm and specify according to described strategy when needing alarm carries out alarm.
The monitoring device of a kind of achievement data that the embodiment of the present invention provides, comprising:
Queue processing module, for putting into the queue of setting in real time by the achievement data of acquisition;
Queue-level determination module, for when described queue is expired, according to the rank residing for achievement data each in described queue, determines the current residing rank of described queue;
Warning processing module, the current residing rank of queue determined for basis and the rank residing for the previous queue of recording, and the strategy preset, determine whether that the mode needing alarm and specify according to described strategy when needing alarm carries out alarm.
The server that the embodiment of the present invention provides, comprises the monitoring device of the These parameters data that the embodiment of the present invention provides.
The beneficial effect of the embodiment of the present invention comprises:
The monitoring method of the achievement data that the embodiment of the present invention provides, device and server, achievement data is put in real time the queue of setting, only have when queue full time, according to the rank of achievement data each in this queue, determine the rank residing for whole queue, then according to the current residing rank of the queue determined, with the rank residing for recorded previous queue, and the strategy preset, determine whether that the mode needing alarm and specify according to this strategy when needing alarm carries out alarm, like this, whole queue is adopted to carry out the mode analyzed, instead of adopt achievement data one by one to carry out the mode analyzed, can avoid in prior art, due to the problem of the mistake alarm that achievement data self may incorrectly cause, in addition on the one hand, it also avoid the problem of the too frequent and excess waste alarm resource of alarm.
Above-mentioned explanation is only the general introduction of technical solution of the present invention, in order to technological means of the present invention can be better understood, and can be implemented according to the content of instructions, and can become apparent, below especially exemplified by the specific embodiment of the present invention to allow above and other objects of the present invention, feature and advantage.
Accompanying drawing explanation
By reading hereafter detailed description of the preferred embodiment, various other advantage and benefit will become cheer and bright for those of ordinary skill in the art.Accompanying drawing only for illustrating the object of preferred implementation, and does not think limitation of the present invention.And in whole accompanying drawing, represent identical parts by identical reference symbol.In the accompanying drawings:
The process flow diagram of the monitoring method of the achievement data that Fig. 1 provides for the embodiment of the present invention;
The process flow diagram of the current residing rank of determination queue that Fig. 2 provides for the embodiment of the present invention;
The another process flow diagram of the monitoring method of the achievement data that Fig. 3 provides for the embodiment of the present invention;
The structural representation of the monitoring device of the achievement data that Fig. 4 provides for the embodiment of the present invention.
Embodiment
Below with reference to accompanying drawings exemplary embodiment of the present disclosure is described in more detail.Although show exemplary embodiment of the present disclosure in accompanying drawing, however should be appreciated that can realize the disclosure in a variety of manners and not should limit by the embodiment set forth here.On the contrary, provide these embodiments to be in order to more thoroughly the disclosure can be understood, and complete for the scope of the present disclosure can be conveyed to those skilled in the art.
Below in conjunction with Figure of description, the embodiment of the monitoring method of a kind of achievement data that the embodiment of the present invention provides, device and server is described in detail.
The monitoring method of a kind of achievement data that the embodiment of the present invention provides, as shown in Figure 1, specifically comprises the following steps:
S11, in real time the achievement data of acquisition is put into the queue of setting;
S12, judge that whether queue is full; If so, S13 is performed, otherwise, turn to S11;
S13, rank residing for achievement data each in queue, determine the current residing rank of described queue;
S14, the basis current residing rank of queue determined and the rank residing for previous queue recorded, and the strategy preset, determine whether that the mode needing alarm and specify according to described strategy when needing alarm carries out alarm.
Respectively above steps is described in detail below.
In above-mentioned S11, the preset amount of queue, such as, be preset as 3 by the size of queue, namely can hold 3 achievement datas, certainly, do not limit in the embodiment of the present invention to the size of queue.
In above-mentioned S13, the rank residing for each achievement data, can be determined by following manner:
The upper limit threshold corresponding with each rank preset by each achievement data and/or lower threshold compare, and determine the rank residing for each achievement data.
The normal variation trend of achievement data, can be downtrending (namely achievement data along with the time more and more less, then variation tendency is normal), also may be ascendant trend (achievement data along with the time increasing, then variation tendency is normal), the determination of the upper limit that each rank is corresponding and/or lower threshold, substantial connection is had with the normal variation trend of achievement data, for example, suppose to preset four ranks: normal level, slight levels, severity level, emergency level, the upper limit/lower threshold of four ranks is respectively: 70,80,90; The data being so less than 70 are normal level; Be more than or equal to 70 and the data being less than 80 are slight levels; Be more than or equal to 80 and the data being less than 90 are severity levels; The data being more than or equal to 90 are emergency level.
Like this, compare according to the upper limit of achievement data and these ranks and/or lower threshold, determine the numerical intervals residing for this achievement data, just can determine the rank residing for this achievement data, the size of such as achievement data is 85, then rank residing for achievement data is serious.
Further, in above-mentioned S13, as shown in Figure 2, the current residing rank of queue can be determined by following manner:
S21, compare rank in queue residing for each achievement data and rank residing for the previous queue of recording;
In embodiments of the present invention, height and the order of severity positive correlation that exception occurs of setting rank, that is, the rank residing for achievement data is higher, then represent that the intensity of anomaly of this achievement data is more serious.
If when the rank in S22 queue residing for each achievement data is all higher than rank residing for previous queue, determine that the rank of queue is for the minimum rank in queue residing for achievement data;
If when the rank in S23 queue residing for each achievement data is all lower than rank residing for previous queue, determine that the rank of queue is for the highest level in queue residing for achievement data;
S24 otherwise, determine that the rank residing for queue is equal with the residing rank of previous queue.
Or for normal level, slight levels, severity level, these four ranks of emergency level, no matter the variation tendency of achievement data, suppose that the rank residing for previous queue is slight levels, if the rank in this queue residing for all achievement datas is respectively severity level, severity level, emergency level, then residing before our team's broomrape rank is severity level; If the rank in this queue residing for all achievement datas is respectively slight levels, severity level, severity level, then residing before our team's broomrape rank is slight levels; If the rank in this queue residing for all achievement datas is respectively normal level, normal level, normal level, then residing before our team's broomrape rank is normal level; If the rank in this queue residing for all achievement datas is respectively slight levels, normal level, normal level, then residing before our team's broomrape rank is slight levels.
After determining the current residing rank of queue, in S14, rank that just can be current according to the queue determined and the rank residing for previous queue recorded, and the strategy preset, determine whether that the mode needing alarm and adopt strategy to specify when needing alarm carries out alarm.
The rank of queue is set to multiple rank, this multiple rank is respectively: normal level and at least one improper rank, improper rank is as example above, can according to circumstances be further divided into multiple rank, such as slight levels, severity level, emergency level etc., but, it should be noted that, in the monitoring method of the achievement data provided in the embodiment of the present invention, achievement data or the rank residing for queue, be not limited to the normal level described in above-mentioned example, the setting of the rank that slight levels etc. are concrete, can be as required, arrange with numeral, characters etc. represent all kinds of ranks of grade size, each rank represents achievement data normal condition from low to high successively, achievement data abnormal conditions of various degree etc., the embodiment of the present invention does not do concrete restriction to this.
Specifically, the rank current according to the queue determined and the rank residing for the previous queue of recording, be divided into several situation below:
1) if the current residing rank of queue is equal with the rank residing for previous queue, then determine not need to carry out alarm;
The current residing rank of queue is equal with the rank residing for previous queue, and a kind of situation is that both residing ranks are normally, then do not need to carry out alarm.
Another kind of situation is that both residing ranks are improper rank, such as slight levels, severity level, emergency level etc., like this, following operation can also be performed: judge that whether the extreme value of the queue stored in database is empty, if be empty, then need, according to the normal variation tendency of data, the maximal value in current queue or minimum value to be stored in database as extreme value.
The size of the extreme value of queue can reflect the abnormal conditions of current data, the normal variation tendency of tentation data is ascendant trend, then minimum value in current queue (namely departing from normal condition those data farthest) should be stored in a database as extreme value, otherwise, maximal value in current queue is stored in a database as extreme value.
If the extreme value of the queue stored in database is not empty (storing) before, then according to the normal variation tendency of data, the extreme value recorded in maximal value in current queue or minimum value and database is compared, according to the normal variation tendency of data, determine whether to upgrade described extreme value, and when determining to need, use the maximal value in current queue or minimum value to upgrade the extreme value stored.
Specifically, if the normal trend of data is ascendant trends, then the extreme value of the minimum value in current queue and storage is compared, when the minimum value in current queue is less than the extreme value of storage, the minimum value in current queue is used to upgrade the extreme value of this storage, when the minimum value in current queue is more than or equal to the extreme value of storage, maintain the extreme value stored in database constant.
Otherwise, if the normal trend of data is downtrendings, then the extreme value of the maximal value in current queue and storage is compared, when the maximal value in current queue is greater than the extreme value of storage, the maximal value in current queue is used to upgrade the extreme value of this storage, when the maximal value in current queue is less than or equal to the extreme value of storage, maintain the extreme value stored in database constant.
For example, suppose that the extreme value recorded in current database is 89, the current residing rank of queue is serious, and the normal variation tendency of data is downtrending, and in queue, the value of three achievement datas is 89.1,89.2,89.3, then from three achievement datas, select maximal value, compare with the extreme value 89 recorded in database, because 89.3 are greater than 89, then use 89.3 values more in new database.
Preferably, the extreme value stored in above-mentioned database, can present to user in real time as achievement data.
Because the current residing rank of queue is equal with the rank residing for previous queue, record in database queue current residing for rank, now do not need the rank that the queue of recording in more new database is current.
2) if the current residing rank of queue is lower than the rank residing for previous queue, and the current rank of queue is improper rank, then determine not need to carry out alarm, otherwise, judge whether to carry out alarm, if alarm, export the information cancelling alarm;
In this case, the degree of the data exception of current queue will lower than previous queue (data exception degree be in improvement), so, similarly, if current level is improper rank, such as slight levels, severity level etc., then the current residing rank (rank namely residing for last queue) of queue of record before needing to use in the current residing grade renewal database of queue;
If current rank is normal level, inquiry is then needed whether to carry out alarm, if carried out alarm, need the message that outputting alarm is cancelled, for example, by reading for recording the field value that whether sends alarm email or determining whether to send alarm for recording the field value whether sending alarm message from database;
If sent alarm email, then outputting alarm terminated mail;
If sent alarm message, then outputting alarm terminated note.
Suppose that the alarm email field value that whether sent read from database is 1 (namely characterizes and send alarm email), then sending reports to the police terminates mail, the field value whether having sent alarm message read from database is 1 (namely characterizes and send alarm message), then sending reports to the police terminates note.
3) if the current residing rank be superior to residing for previous queue of queue, then the warning strategies preset according to each rank in the current residing improper rank of queue and at least one improper rank determines whether the alarm mode of alarm and correspondence.
In this case, the degree of the data exception of current queue is higher than previous queue (data exception degree is in deterioration), then the current residing rank (rank namely residing for last queue) of queue of record before needing to use in the current residing grade renewal database of queue;
Suppose that improper rank comprises three ranks (being certainly not limited to three ranks below) below: slight levels, severity level, emergency level; Be described in detail for this several situation respectively below:
1) when the current residing rank of queue is slight levels, alarm is not carried out;
When the current residing rank of queue is slight levels, although do not carry out alarm, but the normal variation trend of all right reference data, extreme value in database is adjusted, concrete adjustment mode is equal with the rank residing for previous queue with the current residing rank of aforementioned queue and adjustment mode when being improper rank is similar, does not repeat them here.
2) when the current residing rank of queue is severity level, send alarm email, and more in new database for recording the field value whether sending alarm email;
When the current residing rank of queue is severity level, similarly, the normal variation trend of all right reference data, adjust the extreme value in database, concrete adjustment mode is similar to aforementioned, does not repeat them here.
More in new database for recording the field value whether sending alarm email, such as more new database be 1 for recording the field value whether sending alarm email (characterize and send alarm email).
3) when the current residing rank of queue is emergency level, send alarm message, and more in new database for recording the field value whether sending alarm message.
When the current residing rank of queue is emergency level, similarly, the normal variation trend of all right reference data, adjust the extreme value in database, concrete adjustment mode is similar to aforementioned, does not repeat them here.
More in new database for recording the field value whether sending alarm message, such as more new database be 1 for recording the field value whether sending alarm message (characterize and send alarm email).Meanwhile, from database, read the field value whether sending alarm email, if 0 (characterize do not send alarm message), then send alarm email, then the field value whether having sent alarm email is revised as 1.
Because achievement data needs to monitor in real time, the monitoring method of the These parameters data that the embodiment of the present invention provides, after above-mentioned steps S11 ~ S13, as shown in Figure 3, can also comprise and perform following step:
The first achievement data of S15, deletion queue;
And then repeat S11 ~ S14 and namely in real time the achievement data of acquisition is put among queue, then when queue is expired, determine the current residing rank of queue, and the rank residing for the current residing rank of queue and previous queue, and the strategy preset, determine whether that the mode needing alarm and strategically specify when needing alarm carries out the step of alarm.
Based on same inventive concept, the embodiment of the present invention additionally provides a kind of monitoring device and server of achievement data, the principle of dealing with problems due to these devices and server is similar to the monitoring method of aforementioned achievement data, therefore the enforcement of this device and server see the enforcement of preceding method, can repeat part and repeats no more.
As shown in Figure 4, the monitoring device of a kind of achievement data that the embodiment of the present invention provides, comprising:
Queue processing module 401, for putting into the queue of setting in real time by the achievement data of acquisition;
Queue-level determination module 402, for when queue is expired, according to the rank residing for achievement data each in queue, determines the current residing rank of queue;
Warning processing module 403, the current residing rank of queue determined for basis and the rank residing for the previous queue of recording, and the strategy preset, determine whether that the mode needing alarm and strategically specify when needing alarm carries out alarm.
Further, the queue-level determination module 402 in the monitoring device of These parameters data, specifically for upper limit threshold corresponding with each rank preset for each achievement data and/or lower threshold being compared, determines the rank residing for each achievement data.
Further, the queue-level determination module 402 in the monitoring device of These parameters data, specifically for comparing rank residing for rank in queue residing for each achievement data and described previous queue; Height and the order of severity positive correlation that exception occurs of rank; If when the rank in queue residing for each achievement data is all higher than rank residing for previous queue, determine that the rank of queue is for the minimum rank in queue residing for achievement data; If when the rank in queue residing for each achievement data is all lower than rank residing for previous queue, determine that the rank of queue is for the highest level in queue residing for achievement data; Otherwise, determine that the rank residing for queue is equal with the residing rank of previous queue.
Further, the rank of achievement data or queue is in following rank: normal level, at least one improper rank; At least one is improper is superior to normal level;
Correspondingly, warning processing module 403, if it is equal with the rank residing for previous queue to be further used for the current residing rank of queue, then determines not need to carry out alarm; If the current residing rank of queue is lower than the rank residing for previous queue, and the current residing rank of queue is improper rank, then determine not need to carry out alarm, otherwise, judge whether to carry out alarm, if alarm, export the information cancelling alarm; If the current residing rank be superior to residing for previous queue of queue, then the warning strategies preset according to each rank in the current residing improper rank of queue and at least one improper rank described determines whether the alarm mode of alarm and correspondence.
Further, the monitoring device of the achievement data that the embodiment of the present invention provides, as shown in Figure 4, also comprise: update module 404, if unequal for the rank residing for the current residing rank of queue and previous queue, use the rank residing for previous queue that the current residing grade renewal database of queue records.
Further, above-mentioned warning processing module 403, is further used for by reading for recording the field value that whether sends alarm email or determining whether to send alarm for recording the field value whether sending alarm message from database; If sent alarm email, outputting alarm terminated mail; If sent alarm message, outputting alarm terminated note.
Further, at least one improper rank above-mentioned comprises: slight levels, severity level, emergency level;
Correspondingly, above-mentioned warning processing module 403, is further used for, when the current residing rank of queue is slight levels, not carrying out alarm; When the current residing rank of queue is severity level, send alarm email, and more in new database for recording the field value whether sending alarm email; When the current residing rank of queue is emergency level, send alarm message, and more in new database for recording the field value whether sending alarm message, and when not sending alarm email, send alarm email.
Further, update module 404 in the monitoring device of the achievement data that the embodiment of the present invention provides, if be also improper rank for the rank residing for the current residing rank of queue and previous queue, if and the current residing rank be superior to residing for previous queue of queue, when the extreme value of the queue stored in database is for time empty, according to the normal variation tendency of data, the maximal value in current queue or minimum value are stored in database as described extreme value; Or according to the normal variation tendency of data, the extreme value recorded in maximal value in current queue or minimum value and database is compared, and according to the normal variation tendency of described data, determine whether to upgrade described extreme value, and when determining to need, use the maximal value in current queue or minimum value to upgrade the extreme value stored.
Further, above-mentioned queue processing module 401, also for deleting the first achievement data of queue; The achievement data of follow-up acquisition is put into the queue of setting.
The server that the embodiment of the present invention provides, this server comprises the monitoring device of the These parameters data that the embodiment of the present invention provides.
The monitoring method of the achievement data that the embodiment of the present invention provides, device and server, achievement data is put in real time the queue of setting, only have when queue full time, according to the rank of achievement data each in this queue, determine the rank residing for whole queue, then according to the current residing rank of the queue determined, with the rank residing for recorded previous queue, and the strategy preset, determine whether that the mode needing alarm and specify according to this strategy when needing alarm carries out alarm, like this, whole queue is adopted to carry out the mode analyzed, instead of adopt achievement data one by one to carry out the mode analyzed, can avoid in prior art, due to the problem of the mistake alarm that achievement data self may incorrectly cause, in addition on the one hand, it also avoid the problem of the too frequent and excess waste alarm resource of alarm.
Intrinsic not relevant to any certain computer, virtual system or miscellaneous equipment with display at this algorithm provided.Various general-purpose system also can with use based on together with this teaching.According to description above, the structure constructed required by this type systematic is apparent.In addition, the present invention is not also for any certain programmed language.It should be understood that and various programming language can be utilized to realize content of the present invention described here, and the description done language-specific is above to disclose preferred forms of the present invention.
In instructions provided herein, describe a large amount of detail.But can understand, embodiments of the invention can be put into practice when not having these details.In some instances, be not shown specifically known method, structure and technology, so that not fuzzy understanding of this description.
Similarly, be to be understood that, in order to simplify the disclosure and to help to understand in each inventive aspect one or more, in the description above to exemplary embodiment of the present invention, each feature of the present invention is grouped together in single embodiment, figure or the description to it sometimes.But, the method for the disclosure should be construed to the following intention of reflection: namely the present invention for required protection requires feature more more than the feature clearly recorded in each claim.Or rather, as claims below reflect, all features of disclosed single embodiment before inventive aspect is to be less than.Therefore, the claims following embodiment are incorporated to this embodiment thus clearly, and wherein each claim itself is as independent embodiment of the present invention.
Those skilled in the art are appreciated that and adaptively can change the module in the equipment in embodiment and they are arranged in one or more equipment different from this embodiment.Module in embodiment or unit or assembly can be combined into a module or unit or assembly, and multiple submodule or subelement or sub-component can be put them in addition.Except at least some in such feature and/or process or unit be mutually repel except, any combination can be adopted to combine all processes of all features disclosed in this instructions (comprising adjoint claim, summary and accompanying drawing) and so disclosed any method or equipment or unit.Unless expressly stated otherwise, each feature disclosed in this instructions (comprising adjoint claim, summary and accompanying drawing) can by providing identical, alternative features that is equivalent or similar object replaces.
In addition, those skilled in the art can understand, although embodiments more described herein to comprise in other embodiment some included feature instead of further feature, the combination of the feature of different embodiment means and to be within scope of the present invention and to form different embodiments.Such as, in the following claims, the one of any of embodiment required for protection can use with arbitrary array mode.
All parts embodiment of the present invention with hardware implementing, or can realize with the software module run on one or more processor, or realizes with their combination.It will be understood by those of skill in the art that the some or all functions that microprocessor or digital signal processor (DSP) can be used in practice to realize according to the some or all parts in the monitoring device of the achievement data of the embodiment of the present invention and server.The present invention can also be embodied as part or all equipment for performing method as described herein or device program (such as, computer program and computer program).Realizing program of the present invention and can store on a computer-readable medium like this, or the form of one or more signal can be had.Such signal can be downloaded from internet website and obtain, or provides on carrier signal, or provides with any other form.
The present invention will be described instead of limit the invention to it should be noted above-described embodiment, and those skilled in the art can design alternative embodiment when not departing from the scope of claims.In the claims, any reference symbol between bracket should be configured to limitations on claims.Word " comprises " not to be got rid of existence and does not arrange element in the claims or step.Word "a" or "an" before being positioned at element is not got rid of and be there is multiple such element.The present invention can by means of including the hardware of some different elements and realizing by means of the computing machine of suitably programming.In the unit claim listing some devices, several in these devices can be carry out imbody by same hardware branch.Word first, second and third-class use do not represent any order.Can be title by these word explanations.
Obviously, those skilled in the art can carry out various change and modification to the present invention and not depart from the spirit and scope of the present invention.Like this, if these amendments of the present invention and modification belong within the scope of the claims in the present invention and equivalent technologies thereof, then the present invention is also intended to comprise these change and modification.
Claims (19)
1. a monitoring method for achievement data, is characterized in that, comprising:
In real time the achievement data of acquisition is put into the queue of setting;
When described queue is expired, according to the rank residing for achievement data each in described queue, determine the current residing rank of described queue;
According to the current residing rank of the queue determined and the rank residing for the previous queue of recording, and the strategy preset, determine whether that the mode needing alarm and specify according to described strategy when needing alarm carries out alarm.
2. the method for claim 1, is characterized in that, the rank residing for each achievement data, is determined by following manner:
The upper limit threshold corresponding with each rank preset by each achievement data and/or lower threshold compare, and determine the rank residing for each achievement data.
3. the method for claim 1, is characterized in that, described rank residing for achievement data each in described queue, determines the current residing rank of described queue, specifically comprises:
Rank residing for rank in more described queue residing for each achievement data and described previous queue; Height and the order of severity positive correlation that exception occurs of described rank;
If when the rank in described queue residing for each achievement data is all higher than rank residing for described previous queue, determine that the rank of described queue is for the minimum rank in described queue residing for achievement data;
If when the rank in described queue residing for each achievement data is all lower than rank residing for previous queue, determine that the rank of described queue is for the highest level in described queue residing for achievement data;
Otherwise, determine that the rank residing for described queue is equal with the residing rank of described previous queue.
4. method as claimed in claim 3, it is characterized in that, the rank of described achievement data or queue is one in following rank: normal level, at least one improper rank; Described at least one be improperly superior to normal level;
Described rank residing for the current residing rank of queue and previous queue, and the strategy preset, determine whether to need alarm and carry out alarm when needing alarm according to the mode of described strategy regulation, specifically comprise:
If the current residing rank of queue is equal with the rank residing for previous queue, then determine not need to carry out alarm;
If the current residing rank of queue is lower than the rank residing for previous queue, and the current residing rank of queue is improper rank, then determine not need to carry out alarm, otherwise, judge whether to carry out alarm, if alarm, export the information cancelling alarm;
If the current residing rank be superior to residing for previous queue of queue, then the warning strategies preset according to each rank in the current residing improper rank of queue and at least one improper rank described determines whether the alarm mode of alarm and correspondence.
5. method as claimed in claim 4, is characterized in that, if the current residing rank of queue and the rank residing for previous queue unequal, described method also comprises:
Use the rank residing for previous queue that the current residing grade renewal of queue records.
6. method as claimed in claim 4, is characterized in that, described in judge whether to carry out alarm, if alarm, export the information cancelling alarm, comprising:
By reading for recording the field value that whether sends alarm email or determining whether to send alarm for recording the field value whether sending alarm message from database;
If sent alarm email, outputting alarm terminated mail;
If sent alarm message, outputting alarm terminated note.
7. method as claimed in claim 4, it is characterized in that, at least one improper rank described comprises: slight levels, severity level, emergency level;
The described warning strategies preset according to each rank in the current residing improper rank of queue and at least one improper rank described determines whether the alarm mode of alarm and correspondence, specifically comprises:
When the current residing rank of queue is slight levels, do not carry out alarm;
When the current residing rank of queue is severity level, send alarm email, and more in new database for recording the field value whether sending alarm email;
When the current residing rank of queue is emergency level, send alarm message, and more in new database for recording the field value whether sending alarm message, and when not sending alarm email, send alarm email.
8. method as claimed in claim 4, is characterized in that, if the current residing rank of queue is improper rank with the rank residing for previous queue, and if queue current residing for the rank be superior to residing for previous queue, described method also comprises:
When the extreme value of the queue stored in database is for time empty, according to the normal variation tendency of data, the maximal value in current queue or minimum value are stored in database as described extreme value; Or
According to the normal variation tendency of data, the extreme value recorded in maximal value in current queue or minimum value and database is compared, and according to the normal variation tendency of described data, determine whether to upgrade described extreme value, and when determining to need, use the maximal value in current queue or minimum value to upgrade the extreme value stored.
9. the method as described in any one of claim 1-8, is characterized in that, also comprises:
Delete the first achievement data of described queue;
The achievement data of follow-up acquisition is put into the queue of setting;
When described queue is expired, repeat to determine the current residing rank of described queue, and the rank residing for the current residing rank of queue and previous queue, and the strategy preset, determine whether that the mode needing alarm and specify according to described strategy when needing alarm carries out the step of alarm.
10. a monitoring device for achievement data, is characterized in that, comprising:
Queue processing module, for putting into the queue of setting in real time by the achievement data of acquisition;
Queue-level determination module, for when described queue is expired, according to the rank residing for achievement data each in described queue, determines the current residing rank of described queue;
Warning processing module, the current residing rank of queue determined for basis and the rank residing for the previous queue of recording, and the strategy preset, determine whether that the mode needing alarm and specify according to described strategy when needing alarm carries out alarm.
11. devices as claimed in claim 10, is characterized in that, queue-level determination module, specifically for upper limit threshold corresponding with each rank preset for each achievement data and/or lower threshold being compared, determine the rank residing for each achievement data.
12. devices as claimed in claim 10, is characterized in that, described queue-level determination module, specifically for rank residing for the rank residing for achievement data each in more described queue and described previous queue; Height and the order of severity positive correlation that exception occurs of described rank; If when the rank in described queue residing for each achievement data is all higher than rank residing for described previous queue, determine that the rank of described queue is for the minimum rank in described queue residing for achievement data; If when the rank in described queue residing for each achievement data is all lower than rank residing for previous queue, determine that the rank of described queue is for the highest level in described queue residing for achievement data; Otherwise, determine that the rank residing for described queue is equal with the residing rank of described previous queue.
13. devices as claimed in claim 12, is characterized in that, the rank of described achievement data or queue is one in following rank: normal level, at least one improper rank; Described at least one be improperly superior to normal level;
Described warning processing module, if it is equal with the rank residing for previous queue to be further used for the current residing rank of queue, then determines not need to carry out alarm; If the current residing rank of queue is lower than the rank residing for previous queue, and the current residing rank of queue is improper rank, then determine not need to carry out alarm, otherwise, judge whether to carry out alarm, if alarm, export the information cancelling alarm; If the current residing rank be superior to residing for previous queue of queue, then the warning strategies preset according to each rank in the current residing improper rank of queue and at least one improper rank described determines whether the alarm mode of alarm and correspondence.
14. devices as claimed in claim 12, it is characterized in that, also comprise: update module, if unequal for the rank residing for the current residing rank of queue and previous queue, use the rank residing for previous queue that the current residing grade renewal database of queue records.
15. devices as claimed in claim 12, it is characterized in that, described warning processing module, is further used for by reading for recording the field value that whether sends alarm email or determining whether to send alarm for recording the field value whether sending alarm message from database; If sent alarm email, outputting alarm terminated mail; If sent alarm message, outputting alarm terminated note.
16. devices as claimed in claim 12, is characterized in that, at least one improper rank described comprises: slight levels, severity level, emergency level;
Described warning processing module, is further used for, when the current residing rank of queue is slight levels, not carrying out alarm; When the current residing rank of queue is severity level, send alarm email, and more in new database for recording the field value whether sending alarm email; When the current residing rank of queue is emergency level, send alarm message, and more in new database for recording the field value whether sending alarm message, and when not sending alarm email, send alarm email.
17. devices as claimed in claim 12, it is characterized in that, described update module, if be also improper rank for the rank residing for the current residing rank of queue and previous queue, if and the current residing rank be superior to residing for previous queue of queue, when the extreme value of the queue stored in database is for time empty, according to the normal variation tendency of data, the maximal value in current queue or minimum value are stored in database as described extreme value; Or according to the normal variation tendency of data, the extreme value recorded in maximal value in current queue or minimum value and database is compared, and according to the normal variation tendency of described data, determine whether to upgrade described extreme value, and when determining to need, use the maximal value in current queue or minimum value to upgrade the extreme value stored.
18. devices as described in any one of claim 10-17, is characterized in that, described queue processing module, also for deleting the first achievement data of described queue; The achievement data of follow-up acquisition is put into the queue of setting.
19. 1 kinds of servers, is characterized in that, described server comprises the monitoring device of the achievement data as described in any one of claim 10-18.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410540110.7A CN104361713A (en) | 2014-10-13 | 2014-10-13 | Index data monitoring method, device and server |
| CN201510070652.7A CN104599433B (en) | 2014-10-13 | 2015-02-10 | A kind of monitoring method of achievement data, device and server |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410540110.7A CN104361713A (en) | 2014-10-13 | 2014-10-13 | Index data monitoring method, device and server |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN104361713A true CN104361713A (en) | 2015-02-18 |
Family
ID=52528971
Family Applications (2)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410540110.7A Pending CN104361713A (en) | 2014-10-13 | 2014-10-13 | Index data monitoring method, device and server |
| CN201510070652.7A Active CN104599433B (en) | 2014-10-13 | 2015-02-10 | A kind of monitoring method of achievement data, device and server |
Family Applications After (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510070652.7A Active CN104599433B (en) | 2014-10-13 | 2015-02-10 | A kind of monitoring method of achievement data, device and server |
Country Status (1)
| Country | Link |
|---|---|
| CN (2) | CN104361713A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109088775A (en) * | 2018-08-29 | 2018-12-25 | 阿里巴巴集团控股有限公司 | abnormality monitoring method, device and server |
| CN109560956A (en) * | 2017-09-27 | 2019-04-02 | 中兴通讯股份有限公司 | A kind of service alarm method, apparatus and storage medium |
| CN110045063A (en) * | 2019-04-03 | 2019-07-23 | 天津市基理科技股份有限公司 | Harmful gas on-line measuring system |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110471910A (en) * | 2019-07-15 | 2019-11-19 | 联动优势科技有限公司 | A kind of quality of data alarm method, device and equipment |
| CN111583596B (en) * | 2020-05-09 | 2021-11-19 | 杭州润缘信息科技有限公司 | Alarm risk grade evaluation method based on sensor concentration value |
| CN113740776B (en) * | 2021-08-17 | 2024-04-12 | 广州番禺电缆集团有限公司 | Cable sheath grounding loop fault prediction method, device, equipment and storage medium |
Family Cites Families (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2001098916A1 (en) * | 2000-06-21 | 2001-12-27 | Concord Communications, Inc. | Liveexception system |
| CN100490397C (en) * | 2007-02-14 | 2009-05-20 | 华为技术有限公司 | Alarm processing method and alarming system |
| CN101662386B (en) * | 2009-09-27 | 2011-12-07 | 中兴通讯股份有限公司 | Method for processing alarm storm and device thereof |
| CN102118275A (en) * | 2009-12-30 | 2011-07-06 | 大唐移动通信设备有限公司 | Alarm storm processing method and processing device |
| CN102546216B (en) * | 2010-12-30 | 2015-03-11 | 中国移动通信集团山东有限公司 | Method for processing alarm messages in network management system and network management system |
| CN102223247A (en) * | 2011-05-17 | 2011-10-19 | 中兴通讯股份有限公司 | Rapid processing method for batch alarm and system thereof |
| CN102368714B (en) * | 2011-11-09 | 2014-07-30 | 华为技术有限公司 | Network alarm processing method, apparatus and system thereof |
| CN103544093B (en) * | 2012-07-13 | 2016-04-27 | 深圳市快播科技有限公司 | Monitoring alarm control method and system thereof |
| CN103475543A (en) * | 2013-09-11 | 2013-12-25 | 北京思特奇信息技术股份有限公司 | Abnormal system service call detection method and system |
-
2014
- 2014-10-13 CN CN201410540110.7A patent/CN104361713A/en active Pending
-
2015
- 2015-02-10 CN CN201510070652.7A patent/CN104599433B/en active Active
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109560956A (en) * | 2017-09-27 | 2019-04-02 | 中兴通讯股份有限公司 | A kind of service alarm method, apparatus and storage medium |
| CN109088775A (en) * | 2018-08-29 | 2018-12-25 | 阿里巴巴集团控股有限公司 | abnormality monitoring method, device and server |
| CN110045063A (en) * | 2019-04-03 | 2019-07-23 | 天津市基理科技股份有限公司 | Harmful gas on-line measuring system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104599433B (en) | 2017-06-20 |
| CN104599433A (en) | 2015-05-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104361713A (en) | Index data monitoring method, device and server | |
| US11698845B2 (en) | Evaluation rating of a system or portion thereof | |
| CN105095056B (en) | A kind of method of data warehouse data monitoring | |
| CN109491850A (en) | A kind of disk failure prediction technique and device | |
| US20120150925A1 (en) | Proactive Method for Improved Reliability for Sustained Persistence of Immutable Files in Storage Clouds | |
| US20150378873A1 (en) | Automatically recommending test suite from historical data based on randomized evolutionary techniques | |
| CN103026342B (en) | method and system for verifying memory device integrity | |
| US20140149568A1 (en) | Monitoring alerts in a computer landscape environment | |
| CN110674014A (en) | Method and device for determining abnormal query request | |
| CN113641526B (en) | Alarm root cause positioning method and device, electronic equipment and computer storage medium | |
| FI128788B (en) | Providing user guidance on erasure process selection based on accumulated erasure reports | |
| CN103049354A (en) | Data restoration method, data restoration device and storage system | |
| CN103678090A (en) | Method and device for monitoring data processing | |
| US9892162B2 (en) | Managing complex queries with predicates | |
| CN111459692A (en) | Method, apparatus and computer program product for predicting drive failure | |
| CN113485988A (en) | Data quality monitoring method and device and computer readable storage medium | |
| US20160261541A1 (en) | Prioritizing log messages | |
| US20190303245A1 (en) | System and method of assessing and managing storage device degradation | |
| CN102930690B (en) | Alarm processor and alarm processing method | |
| CN116821916A (en) | Method for realizing vulnerability processing, computer storage medium and terminal | |
| US10269076B1 (en) | Electronic device utilizing a risk reduction mechanism to manage property | |
| CN104216814A (en) | Log compression monitoring method and log compression monitoring device | |
| KR100622129B1 (en) | Dynamically changing web page defacement validation system and method | |
| CN118312109B (en) | Bad block management method, system, medium and product of industrial solid state disk | |
| CN103389919A (en) | Data processing method and device based on redundant equipment system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20150218 |