JPS6010941A - System for detecting contradiction of network information - Google Patents

Abstract

PURPOSE:To decide the presence of contradiction by referencing the shortest communicaton path table, and obtaining the distance from the own node to the final address node, and comparing the said distance and a distance added to a reception data when the own address is not used as the final address. CONSTITUTION:In receiving a communication block, a host computer checks a header and fetches it if the header is addressed to the own address. When the communication block is not addressed to the own address, the host computer references the shortest communication path table, obtains the shortest distance from the own node to the final address node, compares the shortest distance from the own node to the final address node with the distance in the header, and when the former is smaller than the latter, it is considered as OK and the relaying processing is executed and in other cases, it is considered as NG (No Good), the processing for confirming network information is executed. Each host computer forms the shortest communication line table based on the network possessed by the own computer. For example, in transmitting a data from a node A to a final address node C, the distance is (2) according to the table and also a direct address node is B.

Description

[Detailed Description of the Invention] [Technical Field of the Invention] The present invention provides a method for easily detecting inconsistencies in network information in a network system in which each node has network information that is the basis for determining a communication route. This paper relates to a method for detecting discrepancies in network information.

[Conventional technology and problems]

FIG. 1 shows an overview of the network system, and A to E indicate nodes.

The nodes are connected by transmission lines. When communicating, each node selects the shortest route (the route with the least communication time) based on network information, and performs communication. Now, when node A sends all data to node C, node A sends the data to node B and requests relaying, and node B sends the received data to node C. Assume now that a failure occurs between node B and node C, node A does not report the occurrence of the failure, and node B is aware of this failure. Note that transmission path failure information is also an element of network information. Under such a state, if a transmission request to node C is generated from node A, node A transmits data to node B and requests full relay.

Since node B thinks that the communication path for sending data to node C is node A→E −+ D −+ C, it sends the received data back to node A. In this way, if the network information held by each node A, B, C, D, and E is contradictory, it may become loose. Therefore, when network information changes, it is necessary to notify other nodes, but the communication to convey this to other nodes must be synchronized with other communications. I have to take it again.
It was also necessary to perform recovery in the event of a failure.

[Purpose of the invention]

The present invention is based on the above consideration, and an object of the present invention is to provide an entire network information contradiction detection method that allows contradictions in network information to be easily detected during normal communication processing.

[Structure of the invention]

Therefore, the network information contradiction detection method of the present invention is applicable to a network system that includes a plurality of nodes that have a network information table that stores network information for determining a communication route, and a transmission path that connects the nodes. In this network information inconsistency detection method, each node refers to the network information table, creates a shortest communication route table indicating the shortest distance to open the node and the direct destination node, and then sends the information to other nodes. When transmitting data, refer to the shortest communication route table above to find the shortest distance and direct destination node, add the shortest distance to the sending data, and add the name of the other node mentioned above as the final destination node name. Send the data directly to the destination node, and when receiving the data, check whether or not you are the final destination. If you are not the final destination, refer to the shortest communication route table above to determine the distance from your own node to the final destination node. It is configured to determine the distance, compare the distance with the distance attached to the received data, and recognize that there is a contradiction in network information if the former zero is greater than the latter. It is.

[Embodiments of the invention]

Hereinafter, the present invention will be explained with reference to the drawings.

Fig. 2 is a diagram showing an example of the hardware configuration of a network system to which the present invention is applied, Fig. 3 is a diagram showing an example of a complete network information table used in the invention, and Fig. 4 is a diagram showing the shortest communication. Figure 5 shows an example of a route table, Figure 5 shows the host computer's reception processing, Figure 6 shows the host computer's reception process.
11 is a diagram showing transmission processing of the ll-machine. FIG.

The present invention can be summarized as follows. For each node, calculate the distance between two nodes from the network information. Distance is a logical concept determined from the number of relay nodes, communication ability, etc. It is determined that the shortest distance (minimum time) is selected as the communication route.When node B is requested to relay from node A to node C, it detects inconsistencies in network information by performing the following checks. You can.

Distance from B to C <Distance from A to C If this condition is not met, the network information held by node A and the network information held by node B will be different, so This can be used as a trigger to check network information, etc.

Figure 2 shows the hardware configuration of the network Φ system to which the present invention is applied. It shows. In FIG. 2, 1-A to 1-E are host computation J2-A to 2-E are block ψ multiplexer channels, 3-A
Reference numerals 3-E to 3-E indicate interface adapters, and 4 indicates a ring-shaped transmission path. Host computer, block multiplexer channel, adapter, etc.
It consists of nodes. Communication between adjacent host computers is performed using CTC (Channel to channel).
This is done in a similar manner to traditional inter-channel communication using a 1-channel adapter. All communications are managed by the host computer.

FIG. 3 shows an example of the network information table. In the figure, ◯ marks indicate that the nodes are directly connected via a transmission path, and X marks indicate that the nodes are not directly connected. Figure 3: For example, node A and node B.

It can be seen that node A and node E are connected.

When it is determined that a failure has occurred in the transmission path between node B and node C, the circle mark in the second row and third column is changed to an x mark. The network information table shown in FIG. 3 is provided in the memory of each host computer.

FIG. 4 shows an example of the shortest communication route table. Each host computer creates a shortest communication path table based on its own network information table8.
In the illustrated shortest communication route table, when sending data from node A to node B, the final destination, the distance is nln and the direct destination is node B, and when sending data from node A to node C, the final destination, the distance is nln and the direct destination is node B. The distance is “2# and the direct destination/-do B, from node B to the final destination node C
, the distance is '1' and the direct destination is node B. In this example, the distance exists between the data sending node and the final destination node. It is assumed that it is determined by the number of relay nodes.

5 and 6 show the transmission and reception processing in the host computer. When communicating, a node adds all headers to data and handles this as one communication block. The header includes the final destination node name, distance, etc. .

FIG. 5 explains the reception processing of the host computer. Upon receiving all communication blocks, the host computer examines the header and takes it in if it is addressed to itself. If the communication block is not addressed to itself (~), the host computer refers to the shortest communication route table to determine the shortest distance from its own node to the final destination node, and then connects it from its own node to the final destination node.

The shortest distance to the header is compared with the distance in the header, and if the former is smaller than the latter, relay processing is performed as OK; otherwise, processing for confirming network information is performed as NQ (no good).

FIG. 6 explains the transmission processing of the host computer. When a transmission request is received, the host calculates the shortest communication route table, determines the distance and direct destination from its own node to the final destination node, creates a header that includes the final destination name, distance, and money, and sends the header. and the transmission data and the name of the direct destination node are stored in all memories, and the block φ multiplexer e-channel is notified that there is a transmission request. Upon receiving this notification, the block multiplexer channel takes steps to send the communication block to the designated direct destination mate. When transmitting data for relay, processing similar to MoM is performed.

Naturally, the final destination node name should not be changed.

〔Effect of the invention〕

As is clear from the above description, according to the present invention, inconsistencies in network information can be detected during normal communication processing.

[Brief explanation of the drawing]

Figure 1 shows an overview of the network system, Figure 2
The figure shows an example of the hardware configuration of a network system to which the present invention is applied, Figure 3 shows an example of a network information table used in the present invention, and Figure 4 shows a shortest communication route table. FIG. 5 is a diagram showing an example of the receiving process of the host computer, and FIG. 6 is a diagram showing the transmitting process of the host computer. A to E...Node, 1-A to 1-E...Host computer, 2-A to 2-E...Block multiplexer or channel, 3-A to 3-E...Duntaface Lu. Adapter, 4... Ring-shaped transmission line. Patent Applicant Fujitsu Ltd. Representative Patent Attorney Kyotani 4 parts 3 figures △ B Otsu E ' figure

Claims (1)

[Claims] A method for detecting contradictions in network information in a network own system comprising a plurality of nodes each having a network information table storing network information for determining a communication route, and a transmission path connecting the nodes, wherein each node , refer to the above network information table to create a shortest communication route table showing the shortest distance between nodes and the direct destination node, and when transmitting data to another node, refer to the above shortest communication route table. calculate the shortest distance and the direct destination node, add the shortest distance to the sending data, add the name of the other node mentioned above as the final destination node name, send it directly to the destination node, and when the data is received, make yourself the final destination node. Check whether it is the destination, and if you are not the final destination, refer to the shortest communication route Chiful above to get from your own node to the final destination node! The network is characterized in that the network is configured to determine the distance at and compare the distance with the distance added to the received data, and if the former is greater than the latter, recognize that there is a contradiction in network information. Information contradiction detection method.