JPH01190046A - Routing information management system - Google Patents

Abstract

(57) [Summary] This bulletin contains application data before electronic filing, so abstract data is not recorded.

Description

[Detailed Description of the Invention] (Summary) Regarding a routing information management method for managing routing information to a destination, by defining route information separately within a PD with strong logical connections and outside of other PDs. , with the aim of simplifying management by sharing route information, the route information is divided into route information for the direct accommodation node that directly accommodates the terminal, and route information for other nodes to the direct accommodation node, It is equipped with a route search structure table that stores the corresponding route information, and in response to a notified network connection establishment request, the node that received the notification refers to the route search structure table held by the node and determines the route to the corresponding destination. , or find a route to a direct accommodating node toward the destination, and configure a call to be made to this found route.

[Industrial application field]

The present invention relates to a routing information management method for managing routing information to a destination.

[Problems to be solved by conventional technology and invention] Conventionally,
In the 031-compliant access law, all route information to the destination is written in the originating node.
In the network example shown in the figure, terminal T1 at originating node A
The route information to the destination is T+: (1)-it).In this way, the route information held by each node to the destination is combined to hold all route information, and there is no correlation between the information between each node. There was a problem in that it was not possible to share route information. Additionally, when adding terminal T8 as a new destination, it is necessary to individually add route information to this destination (terminal T8) at each node, which causes the problem that the addition process becomes complicated. .

In the present invention, in PDs with strong logical connections and in other Ps.
By defining route information separately for outside D, the purpose is to share route information and simplify management.

[Means for solving problems]

Means for solving the problem will be explained with reference to FIG.

In FIG. 1, the route search structure table 1 is 1-1
, l-2, etc., and a route search structure table 1-2 in a direct accommodating node that directly accommodates a terminal, etc.
and a route search structure table 1-1 for other nodes.

The route search structure table 1-2 stores route information in direct accommodation nodes that directly accommodate terminals.

The route search structure table 1-1 stores route information for nodes other than directly accommodated nodes.

The address analysis unit 1) analyzes the notified destination address (the address of terminal T, etc.) in response to a network connection establishment request notified from an application program, etc., and finds the corresponding main control table, etc. be.

The route search unit 12 finds a route to the destination based on the main control table etc. found by the address analysis unit 1).

(Operation) As shown in FIG. 1, the present invention defines route information by dividing it into a PD with strong logical connections and an outside PD. Diagram node A
The route information and destination information from the node A to the directly accommodated node are stored in the route search structure table 1-1 held by the node A, and the route information and destination information from the node A to the directly accommodated node are stored in the route search structure table 1-2 held by the directly accommodated node, for example, the node C in FIG. stores route information and destination information from the directly accommodated node to the terminal, and in response to the notified network connection establishment request, the address analysis unit 1) analyzes the notified destination address to find the main control table; The route search unit 12 finds a route to the destination based on the main control table and makes a call, thereby establishing the route to the destination.

Therefore, it becomes possible to share the route information in the node that directly accommodates the terminal with other nodes in the PD,
Centralized management of route information by the management host is easy (also, even if a terminal is added, only the route search structure table l-2 held by the directly accommodating node, for example, node C, that directly accommodates this terminal) After adding the route information, automatically notify each node in the PD that has this terminal as a destination that this terminal has been newly added, and add this terminal as a new destination. It becomes possible to have the

〔Example〕

Next, the configuration and operation of one embodiment of the present invention will be explained in detail using FIGS. 1 to 4.

In FIG. 1, the route search structure table 1-2 consists of P D (Pr
ivate Domain) to the outside from the terminal T
, etc. and route information for this destination are stored in the so-called direct accommodating node C that directly accommodates the terminal TI and the like. This route search structure table 1-2 uses a hash function to find the main control table corresponding to the destination terminal TI, and further finds possible outgoing routes ls based on this main control table.

The route search structure table l-1 contains the destination information held by node A (the address of terminal T, etc.) in PDs with strong logical connections, and the information to the above-mentioned directly accommodating nodes (node A1 node D) towards this destination. It stores route information. This route search structure table 1-1 uses a hash function to find the main control table corresponding to the destination terminal TI, and further finds the exit node number from the exit node number list 2 based on this main control table.
Further follow the pointer to find a possible exit! , etc.

The address analysis unit 1) analyzes a notified destination (address) in response to a network connection establishment request notified from an application scene program, etc., and analyzes a main control table (for example, a main control table T of a terminal T). ).

The route search unit 12 finds an outgoing route (route) to the destination based on the main control table found by the address analysis unit 1).

As mentioned above, route information is stored in PDs with strong logical connections.
By defining the inside and outside of the PD separately, each node within the PD can share the route information to the destination held by the directly accommodating node that directly accommodates the terminal outside the PD, This facilitates centralized management of route information by the management host.

Furthermore, even if a new terminal is added outside the PD, the route information corresponding to this addition only needs to be newly added to the directly accommodating node, and each node in other PDs only needs to add this destination information. If you do this, it can be easily generated automatically.

Next, the operation of the configuration shown in FIG. 1 will be explained in detail using FIGS. 2 and 3.

FIG. 2 shows an example of a network. In the figure, PD indicates an area containing nodes A to P with strong logical connections.
Outside D indicates other ropes, terminals T, etc. Terminal T outside of PD
, etc., for example, node C1
The node D is caused to hold terminal information (address) of the terminal T, etc. that it directly accommodates, and route information to the terminal T+, etc. On the other hand, other nodes in the PD, such as node A1 and node B, are made to hold destination terminal information and route information to the directly accommodating node leading to this destination terminal.

In FIG. 3, ■ indicates that, for example, the address of the destination terminal T is analyzed and the main control table T of the terminal T is found. This means that the notification of the network connection establishment request shown in FIG. The received address analysis unit 1) analyzes the notified address and uses the hash function to identify node A.
This represents finding the main control table T in the route search structure table l-1 in FIG. 1 held by .

■ in the figure indicates that it is determined whether the route expression describes a node number or a direct exit route.
If a node number is written (for example, in the case of node A in FIG. 2), execute the process (■) in the figure. If a direct outgoing route is described (in the case of a node directly accommodating a terminal, such as node C in FIG. 2), Φ in the figure is executed. This node C
A direct exit route is described in the possible exit route list 5 from the main FE control table T in the route search structure table 1-2 in FIG.

■ in the figure indicates that an exit route that can reach that node is obtained by the node number. This is, for example, the exit pointed to by the main control table T in the route search structure table 1-1 of node A in Figure 1. Node C in node number list 2
Follow the pointer sequentially from the list of possible routes 4-1! , represents obtaining.

0 in the figure indicates that a call is to be made. This means that a call is made to the exit route (for example, route!) obtained in ■ in the diagram, or if the exit route is written directly in ■ in the diagram, This call represents making a call to the described outgoing route (for example, route l1S), and this call causes node A to notify node C of information as shown in FIG. 4, for example. .

Through the above processing, a route is established from the node that issued the network connection establishment request to the direct accommodating node that directly accommodates the terminal outside the PD by sequentially writing the node numbers marked with ■ and ■ in the figure, and performing the processing with ■ and ■. , Further, in the directly accommodating node, by describing the direct outgoing route shown in (1) and (2) in the figure, and establishing a route from the directly accommodating node to the destination terminal through the process (2), it becomes possible to establish a connection.

Also, the terminal T! is shown using the dotted line in FIG. When adding a new terminal T8, the main control table of the terminal T8 is added to the route search structure table 1-2 in FIG. In addition, exit route i of possible exit route list 5 as route information
, is defined to point to . Then, by notifying other nodes in the PD, such as node A, that the node C has newly added the terminal T8, the node A stores the root search structure shown in FIG. As shown using a dotted line, the main control table T8 is added and pointed to.

As described above, a direct accommodation node that directly accommodates a terminal in a PD has terminal information and route information to this terminal, and other nodes in the PD have this terminal information and a route to this direct accommodation node. By separating and defining route information, a new terminal, for example, terminal T! , nodes other than the directly accommodating node need only write the newly added terminal information, and can share route information.

〔Effect of the invention〕

As explained above, according to the present invention, a direct accommodating node that directly accommodates a terminal in a PD is provided with route information to the terminal, and other nodes in the PD are provided with route information to this directly accommodating node. Since we have adopted a configuration in which route information is defined separately, other nodes can share the route information held by this directly accommodating node, and the management host centrally manages route information. This makes it easier. In addition, even if a terminal is added, route information only needs to be added to the directly accommodating node that directly accommodates this terminal, and only the terminal information needs to be added to other nodes, and the information will be added automatically. Processing becomes easier.

[Brief explanation of the drawing]

FIG. 1 is a configuration diagram of one embodiment of the present invention, FIG. 2 is an example of a network, FIG. 3 is a flowchart for explaining establishment of network connection subversion, and FIG. 4 is an example of notification information accompanying a call. In the figure, 1.1-1 and 1-2 are route search structure tables,
2 is the exit node number list, 4-15 is the possible exit route list, 1) is the address analysis section, and 7 examples of half-duplex data.

Claims (1)

[Claims] In a routing information management method for managing routing information to a destination, route information is divided into route information at a directly accommodating node that directly accommodates a terminal, and route information from other nodes to the directly accommodating node. , has a route search structure table (1) that stores the corresponding route information, and in response to the notified network connection establishment request, refers to the route search structure table (1) held by the node that received the notification. , the route to the appropriate destination,
Alternatively, a routing information management method is characterized in that a route to a directly accommodating node heading toward a destination is found, and a call is made to the found route.