JPS6361527A - Inter-node transfer routing system - Google Patents

Abstract

PURPOSE:To easily and quickly cope with the change of system constitution by providing network constitution information in a network and providing each node with a routing means which analyzes constitution information to redescribe the connection route from its own node to another as a tree structure and determines an outgoing path on a basis of this tree structure. CONSTITUTION:A connection route analyzing means 2a in a routing means 2 of each node analyzes network constitution information 1 to redescribe the connection route from its own node to another as a tree structure and preserves it as connection route information. An outgoing path selecting means 2b in the routing means 2 detects a destination node name as the transfer object of a network job or the like which occurs in the node. The connection route where the destination node appears in the lowest level is searched from preserved connection route information, and a transfer destination node is determined in the last step 53 on a basis of this connection route. Consequently, a required function is implemented by the minimum change of communication constitution in case a node is added to the network to transfer information.

Description

DETAILED DESCRIPTION OF THE INVENTION Object of the Invention Industrial Field of Application The present invention relates to an inter-node transfer routing method applied to a computer network system. In the above, it was necessary for the nodes to be transferred such as network jobs to declare in advance the same information as the communication connection information between the transfer nodes when initializing the job transfer management file.

Therefore, there is a problem in that when the system configuration is changed due to the addition of a node or the like, a significant change in the communication configuration is required.

Means for Solving the Configuration Problems of the Invention The inter-node transfer routing method of the present invention includes network configuration information that describes the network configuration in the network, and each node analyzes the network configuration information and By re-describing the connection paths from to each other node in a tree structure and by providing a routing means that determines the outgoing route based on this tree structure, the system is configured to be able to easily and quickly deal with changes in the system configuration. ing.

Hereinafter, the operation of the present invention will be explained in detail together with examples.

Embodiment According to one embodiment of the present invention, each node is provided with network configuration information 1 and routing means 2, as shown in FIG. The routing means 2 is comprised of a connection route analysis means 2a and an outgoing route determination means 2b.

The network configuration information 1 describes all the nodes of this computer network system and all the transmission paths connecting the nodes, and it is sufficient if there is one in common in the network.

In the computer network system including the nodes in FIG. 1, five nodes A, B, C, D, and E are connected in a loop, as illustrated in FIG. and F are connected oppositely to each node, and node F has five nodes E, G, H, ! , J are connected in a branch-like manner, a node L is connected to the node I in a facing manner, and a node M is connected to the node L in a facing manner.

Connection route analysis means 2 in the routing means 2 of each node
a analyzes the network configuration 117 report 1, rewrites the connection paths from its own node to each other node in a tree structure, and saves it as connection path information u.

For example, as illustrated in FIG.
Rewrite the connection route up to the tree structure and save it.

That is, as illustrated in the flowchart of FIG. 4, the connection path analysis means 2a first searches for the position of its own node from the network configuration information 1 in step 41. In the next step 42, the (first reher) node directly connected to the own node is extracted. Step 43
In this step, the n-th level node connected to the (n-1)th (n=2.3...) level node is extracted. At this time, the node extracted as the n-th level is made not to be included in the nodes of the n-th level from the second level leading to that node.

In step 44, if there is no node taken at the n-th level, the process proceeds to the next step 45, and if at least one node is taken, the process returns to step 43 to extract the next level node. In step 45, steps 41 to 4
The analysis results created in step 4 are saved.

The outgoing route selection unit 2b in the routing unit 2 refers to the connection route information stored by the connection route analysis unit 2a and selects an outgoing route every time an inter-node transfer target such as a network job occurs within a node. decide.

That is, as illustrated in the flowchart of FIG.
In step 51, the name of a destination node to which a network job or the like generated within the node is to be transferred is detected. In the next step 52, a connection route in which the destination node appears at the lowest level is searched from the saved connection route information, and based on this connection route, the transfer destination node (outgoing route) is determined in the final step 53. Ru.

Effects of the Invention As explained in detail above, in the inter-node transfer routing method of the present invention, each node analyzes network configuration information and re-describes the connection route from its own node to each other node in a tree structure. Since the configuration is equipped with a routing means that determines the outgoing route based on this tree structure, the minimum communication configuration is required when adding nodes to a network or transferring jobs etc. across several networks. The required functionality can be achieved by changing the .

[Brief explanation of drawings]

FIG. 1 is a conceptual diagram showing the configuration of a node to which an embodiment of the present invention is applied, FIG. 2 is a conceptual diagram showing an example of network configuration information, FIG. 3 is a conceptual diagram illustrating connection route information, and FIG.
FIG. 5 and FIG. 5 are flowcharts showing the processing procedure of the routing means. 1. Network configuration information, 2. Routing means, 2a. Connection route analysis means, 2b. Output route determination means. Figure 1 Figure 2 Figure 3 Figure 4

Claims (1)

[Claims] A network configuration is described in an inter-node transfer routing system in a computer network consisting of a group of nodes and loop-shaped, branch-shaped, and opposing transmission paths that connect these node groups. Network configuration information is provided in the network, and each node analyzes the network configuration information, re-describes the connection route from its own node to each other node in a tree structure, and determines the exit route based on this tree structure. An inter-node transfer routing system characterized by comprising a routing means for.