JP2012212341A - Polling monitoring system, polling monitoring server, polling monitoring method, and polling monitoring program - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a polling monitoring system or the like for executing polling to a monitoring object machine whose priority is high by an interval which is as close to setting as possible, and for executing polling to all the monitoring object machines including those whose priority is low without omission.SOLUTION: A polling monitoring server 10 includes: an in-group polling execution unit 102 configured to, when polling is executable within a group-based assigned time, execute polling to each monitoring object machine in the order of high priority, and to, when polling becomes not-executable within the group-based assigned time, add a surplus group-based assigned time to a pool time; and a pool time confirmation unit 103 configured to, after the end of the polling within the group-based assigned time, execute polling to the monitoring object machine whose execution frequency of polling in the past is the smallest when the polling is executable within the pool time.

Description

  The present invention relates to a polling monitoring system, a polling monitoring server, a polling monitoring method, and a monitoring program thereof, and more particularly to a polling monitoring system and the like that can execute polling without omission for all monitored machines.

  In order to confirm the operation of each computer connected to each other via a computer network, a dedicated monitoring server is connected, and one server is connected to each computer at regular intervals (whether there is a processing request. Inquiries about behavior). Such a server is referred to as a polling monitoring server in this specification. A network in which such a polling monitoring server is introduced is referred to as a polling monitoring system in this specification.

  FIG. 9 is an explanatory diagram showing the network configuration of the polling monitoring system 901 according to the existing technology. The polling monitoring system 901 includes a polling monitoring server 910 and monitored machines 920a to 920e that are connected to each other via a network 930. Since all of the monitoring target machines 920a to 920e have the same configuration, they are collectively referred to as a monitoring target machine 920 hereinafter. The number of monitored machines 920 is not particularly limited, but FIG. 9 shows five monitored machines 920a to 920e as an example. These five units have identifiers A to E, respectively.

  The polling monitoring server 910 confirms and records the operations of the monitoring target machines 920 by polling each of the monitoring target machines 920a to 920e. At that time, setting data given in advance for the polling interval (cycle) and the priority of each monitoring target machine 920 is provided, and polling is performed based on the designation in the setting data.

  Patent documents related to this include the following. Among them, in Patent Document 1, priority is set in advance for each monitored machine, and monitored machines with low priority are excluded from polling targets and set for monitored machines with high priority. A polling delay avoidance method is described in which polling is performed at a given cycle. Patent Document 2 describes an information collection device that changes the priority of polling according to the amount of received data.

  Patent Document 3 describes a polling method in which a periodic command transmission cycle is adjusted, and other data and commands are transmitted during idle time of the command. Patent Document 4 describes a digital camera that changes a target (pixel) that requires the least change in recording audio data attached to photo data.

  Patent Document 5 describes a network system that updates the priority of polling according to the number of past polling. Patent Document 6 describes a scheduling method that adjusts CPU allocation times for periodically executing processes so that they do not collide with each other.

Japanese Patent Laid-Open No. 10-294049 (Patent No. 3104221) JP 2001-333071 A JP 2006-340207 A JP 2009-081842 A Japanese Patent Application Laid-Open No. 08-037540 JP 09-319597 A

  In the polling monitoring system 901 of the existing technology shown in FIG. 9, the polling monitoring server 910 performs the polling operation based on the setting data given in advance for the polling interval (cycle) and the priority of each monitored machine 920. Do. However, this setting is not always performed appropriately.

  For example, there may be a case where a cycle shorter than the time required for polling all the monitoring target machines 920 is set. This is not necessarily just a setting mistake, and such a setting may be required for convenience of network management.

  FIG. 10 is an explanatory diagram showing a state in which polling is performed on only one monitoring target machine 920a (A) in the polling monitoring system 901 shown in FIG. FIG. 11 is an explanatory diagram illustrating a state in which polling is simultaneously performed on five monitored machines 920a to 920e. Incidentally, FIGS. 10 to 12 all show the identifiers (A to E) of the monitoring target machine 920 to be polled at that time in squares.

  10 to 11, an example in which the polling processing time when the polling monitoring server 910 polls one monitored machine 920 is 2, the polling interval is 6, and the total cycle is 8 will be described. ing. In order to perform polling for all of the five monitored machines 920a to 920e, polling processing time per unit 2 × 5 = 10 processing times are required. That is, an example in which a period of 8 shorter than the required time is set is shown in FIGS.

  If polling is performed on these monitored machines in this state, the period 8 elapses when polling on the monitored machines A, B, C, and D is completed as shown in FIG. Next, when polling is performed on the monitoring target machine E, a delay time 2 occurs when polling is started on the monitoring target machine A next time. If such a polling operation is repeated, the delay time increases.

  12 shows a state in which polling is simultaneously performed on five monitored machines 920a to 920e as in FIG. 11 when the technique described in Patent Document 1 is applied to the polling monitoring system 901 shown in FIG. It is explanatory drawing shown about no operation | movement. In the technology described in Patent Document 1, “priority” is set for each monitored machine, monitored machines with low priority are excluded from polling targets, and each monitored machine is ordered in descending order of priority. On the other hand, polling is performed at an interval (cycle) as set. However, in this technique, unless the setting is changed, polling is not executed for a monitoring target machine set to a low priority.

  In the example of the operation shown in FIG. 12, since the period 8 has elapsed when polling is performed to the monitored machines A, B, C, and D, polling for the monitored machine E having the lowest priority is omitted, Returning to the monitored machine A, the polling is continued from there again. In this operation, unless the setting is changed, the operation is continued without performing polling for the monitored machine E.

  Therefore, this technique cannot cope with the case where it is necessary to reliably perform polling for all monitored machines. For example, if a worm has entered the network, check the logs when polling is performed on all monitored machines to ensure normal operation of all monitored machines regardless of priority. It is necessary to confirm. However, unless the setting for priority is changed, there is a risk that a monitored machine that is not polled by this technique appears.

  Especially when the number of monitored machines to be polled increases, it becomes difficult to set the polling interval, and it is practically impossible to poll all monitored machines at the same polling interval. There is also. Even in such a case, polling the monitored machine with a high priority at an interval as close as possible to the setting so that nothing that is not polled for the monitored machine with a low priority does not appear. However, the technique described in Patent Document 1 cannot perform such polling.

  The remaining techniques described in Patent Documents 2 to 6 are not intended to solve this problem in the first place and are not available for that purpose. Patent Documents 2 and 5 describe a technique of “changing priority according to circumstances”, but this does not solve this problem without changing the setting of priority. That is, even if all the techniques described in Patent Documents 1 to 6 are combined, this problem cannot be solved.

  The object of the present invention is to perform polling for all monitored machines including those with low priority while performing polling for monitored machines with high priority at intervals as close to the setting as possible. A polling monitoring system, a polling monitoring server, a polling monitoring method, and a monitoring program thereof are provided.

  In order to achieve the above object, a polling monitoring system according to the present invention is a polling monitoring system in which a plurality of monitored machines and a polling monitoring server are connected to each other to check and record the operation of each monitored machine. The polling monitoring server stores in advance the group to which each monitored machine belongs, the monitored machine data indicating the priority of each group, and the allocation time for each group given for polling each monitored machine for each group. When storage means and polling can be executed within the allocation time for each group, polling is performed for each monitored machine in order of priority, and when polling becomes impossible within the allocation time for each group Is the pool time stored in the storage means for the remaining allocation time by group When the polling within the group to be added and the polling within the allocated time for each group are completed, and the polling can be performed within the pool time, polling is performed for the monitored machine with the smallest number of polling in the past. And a pool time confirmation unit.

  In order to achieve the above object, a polling monitoring server according to the present invention is a polling monitoring server that is mutually connected to a plurality of monitored machines, and that confirms and records the operation of each monitored machine. Storage means for preliminarily storing the group to which the group belongs, the monitoring target machine data indicating the priority of each group, and the allocation time for each group given for polling each monitoring target machine, and the polling is the allocation time for each group When it is possible to execute the polling, polling is performed for each monitored machine in the order of priority, and when the polling becomes impossible to execute within the allocation time for each group, the remaining allocation time for each group is stored. In-group polling execution unit to be added to the pool time stored in And a pool time confirmation unit that polls a monitored machine with the smallest number of polling executions in the past when polling can be executed within the pool time after the end of polling within the time. To do.

  In order to achieve the above object, a polling monitoring method according to the present invention is a polling monitoring system in which a plurality of monitored machines and a polling monitoring server are connected to each other, and the operation of each monitored machine is confirmed and recorded. The group to which each monitored machine belongs, the monitored machine data indicating the priority of each group, and the allocation time for each group assigned for polling each monitored machine for each group are stored in the storage means of the polling monitoring server in advance. If the polling execution unit of the polling monitoring server determines whether or not polling can be executed within the allocation time for each group, and polling can be executed within the allocation time for each group, Polling monitoring server group polls in descending order of priority When the polling execution unit performs polling and polling becomes impossible within the allocation time for each group, the remaining allocation time for each group is indicated as the pool time stored in the storage means by the in-group polling execution unit of the polling monitoring server. After the polling within the allocation time for each group is completed, the pool time confirmation unit of the polling monitoring server determines whether or not the polling can be performed within the pool time, and the polling can be performed within the pool time. The pool time confirmation unit of the polling monitoring server polls the monitored machine having the smallest number of polling executions in the past.

  In order to achieve the above object, a polling monitoring program according to the present invention is a polling monitoring system in which a plurality of monitored machines and a polling monitoring server are connected to each other, and the operation of each monitored machine is confirmed and recorded. The polling monitoring server includes a group to which each monitored machine belongs, monitored machine data indicating the priority of each group, and an allocation time for each group given for polling each monitored machine for each group. To determine whether or not polling can be performed within the allocation time for each group. If polling can be performed within the allocation time for each group, poll each monitored machine in descending order of priority. Procedure to be performed, polling is executed within the allocation time by group Procedure for adding surplus group allocation time to stored pool time when possible, Procedure for determining whether polling can be performed within pool time after polling within group allocation time is completed, When the polling can be performed within the pool time, a procedure for polling a monitored machine having the smallest number of polling executions in the past is executed.

  As described above, the present invention accumulates the time remaining after polling each monitored machine in descending order of priority as the pool time, and the monitored machine with the smallest number of polling executions in this pool time. Since the configuration is such that polling is performed, there is no occurrence of a monitored machine that has not been polled.

  As a result, polling can be performed for all monitored machines including those with low priority while performing polling for monitored machines with high priority at intervals as close as possible to the setting. It is possible to provide a polling monitoring system, a polling monitoring server, a polling monitoring method, and a monitoring program thereof having an excellent feature of being possible.

It is explanatory drawing which shows in more detail the structure of the polling monitoring server shown in FIG. It is explanatory drawing which shows the structure of the polling monitoring system which concerns on embodiment of this invention. It is a flowchart shown about operation | movement of the whole process execution part shown in FIG. FIG. 4 is a flowchart illustrating an operation of the intra-group polling execution unit shown in FIG. FIG. 4 is a flowchart showing the operation of the pool time confirmation unit shown in FIG. 1 shown as step S205 in FIG. It is explanatory drawing shown about an example of the memory content of each data memorize | stored in the external storage means shown in FIG. 1 in this execution example. It is explanatory drawing shown about the state when polling of the 1st period is performed with respect to the five monitoring object machines shown to FIG. 2 and FIG. 6 in this execution example. It is explanatory drawing shown about the state when polling to the 2nd period is performed with respect to the five monitoring object machines shown to FIG. 2 and FIG. 6 in this execution example. It is explanatory drawing shown about the network structure of the polling monitoring system which concerns on the existing technique. FIG. 10 is an explanatory diagram illustrating an operation in a state where polling is performed on only one monitored machine in the polling monitoring system illustrated in FIG. 9. FIG. 10 is an explanatory diagram illustrating an operation in a state where polling is simultaneously performed on five monitored machines in the polling monitoring system illustrated in FIG. 9. FIG. 10 is an explanatory diagram illustrating an operation in a state where polling is simultaneously performed on five monitored machines in the same manner as in FIG. 11 when the technique described in Patent Document 1 is applied to the polling monitoring system illustrated in FIG. 9. .

(Embodiment)
Hereinafter, the configuration of an embodiment of the present invention will be described with reference to FIGS.
First, the basic content of the present embodiment will be described, and then more specific content will be described.
The polling monitoring system 1 according to the present embodiment is a polling monitoring system in which a plurality of monitoring target machines 20 and a polling monitoring server 10 are connected to each other and check and record the operation of each monitoring target machine. The polling monitoring server 10 includes a group to which each monitored machine belongs, monitored machine data 123 indicating the priority for each group, and an allocation time for each group given for polling each monitored machine for each group (by group). Storage unit (external storage unit 13) for storing allocation time data 125) in advance, and when polling can be executed within the allocation time for each group, each monitored machine is polled in descending order of priority and for each group In-group polling execution unit 102 for adding the remaining group-specific allocation time to the pool time stored in the storage means when polling becomes impossible within the allocation time, and after polling within the group-specific allocation time In the past if polling can be performed within the pool time Kicking and a pool time confirmation unit 103 polls the fewest each monitored machine execution times of polling.

  The storage unit 13 stores the number of polling executions (polling execution number data 122) indicating the number of polling executions in the past for each monitored machine, and the in-group polling execution unit 102 and the pool time confirmation unit 103 perform polling. Immediately after execution, the polling execution count is added to the monitored machine.

  Furthermore, when there are a plurality of monitoring target machines with the smallest number of polling executions in the past, the pool time confirmation unit 103 is a monitoring target that is subject to polling in descending order of priority set in the monitoring target machine data. Determine the machine.

  Then, the intra-group polling execution unit 102 and the pool time confirmation unit 103 calculate the next polling execution time for the target monitored machine immediately after executing the polling, and store this in the storage means.

By having the above configuration, the polling monitoring system 1 performs polling on a monitoring target machine with a high priority at intervals as close as possible to all the monitoring target machines including those with a low priority. Polling can be executed without omission.
Hereinafter, this will be described in more detail.

  FIG. 2 is an explanatory diagram showing the configuration of the polling monitoring system 1 according to the embodiment of the present invention. The polling monitoring system 1 is configured by connecting a polling monitoring server 10 and monitoring target machines 20 a to 20 e to each other via a network 30. Since all the monitoring target machines 20a to 20e have a common configuration, they will be collectively referred to as monitoring target machines 20 hereinafter. The number of monitored machines 20 is not particularly limited, but FIG. 2 shows five monitored machines 20a to 20e as an example. These five units have identifiers A to E, respectively.

  FIG. 1 is an explanatory diagram showing the configuration of the polling monitoring server 10 shown in FIG. 2 in more detail. The polling monitoring server 10 is a computer device that confirms and records the operations of the monitored machines 20 by polling the monitored machines 20 via the network 30, and has a configuration as a general computer. It is.

  That is, the polling monitoring server 10 temporarily stores a main processing control unit (CPU: Central Processing Unit) 11 that is a main body that executes various processes described as a computer program and data being processed by the main processing control unit 11. Random access memory (RAM) 12 for storing, external storage means 13 (such as a hard disk) for storing a large amount of data, and communication means for communicating data with other computers connected to the network 30 14.

  The main arithmetic control unit 11 operates as a functional unit of the overall processing execution unit 101, the in-group polling execution unit 102, and the pool time confirmation unit 103 by the operation of the polling monitoring program. The operation contents of each of these functional units will be described later.

  The temporary storage means 12 stores schedule data 111, and the external storage means 13 includes polling interval data 121, polling execution count data 122, monitored machine data 123, next polling execution time data 124, and allocation by group. Each of time data 125 and pool time data 126 is stored. The contents stored in each of these data will also be described later.

  The polling interval data 121 stores a polling interval at which the polling monitoring server 10 polls each monitored machine 20 and a time required for one polling (polling processing time). Polling interval + polling processing time = polling cycle. That is, the polling interval for each monitored machine 20 is set in advance by the user (system administrator).

  In the polling execution count data 122, the number of times the polling monitoring server 10 performs polling on each monitoring target machine 20 is stored for each identifier of the monitoring target machine 20.

  In the monitoring target machine data 123, an identifier for determining the monitoring target machine 20 that is a target to be polled by the polling monitoring server 10 is divided into N groups according to priority, and each group has a high priority. They are stored side by side in order. The number of groups and which monitored machines 20 are included in each group are set in advance by the user according to the priority.

  The next polling execution time data 124 stores the time when the next polling is scheduled to be performed for each identifier of each monitored machine 20. In the first time, “0” is set as an initial value for all the monitoring target machines 20, and a value obtained by calculating the next polling execution time after polling the monitoring target machine is stored.

  The group-specific allocation time data 125 stores the time for performing polling allocated to each group. Although the time is set by the user, it is set so that the group including the monitoring target machine having a high priority is assigned so as to increase the opportunity to execute polling.

  In the pool time data 126, a time that is not used in the polling execution process among the group allocation time in the process of the intra-group polling execution unit 102 described later is added as the pool time. The pool time is used in the polling execution process when the polling process time is satisfied by the process in the pool time confirmation unit 103.

  The schedule data 111 temporarily stores the next polling execution time corresponding to the identifier of the monitoring target machine included in the group in the processing in the overall processing execution unit 101. The data stored in the schedule data 111 is the same as the next polling execution time data 124.

  FIG. 3 is a flowchart showing the operation of the overall process execution unit 101 shown in FIG. The overall process execution unit 101 performs an operation of repeating the process of operating the intra-group polling execution unit 102 and the pool time confirmation unit 103 described later for each group set in the monitoring target machine data 123.

  More specifically, the overall process execution unit 101 that has started the operation first sets an initial value “1” in the counter i (step S201), and in the set N groups, the monitoring target machine data 123 is set. The identifier of the monitored machine included in the i-th group Ni from the designated high priority is acquired from the monitored machine data 123, and the next polling execution time corresponding to the acquired monitored machine identifier is next polled. Obtained from the time data 124, the in-group polling execution unit 102 is operated for this group Ni (step S202).

  At this time, the overall process execution unit 101 stores the schedule data 111 together with the next polling execution time corresponding to the identifier in order from the monitoring target machine with the next next polling execution time being earlier.

  Subsequently, the overall process execution unit 101 increments the value of the counter i by 1 (step S203), and determines whether the counter value i exceeds the number of groups N (step S204). If the counter value i does not exceed the number of groups N (No in step S204), the processes in steps S202 to S204 are repeated. If the counter value i exceeds the number N of groups (Yes in Step S204), the pool time confirmation unit 103 is operated (Step S205), and the process is repeated from Step S201.

  FIG. 4 is a flowchart showing the operation shown as step S202 in FIG. 3 of the intra-group polling execution unit 102 shown in FIG. The in-group polling execution unit 102 first performs the polling processing time for the i-th group Ni designated by the overall processing execution unit 101 within the time for performing polling assigned to the group Ni. Check if this is the case.

  If the remaining time for executing polling is equal to or longer than the polling processing time, it is checked whether the current time has passed the next polling execution time of the monitored machine 20, and if it has passed, polling is executed. When this check for all the monitoring target machines 20 is completed or when the polling processing time exceeds the remaining time for performing the polling, the monitoring target machine 20 is not polled and the remaining time for the polling is stored as the pool time. To do.

  More specifically, the intra-group polling execution unit 102 that has started operation by designating the group Ni from the overall processing execution unit 101 in step S202 of FIG. 3 sets the i-th group Ni from the group-specific allocation time data 125. The assigned time by group is set as the polling execution remaining time T (step S301), and an initial value “1” is set to a counter j that counts the number of monitored machines 20 included in the group Ni (step S302).

  Next, the in-group polling execution unit 102 determines whether or not the remaining polling execution time T is equal to or longer than the polling processing time (step S303), and if the remaining polling execution time T is less than or equal to the polling processing time (step S303 is no). Proceed to step S310 to be described later. If the remaining polling execution time T is equal to or longer than the polling processing time (Yes in step S303), it is subsequently determined whether or not the current polling time of the j-th monitored machine 20 has passed the next polling execution time (step S304). . If not (NO in step S304), the process proceeds to step S308 described later.

  If the current time has passed the next polling execution time of the j-th monitored machine (Yes in step S304), the in-group polling execution unit 102 performs polling on the monitored machine 20 (step S305), and the step The time required for polling executed in S305 and the polling interval of the jth monitored machine acquired from the polling interval data 121 are added to the current time to calculate the next polling execution time of the monitored machine 20 (step S306). Then, the time required for polling the monitored machine 20 is subtracted from the remaining polling execution time T (step S307).

  The intra-group polling execution unit 102 increments the value of the counter j by 1 (step S308), and determines whether or not the value of the counter j exceeds the number of monitored machines Mi of the group Ni (step S309). If the value of the counter j does not exceed Mi (No in step S309), the process returns to step S303 and the process is repeated. If the value of the counter j exceeds Mi (Yes in step S309), the remaining polling execution remaining time T is added to the pool time data 126 stored in the pool time data 126 (step S310). finish.

  FIG. 5 is a flowchart showing the operation shown as step S205 in FIG. 3 by the pool time confirmation unit 103 shown in FIG. The pool time confirmation unit 103 is called from the overall processing execution unit 101 and operates. When the accumulated pool time is equal to or longer than the polling processing time, the current time of the monitored machines 20 whose next polling execution time has passed are: The monitoring target machine 20 having the smallest number of polling executions is selected and polled. After executing the polling, after subtracting the time required for the polling process from the pool time, the process returns to the beginning and the process is repeated until the polling process time exceeds the pool time.

  More specifically, the pool time confirmation unit 103 called from the overall process execution unit 101 in step S205 of FIG. 3 first determines whether or not the pool time stored in the pool time data 126 is equal to or longer than the time required for the polling process. That is, it is determined whether the polling process can be performed in this pool time (step S401). If the polling process cannot be performed in the stored pool time (No in step S401), the process ends there.

  If it is possible to perform the polling process with the stored pool time (Yes in step S401), the pool time confirmation unit 103 next selects the monitored machine 20 whose current time has passed the next polling execution time. Extracted from the polling execution time data 124 (step S402), the number of polling executions is confirmed from the polling execution number data 122 for each of the monitored machines 20 extracted there. Polling is executed for the smallest number (step S403). Here, when there are a plurality of monitoring target machines 20 having the same number of polling executions, the higher priority is selected in the group to which the monitoring target machine belongs and polling is executed.

  Then, the pool time confirmation unit 103 increases the polling execution count of the monitored machine 20 that has performed polling by one in the polling execution count data 122 (step S404). Then, the pool time confirmation unit 103 sets the next polling execution time of the monitored machine 20 that has been polled in step S403, the polling interval of the monitored machine acquired from the polling interval data 121, and the actual required polling of the monitored machine. The total time is calculated (step S405), and the actual required time for the polling process in step S403 is subtracted from the pool time (step S406). Thereafter, the process returns to step S401 to repeat the determination.

(Specific execution example of this embodiment)
An example in which the present embodiment described above is specifically executed will be described below.

  FIG. 6 is an explanatory diagram showing an example of the storage contents of each data stored in the external storage unit 13 shown in FIG. 1 in this execution example. In the polling interval data 121, as in FIGS. 10 to 12, the polling processing time when polling is performed on one monitored machine 20 is 2, the polling interval is 6, and the combined polling cycle is 8. Is stored in advance.

  In the data stored in the monitoring target machine data 123 in advance, the five monitoring target machines 20a to 20e can be respectively identified by the identifiers A to E, the monitoring target machines A and B are “group 1”, and C and D are “group”. 2 ”and E are divided into three groups“ Group 3 ”,“ Group 1 ”has the highest priority“ 3 ”,“ Group 2 ”has the priority“ 2 ”, and“ Group 3 ”has the lowest priority“ 1 ”. "Is set.

  In the data stored in advance in the group-specific allocation time data 125, polling execution times of 4, 3, and 1 are allocated to the groups 1 to 3, respectively. The polling interval data 121, the monitoring target machine data 123, and the group allocation time data 125 are fixed values indicating settings given in advance, and these values are held unless the settings are changed.

  In the polling execution count data 122, an initial value of “0” is defined for all of the monitoring target machines 20a to 20e (A to E). The initial values of the next polling execution time data 124 and the schedule data 111 are blank for all the monitoring target machines 20a to 20e (A to E). The initial value of the pool time data 126 is also “0”.

  Each time polling is performed, the number of executions of the polling execution count data 122 is incremented by 1 in the monitored machines 20a to 20e (AE) that are the targets, and the next polling execution time data 124 is polled next time. The execution time is calculated. The pool time data 126 is also a value that is increased or decreased according to the execution status, as will be described later.

  FIG. 7 is an explanatory diagram illustrating a state when polling of the first cycle is performed on the five monitoring target machines 20a to 20e (AE) illustrated in FIGS. 2 and 6 in the present execution example. . First, the overall process execution unit 101 operates the in-group polling execution unit 102 for the monitoring target machines A and B belonging to the group 1 (step S202 in FIG. 3).

  The intra-group polling execution unit 102 performs the polling on the monitoring target machines A and B as they are because the group allocation time of the group 1 is 4 and the polling time per monitoring target machine is 2. And the value of the polling execution count data 122 of the monitored machines A and B is increased by 1 to “1” (FIG. 4, steps S301 to S309).

  When polling is performed on the monitoring target machines A and B, the same 4 times as the allocation time by group elapses, so the value of the time added to the pool time stored in the pool time data 126 is 0 (FIG. 4. Step S310).

  Subsequently, the overall process execution unit 101 operates the in-group polling execution unit 102 for the monitoring target machines C and D belonging to the group 2 (step S202 in FIG. 3).

  Here, the intra-group polling execution unit 102 performs the polling on the monitoring target machine C because the group-specific allocation time of the group 2 is 3, and the time required for polling per monitoring target machine is 2. Then, when the value of the polling execution count data 122 is increased by 1 to “1”, the remaining allocation time for each group becomes “1” (FIG. 4, steps S301 to S309).

  Therefore, since polling cannot be executed for the monitored machine D, the remaining time = "1" is added to the pool time, and the pool time = "1" is stored as the pool time data 126 (FIG. 4, step S310). ).

  Subsequently, the overall process execution unit 101 operates the in-group polling execution unit 102 for the monitoring target machine E belonging to the group 3 (step S202 in FIG. 3). Here, the intra-group polling execution unit 102 does not execute the polling for the monitoring target machine E because the allocation time for each group of the group 3 is 1 and the time required for polling per monitoring target machine is 2. (FIG. 4, steps S301 to S309), the remaining time = "1" is added to the pool time, and the pool time = "2" is stored as the pool time data 126 (step S310).

  As a result, the pool time = 2, and the time for polling of one monitored machine is possible. At the same time, since the operation of the intra-group polling execution unit 102 has been completed for all groups, the operation by the pool time confirmation unit 103 is started (step S205 in FIG. 3). The pool time confirmation unit 103 confirms that polling is possible at the current pool time (= 2) (FIG. 5, step S401), and next polls the current time that has passed the next polling execution time. It is extracted from the execution time data 124 and it is confirmed that the monitoring target machines D and E are not yet polled (step S402 in FIG. 5).

  Then, the pool time confirmation unit 103 confirms that the number of polling executions registered in the polling execution number data 122 is “0” for each of the monitoring target machines D and E, but the priority is monitored machine data. In 123, since the monitored machine D belonging to the group 2 is higher, polling is executed for the monitored machine D (step S403 in FIG. 5). Since the pool time is now 0 (FIG. 5, step S406), the processing by the pool time confirmation unit 103 ends.

  Thus, the process for the first cycle is completed, and the process is similarly performed for the second cycle. Polling for the monitoring target machines A, B, and C is executed in the same manner as in the first cycle. However, when the pool time = “2” and the pool time confirmation unit 103 performs polling for one monitoring target machine, This time, only the monitoring target machine E has the polling execution count of “0”, that is, polling has not been executed, so the pool time confirmation unit 103 performs polling on the monitoring target machine E (step in FIG. 5). S402-403).

  FIG. 8 is an explanatory diagram showing a state when polling up to the second cycle is performed on the five monitored machines 20a to 20e (AE) shown in FIGS. 2 and 6 in this execution example. is there. As described above, in this execution example, polling is executed in the order of the monitoring target machine A → B → C → D → A → B → C → E. The operations in the first and second cycles are continued after the third cycle.

  That is, polling is executed for the monitored machines A and B belonging to the group 1 with high priority without delay from the set cycle = 8. In addition, polling is executed for the other monitored machines C to E without leaking.

(Overall operation of the embodiment)
Next, the overall operation of the above embodiment will be described. The polling monitoring method according to the present embodiment is a polling monitoring system 1 in which a plurality of monitoring target machines 20 and a polling monitoring server 10 are connected to each other, and check and record the operation of each monitoring target machine. Storing in the storage means of the polling monitoring server in advance the group to which the target machine belongs and the monitoring target machine data indicating the priority for each group and the group-by-group allocation time given for polling each monitoring target machine; The intra-group polling execution unit of the polling monitoring server determines whether or not polling can be performed within the group-specific allocation time (step S303 in FIG. 4). The polling monitoring server in descending order of priority for the target machine When the in-loop polling execution part performs polling (FIG. 4, steps S304 to S309), when polling becomes impossible to execute within the group allocation time, the remaining group allocation time is polled within the group of the polling monitoring server. Is added to the pool time stored in the storage means (step S310 in FIG. 4), and after polling within the allocation time for each group, whether or not polling can be executed within the pool time is determined by the pool time of the polling monitoring server When the confirmation unit determines (step S401 in FIG. 5) and the polling can be executed within the pool time, the polling monitoring server pool time confirmation unit polls the monitored machine having the smallest number of polling executions in the past. (FIG. 5, step S403).

Here, about each said operation step, this may be programmed so that execution is possible with a computer, and you may make it perform the polling monitoring server 10 which is a computer which performs each said step directly. The program may be recorded on a non-transitory recording medium, such as a DVD, a CD, or a flash memory. In this case, the program is read from the recording medium by a computer and executed.
By this operation, this embodiment has the following effects.

  According to the present embodiment, the monitoring target machines with high priority are polled in the order of the priorities, so that the polling can be executed at an interval as set or close thereto. On the other hand, the remaining time for polling execution of high-priority monitored machines is accumulated as pool time, and polling is performed for the monitored machine with the least number of polling times during this pool time. Polling is also performed on monitored machines with low values.

  At that time, polling is executed in order from the monitored machine with the smallest number of executions in the past, based on the polling execution count data, and by repeating this operation repeatedly, there will be a monitored machine that is not polled. Disappears.

  The present invention has been described with reference to the specific embodiments shown in the drawings. However, the present invention is not limited to the embodiments shown in the drawings, and any known hitherto provided that the effects of the present invention are achieved. Even if it is a structure, it is employable.

  Regarding the embodiment described above, the main points of the new technical contents are summarized as follows. In addition, although part or all of the said embodiment is summarized as follows as a novel technique, this invention is not necessarily limited to this.

(Appendix 1) A polling monitoring system in which a plurality of monitored machines and a polling monitoring server are connected to each other, and confirm and record the operation of each monitored machine,
The polling monitoring server is
Storage means for preliminarily storing a group to which each monitored machine belongs, monitored machine data indicating a priority for each group, and an allocation time for each group given for polling each monitored machine for each group; ,
When the polling can be performed within the allocation time for each group, the respective machines to be monitored are polled in the descending order of priority, and the polling cannot be performed within the allocation time for each group. In this case, an intra-group polling execution unit that adds the remaining allocation time by group to the pool time stored in the storage unit;
A pool time confirmation unit that polls the monitored machine with the smallest number of polling executions in the past when the polling can be performed within the pool time after the polling within the group allocation time is completed. And a polling monitoring system.

(Additional remark 2) While the said memory | storage means has memorize | stored the polling execution frequency which shows the execution frequency of the said polling in the past of each said monitoring object machine,
The supplementary note 1 is characterized in that the in-group polling execution unit and the pool time confirmation unit have a function of adding the number of polling executions to the monitored machine immediately after the polling is executed. The polling monitoring system described.

(Supplementary Note 3) When there are a plurality of the monitoring target machines with the smallest number of executions of the polling in the past, the pool time confirmation unit, in the descending order of the priority set in the monitoring target machine data The polling monitoring system according to appendix 1, characterized by having a function of determining the monitoring target machine to be polled.

(Supplementary Note 4) Immediately after executing the polling, the in-group polling execution unit and the pool time confirmation unit calculate the next polling execution time for the target monitored machine and store it in the storage unit. The polling monitoring system according to appendix 1, characterized by having a function of:

(Supplementary Note 5) A polling monitoring server that is mutually connected to a plurality of monitored machines and that checks and records the operation of each monitored machine,
Storage means for preliminarily storing a group to which each monitored machine belongs, monitored machine data indicating a priority for each group, and an allocation time for each group given for polling each monitored machine for each group; ,
When the polling can be performed within the allocation time for each group, the respective machines to be monitored are polled in the descending order of priority, and the polling cannot be performed within the allocation time for each group. In this case, an intra-group polling execution unit that adds the remaining allocation time by group to the pool time stored in the storage unit;
Pool time confirmation unit that polls the monitored machine with the smallest number of polling executions in the past when the polling can be performed within the pool time after the polling within the group allocation time is completed. And a polling monitoring server.

(Supplementary Note 6) In a polling monitoring system in which a plurality of monitored machines and a polling monitoring server are connected to each other, and the operation of each monitored machine is confirmed and recorded,
The group to which each monitored machine belongs and the monitored machine data indicating the priority of each group and the allocation time for each group given for polling each monitored machine for each group are set in advance in the polling monitoring server. Memorize it in the memory means,
The in-group polling execution unit of the polling monitoring server determines whether or not the polling can be executed within the allocation time for each group,
When the polling can be executed within the allocation time by group, the in-group polling execution unit of the polling monitoring server performs polling in order of the priority for each monitored machine,
When the polling becomes impossible to execute within the allocation time for each group, the remaining allocation time for each group is added to the pool time stored in the storage means by the in-group polling execution unit of the polling monitoring server,
After completion of polling within the group allocation time, the pool time confirmation unit of the polling monitoring server determines whether or not the polling can be executed within the pool time,
When the polling can be performed within the pool time, the pool time confirmation unit of the polling monitoring server polls the monitored machine with the smallest number of polling executions in the past. Polling monitoring method.

(Supplementary note 7) In a polling monitoring system in which a plurality of monitored machines and a polling monitoring server are connected to each other, and the operation of each monitored machine is confirmed and recorded,
The polling monitoring server has a group to which each monitored machine belongs, monitored machine data indicating the priority of each group, and an allocation time for each group given for polling each monitored machine for each group On a computer that stores
A procedure for determining whether or not the polling can be performed within the allocation time for each group;
When the polling can be executed within the group allocation time, a procedure for polling the monitored machines in order of the priority,
A step of adding the remaining group allocation time to the stored pool time when the polling becomes impossible within the group allocation time;
A procedure for determining whether or not the polling can be executed within the pool time after the polling within the group-specific allocation time is completed;
When the polling can be performed within the pool time, a polling monitoring program that causes the monitoring target machine having the smallest number of polling executions in the past to be executed is executed.

  The present invention can be applied to a computer network.

DESCRIPTION OF SYMBOLS 1 Polling monitoring system 10 Polling monitoring server 11 Main operation control means 12 Temporary storage means 13 External storage means 14 Communication means 20, 20a-e, AE Monitoring target machine 30 Network 101 Overall processing execution part 102 In-group polling execution part 103 Pool time confirmation unit 111 Schedule data 121 Polling interval data 122 Polling execution count data 123 Monitored machine data 124 Next polling execution time data 125 Group allocation time data 126 Pool time data

Claims (7)

A polling monitoring system in which a plurality of monitored machines and a polling monitoring server are connected to each other, and the operation of each monitored machine is confirmed and recorded.
The polling monitoring server is
Storage means for preliminarily storing a group to which each monitored machine belongs, monitored machine data indicating a priority for each group, and an allocation time for each group given for polling each monitored machine for each group; ,
When the polling can be performed within the allocation time for each group, the respective machines to be monitored are polled in the descending order of priority, and the polling cannot be performed within the allocation time for each group. In this case, an intra-group polling execution unit that adds the remaining allocation time by group to the pool time stored in the storage unit;
A pool time confirmation unit that polls the monitored machine with the smallest number of polling executions in the past when the polling can be performed within the pool time after the polling within the group allocation time is completed. And a polling monitoring system. The storage means stores a polling execution count indicating the polling execution count in the past of each monitored machine,
The in-group polling execution unit and the pool time confirmation unit have a function of adding the number of polling executions to the monitoring target machine immediately after the polling is executed. Polling monitoring system described in 1.   When there are a plurality of monitored machines with the smallest number of polling executions in the past, the pool time confirmation unit performs the polling execution targets in descending order of priority set in the monitored machine data The polling monitoring system according to claim 1, further comprising: a function for determining the monitoring target machine.   The in-group polling execution unit and the pool time confirmation unit have a function of calculating the next polling execution time for the target monitored machine immediately after executing the polling and storing this in the storage means The polling monitoring system according to claim 1, wherein: A polling monitoring server that is mutually connected to a plurality of monitored machines and that checks and records the operation of each monitored machine,
Storage means for preliminarily storing a group to which each monitored machine belongs, monitored machine data indicating a priority for each group, and an allocation time for each group given for polling each monitored machine for each group; ,
When the polling can be performed within the allocation time for each group, the respective machines to be monitored are polled in the descending order of priority, and the polling cannot be performed within the allocation time for each group. In this case, an intra-group polling execution unit that adds the remaining allocation time by group to the pool time stored in the storage unit;
Pool time confirmation unit that polls the monitored machine with the smallest number of polling executions in the past when the polling can be performed within the pool time after the polling within the group allocation time is completed. And a polling monitoring server. In a polling monitoring system in which a plurality of monitored machines and a polling monitoring server are connected to each other, and the operation of each monitored machine is confirmed and recorded,
The group to which each monitored machine belongs and the monitored machine data indicating the priority of each group and the allocation time for each group given for polling each monitored machine for each group are set in advance in the polling monitoring server. Memorize it in the memory means,
The in-group polling execution unit of the polling monitoring server determines whether or not the polling can be executed within the allocation time for each group,
When the polling can be executed within the allocation time by group, the in-group polling execution unit of the polling monitoring server performs polling in order of the priority for each monitored machine,
When the polling becomes impossible to execute within the allocation time for each group, the remaining allocation time for each group is added to the pool time stored in the storage means by the in-group polling execution unit of the polling monitoring server,
After completion of polling within the group allocation time, the pool time confirmation unit of the polling monitoring server determines whether or not the polling can be executed within the pool time,
When the polling can be performed within the pool time, the pool time confirmation unit of the polling monitoring server polls the monitored machine with the smallest number of polling executions in the past. Polling monitoring method. In a polling monitoring system in which a plurality of monitored machines and a polling monitoring server are connected to each other, and the operation of each monitored machine is confirmed and recorded,
The polling monitoring server has a group to which each monitored machine belongs, monitored machine data indicating the priority of each group, and an allocation time for each group given for polling each monitored machine for each group On a computer that stores
A procedure for determining whether or not the polling can be performed within the allocation time for each group;
When the polling can be executed within the group allocation time, a procedure for polling the monitored machines in order of the priority,
A step of adding the remaining group allocation time to the stored pool time when the polling becomes impossible within the group allocation time;
A procedure for determining whether or not the polling can be executed within the pool time after the polling within the group-specific allocation time is completed;
When the polling can be performed within the pool time, a polling monitoring program that causes the monitoring target machine having the smallest number of polling executions in the past to be executed is executed.

Images