JPH0354940A - A method for centrally monitoring connection information in computer network systems - Google Patents

Abstract

PURPOSE:To improve the using efficiency of a network by executing communication with priority when the communication is required, and when no communication is applifed from a node for a fixed time or more, judging the disconnection of the node from the network and updating information in a routing table. CONSTITUTION:When no message is transferred, respective nodes N0 to N6 send the dummy packets of connection information to a router R in each fixed period or within a predetermined fixed time. When communication is requested, the dummy packet transmission is suppressed to execute the communication with priority and the router R monitors the packets transferred on a transmission line. When communication or dummy pakets are not broadcasted from the nodes N0 to N6 for the previously fixed time or more, the router R judges the disconnection of the nodes from the network L, broadcasts the connection information to respective nodes N0 to N6 and allows respective nodes N0 to N6 to update the routing inforamtion.

Description

[Detailed Description of the Invention] [Summary] The present invention relates to a connection information centralized monitoring method in which the connection status of nodes constituting a computer network system is monitored by a router, and connection information of each node is efficiently collected. The purpose is to improve the efficiency of network use. Each node is. When no messages are being transferred, the connection information is sent to the router at regular intervals or within a predetermined period of time.
Send packet. When there is a communication request. Priority is given to that communication, and the transmission of dummy packets is suppressed, and the router monitors the packets going back and forth on the transmission path. When a node does not communicate or broadcast dummy packets for a predetermined period of time or more. It determines that the node has disconnected from the network and broadcasts the connection information to each node. We configured each node to update its routing information. [Industrial Application Field] The present invention... This paper relates to a connection information centralized monitoring method that uses routers to monitor the connections of nodes that make up a computer network system. Network routers must dynamically reflect the connection status of network nodes in the routing information held by each node. Therefore, routers monitor the connection status of individual nodes and collect connection information. The process of broadcasting to each node is performed, but the network is used at this time, which reduces the efficiency of using the software. The present invention aims to improve this. [Prior art] When a node needs to send a message in a complex network in which multiple networks are interconnected. Find the network to which the node is connected from the destination node address. Which rook or gateway (hereinafter referred to as
The system used a routing table that stored routing information to determine whether data should be relayed to a router (a group of routers and gateways collectively referred to as a router), and then sent messages to that router. Here, the routing information is defined as connection information indicating the connection status of each node and router.

A router that receives a message similarly searches for a relay rook from its routing table and sends a message. The router that received the data sent messages to the target node if it existed in the network. For this reason. The routing information in each node's routing table must represent the latest connectivity status for each node in the network.

and. In the process of updating node routing information in a conventional complex network system, a router sends a request packet to all nodes. In response, the connection status of the node was monitored by sending a response packet 1}, indicating that the node that returned the response was connected to the network, and this response packet was sent to all connected nodes. Because it is sent from the node. Based on this, the router creates 11 connection reports that represent the connection status of each node. And what connection did the router create? One message was broadcast to each node; each node updated its routing table according to the received connection information. Figure 6(a),
By (b) and (c), this conventional connection t+! This section explains the L-report monitoring method. Figure 6(a). In (b) and (c), R is a router, No, Nl, N2, N3, N4, N
5, NG is a node. L is a network. Luke R
is for each node NO-NG. A request packet for collecting connection information is sent (Figure 6(a)). The nodes connected to the network are: Upon receiving the request packet, it sends a response packet to router R (FIG. 6(b)).

Since this response packet is sent from all five connected nodes, router R creates node connection information based on this and broadcasts it to each node. and. The connected nodes updated the routing information in their routing tables using the sent connection information (Figure 6(c)). [Problem to be solved by the invention] Request packets for nodes in the conventional technology as described above. Response packets from nodes and broadcasts of routing information from routers are both information transfers necessary for network management, rather than communication messages associated with the original processing between nodes.
This reduces the efficiency of using the transmission path for the original processing purpose. By the way, the transmission capacity of the network is limited. If the number of nodes is large, the amount of connection information required to maintain the system also increases, resulting in a decrease in network usage efficiency.

This became a serious problem when the system was expanded to increase the number of nodes, and there was a risk that the majority of packets traveling on the transmission path would be made up of routing information. [Means for solving the problem] In the present invention. Each node connected to the network has a fixed period. or. Periodically, within a predetermined period of time, a dummy packet is sent to the router indicating that it is connected to the network. However, if communication is necessary, priority is given to that communication and the transmission of dummy packets is suppressed. On the other hand, the router. Constantly monitors packets passing through the transmission path. Transfer source. In addition to identifying the destination node, it also receives dummy packets, which are connection information, from nodes with which it is not communicating. Based on this information, it intensively monitors the connection status and updates its own routing table information if there is a change. Also, if there is no communication from a node for a certain period of time, the router will The node determines that it has disconnected from the network and updates the information in its routing table. In this way, the router constantly updates the information in its own routing table and broadcasts the latest connection information to all nodes based on this information.

The principle of the present invention will be explained based on FIGS. 1(a) and 1(b).

FIGS. 1(a) and 1(b) are explanatory diagrams of the principle of the present invention shown using a specific example. In the figures, L is a network, R is a router, and NO. NI N2N3. N4. N5,
N6 is a node and RT is a routing table. Figure I (a) shows the router R's routing data RT.
(b) shows the update processing state of the routing table RT of each node.

In FIG. 1(a), ■ indicates a state in which N3 is sending connection information to router R. Similarly, ■ is N4
has lost connection with the network. This indicates that the connection information from N4 does not come to router R even after a certain period of time has passed. Also, ■ indicates communication between nodes of different networks.

The router constantly monitors these packets passing through the network. Then, connection information is intensively constructed in the routing table RT using information on the communication source node and communication destination node and dummy packets in communication between nodes as shown in (2).

Furthermore, as shown in ■, there is no communication with the router even after a certain period of time has elapsed. Furthermore, for nodes that do not receive dummy packets. N4 determines that it is disconnected from the network and updates its routing table.

As shown in Figure 1(b). When the routing table is updated, the router broadcasts its latest routing information, that is, the connection information for each node. And all nodes are. Update own routing table.

[Operation] The operation of the present invention will be explained based on FIGS. 2(a) and (b). FIG. 2(a) is a control flow diagram of a node according to the present invention, and the operation is performed as follows.

■ If connection information is broadcast from the router, it receives it and updates the routing table.

■ If there is a communication packet addressed to the own node. Performs reception processing. ■ If there is a communication request to the own node. Perform the transmission process.

■ If there is no communication request for a predetermined period of time, a dummy packet is sent. Above ■、■
．． ■． The process (2) is repeated while the node is connected.

FIG. 2(b) is a control flow diagram of the router in the present invention. The operation is as follows. The router is. Monitor packets passing through the network, ■′, ■′, ■′
Perform the action indicated by the path. ■'When an inter-node communication packet is detected, the source node is identified. Refers to the routing table, checks the correspondence with connection information, and detects whether there is a change in the connection status. For example, if a packet is being sent from a node whose connection is OFF in the routing table, it is assumed that the connection status has changed. The connection information of the node where a change is detected is updated on the routing table, and the connection information is then broadcast to each node. ■'When a dummy packet is detected. Identify the source node, refer to the routing table, check whether there is a change in the connection status of the corresponding node, and if there is a change, perform the same process as ■'. ■' Detect a node that has not sent a packet for a predetermined period of time, treat the detected node as having been disconnected, and update the connection information of the corresponding node in the routing table, in the same way as ■' Broadcast. The above processing is repeated during system operation.

In the present invention, 1. the latest routing information. Broadcasting is only required when there is a change in routing information, improving network usage efficiency.

Also. Since it is no longer necessary to update the routing information at each node at regular intervals, processing speed can be increased. [Embodiment] FIG. 3 shows a flow of dummy packet transmission control using a node timer according to an embodiment of the present invention.

Next, we will explain the operation according to the flow. ■ Set and start the timer. The timer time is set to a certain period of time suitable for monitoring the connection status of the nodes. ■ Check for transfer requests.

■ If there is a transfer request, transfer the communication packet. Return to ■. ■ If there is no transfer request, wait for a timer interrupt. ■ If there is a timer interrupt, transfer the dummy packet and return to ■. ■ If there is no timer interrupt, determine whether the timer has ended or not. If it has ended, terminate the process. If not, the timer has been canceled (reset) for another reason, so return to step ■ and set the timer. do. Figure 4 shows the flow of router connection information monitoring and control according to an embodiment of the present invention. Next, we will explain the operation according to the flow. ■'The router has a timer table to monitor the time of each node, and sets an initial value as data in the entry of each node. The initial value is a value for a certain period of time.

■ Set a predetermined fixed time value to the timer and start it. ■'Monitor communication request packets and dummy packets. ■'If there is a communication request packet or dummy packet, analyze its source node.

■′Based on the analyzed source node. Clear the data of the corresponding entry in the timetable.

■'If there is no communication request, wait for a timer interrupt. ■′If there is a timer interrupt. At that point, the node whose time has exceeded, that is, the node whose data remains in the time table without being cleared, is detected, and the time table is updated with the original time data. ■'Uncleared nodes detected in the timetable, that is, nodes that did not transmit packets during the timer time. It determines that it is disconnected from the network, rearranges the routing information, and broadcasts it. ■If it is not finished, repeat the process from ■′, and if it is finished, finish the processing of this flow. The dummy packet is in the format of a standard data communication packet, but the dummy information is set in the data part of the packet format. The physical structure of the nodes used in the present invention is the same as that in conventional network systems (local area network interface). The present invention can be applied to either ring type or bus type networks, but for ring type networks, Figures 1(a) and (
As shown in b). Figure 5(a). According to (b) and (c). An example in which the present invention is applied to a bus type network will be described. In Figure 5(a). ■ indicates the transmission of a dummy packet from the node, and ■ indicates communication with a node in another network of N4. Figure 5(b) shows a state where N4 is disconnected from the network. Then, even after a certain period of time (time-over), the router does not receive any connection information from N2. Node N2 is determined to be disconnected. Indicates that the routing table will be updated. Dummy packet transmission from the node is as follows. As mentioned above, it is a constant period. Or do it at predetermined intervals.

Figure 5 (C) shows that the router has updated the 9 routing table. This shows that the latest routing information is broadcast to each node. Each node then updates its own routing table based on this information. In the present invention. Dummy packets are broadcast from each node at a fixed period or within a predetermined period of time. In the latter case, the time interval may vary depending on the node as long as it is within a certain period of time, or may change depending on the processing state even within the same node. Furthermore, at that time, when there is a data communication request to the node. Suppress the transmission of dummy packets and prioritize communication between nodes. [Effect] According to the connection information centralized monitoring method of the present invention. The efficiency of using Nesotowork has improved. Processing speed will be increased. Also for that reason. Wide area. Complex. It becomes possible to construct large-scale networks.

[Brief explanation of drawings]

FIGS. 1(a) and 1(b) are diagrams explaining the principle of the present invention. FIG. 2(a) is a control flow diagram of a node in the present invention. Figure 2(b) is. It is a control flow diagram of the router in the present invention. FIG. 3 is a flow diagram of dummy packet transmission control of a node according to an embodiment of the present invention. Figure 4 is. FIG. 2 is a flow diagram of router connection information monitoring control according to an embodiment of the present invention. Figures 5 (a), (b), and (c) are. Bus type network Figure 6 (a), (b). (c) is. This is an explanatory diagram of a conventional connection and monitoring method. In the drawing, L: Futaku. R; Router NO, Nl, N2 N3, N4 N5, N6: Node.

Claims (1)

[Claims] In a connection information centralized monitoring method in a computer network system, each node sends connection information to the router at regular intervals or within a predetermined period of time when no messages are being transferred. A dummy packet is sent, and when there is a communication request, the transmission of the dummy packet is suppressed, giving priority to that communication.The router monitors the packets going back and forth on the transmission path, and sends the packet from the node to the router for a predetermined period of time. When no communication or dummy packet broadcast is performed, the node determines that it has disconnected from the network and broadcasts the connection information to each node, causing each node to update the routing information. Features a centralized connection information monitoring method.