JP2005250521A - Data processing system, data processor, and data processing method - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a system where distributed pieces of equipment are configured of multi-hierarchies for reducing monitor traffic, and for reducing information stored by an intermediate node, and for improving reliability, and for efficiently collecting information. <P>SOLUTION: Each node stores the last update time(LUT: Last Update Time) of a node belonging to a hierarchy immediately under the node, and performs the polling of the LUT to the node immediately under the node in predetermined timing, and when the LUT is changed, collects only the changed information (difference information) from the previous LUT from the node, and when an inquiry for the LUT is made from the upper rank node, notifies it of the LUT of its own node, and when an inquiry for the difference information is made from the node in the upper rank, transmits the difference information to the upper rank node. <P>COPYRIGHT: (C)2005,JPO&NCIPI

Description

  The present invention relates to an information collection technique for collecting information on each device in a system in which distributed devices are configured in multiple layers.

  The conventional distributed device information collection method collects device information by a polling method or a trap method. However, the polling method has a problem that traffic and server load increase as the number of devices increases, and that information delay increases and information leakage occurs when the polling interval is increased. In addition, the trap method can reduce the steady load, but the reliability is low, such as the possibility of the trap disappearing or the stop of the device itself being detected, and the trap is generated asynchronously, so There is a problem that the server load increases when multiple traps occur.

Also, a management method using a hierarchical structure has been proposed in order to cope with an increase in the number of management targets (for example, Patent Documents 1 and 2). However, in Patent Document 1, it is necessary for each node to hold a table of the state of all nodes, and as the number of nodes increases, there is a problem that the amount of information held by each node becomes enormous and is managed. The status is only status information such as whether or not it is operating, and it cannot cope with a case where each device has a plurality of information. Patent Document 2 proposes a method combined with a polling method in order to solve the low reliability of the trap method, but cannot cope with the problem that the server load increases when a plurality of traps are generated at once. In addition, as in Patent Document 1, the state to be managed is only state information such as whether or not it is operating, and cannot be used when each device has a plurality of pieces of information.
Japanese Patent No. 3149924 Japanese Patent Laid-Open No. 4-178039

  The present invention has been made to solve the above-mentioned problems. The configuration of a large number of devices is hierarchized, and based on a reliable polling method, the number of devices and each device can receive a plurality of information. Even if it has, the purpose is to reduce monitoring traffic, reduce information held by intermediate nodes, improve reliability, and collect information efficiently.

A data processing system according to the present invention includes a plurality of data processing devices, and the plurality of data processing devices form a logical hierarchical structure,
Each of the plurality of data processing devices
For each specific data processing device lower than each data processing device, the specific data processing device stores the update time when the information was updated,
When the latest update time is inquired to the specific data processing device at a predetermined timing, and the latest update time notified from the specific data processing device is later than the stored update time In addition, the information updated at the latest update time is received from the specific data processing apparatus.

  In the present invention, the latest update time is inquired to the specific data processing device at the lower level, and the latest update time notified from the specific data processing device is later than the stored update time. Since the information updated at the latest update time is received from the specific data processing device, the communication amount between the data processing devices can be reduced. Further, since each data processing device manages only the information updated at the update time and the latest update time in the lower specific data processing device, the amount of information managed by each data processing device can be reduced.

Embodiment 1 FIG.
FIG. 1 is a block diagram showing the entire system of the present invention.

  In FIG. 1, a monitoring server (0101) is a server that monitors the status of each device (0102) and intermediate node (0103). Management is performed in multiple layers, and each intermediate node (0103aa to 0103mn) is a plurality of lower nodes (lower intermediate nodes and devices) to be monitored, and one upper node that monitors the status of the own node and its lower nodes, etc. have. Each device (0102a to 0102n) holds various information (0105a to n) such as a state, an operation mode, a performance value, and a load value. Each intermediate node (0103aa to mn) receives information (difference information) indicating changes in the status, operation mode, performance value, load, etc. of the lower node and its own node, and the received difference information is stored in the difference information DB (0106aa to mn). ). The monitoring server (0101) holds the collected various information in the device information DB (0104). The monitoring server (0101), the intermediate node (0103), and the device (0102) are examples of data processing devices.

  Next, the configuration of the monitoring server (0101) will be described with reference to FIGS.

  In FIG. 2, a communication processing unit (0201) is a mechanism for controlling communication with each lower node, and collects the state of each lower node as difference information in accordance with an instruction from the state acquisition processing unit (0202). The state acquisition processing unit (0202) is a mechanism for efficiently collecting difference information of each lower node. The LUT management unit (0203) is a mechanism for managing the last update time (hereinafter referred to as LUT: Last Update Time) of the own node and its lower nodes, and the LUT of the own node and the device identifier of each lower node as shown in FIG. And LUT are managed. Here, the device identifier is an identifier for uniquely determining each device and each node. The difference information processing unit (0204) is a mechanism that receives the difference information acquired by the state acquisition processing unit (0202) and registers it in the device information DB (0104) through the device information DB management unit (0205). In the device information DB (0104), as shown in FIG. 4, the device identifier, information identifier, and information value are managed as the latest device information, and the time stamp, device identifier, information identifier, new information value, and old information value are managed as history information. To do. The status acquisition processing unit (0202) corresponds to an update time inquiry unit and an update information reception unit, and the LUT management unit (0203) corresponds to an update time storage unit.

  Although not shown, the monitoring server (0101) can be realized by a computer having a CPU such as a microprocessor, a recording unit such as a semiconductor memory or a magnetic disk, and a communication unit. The recording means stores a program that realizes the function of each component included in the monitoring server (0101). The CPU reads the program to control the operation of the monitoring server (0101). The function of the element can be realized.

  Next, the configuration of the intermediate node (0103) will be described with reference to FIGS.

  In FIG. 5, a communication processing unit (0501) is a mechanism for controlling communication with the upper node and each lower node. The communication processing unit (0501) transfers an inquiry from the upper node to the status reply processing unit (0502), and the status acquisition processing unit (0503). This is a mechanism for sending an inquiry from a subordinate node to a lower node. In response to the inquiry from the communication processing unit (0501), the status reply processing unit (0502) refers to the information in the difference information DB (0106) through the LUT management unit (0504) and the difference information management unit (0505), and This is a mechanism for returning the result to the upper node through the communication processing unit (0501). The state acquisition processing unit (0503) is a mechanism for efficiently collecting difference information of each lower node. The LUT management unit (0504) is a mechanism for managing the LUT of the own node and its lower nodes, and manages the LUT of the own node, the device identifiers and LUTs of the lower nodes as shown in FIG. The difference information management unit (0505) is a mechanism for managing the difference information DB, and returns the information of the difference information DB (0106) in response to an inquiry from the state reply processing unit (0502), and from the state acquisition processing unit (0503). The difference information DB (0106) is updated in response to the request. As shown in FIG. 6, the difference information DB (0106) manages a time stamp, a device identifier, an information identifier, a new information value, and an old information value as difference information. Here, the status reply processing unit (0502) corresponds to the update information transmission unit, the status acquisition processing unit (0503) corresponds to the update time inquiry unit and the update information reception unit, and the LUT management unit (0504) stores the update time. The difference information management unit (0505) corresponds to an update management unit, and the difference information DB corresponds to an information storage unit.

  Although not shown, the intermediate node (0103) can be realized by a computer having a CPU such as a microprocessor, a recording unit such as a semiconductor memory or a magnetic disk, and a communication unit. The recording means stores a program that realizes the function of each component included in the intermediate node (0103), and the CPU reads the program to control the operation of the intermediate node (0103). The function of the element can be realized.

  Next, the configuration of each device (0102) will be described with reference to FIGS.

  In FIG. 7, a communication processing unit (0701) is a mechanism for controlling communication with an upper node, and sends an inquiry from the upper node to a status reply processing unit (0702). In response to the inquiry from the communication processing unit (0701), the status reply processing unit (0702) refers to the information of various information (0105) through the information management unit (0703), and sends the inquiry result to the host through the communication processing unit (0501). It is a mechanism that returns to the node. The information management unit (0703) is a mechanism for managing various types of information (0105). In response to an inquiry from the status reply processing unit (0702), the value of the various types of information (0105) is returned, and various sensors, meters, etc. (0704) Various information (0105) is updated according to the values collected from the device, the state of the device, the operation mode, and the like. In various information (0105), information identifiers and information values are managed as shown in FIG. Here, the information identifier is for uniquely determining each information, and is an MIB OID in SNMP or the like.

  Although not shown, the device (0102) can be realized by a computer having a CPU such as a microprocessor, a recording unit such as a semiconductor memory or a magnetic disk, and a communication unit. In the recording means, a program for realizing the function of each component included in the device (0102) is recorded, and the CPU reads the program to control the operation of the device (0102). Function can be realized.

  Next, the operation will be described with reference to FIGS.

  FIG. 9 is a flowchart for making an inquiry to a lower node of an upper node.

  In step 0901, the processing of steps 0902 to 0913 is performed for all the lower nodes, and when the processing of all the lower nodes is completed, the process jumps to step 0914.

  First, it is checked in step 0902 whether the inferior node to be inquired corresponds to the LUT. If it corresponds, the process proceeds to step 0903, and if not, the process jumps to step 0905. Here, if the lower node is the intermediate node (0103), the intermediate node (0103) manages the LUT, so that it moves to step 0903 assuming that it corresponds to the LUT, and the lower node is the device (0102). For example, since the device (0102) does not manage the LUT, it is determined that the device (0102) does not support the LUT, and the process proceeds to step 0905.

  If the lower node corresponds to the LUT, in step 0903, the lower node is inquired about the LUT. In step 0904, it is checked whether or not the acquired LUT is different from the held LUT (whether the acquired LUT is later than the held LUT). If they are different, the process proceeds to step 0905, and if they are the same, the process proceeds to step 0901. Return to the next lower node process. These steps 0902 to 0904 are performed by the state acquisition processing unit (0202) or the state acquisition processing unit (0503).

  In step 0905, it is checked whether or not the inferred lower level node corresponds to the difference information. If it corresponds, the process proceeds to step 0906, and if not, the process jumps to step 0909. Here, if the lower node is the intermediate node (0103), the intermediate node (0103) manages the difference information. Therefore, the process moves to step 0906 because it corresponds to the difference information, and the lower node is the device (0102). If so, since the device (0102) does not manage the difference information, the device (0102) moves to Step 0909 because it does not support the difference information. In step 0906, the subordinate node is inquired about difference information. These steps 0905 and 0906 are performed by the state acquisition processing unit (0202) or the state acquisition processing unit (0503).

  In step 0907, the difference information DB is updated with the acquired difference information. At this time, in the case of the highest node (monitoring server), it is registered in the device history information and the latest device information is updated. Next, in Step 0908, the LUT of the inferior node that made the inquiry and the LUT of the own node are updated, and the process returns to Step 0901 to proceed to the processing of the next lower node. These steps 0907 and 0908 are performed by the device information DB management unit (0205) or the difference information management unit (0505).

  Steps 0909 and thereafter show processing when an inquiry is made to the device (0102) whose lowest intermediate node is a lower node.

  In step 0909, the processing of steps 0910 to 0913 is performed for all information identifiers held by the inquired lower node (device (0102)). When all the information identifiers are completed, the processing returns to step 0901 and proceeds to the processing of the next lower node. In step 0910, information is inquired to the lower node. Step 0910 is performed by the state acquisition processing unit (0503).

  In step 0911, it is checked whether or not the acquired information is different from the held information. If they are different, the process proceeds to step 0912. If they are the same, the process returns to step 0909 to proceed to the next information identifier process. In step 0912, the difference information DB is updated with the acquired information and the stored information. That is, the lowest intermediate node holds a table of current values for all information items (state, operation mode, performance value, load value, etc.) of the lower-level device (0102). The value is compared with information transmitted from the device to update the value of the table, and difference information is created when there is a change in the state of the device or the like. In step 0913, the LUT of the inferior node that made the inquiry and the LUT of the own node are updated, and the process returns to step 0909 to move to the next information identifier process. These steps 0911 to 0913 are performed by the device information DB management unit (0205) or the difference information management unit (0505).

  Thereafter, the process waits until the next polling time in step 0914 and returns to step 0901.

  FIG. 10 is a flowchart for replying to an inquiry from an upper node of a lower node.

  In step 1001, an inquiry from a higher-level node is waited.

  In step 1002, the type of inquiry is determined. If it is an LUT inquiry, the process proceeds to step 1003. If it is a difference information inquiry, the process proceeds to step 1004. If it is an information inquiry, the process proceeds to step 1007. Normally, in the case of the intermediate node (0103), the inquiry from the upper node is an LUT inquiry and a difference information inquiry, and in the case of the device (0102), the inquiry from the upper node is an information inquiry.

  In step 1003, the LUT of its own node is referred to, the LUT is returned to the upper node, and the process returns to step 1001. This step 1003 is performed by the status reply processing unit (0502).

  In step 1004, difference information after the inquiry LUT is acquired from the difference information DB, and reply data is created. Thereafter, in step 1005, the created data is returned to the upper node. These steps 1004 to 1005 are performed by the status reply processing unit (0502). In step 1006, the transmitted difference information is deleted, and the process returns to step 1001. This step 1006 is performed by the difference information management unit (0505).

  In step 1007, the value of the inquired information is acquired and reply data is created. In step 1008, the created data is returned to the upper node, and the process returns to step 1001. These steps 1007 and 1008 are performed by the status reply processing unit (0702) and the information management unit (703).

  Further, in this flowchart, it is described that each process is executed sequentially, but a part that can be processed in parallel, such as an inquiry to each lower node, may be executed in parallel.

  9 and 10 are performed independently at each node, and it is not always necessary to synchronize between the nodes.

  Next, the flow of information in each node will be described with reference to FIG. In FIG. 20, for convenience of explanation, the system has a one-to-one relationship between nodes.

  As a result of the operation shown in FIG. 9 being performed in each node, in the monitoring server (0100) to the device (0102a), the LUT inquiry for the lower node, the difference information inquiry or the information inquiry for the lower node are independently performed. Is done. Further, as a result of the operation shown in FIG. 10 being performed in each node, in the device (0102a) to the monitoring server (0101), the LUT is independently transmitted to the upper node, the information is transmitted to the upper node, or The difference information is transmitted. The transmission of information or the transmission of difference information specifically includes the latest state (state, operation mode, performance value, load value, etc.) of the device (0102a) from the device (0102a) to the intermediate node (0103ma), etc. , State means state, operation mode, performance value, load value, etc.). From the intermediate node (0103ma), difference information indicating a change in the state of the device (0102a) and a change in the state of the intermediate node (0103ma) with respect to the intermediate node (0103la) (not shown) in the next higher hierarchy is displayed. Thereafter, the difference information obtained by adding the change in the state of each intermediate node is similarly transmitted to the upper node in each intermediate node. As a result, the intermediate node (0103ba) receives, from the intermediate node (0103ca), the difference information indicating the state of the lower-level device (0102a) and changes in the states of the intermediate node (0103ca) to the intermediate node (0103ma). To do. The intermediate node (0103ba) adds the change of the state of the intermediate node (0103ba) itself, and adds difference information indicating the change of the state of the device (0102a) and the state of each of the intermediate node (0103ba) to the intermediate node (0103ma). Transmit to the intermediate node (0103aa). Similarly, in the intermediate node (0103aa), the change in the state of the intermediate node (0103aa) itself is added, and the difference information indicating the state of the device (0102a) and the change in the state of each of the intermediate node (0103aa) to the intermediate node (0103ma) Is transmitted to the monitoring server (0101), and the monitoring server (0101) holds the collected various information in the device information DB.

  As described above, the data processing system shown in the present embodiment is a data processing system having a plurality of nodes (data processing devices), and the plurality of nodes (data processing devices) forming a logical hierarchical structure. In each of the plurality of nodes (data processing devices), the specific node (data processing device) updates the information for the specific node (data processing device) lower than the respective node (data processing device). The update time is stored, the latest update time is inquired to a specific node (data processing device) at a predetermined timing, and the latest update time notified from the specific node (data processing device) is stored. When the time is later than the update time, the information updated at the latest update time is received from a specific node (data processing apparatus).

  In addition, each of the plurality of nodes (data processing devices) stores the update time of the node (data processing device) located in the hierarchy immediately below each node (data processing device), and immediately below at a predetermined timing. Query the node (data processing device) for the latest update time, and if the latest update time notified from the immediate node (data processing device) is later than the stored update time, The information updated at the latest update time is received from the (data processing apparatus).

  Each of the plurality of nodes (data processing devices) has the latest update time when the latest update time notified from the immediately lower node (data processing device) is later than the stored update time. It is characterized in that information relating to a node (data processing device) subordinate to a node (data processing device) and a node (data processing device) subordinate to the node directly below (data processing device) is received from the node immediately below (data processing device).

  Further, each of the plurality of nodes (data processing devices) is information relating to a direct node (data processing device) and a node (data processing device) lower than the direct node (data processing device), and at the latest update time. Only information that has changed since the last update time is received from the immediately lower node (data processing apparatus).

  Each of the plurality of nodes (data processing devices) updates information on each node (data processing device) and a node (data processing device) lower than each node (data processing device) at a predetermined timing. Then, each node (data processing device) from a specific node (data processing device) higher than each node (data processing device) and a node (data processing device) lower than each node (data processing device) When the transmission of the updated information related to the node is requested, each node (data processing device) and a lower node (data processing device) than each node (data processing device) are sent to a specific upper node (data processing device). The updated information regarding the apparatus is transmitted.

  Each of the plurality of nodes (data processing devices) is updated each time information on each node (data processing device) and a node (data processing device) lower than each node (data processing device) is updated. And when the notification of the latest update time is requested from the upper specific node (data processing apparatus), the stored latest update time is notified to the upper specific node (data processing apparatus). After the latest update time is notified, each node (data processing device) from the upper specific node (data processing device) and after the update of the node (data processing device) lower than each node (data processing device) When transmission of information is requested, each node (data processing device) and each node are sent to a specific upper node (data processing device). Than de (data processing device) and transmits the updated information about the lower node (data processing device).

  Each of the plurality of nodes (data processing devices) is information on each node (data processing device) and a node (data processing device) lower than each node (data processing device), and the latest update Only information that has changed from the last update time in time is transmitted to a specific upper node (data processing apparatus).

  In addition, the data processing system shown in the present embodiment notifies the update contents in the lower node (data processing apparatus) from the lower node (data processing apparatus) to the upper node (data processing apparatus), and the upper node In the (data processing device), the update content notified from the lower node (data processing device) is added to the update content in the upper node (data processing device), and the upper node (data processing device) and the lower node The update content in the (data processing apparatus) is notified to a higher-order node (data processing apparatus).

  As described above, the upper node polls the LUTs of the respective lower nodes and acquires information only about the changed ones, so that the network traffic can be reduced. Also, since each intermediate node manages only the LUT and difference information, the amount of information managed by each intermediate node can be reduced.

Embodiment 2. FIG.
In the first embodiment described above, each intermediate node is monitored by one upper node. Next, an embodiment in which monitoring by a plurality of upper nodes is possible in order to improve reliability will be described. .

  The configuration of the system according to the second embodiment will be described with reference to FIG. Each component in FIG. 11 is the same as each component in FIG. 1, but each intermediate node is expanded so that it can support monitoring by a plurality of upper nodes. The difference between the components and operation from the first embodiment will be described below.

  The LUT management unit (0504) of each intermediate node in FIG. 5 newly manages the device identifier and the upper node LUT as shown in FIG. 12 in addition to the information shown in FIG. Also, regarding the operation, in the flowchart of inquiry from the upper node to the lower node in FIG. 9, when the difference information DB of step 0907 and step 0912 is updated, if there is the same difference information, the information is changed to be deleted. . Further, in the flowchart for the inquiry from the upper node of the lower node in FIG. 10, in the difference information deletion in step 1006, the transmitted difference information is not deleted, but the difference information before the oldest time in the upper node LUT is deleted. Change to

  Hereinafter, an operation example according to the second embodiment will be described with reference to FIG. Note that FIG. 21 has a configuration different from that of FIG. 11 for convenience of explanation.

  First, the intermediate node (0103ca) transmits the difference information (0103ca˜) of the nodes below the own node to the intermediate node (0103ba) and the intermediate node (0103bb) which are upper nodes. Similarly, the intermediate node (0103cb) also transmits the difference information (0103cb ~) of the nodes below the own node to the intermediate node (0103ba) and the intermediate node (0103bb) which are higher nodes.

  The intermediate node (0103ba) compares the received difference information (0103ca ~) with the difference information (0103cb ~), and since there is no overlap between them, the difference information (0103ca ~) and the difference information (0103cb ~) The change is added and transmitted as difference information (0103ba, 0103ca˜, 0103cb˜) to the intermediate node (0103aa) and the intermediate node (0103ab) which are upper nodes. Similarly, the intermediate node (0103bb) also compares the received difference information (0103ca ~) with the difference information (0103cb ~). Since there is no overlap between the two, the difference information (0103ca ~) and the difference information (0103cb ~) The change of the own node is added, and the difference information (0103bb, 0103ca ~, 0103cb ~) is transmitted to the intermediate node (0103aa) and the intermediate node (0103ab) which are upper nodes.

  The intermediate node (0103aa) compares the received difference information (0103ba, 0103ca ~, 0103cb ~) with the difference information (0103bb, 0103ca ~, 0103cb ~), and there is overlap in the part of the difference information 0103ca ~, 0103cb ~. Therefore, either one of the overlapping portions is deleted and the change of the own node is added and the difference information (0103aa, 0103ba, 0103bb, 0103ca˜, 0103cb˜) is transmitted to the monitoring server (0101) which is the upper node. Similarly, the intermediate node (0103ab) also compares the received difference information (0103ba, 0103ca˜, 0103cb˜) with the difference information (0103bb, 0103ca˜, 0103cb˜), and the portion of 0103ca˜, 0103cb˜ of the difference information Since there is an overlap, either one of the overlapping portions is deleted and a change of the own node is added to the monitoring server (0101) which is the upper node as difference information (0103ab, 0103ba, 0103bb, 0103ca˜, 0103cb˜). Send.

  The monitoring server (0101) compares the received difference information (0103aa, 0103ba, 0103bb, 0103ca˜, 0103cb˜) with the difference information (0103ab, 0103ba, 0103bb, 0103ca˜, 0103cb˜), and 0103ba, Since there is an overlap in the parts 0103bb, 0103ca ~, 0103cb ~, one of the overlapping parts is deleted, and the difference information (0103aa, 0103ab, 0103ba, 0103bb, 0103ca ~, 0103cb ~) is stored in the equipment information DB as the equipment information. Store.

As described above, in the present embodiment, each of the plurality of nodes (data processing devices) has a plurality of direct nodes (data processing devices), and the latest nodes from the plurality of direct nodes (data processing devices). Receiving information on a node (data processing device) directly below the node (data processing device) and a node (data processing device) below the node (data processing device) updated at the update time,
Analyzing information received from multiple direct nodes (data processing devices), and selecting and selecting one of the duplicate information when duplicate information about the same node (data processing device) is received It is characterized in that duplicate information that has not been deleted is deleted.

  In addition, each of the plurality of nodes (data processing devices) includes each node (data processing device) and each node (data) from a plurality of nodes (data processing devices) higher than each node (data processing device). The transmission of updated information related to a node (data processing device) lower than the processing device) is requested, and each of the nodes (data processing device) and each node ( It is characterized by transmitting updated information regarding a node (data processing device) lower than the data processing device.

  With the above configuration, even when a failure occurs in each intermediate node, it is possible to continue monitoring without interruption of information, and reliability is improved.

Embodiment 3 FIG.
Embodiment 3 is an embodiment in which information can be collected more efficiently by adding a role to the difference information of Embodiments 1 and 2 and changing the management method.

  That is, when the contents of the present embodiment are outlined, the upper node receives the difference list indicating the priority, the number of information, and the information size from the plurality of lower nodes before actually inquiring the difference information. An inquiry list in which difference lists collected from a plurality of lower nodes are arranged in order of priority is generated, and difference information is inquired to lower nodes in the order shown in the inquiry list. And if difference information is acquired from a lower node, a priority will be set to difference information according to the role (state information, performance information, log information) of information. Also, each node creates and transmits a difference list according to the set priority when there is a difference list inquiry from its own upper node.

  In the present embodiment, the components of the monitoring server, intermediate node, and device are the same as those in the first and second embodiments, but the contents of the difference information DB managed by the intermediate node are shown in FIGS. Change as follows. As shown in FIG. 13, data indicating a new role is added to the difference information. The role indicates the role of information managed by difference information such as “status information”, “performance information”, and “log information”. Further, as shown in FIG. 14, a plurality of difference information tables are held for each priority, and managed by the priority table. Also, a compression area is provided at the bottom of the priority table. FIG. 15 shows a difference list created by a query from a higher-level node. The difference list is searched from the priority table and the difference information, and the priority, the number of information, and the information size are collected. The priority is “difference table priority”, the number of information is “number of information (table rows) after the query LUT included in the priority difference table”, and the information size is “included in the priority difference table” The total size of information after the query LUT is displayed.

  Next, the operation in the present embodiment will be described with reference to FIGS.

  FIG. 16 is a flowchart for making an inquiry to a lower node of an upper node.

  In step 1601, the processing of steps 1602 to 1607 is performed for all lower nodes, and when the processing of all lower nodes is completed, the processing jumps to step 1608. Steps 1601 to 1605 are the same as steps 0901 to 0905 in FIG.

  In step 1602, it is checked whether or not the inquired lower node corresponds to the LUT. If it corresponds, the process proceeds to step 1603, and if not, the process jumps to step 1605.

  In step 1603, the lower node is inquired about the LUT. In step 1604, it is checked whether or not the acquired LUT is different from the held LUT. If the acquired LUT is different, the process proceeds to step 1605. If the acquired LUT is the same, the process returns to step 1601 and proceeds to the processing of the next lower node.

  In step 1605, it is checked whether or not the lower-level node to be inquired corresponds to the difference information. If it corresponds, the process proceeds to step 1606, and if not, the process jumps to step 1608.

In step 1606, the lower level node is inquired about the difference list.
In step 1607, the acquired difference list is added to the inquiry list, and the process returns to step 1601. The configuration of the inquiry list is as shown in FIG. 17, “difference information” as the type, and the identifier of the device to be queried as the device identifier, and the priority, number of information, and information size are added using the acquired difference list. . Specifically, the device identifier is “inquiry node, device identifier of the device (node to which the difference list is answered, device)”, the information identifier is “empty”, and the priority, the number of information, and the information size are in the difference list. It becomes contents. Further, as the operation of each node, the contents of the difference information table (including the device identifier and the information identifier) acquired from the lower node are added as they are to the difference information table of the priority designated by the own node.

  In step 1608, the information inquiry is added to the inquiry list, and the process returns to step 1601. The inquiry to be added is added by using “information” as the type, the identifier of the device to be queried for the device identifier, and the identifier of the information to be queried for the information identifier as the information size using the size of the information identifier type. Specifically, each intermediate node includes, as “information in the intermediate node”, a node that makes an inquiry, a device (device identifier), information to make an inquiry (information identifier), a size of information managed by the information identifier, The number of information and the priority are managed, and the information identifier and the information size are the specifications (SNMP (Simple Network Management Protocol) MIB (Management Information Base) MIB) or DMI (Desktop Management Interface) MIF (Management). Information Format), CIM (Common Information Model) MOF (Managed Object Format, etc.) information, The number of information is set by the device and the priority is set by the system administrator. The inquiry list is created using the “information in the intermediate node”. As the operation of each node, difference information is created from “information value” and “information in intermediate node” acquired from the lower node, and added to the difference information table of the priority specified by the own node.

  Next, after steps 1602 to 1607 (or 1608) are completed for all lower nodes, in step 1609, the inquiry list is rearranged in order of priority. At this time, if the total information size exceeds the size that can be acquired within the polling time, the corresponding inquiry list is deleted.

  In step 1610, the processing from step 1611 to 1612 is performed for all queries in the query list, and when all processing is completed, the process jumps to step 1613.

  In step 1611, difference information or information inquiry is performed. In step 1612, the difference information DB is updated, and the process returns to step 1610 to process the next inquiry. At this time, in the case of the highest node (monitoring server), it is registered in the device history information and the latest device information is updated. Details of the update of the difference information DB in step 1611 will be described later with reference to FIG. In step 1613, the LUTs of all lower nodes are updated. In step 1614, the process waits for the next polling and returns to step 1601.

  Next, a flowchart for updating the difference information DB will be described with reference to FIG.

  In step 1801, the role of the information acquired from the lower node is confirmed. If the role is “status information”, the process proceeds to step 1802. If it is “log information”, the process proceeds to step 1808. If the role is “performance information”, the process proceeds to step 1811. jump.

  In step 1802, the difference information DB is searched for the same device identifier and difference information of the same information identifier (difference information having the same device identifier and the same information identifier as the difference information acquired from the lower node). In step 1803, if the difference information is detected as a result of the search, the process proceeds to step 1804. If not detected, the process jumps to step 1806. In step 1804, it is confirmed which of the information in the difference information DB and the acquired difference information is newer. If the acquired difference information is new, the process proceeds to step 1805, and if it is old, the process jumps to step 1808. In step 1805, the detected old difference information is moved to the lowest priority table. In step 1806, the status information is converted into a priority based on the acquired status information value or performance information threshold value. For example, “1” is normal and low priority, “2” is warning and medium priority, and “3” is abnormal and high priority. In step 1807, the acquired information is registered in the converted priority difference information table.

  On the other hand, in step 1808, the acquired difference information is registered in the lowest priority table. In step 1809, if the difference information table with the lowest priority exceeds a certain amount or a certain time has elapsed, the process proceeds to step 1810. Otherwise, the process proceeds to the next step (step 1610). In step 1810, the difference information table with the lowest priority is compressed and added to the compressed area, and the process proceeds to the next step (step 1610).

  In step 1811, it is confirmed whether or not the performance information exceeds a preset threshold value. If it exceeds, the process jumps to step 1802, and if not, the process jumps to step 1808.

  FIG. 19 is a flowchart for replying to an inquiry from an upper node of a lower node.

  Steps 1001 to 1008 in FIG. 19 are the same as the steps in FIG. In step 1901, the type of inquiry is determined. If the type of inquiry is “LUT inquiry”, the process proceeds to step 1003. If “difference list inquiry”, the process proceeds to step 1902. If it is “Information inquiry”, the process jumps to Step 1007.

  In step 1902, information after the inquiry LUT is searched from the priority table and difference information, a difference list in which the priority, the number of information, and the information size are collected is created, and reply data is created. The reply data created in step 1903 is returned to the upper node, and the process returns to step 1001.

  The processing of each node will be described with reference to FIG.

  First, the upper intermediate node (0103aa) makes an LUT inquiry to the lower intermediate nodes (0103ba, 0103bb, 0103ca). In FIG. 22, only the communication between the intermediate node (0103aa) and the intermediate node (0103ba) is shown for the convenience of drawing, but similar communication is also performed in other intermediate nodes.

  The lower intermediate node (0103ba) responds to the LUT inquiry from the upper intermediate node (0103aa).

  Further, when the upper intermediate node (0103aa) is newer than the LUT stored in the response, the lower intermediate node (0103ba) inquires the lower intermediate node (0103ba) about the difference list. Send the difference list.

  In the upper intermediate node (0103aa), an inquiry list is created based on the difference list received from each of the lower intermediate nodes (0103ba, 0103bb, 0103ca), and in the lower intermediate node (0103ba) according to the order of the inquiry list. Inquires of the difference information. The lower intermediate node (0103ba) transmits difference information in response to an inquiry from the upper intermediate node (0103aa).

  Thereafter, the upper intermediate node (0103aa) sets a priority for the difference information received from each of the lower intermediate nodes (0103ba, 0103bb, 0103ca), and further upper intermediate node (not shown). When a difference list is inquired from, the information size of the difference information is calculated, the difference list is generated according to the priority, and the difference list is transmitted to a higher intermediate node.

  In this embodiment, the inquiry list is rearranged in order of priority in step 1609. However, rearrangement may be performed in consideration of the priority and size of each device identifier or information identifier.

  Thus, in the data processing system shown in the present embodiment, each of a plurality of nodes (data processing devices) is connected to a plurality of nodes (data processing devices) lower than each node (data processing device). The latest update time is queried, and the priority and information size of the information updated at the latest update time for the node (data processing device) whose time is later than the stored update time is stored. And the order of receiving information updated at the latest update time from each node (data processing device) based on the priority and information size transmitted from each node (data processing device) in response to the inquiry And the information updated at the latest update time is received from each node (data processing apparatus) according to the determined order.

  Each of the plurality of nodes (data processing apparatuses) receives information in order from the highest priority within the receivable information size range.

  Each of the plurality of nodes (data processing devices) updates information on each node (data processing device) and a node (data processing device) lower than each node (data processing device), and after the update. The priority is set to the information of the information, and when requested from a specific node (data processing device) higher than each node (data processing device), the information size of the updated information is calculated and updated. The information priority and the information size are transmitted to a specific upper node (data processing apparatus).

  Each of the plurality of nodes (data processing devices) determines the priority of the updated information based on at least one of the information type of the updated information, the value of the updated information, and the update time. It is characterized by that.

  Further, each of the plurality of nodes (data processing devices) is characterized in that, in a predetermined case, compression processing is performed on information having a priority level equal to or lower than a certain level, and the information after the compression processing is held.

  By configuring as described above, even when all the difference information cannot be acquired within the polling time, it is collected in descending order of priority, so that important faults are delayed by other information. Things won't happen. In addition, since information with a low priority can be compressed and transferred, information can be collected efficiently. In addition, since the polling interval can be shortened, information delay can be reduced.

  Here, the characteristics of the distributed device information collection method described in the above embodiment are shown below.

  In the distributed device information collection method described in the above embodiment, in a system in which distributed devices are configured in multiple layers, the intermediate node polls the last update time (LUT: LastUpdateTime) of the lower node, and the LUT has changed. It is characterized by collecting only the information of the devices.

  Further, each intermediate node manages the change of information of each lower node as difference information together with the change time, and returns only difference information from the previous inquiry time in response to an inquiry from the upper node.

  In addition, the system is monitored by using the highest node as a monitoring server.

  Each intermediate node can respond to inquiries from a plurality of upper nodes.

  Further, a role is added to the difference information managed by each intermediate node, each intermediate node holds a priority table for managing the difference information for each priority, and the difference information management method is changed for each role. To do.

  In addition, when the role is “status information” and the same device identifier and the same information identifier, the latest information is prioritized by increasing the priority of the new one and lowering the priority of the old one. It collects in the highest node.

  In addition, when the role is “log information”, the priority is set low, and when the information with low priority is accumulated for a certain period of time or a certain amount, it is compressed to reduce the communication amount.

  Further, when the role is “performance information”, the priority is set high when a preset threshold is exceeded, and the priority is set low otherwise.

FIG. 3 is a diagram illustrating an example of a system configuration according to the first embodiment. FIG. 3 is a diagram illustrating a configuration example of a monitoring server according to the first embodiment. FIG. 5 is a diagram illustrating an example of information managed by the LUT management unit according to the first embodiment. FIG. 6 is a diagram showing an example of device latest information according to the first embodiment. FIG. 3 shows a configuration example of an intermediate node according to the first embodiment. FIG. 4 is a diagram showing an example of a difference information table according to the first embodiment. FIG. 3 illustrates a configuration example of a device according to Embodiment 1; FIG. 3 shows an example of an information table according to the first embodiment. FIG. 3 is a flowchart showing an operation example of each node according to the first embodiment. FIG. 3 is a flowchart showing an operation example of each node according to the first embodiment. FIG. 4 is a diagram illustrating an example of a system configuration according to a second embodiment. FIG. 10 is a diagram illustrating an example of information managed by an LUT management unit according to the third embodiment. FIG. 10 shows an example of a difference information table according to the third embodiment. FIG. 10 shows an example of a priority table according to the third embodiment. FIG. 10 shows an example of a difference list according to the third embodiment. FIG. 9 is a flowchart showing an operation example of each node according to the third embodiment. FIG. 10 shows an example of an inquiry list according to the third embodiment. FIG. 9 is a flowchart showing an operation example of each node according to the third embodiment. FIG. 9 is a flowchart showing an operation example of each node according to the third embodiment. FIG. 4 is a diagram illustrating an operation example of each node according to the first embodiment. FIG. 10 is a diagram illustrating an operation example of each node according to the second embodiment. FIG. 10 is a diagram illustrating an operation example of each node according to the third embodiment.

Explanation of symbols

  0101 Monitoring server, 0102 device, 0103 Intermediate node, 0104 Device information DB, 0105 Various information, 0106 Difference information DB, 0201 Communication processing unit, 0202 Status acquisition processing unit, 0203 LUT management unit, 0204 Difference information processing unit, 0205 Device information DB management unit, 0501 communication processing unit, 0502 status return processing unit, 0503 status acquisition processing unit, 0504 LUT management unit, 0505 difference information management unit, 0701 communication processing unit, 0702 status return processing unit, 0703 information management unit, 0704 Sensor, meter, etc.

Claims (30)

A data processing system having a plurality of data processing devices, wherein the plurality of data processing devices form a logical hierarchical structure,
Each of the plurality of data processing devices
For each specific data processing device lower than each data processing device, the specific data processing device stores the update time when the information was updated,
When the latest update time is inquired to the specific data processing device at a predetermined timing, and the latest update time notified from the specific data processing device is later than the stored update time And receiving information updated at the latest update time from the specific data processing apparatus. Each of the plurality of data processing devices
Stores the update time of the data processing device located immediately below each data processing device,
When the latest update time is inquired to the direct data processing device at a predetermined timing, and the latest update time notified from the direct data processing device is later than the stored update time, The data processing system according to claim 1, wherein information updated at the latest update time is received from the direct data processing apparatus. Each of the plurality of data processing devices
When the latest update time notified from the direct data processing device is later than the stored update time, the direct data processing device and the direct data processing device updated at the latest update time. The data processing system according to claim 2, wherein information relating to a lower-level data processing device is received from the data processing device immediately below. Each of the plurality of data processing devices
Information related to the immediate data processing device and a data processing device lower than the direct data processing device, which is changed from the previous update time to the latest update time, is received from the direct data processing device. The data processing system according to claim 3. Each of the plurality of data processing devices
At a predetermined timing, the information regarding each data processing device and the data processing device lower than each data processing device is updated,
When a specific data processing device higher than each data processing device requests transmission of updated information regarding each data processing device and a data processing device lower than each data processing device, the specific processing device 2. The data processing system according to claim 1, wherein updated information relating to each data processing device and a data processing device lower than each data processing device is transmitted to the data processing device. Each of the plurality of data processing devices
Each time the information regarding each data processing device and the data processing device lower than each data processing device is updated, the update time is stored,
When the notification of the latest update time is requested from the specific data processing device, the latest update time stored is notified to the specific data processing device,
When the specific data processing device is requested to transmit updated information regarding each data processing device and a data processing device lower than each data processing device after notifying the latest update time. 6. The data processing system according to claim 5, wherein updated information regarding each data processing device and a data processing device lower than each data processing device is transmitted to the data processing device. Each of the plurality of data processing devices
Information related to each data processing device and a data processing device lower than each data processing device, and only information that has changed from the last update time at the latest update time is transmitted to the specific data processing device. 6. The data processing system according to claim 5, wherein the data processing system is characterized in that: Each of the plurality of data processing devices
It has a plurality of direct data processing devices,
From each of the plurality of direct data processing devices, information related to the direct data processing device updated at the latest update time and the data processing device lower than the direct data processing device is received,
Analyzing information received from multiple data processing devices directly below, and if duplicate information related to the same data processing device was received, select one of the duplicate information and delete the duplicate information that was not selected The data processing system according to claim 3, wherein: Each of the plurality of data processing devices
A plurality of data processing devices higher than each data processing device are requested to transmit updated information regarding each data processing device and each data processing device lower than each data processing device,
6. The data processing system according to claim 5, wherein updated data regarding each data processing device and a data processing device lower than each data processing device is transmitted to each of a plurality of upper data processing devices. . The data processing system includes:
The update contents in the lower data processing apparatus are notified from the lower data processing apparatus to the upper data processing apparatus, and the update contents notified from the lower data processing apparatus in the upper data processing apparatus are updated in the upper data processing apparatus. 2. The data processing system according to claim 1, wherein the contents are added to notify the higher-order data processing apparatus of the updated contents in the higher-order data processing apparatus and the lower-order data processing apparatus. Each of the plurality of data processing devices
Queries the latest update time for a plurality of data processing devices lower than the respective data processing devices, and the latest update time for the data processing device that is later than the stored update time. Queries the priority and information size of information updated at the update time,
Based on the priority and information size transmitted from each data processing device in response to the inquiry, the order for receiving information updated at the latest update time from each data processing device is determined, and each order is determined according to the determined order. 2. The data processing system according to claim 1, wherein information updated at the latest update time is received from the data processing device. Each of the plurality of data processing devices
12. The data processing system according to claim 11, wherein reception is performed in order from information having a higher priority within a receivable information size range. Each of the plurality of data processing devices
While updating information related to each data processing device and data processing device lower than each data processing device, set the priority to the updated information,
When requested by a specific data processing device higher than each data processing device, the information size of the updated information is calculated, and the priority and information size of the updated information are determined by the upper specific data processing. The data processing system according to claim 5, wherein the data processing system transmits the data to a device. Each of the plurality of data processing devices
14. The data processing system according to claim 13, wherein the priority of the updated information is determined based on at least one of the information type of the updated information, the value of the updated information, and the update time. . Each of the plurality of data processing devices
14. The data processing system according to claim 13, wherein in a predetermined case, compression processing is performed on information having a priority level equal to or lower than a certain level, and the information after compression processing is held. A data processing device included in a data processing system in which a plurality of data processing devices form a logical hierarchical structure,
An update time storage unit for storing an update time at which the specific data processing device has updated the information for a specific data processing device lower than the own data processing device;
Inquiring the latest update time for the specific data processing device at a predetermined timing, and an update time inquiry unit for receiving a response indicating the latest update time from the specific data processing device,
When the latest update time indicated in the response from the specific data processing device is a time later than the update time stored in the update time storage unit, the latest update from the specific data processing device. A data processing apparatus comprising: an update information receiving unit that receives information updated at a time. The update time storage unit
Stores the update time of the data processing device located immediately below the own data processing device,
The update time inquiry unit
Inquires the latest data processing device for the latest update time at a predetermined timing, and receives a response indicating the latest update time from the data processing device immediately below,
The update information receiving unit
When the latest update time indicated in the response from the direct data processing device is later than the update time stored in the update time storage unit, the latest update time is set from the direct data processing device. The data processing apparatus according to claim 16, wherein the updated information is received. The update information receiving unit
The latest data updated at the latest update time when the latest update time indicated in the response from the immediate data processing device is later than the update time stored in the update time storage unit. 18. The data processing apparatus according to claim 17, wherein information regarding a processing apparatus and a data processing apparatus lower than the immediate data processing apparatus is received from the direct data processing apparatus. The update information receiving unit
Information related to the immediate data processing device and a data processing device lower than the direct data processing device, which is changed from the previous update time to the latest update time, is received from the direct data processing device. The data processing apparatus according to claim 18. The data processing device further includes:
An information storage unit for storing information relating to the own data processing device and the lower data processing device;
An update management unit for updating information on the own data processing device and the lower data processing device stored in the information storage unit at a predetermined timing;
A request for transmitting information related to the own data processing device and the lower data processing device after being updated by the update management unit is received from the upper specific data processing device, and the updated own data processing device and the lower data processing are processed. An update information transmission unit that acquires information about a device from the information storage unit and transmits information about the updated data processing device and a lower data processing device to the specific data processing device; The data processing apparatus according to claim 16. The update time storage unit
Each time the information on the own data processing device and the lower data processing device is updated by the update management unit, the update time is stored,
The update information transmission unit
When the notification of the latest update time is requested from the specific data processing device, the latest update time stored in the update time storage unit is notified to the specific data processing device,
When a request for transmitting information related to the updated data processing device and the lower data processing device is received from the specific data processing device after notifying the latest update time, the updated data processing device and lower data are updated. 21. The data processing apparatus according to claim 20, wherein information on the processing apparatus is transmitted to the specific data processing apparatus. The update information transmission unit
The information related to the updated data processing device and the lower data processing device, wherein only information that has changed from the previous update time at the latest update time is transmitted to the specific data processing device. The data processing apparatus according to 20. The data processing device includes:
It has a plurality of direct data processing devices,
The update information receiving unit
From each of the plurality of direct data processing devices, information related to the direct data processing device updated at the latest update time and the data processing device lower than the direct data processing device is received,
Analyzing information received from multiple data processing devices directly below, and if duplicate information related to the same data processing device was received, select one of the duplicate information and delete the duplicate information that was not selected The data processing apparatus according to claim 18, wherein The update information transmission unit
Receives a request for transmitting information related to the updated data processing device and the lower data processing device from the plurality of upper data processing devices, and updates the own data processing device to each of the plurality of higher data processing devices, and 21. The data processing apparatus according to claim 20, wherein information on a lower data processing apparatus is transmitted. The update time inquiry unit
Queries the latest update time for multiple lower-level data processing devices,
The update information receiving unit
The priority and information size of information updated at the latest update time for the data processing apparatus whose latest update time indicated in the response is later than the update time stored in the update time storage unit Inquire
Based on the priority and information size transmitted from each data processing device in response to the inquiry, the order for receiving information updated at the latest update time from each data processing device is determined, and each order is determined according to the determined order. 17. The data processing apparatus according to claim 16, wherein information updated at the latest update time is received from the data processing apparatus. The update information receiving unit
26. The data processing apparatus according to claim 25, wherein information is received in order from information with a high priority within a receivable information size range. The update management unit
While updating the information about the own data processing device and the lower data processing device stored in the information storage unit, set the priority to the updated information,
The information storage unit
When information about the own data processing device and the lower data processing device is updated by the update management unit, the priority is stored together with information about the updated own data processing device and the lower data processing device,
The update information transmission unit
When requested by a specific upper data processing device, it calculates the information size of the information related to the updated data processing device and the lower data processing device, and also updates the updated data processing device and the lower data processing device. 21. The data processing apparatus according to claim 20, wherein the priority and the information size of the information regarding the information are transmitted to a specific data processing apparatus at a higher level. The update management unit
After updating based on at least one of the information type of information related to the updated data processing device and the lower data processing device, the value of information related to the updated data processing device and the lower data processing device, and the update time 28. The data processing apparatus according to claim 27, wherein priorities of information related to the data processing apparatus and the subordinate data processing apparatus are determined. The update management unit
In a given case, compression processing is performed on information whose priority is below a certain level,
The information storage unit
29. The data processing apparatus according to claim 28, wherein the information after compression processing is stored. A data processing method for performing data processing in a data processing system that forms a logical hierarchical structure,
An update time storage step for storing an update time at which information is updated in a specific lower hierarchy;
An update time inquiry step of inquiring the latest update time with respect to the specific lower hierarchy at a predetermined timing and receiving a response indicating the latest update time from the specific lower hierarchy;
When the latest update time indicated in the response from the specific lower hierarchy is later than the update time stored in the update time storage step, the latest update time is changed from the specific lower hierarchy. An update information receiving step for receiving updated information.

Images