JPH104405A - Method for managing path information of network - Google Patents

Abstract

PROBLEM TO BE SOLVED: To reduce the storage capacity of path information by storing only required path information and eliminating duplicate path information through link processing. SOLUTION: When a call processing unit 1 receives a call notice, the processing unit references path information stored in a path information storage section 4. When the path information is not stored, a path information generator 3 generates path information. The generated path information is stored in the path information storage section 4. The path information is used for succeeding call processing. However, after lapse of a preset period, the path information is automatically deleted. Furthermore, the path information is deleted when a network topology is changed. The path information is generated for each layer and linked.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a network route information management method for efficiently generating and managing route information when a call is generated in a network.

[0002]

2. Description of the Related Art When a terminal connected to a network is connected to another terminal for communication, a call setting process for setting a communication path on the network is performed in advance.
Such a call setup procedure includes a process of transferring necessary route information to a node on a route to be set or a terminal on the receiving side. In a network adopting such a method, a route where a call frequently occurs in advance is
The route information is generated and stored, and is transferred to a receiving terminal or the like at the time of call setting (PNNI (Pr.
ivate Network-Node Interface)).

[0003]

The conventional route information management method as described above has the following problems to be solved. When generating the route information in advance or periodically and transmitting the route information to the receiving side,
Generating such route information intensively increases the load on each node. Therefore, in the case of a large-scale network having many nodes, the response of the call setting process may be delayed during that period. Further, in a network in which a cluster including an arbitrary number of nodes is set and the cluster is hierarchized, each node holds internal path information for setting a path inside each cluster. On the other hand, in order to set a route to a node of another cluster,
It is necessary to have path information including path information inside its own node. That is, if a large amount of route information for transferring to a destination is set in each cluster at the time of call setting, such redundant information wastes memory. .

[0004]

The present invention employs the following structure to solve the above problems. <Structure 1> When a node group forming a network is a set of clusters including an arbitrary number of nodes, and each cluster is a logical node, a higher-level cluster including an arbitrary number of logical nodes If necessary, set a cluster including an arbitrary number of higher-order logical nodes in the same manner and hierarchize the network. When a call occurs, any one of the nodes inside the cluster is set. Is stored in the node of the call setting request source for a certain finite period, and when a call is generated thereafter, the route is established using this route information. To manage network routing information.

<Description> The network includes various communication paths for transmitting signals. A node refers to a device such as an exchange that relays a transmission signal on a network. When a call is generated, it means when there is a call setting request. When a call is generated, a route selection is performed as to which node of each cluster transmits a signal. The route established at this time is stored in the call setting source node. The reason why the route information is stored for a certain finite period is that if the information is stored for a long period of time, adverse effects may occur. The finite period is arbitrary and may vary from node to node. If the route information stored in this way is used for call setting when a subsequent call is generated, the processing load is reduced.

<Structure 2> In structure 1, the call setting request source node transmits the path information to a specific logical node designated as the destination in the upper-level cluster to which the call setting request source node belongs. A route information management method for a network, wherein route information inside a cluster and route information inside each higher-level cluster are linked and stored by a pointer.

<Explanation> The call setting request source node stores the route information. In this configuration, the route information is configured not to overlap. That is, a cluster exists for each hierarchy in a route to a specific logical node designated as a destination in a higher-level cluster. By linking the path information of these clusters and the path information inside the own cluster, necessary path information can be generated. At this time, the route information inside each cluster is put together and linked by a pointer. By doing so, the path information in the cluster to which the node belongs stored in the call setting requesting node can be shared with any other path information using the pointer. Accordingly, there is an effect that a small storage amount for storing information is required. The format of the route information and the format of the pointer may be freely selected.

<Configuration 3> In the configuration 1, a route information management method for a network, characterized in that when a change occurs in the topology of the network, the route information is deleted from the corresponding cluster.

<Explanation> If the route information is used at the time of subsequent call setting, a quick call setting process can be performed. The past route information is useless when
On the contrary, adverse effects such as incorrect connection are caused. Therefore, a change in the topology is detected and the route information is positively deleted.

[0010]

DESCRIPTION OF THE PREFERRED EMBODIMENTS Embodiments of the present invention will be described below using specific examples. <Specific Example> FIG. 1 is an explanatory view of the method of the specific example 1. Before describing this diagram, the configuration of a hierarchical network to which the present invention is applied will be described. FIG. 2 shows an explanatory diagram of hierarchization. As shown in this figure, for example, a terminal X or a terminal Y is connected to the network. Then, the network is configured as shown in FIG. 1.1-B. It is composed of a number of nodes such as 2.3. Each of these nodes is a cluster 1 in which an arbitrary number of nodes are put together.
1, 12, 13, and 14. When the clusters 11 to 14 are the physical clusters of the hierarchy 0, the hierarchies are performed on the assumption that these clusters are logical nodes. Therefore, the cluster 11 has a logical node A. 1 and the cluster 12 is the logical node A.1. It becomes 2. As a result, a logical cluster group of the hierarchy 1 is formed above the hierarchy 0. Tier 1 is the cluster 15,1
6. Similarly, these clusters 15 and 16 are regarded as logical nodes A and B, respectively, and are included in the cluster 17 in the higher hierarchy 2. That is, the cluster 15 is a logical node A,
The cluster 16 is a logical node B, and the cluster 1
7

Here, the real node A. shown in the hierarchy 0 1.1-B. 2.3 incorporates a device as shown in FIG. That is, each node is provided with a call processing device 1, a route information management device 2, a route information generation device 3, a route information storage unit 4, and a storage period setting unit 5. Each node performs a call setting process as follows. The processing procedure is represented as S1 to S5 in FIG.

First, in step S1 of FIG. 1, when there is a call notification to the call processing device 1, in step S2, the route information management device 2 performs a process of acquiring route information. The route information management device 2 stores the route information storage unit 4 in advance.
Is inquired as to whether there is corresponding route information, and if not, a route information generation request is made to the route information generating device 3 (step S3). The route information generation device 3 generates route information necessary for setting a route from the terminal accommodated in this node to the terminal of the other party by a procedure described later. Then, call processing is executed in accordance with the route information, and in step S4, the route information is stored in the route information storage unit. The route information thus stored is read and used when a call having the same content is generated again thereafter. Thereby, the load on the route information generating device 3 is reduced.

On the other hand, if route information is accumulated each time a call is generated, a large amount of route information including unnecessary ones must be stored in the route information storage unit 4. Therefore, in this example, the storage period setting unit 5 is provided, and the route information after a certain period is automatically deleted. Thus, the purpose of appropriately reducing the storage capacity of the route information storage unit 4 is achieved. Note that the storage period is selected to an optimal value in consideration of the traffic amount of the node and the like. Therefore, a different storage period may be set for each node.

Next, a specific procedure for generating route information by the above-described route information generating device 3 will be described. FIG. 3 shows clusters 11, 15, and 17 as a route information generation model. Here, for example, the nodes A. 1.
A description will be given of a case where route information from node 1 to the node B of the cluster 17 is generated. FIG. 4 is a flowchart showing the operation of the route information generation procedure. In step S1 in the figure, first, it is confirmed whether or not there is route information to B in the cluster 17. If it is determined that the file does not exist, step S2
Then, the process proceeds to step S3, where the cluster 15 in the hierarchy one level lower than the cluster 17 to which the target node B belongs is referred to. In order to reach the destination node B, the node A. from the entrance to the exit of the cluster 15. 1-A. Check whether there is route information between the two.

In step S4, it is determined whether or not the node A. exists in the cluster 15. If it does not exist, the process proceeds to step S5. 1 to A. A.2, which is an exit node in the cluster 11 for going to A.2. Check the route information up to 1.3.
If this path information does not exist, the process proceeds from step S6 to step S7, and first, path information inside the cluster 11 is generated. When the path information inside the cluster 11 is obtained in this manner, the process proceeds to step S8, and the next higher-level cluster 15 sets A.P. 1 to A. 2 is generated, and the route information from A1.1 to A.2 is generated. Link with the route information up to 1.3. The link method will be described later. Further, step S9
Generates the route information from A to B in the cluster 17 higher than the cluster 15. Link with the route information to 2. The generation of the route information is performed by the transmitting terminal X.
Node A. 1 is executed in the route information generating device 3 shown in FIG.

FIG. 5 is an explanatory diagram of the data structure of the path information generated in this way. As shown in FIG.
Is the node A. in the cluster 11.
1.1 to A. 1.2 and A. It is displayed and stored so as to go to 1.3. Further, on the other hand, the route information of layer 1 is generated in the manner described above, and the destination is A. 2
The path information from A1 to A2 inside the cluster 15 in the case of, and a pointer for linking the path information to the path information of the tier 0. The route information of layer 2 is
A to B inside the cluster 17 when the destination is B
, And pointers for linking to the layer 1 path information. The link (1)
Is the target value A. 2 and the exit node A.2 of the hierarchy 0. 1.3 shows the link of the route information to 1.3. The link (2) includes the route information to the target value B of the hierarchy 2 and the exit node A.1 of the hierarchy 1. This is a link of the route information to No. 2.

That is, the nodes A. The route information storage unit 4 as shown in FIG.
For example, the route information of the hierarchy 0 shown in FIG. 5 is stored in advance. When the route information for the logical node B shown in FIG. 3 is newly generated, the layer 1 shown in FIG.
And the route information of layer 2 are separately generated and linked by pointers. As a result, Tier 0
Can be used by freely linking with other route information, and there is no need to store the route information redundantly. Therefore, the storage capacity of the route information in the route information storage unit 4 can be reduced.

FIG. 6 is an explanatory diagram of the method of the second embodiment. In this specific example 2, a different procedure of deleting the route information from the specific example 1 will be introduced. That is, the topology state monitoring device 6 is provided in the node shown in the figure instead of the storage period setting unit 5 shown in FIG. The topology state monitoring device 6 is for detecting when a change occurs in the topology of the network, that is, when a change in the configuration that affects the route selection of the network occurs. When a change occurs in the topology, the route information stored in the route information storage unit 4 is deleted. This is because if a change occurs in the topology, the previous route information cannot be used, and if used incorrectly, an erroneous connection occurs. In this case, the deletion target may be only the route that passes through the portion where the topology has been changed. Therefore, for example, when no topology change has occurred in the own cluster, the route information in the own cluster is stored as it is, and the route information in a higher-level cluster linked to this is deleted.

In this way, the route information is deleted at an appropriate timing, the load on the call processing due to the accumulated route information is reduced, and the data can be optimized and managed without duplication. Note that a plurality of pieces of route information for the same destination may be generated and stored as described above.
This makes it possible to set another route as a detour when a certain route has a fault. Either or both of the storage period setting unit and the topology state monitoring device may be provided.

[Brief description of the drawings]

FIG. 1 is an explanatory diagram of a method of a specific example 1.

FIG. 2 is an explanatory diagram of hierarchization.

FIG. 3 is a route information generation model.

FIG. 4 is a flowchart showing a route information generation procedure.

FIG. 5 is an explanatory diagram of a data structure of generated route information.

FIG. 6 is an explanatory diagram of a method of a specific example 2.

[Explanation of symbols]

 REFERENCE SIGNS LIST 1 call processing device 2 route information management device 3 route information generation device 4 route information storage unit

Claims (3)

[Claims] 1. A high-level cluster including an arbitrary number of logical nodes, wherein a node group constituting the network is a set of clusters including an arbitrary number of nodes, and each cluster is a logical node. In the same way, if necessary, a cluster including an arbitrary number of higher-order logical nodes is set to form a hierarchical network, and when a call is generated, one of the clusters is set inside the cluster. The route established via the node is stored for a certain finite period at the call setting requesting node, and when a call is made thereafter, the route is established using this route information. Network routing information management method to be. 2. The call setting request source node according to claim 1, wherein the call setting request source node transmits the path information to a specific logical node designated as a destination in the higher-level cluster to the cluster to which the call setting request source node belongs. A path information management method for a network, characterized in that the path information inside the network and the path information inside each high-order cluster are linked by a pointer and stored. 3. The network routing information management method according to claim 1, wherein when a change occurs in the topology of the network, the routing information is deleted from the corresponding cluster.