JP2000106560A - Connection path revision system - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide the connection path revision system that can revise a path without the need for asking a terminal user to make a 2nd connection request in the case that a network manager or the like requires revision of a path for the connection used by the user terminal at present due to any reason. SOLUTION: Upon the receipt of a request of connection path change from a network manager, a signaling means 102 transmits a connection path revision message with individual identifier information of a concerned device or individual identifier information of all of undesired pass positions added thereto to a transmission terminal of concerned connections. When a start point node receives the connection path revision message, its signaling means 102 transmits a connection setting request message including information of a path up to an end node of the concerned connection based on a calculation result by a path calculation means 103 to an adjacent device on the path to set a new connection.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a connection route changing device, and more particularly to a connection route changing device capable of changing a route without requiring a terminal user to make a connection request again.

[0002]

2. Description of the Related Art As an example of a conventionally known network model, a private company has gathered in an interface protocol for setting a connection and is studying a global standardization specification for an asynchronous transfer mode (ATM) technology. One that uses a PNNI (Private Network-Network Interface) protocol defined by ATM Forum, which is one of the organizations, is mentioned. The PNNI protocol defines a routing technique for exchanging network topology information and a signaling technique for connecting a connection.

In a network using this PNNI protocol, conventionally, when a connection path is changed, a message (R
After the transmission of the ELEASE message, the connection must be set again.

When a failure has occurred, a RELEASE message is transmitted from the node that has detected the failure to the originating terminal and the destination terminal, and the node to which the terminal is connected is connected to the start node. Then, a procedure is taken again to secure another path and restore the connection by transmitting a connection setting request message (SETUP message) to the end point node again. Apart from this, there is also a procedure in which another path is set in advance for the currently used connection and then switched.

[0005]

However, when it is necessary to relocate the building housing the device, or temporarily concentrate on the location where the connection is located, the network management requires the connection. Conventionally, when it is desired to change the route for the connection in use when an unfavorable state such as concentration occurs, a RELEASE message is once generated,
That is, it is necessary to disconnect the connection, and there is a problem that the connection disconnection time is prolonged before the change of the route is completed even though it is not a failure.

Further, in order to change the connection path, it is necessary to give a switching trigger to the device (starting node) accommodating the calling terminal. In this method, it is necessary to specify the start node by managing all information in the network or transmitting a message that tracks the connection path by using a special message. The reason is that when the procedure in the event of a failure is used, the switching is performed based on the message that disconnects the actual connection. Because it does.

In the procedure for connecting and switching another route in advance, when searching for a start node, a search message or the like is transmitted, the start node is specified, and a connection is made again to that node. This is because a procedure for requesting a change is additionally required.

[0008] The present invention has been made in view of the above points,
Upon receiving a connection connection request from a terminal user based on the topology information exchanged between the devices, the device that has received the request calculates the route to the receiving terminal (source routing), and the network administrator etc. Provides a connection route changing device that can change the route of a connection currently used by a user when the route needs to be changed for some reason without requiring a terminal user to make a connection request again. The purpose is to do.

[0009]

SUMMARY OF THE INVENTION In order to achieve the above object, the present invention, when receiving a connection connection request from a terminal user based on topology information exchanged between nodes, accepts the request. A connection path change device provided in each of the nodes constituting a connection-oriented network using a protocol in which a node calculates a path to a terminating terminal and dynamically performs connection connection processing each time a request is made, A routing unit for performing a process for collecting a network topology, and receiving at least a connection connection request message, a disconnection request message, a connection completion message, and a connection route change message from the outside, and performing a process according to the received message. , Connect to the next node on the route Means for transmitting at least a connection connection request message, a disconnection request message, a connection completion message, and a connection path change message; a database storing a table of network topology information collected by the routing means; and a path calculation from the signaling means. When requested, based on database storage topology information,
A route calculation means for calculating a route to the destination node of the requested connection and adding the calculated route information to a connection connection request message transmitted by the signaling means; and Switching means for switching to the requested path, and when the signaling means receives a connection path change message from the outside, at least the starting node accommodating the originating terminal of the connection whose path is to be changed, at the point to be bypassed The configuration is such that a connection route change message including information is transmitted.

According to the present invention, when a node performing a route change receives a connection route change message for a route change from the outside transmitted from a network administrator or the like, a start point for accommodating the originating terminal of each connection. Since a connection route change message containing information on the location to be bypassed is sent to the node,
The originating node that accommodates the connection originating terminal can receive the connection route change message for this route change.

According to the present invention, in order to achieve the above object, a connection route change message including information on a location to be bypassed by a signaling means of a source node accommodating an originating terminal of a connection whose route is to be changed is received. When the signaling means is calculated by the route calculation means,
Based on the received information of the location to be bypassed and the storage topology information of the database, calculate the route to the destination node of the requested connection, and bypass the connection connection request message having the calculated new route information. This is configured to be transmitted together with the individual identifier information indicating the location.

According to the present invention, when a connection route change message for a route change is received at a source node accommodating a connection originating terminal, a route calculation is performed by using information of a location to be detoured provided. By
You can calculate another route.

[0013]

Next, embodiments of the present invention will be described with reference to the drawings. FIG. 1 is an overall configuration diagram of an embodiment of a connection route changing device according to the present invention.
In FIG. 1, the connection route changing device includes a routing unit 101, a signaling unit 102, a route calculation unit 103, and a switching unit 104, and includes a network topology information table as a database 111.

The routing means 101 performs a process for collecting a network topology. The collecting method is performed by using a protocol for exchanging information via a routing means of an adjacent device and a routing connection. Further, the topology information obtained here is stored in the topology information database 111.

The signaling means 102 processes various messages such as a request message (SETUP message) for connecting a connection from another device or a terminal, and a message (RELEASE message) for requesting disconnection. If the received message is a SETUP message and the route needs to be calculated, the route information is obtained by providing the information of the called terminal in this request to the route calculation means 103. Then, a SETUP message is transmitted to the next device on the route according to the route information.

Thereafter, a completion message (CONNECT) indicating that the connection connection has been completed is received from the direction of the receiving terminal.
), The setting of this connection is completed, and a CONNECT message is transmitted toward the calling terminal. If it is not necessary to perform route calculation in this device when the SETUP message is received, the processing for connection is performed by the signaling means 102 as it is, and the next device on the route is connected to the SETU.
The P message is transmitted. When the RELEASE message is received, a disconnection process is performed, and the RELEASE message is also transmitted to an adjacent device on the route.

The network administrator issues a connection route change request to the connection route change device having the above-described configuration that accommodates a connection whose route is to be changed. Alternatively, a connection path change request is made to the connection path change device to be relocated. At this time, if you do not want to connect in a certain range,
The individual identifier information of all the corresponding devices is given to the connection route changing device.

In the connection path changing apparatus, when a request for changing the connection path is made, the signaling means 102 for processing the connection connection within the apparatus itself is used.
To the originating terminal of the connection, or
A connection path change message is transmitted to the originating terminal direction (or bidirectional if the originating terminal direction is unknown) in all connections passing through the device. At that time, the message is provided with the individual identifier information of the device or the individual identifier information of all places that are not to be passed.

At the start node accommodating the originating terminal of the relevant connection, when the connection route change message is received, the signaling unit 102 calculates the route to the end node of the relevant connection by the route calculation unit 103. Based on the result, a new connection setting is performed by transmitting a connection setting request message (SETUP message) to a device adjacent on the route.

When requesting the route calculation means 103 to perform calculation, the individual identifier information included in the connection route change message is provided. This is to enable the route calculation unit 103 to perform calculations excluding the individual identifier information.

If the route cannot be completely calculated by this node so as to bypass the relevant location, this information is added to the SETUP message. Then, when a device on the route to the end point including the device for which a route change request has been received from the network administrator needs to perform detailed route calculation and manages a location that is not to be passed, The route calculation means 103 of the device calculates the route excluding the relevant part, and sets the route according to the information. Other devices that do not need to perform the route calculation add the individual identification information as they are and transmit the SETUP message.

That is, from the route calculation means 103, this individual identifier information has the same logical management group (Peer).
Group), and if detailed calculations excluding that point could not be made, SETU
The P message is attached with individual identifier information and transmitted. On the other hand, if they belong to the same Peer Group,
Since the calculation can be performed without the individual identifier information, it is not necessary to add this information to the SETUP message.

After that, a completion message (CO
When receiving the NNECT message), the switching unit 104 is requested to switch the connection.

The route calculating means 103 calculates a route to the destination device with reference to the topology information database 111. When the individual information identifier is simultaneously received from the signaling means 102, the own node
It is determined whether it belongs to the Group, and if it does, the route excluding this part is calculated. If the same P
If it does not belong to the eer Group, it notifies the signaling means 102 to that effect.

As an example of the route calculation algorithm, Dij which is known as an algorithm for obtaining a route having the shortest number of hops of a node or a minimum accumulation of a certain parameter from all the routes in the network is known.
For example, a kstra algorithm is used. The switching unit 104 performs a process of switching a connection to a newly secured path when a switching request is received from the signaling unit 102.

As described above, by making a connection change request to the device accommodating the connection whose route is to be changed, the start node of each connection is searched for and the route change request is not made. You can make changes. In addition, the individual identification information is
By providing the P message, a change path can be set. After the connection is established, the connection path is changed by switching to the original connection.

Next, the operation of this embodiment will be described in detail. First, before describing the points of the present invention, a method of connection connection and path switching in a network to which the present apparatus is applied will be described.

As an example of a specific network model,
An example using the PNNI defined in the ATM Forum is given below. First, an outline of the routing technique will be described. This processing is performed by the routing unit 101
It is performed in. The routing technology is based on the PNN shown above.
Performs processing based on I protocol technology. In this method, network topology information is exchanged by exchanging messages between a node and all adjacent nodes using a connection for exchanging routing information.

Here, if it is determined that the exchanged topology information is different from the topology information table of the own node and the information needs to be updated according to the PNNI rules,
Update. If it is necessary to transfer the received topology information to another node, it is transmitted. This operation is defined as a flooding process. By repeating this processing in all nodes in the network, the nodes can grasp information about what topology all the nodes have.

The state of the flooding process will be described with reference to the network shown in FIG. In FIG.
Six nodes (301, 302, 303, 304, 30
5,306) between the nodes 301
−302,301−304,302−303,302−
305, 303-304, 303-306, 304-3
05, 305-306 are assumed to be connected by a link. The terminals 311 and 312 are connected to the node 30 respectively.
1,306.

Here, when the node 303 recognizes the change in the topology, the information is notified to the nodes 302, 304, and 306 by the routing messages 321 to 323 in the first stage as shown in FIG. In the second stage, the nodes 301 and 305 are notified by routing messages 324 and 325.

In the PNNI, it is possible to simultaneously perform logical hierarchical management of a network. This means that some nodes are managed as one Peer Group, and this Peer Group is treated as one logical node in a higher hierarchy, and some collections of the logical nodes are again referred to as Peer Group. By repeatedly managing the peer group, logical hierarchy management can be performed for the entire network.

The logical node is the corresponding Peer
Group topology information is managed collectively. This makes it possible to grasp the topology of the entire network by exchanging a small amount of information even in a large-scale network when exchanging topology information in the network as described above.

This will be described with reference to a specific example of a network shown in FIG. In this example, nodes 420-44
5 belongs to any of Peer Group (PG) 401-408. This Peer Group 401-
408 is a logical node 450 to 45 of the higher level.
6,459. Further, the logical nodes are grouped as an upper Peer Group, and correspond to the logical nodes 457 and 458. These logical nodes are managed by one of the nodes at the lowest level. By way of example, FIG. 4 shows how the overall network configuration at node 420 looks. In FIG. 4, numerical values in angle brackets next to the reference numerals indicate hierarchical information, but have no relation to the gist of the present invention, and a description thereof will be omitted.

Next, the signaling technique will be described. This technique is realized by the signaling means 102. This technique also performs processing substantially based on the PNNI protocol technique. When a SETUP message is received from a calling terminal at a node (a starting node) to which the calling terminal is connected, the route calculating means 103 uses It can be obtained by calculating the route to,
This is a technique for setting a connection based on the route information.

This is possible because, by collecting the network topology by the routing technique, it is possible to grasp what kind of device is connected to this network and how. The connection is set by sequentially transferring the SETUP message according to the route information. In this route calculation, if the information is in the same Peer Group as the own node, all information can be known, so that a complete route can be calculated.
For the er Group, since the aggregated topology information is managed, the calculation of the complete route is not performed until the other Peer Group. In this case, the node (entry node) at the entrance of the corresponding Peer Group performs a detailed route calculation only inside the Peer Group, and finally complete source routing is possible.

This processing will be described with reference to FIG. 3 as a specific example. When the terminal 470 sets a connection to the terminal 471, a SETUP message is transmitted from the terminal 470 to the network. This SE
The node 420 that first receives the TUP message corresponds to an entry node of this network, and performs route calculation and the like. The node 420 can calculate the detailed route only in the same PeerGroup 401 and in the upper PeerGroups 409 and 411 to which this node belongs. That is, other Peer Gro
Since up can be specified only in the upper layer, detailed route calculation cannot be performed.

Therefore, in this example, Peer Grou
Route information in p401 [420-422-423]
And the route information [45] of the upper Peer Group 409
0-452-453], and the higher Peer Gro
It is assumed that the path information [457-458] of up411 has been obtained as a calculation result. The SETUP message is provided with the route information and is transferred based on the route information.

When the vehicle exits the peer group 401 and reaches the peer group 403, the node 427 corresponding to the entry node of the peer group 403 calculates a detailed route in the peer group 403 and transmits a SETUP message. By repeating the above, the SETUP message can reach the terminal 471 via the route shown by the thick line in FIG.

Next, a technique for performing the switching will be described. For this technique, the signaling means 10
2 and the switching means 104. The user sends a SETUP message from the calling terminal to the network. When a new connection is established, the entry node of the network assigns a unique connection identifier within the network to each connection.

Further, as for the connection that may be switched, the contents of the SETUP message are necessary when the SETUP message is transmitted again, and thus are retained as long as the connection exists. The connection identifier is for associating the connection of the old route and the connection of the new route at the end point node when setting another alternative route in the connection.

For example, in FIG. 5, it is assumed that there is a connection request from the terminal 511 to the terminal 512. At this time,
The node 501 performs route calculation, and the result is [50
1-502-503-506]. If there is a possibility that this connection will switch the path in the future, the node 501
The contents of the P message are retained, and a unique connection identifier
Forward the P message to node 502.

In the nodes 502 and 503 on the way,
When a SETUP message, which is a normal process, is received, a SETUP message is transmitted based on the route information.
Finally, the node 506 holds the connection identifier when receiving the SETUP message. Thereafter, when another detour path is set, the node 501
By adding the same connection identifier as the corresponding connection to the SETUP message for the bypass route and transmitting the SETUP message, the node 506 as the end node can determine which existing connection the new bypass route has been set to. Will be. When the contents of the connection identifier match, the switching is performed.

Although there is a method of switching at a node in the middle of the route, here, an example is shown in which the switching device is limited to the entry node and the exit node of the network. In this case, the selection of the switching node is made. Since there is no need to perform this, the processing procedure is simplified. The above-described route switching method is currently under study for specification in the ATM Forum.

Next, the operation of the embodiment of the present invention in the connection path changing apparatus which implements the above-described technology, particularly, the case where the path is already set and the path is changed will be described with reference to FIGS. 6 will be described in detail.

It is assumed that the network administrator wants to relocate the device to the already connected connection 480 or change the connection route for some reason. Here, it is specifically assumed that the node 429 is to be removed. In this case, the network administrator
Request the connection to change the route. In the signaling means of this node, the corresponding connection 4
A connection route change message to which the individual identifier information of the node is added is transmitted to the originating terminal direction of 80. Examples of individual identifier information include node addresses or node identifiers for nodes, and node addresses or identifiers at both ends for links between nodes, or link numbers uniquely assigned in the network. Is raised. When this message arrives at the source node, or node 420, containing the originating terminal of each connection, the node 420
The signaling means 102 requests a path change request to the path calculation means 103 together with the individual identifier information included in the connection path change message.

In the network topology information table 111, specifically, data indicating the nodes existing in the network and their connections, the service quality of each node or the link between the nodes (for example,
Cell transfer delay time), available bandwidth information, etc., and
When hierarchical management is performed, the hierarchical information is also held. This information is also taken into account when calculating the route.

The route calculation means 103 refers to the network topology information table 111 and determines whether or not the corresponding location is in the same Peer Group as the own node. If the corresponding node is the same Peer
If it exists in the Group, the network connection information in the network topology information table 111 includes
The route is calculated by applying the individual identifier information and deleting the corresponding part. If the corresponding node does not exist in the same Peer Group, the route calculation unit 103 notifies the signaling unit 102 of a notification that the corresponding location cannot be excluded as a detailed route, and FIG.
As shown in (1), information corresponding to the SETUP message is added and transmitted.

FIG. 6 shows an example of the format of a SETUP message (signaling message), which is composed of a message header 71 and information elements 72 to 75. The information element 75 is an individual identifier which is information of a place to be bypassed with the information element header 76. Information 77. The notification that the above-mentioned corresponding location could not be excluded as a detailed route is transmitted from the information element 72 to
74. Based on this information, the signaling means 102 transmits a SETUP message to the next device. At this point, no processing is performed on the original route. If a route that avoids the relevant location is not possible, that fact is notified.

Here, as the calculation result, [420-4]
21], [450-451], [457-59-45]
8] will be described below. The node 421 corresponding to the next node as a calculation result is the same Peer
Since the message belongs to the Group, the signaling means 102 in the node 421 receives the message,
Connection processing is performed, and according to the route information, S
Transfer the ETUP message.

If the Peer Group changes in the middle of the route, in this example, the node 425
When the SETUP message is received, it corresponds to the entry node of the Group 402.
It is necessary to calculate a route in r Group. At this time, the signaling means 102 of the node 425
Requests the route calculation unit 103 to perform the route calculation in the same manner as the start node 420. At that time, if there is information on a place that you do not want to go through, give it at the same time and request. Then, connection processing is performed based on the route information that is the result, and a message is transmitted.

By repeating this, the end node 4
Reach 42. At this time, the signaling means 102 of this node 442 performs connection connection processing, and as soon as the processing is completed,
Send an ONCONNECT message. At this time, the signaling means 102 of the node 442 performs switching with the connection originally used,
A request for switching is made to the second switching unit 104.

The switching means 104 disconnects the terminal node from the starting node of the original connection. Thereafter, the connection is switched by connecting the newly connected connection with the terminal side. CONN
In the signaling means 102 of the node in the middle of receiving the ECT message, the connection completion processing (for example, changing the state management for the connection in the device)
And send the CONNECT message to the starting node direction 4
20. Finally, this CONNECT
The message is sent by the signaling means 1 of the source node 420.
When it is received in 02, it requests the switching means 104 to perform switching. Then, the switching unit 104 disconnects the originating terminal side and the terminating terminal side of the original connection, and connects the originating terminal side to the newly prepared connection, thereby completing the connection path change. And the start node 420
Sends a RELEASE message to the connection on the old route.

In the end node, the switching may be performed when a RELEASE message for the last old route connection is received.

FIG. 7 shows an example of a message flow in the entire network at this time. This message flow shows a message flow after the node 429 receives a connection route change request from the network administrator.
The node 429 transmits a connection route change message to the originating terminal direction of the corresponding connection. In this case, the direction is the node 427. The node 427 similarly transmits a connection route change message to the direction of the originating terminal of the corresponding connection. Finally, the connection route change message reaches the node 420 which is the start node of the connection.

At this node 420, another route is calculated,
According to the result, the SETUP message is transmitted toward the end point node. In this case, the node 421 is the next node. The node 421 further transmits a SETUP message to the next node, the node 425. At node 425, the Peer Gro to which the user belongs
The route in the up is calculated, and a SETUP message is transmitted according to the result. In this example, it is node 426.

In this way, when the SETUP message reaches the end point node 442, this node 442
Then, the connection is switched to a new route. Thereafter, a CONNECT message indicating that the connection has been completed is sent to the source node 420. After receiving the CONNECT message, the source node 420 switches the route, and performs RELEAS for the original route.
The connection is deleted by transmitting the E message.

FIG. 8 shows a processing flowchart in each node at this time. This flowchart is an example of processing performed when an entry node that performs route calculation receives a SETUP message. Node is S
When receiving the ETUP message, first, Peer G
It is determined whether or not it is an entry node of the group (step 801). This determination is made using the address of the adjacent node connected to the received port and the like, and is compared with that of the own node, and is determined based on whether or not the node belongs to the same Peer Group. If they are different, it is determined that the own node is an entry node, and it is determined whether there is a portion corresponding to the individual identifier information (step 80).
2) If they are the same, determine that the node is not an entry node, and
An ETUP message transmission process is performed (step 80).
6).

If it is determined in step 802 that there is a location corresponding to the individual identifier information, it is determined that the location is present by requesting the route calculation means 103 to remove the location (step 802). 804). on the other hand,
Since there is no location corresponding to the individual identifier information in the PeerGroup to which the own node belongs, the route calculation unit 103 requests the route calculation unit 103 to perform a normal route calculation (step 803).

After the processing of step 803 or 804 is completed, it is determined whether or not a route is finally found (step 805).
An UP message is transmitted (step 806), and if no route exists, a RELEASE message is transmitted (step 807).

According to the present embodiment described above, FIG.
As in the example, when the connection is changed, the accommodation efficiency of the network can be improved. That is, FIG.
In (A) and (B), it is assumed that all links of the network including the nodes 901 to 906 are connected at 150 Mbps. Also, as shown in FIG. 9A, the route A connecting the node 901 to the node 902 to the node 903 is 70 Mbps, and the node 901 to the node 90
The route B connecting the 4-node 905 to the node 906 is also 70
It is assumed that a Mbps connection is connected.

At this time, as shown in FIG. 9A, when a request for a new connection of 100 Mbps is made on the path connecting the nodes 904 to 905, the connection between the nodes 904 and 905 becomes 170 Mbps as it is. Cannot be connected.

However, according to the present embodiment, the 70 Mbps connection route of the route B is changed to a connection route connecting the nodes 901-902-903-906 as shown in FIG. 9B. , So that nodes 901-902-9
03 is 140 Mbps, and a new node 90
4-Connection of route C of node 905 is 100 Mb
Since it is ps, all three can be accommodated, and the network utilization rate can be increased.

[0064]

As described above, according to the present invention,
When a connection route change message of a route change from the outside is received, a connection route change message including information on a location to be bypassed is transmitted to a source node accommodating the originating terminal of each connection, thereby establishing a connection. The originating node that accommodates the originating terminal of the connection receives the connection route change message of this route change, and the detour provided when the originating node that accommodates the originating terminal of the connection receives the connection route change message of the route change When a route connection is requested from a terminal user based on topology information exchanged between nodes, since a different route can be calculated by performing route calculation using the information of the desired location The source that calculates the route on the device that received this request Even in a connection-oriented network using a protocol that dynamically connects connections using the routing method, the network user must set up the connection from the terminal user again for the currently used connection. Route can be changed easily.

Further, according to the present invention, switching can be started without searching for a start point node, and when a route must be changed for construction or other reasons, or a network configuration needs to be changed. In such a case, and when the resource distribution of the connection fails and a certain connection can be successfully accommodated by moving, the path of the connection can be changed in a short disconnection time.

[Brief description of the drawings]

FIG. 1 is a configuration diagram of an embodiment of the present invention.

FIG. 2 is a diagram illustrating a flooding process according to the present invention.

FIG. 3 is a diagram showing a specific example of a network for explaining how to grasp the topology of the entire network.

4 is a diagram showing how the configuration of the entire network looks from a node 420 in FIG. 3;

FIG. 5 is an explanatory diagram for performing switching in the present invention.

FIG. 6 is a diagram illustrating an example of a signal format in which information corresponding to a SETUP message is added and transmitted.

FIG. 7 is a diagram showing an example of a message flow of the entire network according to the present invention.

FIG. 8 is an example of a processing flowchart in each node according to the present invention.

FIG. 9 is an explanatory diagram of an example in which a connection change is performed to increase the network accommodation efficiency.

[Explanation of symbols]

 DESCRIPTION OF SYMBOLS 101 Routing means 102 Signaling means 103 Route calculation means 104 Switching means 111 Topology information database

Claims (6)

[Claims] When a connection connection request is received from a terminal user based on topology information exchanged between nodes, the node that has received the request calculates a route to a called terminal, and every time there is a request, A connection route changing device provided in each of the nodes constituting a connection-oriented network using a protocol for dynamically performing connection connection processing, wherein a routing for performing a process for collecting a topology of the network is provided. Means for receiving at least a connection connection request message from the outside, a disconnection request message, a connection completion message, and a connection route change message, and performing a process according to the received message, and the connection connection request message to the next node on the route; Disconnect request A signaling means for transmitting at least a message, a connection completion message and a connection path change message; a database storing information on the topology of the network collected by the routing means as a table; and a path calculation request from the signaling means. When, based on the storage topology information of the database,
A route calculation unit that calculates a route to the end point node of the requested connection and adds the calculated route information to the connection connection request message transmitted by the signaling unit; and when there is a route switching request from the signaling unit. Has switching means for switching the connection to the requested path, and when the signaling means receives the connection path change message from the outside, at least the starting node accommodating the originating terminal of the connection whose path is to be changed, A connection route change device for transmitting a connection route change message including information on a portion to be bypassed. 2. When the signaling means of the source node accommodating the originating terminal of the connection whose path is to be changed receives a connection path change message including the information of the point to be bypassed, the signaling means performs The path calculating means calculates a path to the destination node of the requested connection based on the received information of the location to be bypassed and the storage topology information of the database, and the connection having the calculated new path information. 2. The connection path changing device according to claim 1, wherein the connection request message is transmitted together with individual identifier information indicating a location to be bypassed. 3. A connection change apparatus used in a network to which a protocol for hierarchically and repeatedly managing several nodes into one management group for logical hierarchical management of a network is applied. When the node indicated by the individual identifier information is a node belonging to the same logical management group as the own apparatus, the path calculation means of the node corresponding to the entrance of the management group includes a path excluding the node indicated by the individual identifier information. And transmits the connection connection request message by the signaling means, and when the node indicated by the individual identifier information is a node that does not belong to the same logical management group as the own device, performs a normal route calculation. The connection connection request message having the individual identifier information by the signaling means; 3. The connection path changing device according to claim 2, wherein the signaling means of the node other than the entrance of the management group transmits the received connection connection request message as it is. 4. The connection route changing device according to claim 3, wherein, as a result of the calculation by said route calculation means, when no route is found, said signaling means transmits said disconnection request message. 5. When the signaling means receives the connection route change message from the outside, it transmits a connection route change message containing information on a portion to be bypassed in both directions of the connection whose route is to be changed. The connection path changing device according to claim 1, wherein 6. The signaling means of an end node accommodating a terminating terminal of a connection for changing the route,
2. The connection path according to claim 1, wherein when the connection connection request message is received, a request for switching is made to the switching means, and the connection completion message is transmitted in the direction of a start node after connection connection processing is completed. Change device.