JP2655467B2 - Route determination method in autonomous decentralized path setting route search - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a path search method for setting a path used in a communication network composed of a plurality of multiplexers and transmission lines.

[0002]

2. Description of the Related Art Conventionally, in order to search for a path between a start node and an end node of a path, a path search message is first sent to all adjacent nodes having an available band on a connection transmission line, and the node receiving the message sends the message to the same node. , And repeatedly send a message to an adjacent node, and the route via which the message first reaches the terminal node of the path is set as the path setting route.

[0003]

However, in this conventional path route search method, even when a plurality of routes exist between nodes, the shortest route is always selected, so that the utilization rate of the transmission line is limited to a specific transmission line. There was a disadvantage biased toward.

Accordingly, an object of the present invention is to solve the above-mentioned drawbacks,
It is an object of the present invention to provide a path setting path search method for autonomously selecting a path setting path that equally uses transmission paths in a network.

[0005]

According to the present invention, there is provided a route determination system for autonomous decentralized path setting route search, which comprises a node which is a multiplexer for multiplexing a plurality of paths and a plurality of transmission lines. In the route search between the start node and the end node of the network, a route search message is sent from the start node to all adjacent nodes having an available bandwidth on the connection transmission path, and the node receiving the message sends the route search message in the same manner. In the autonomous decentralized route search method, by repeatedly sending the message to all adjacent nodes having an available bandwidth on the connection transmission path, and setting a route via the message that has reached the terminal node of the path as a path setting route,
A field indicating the integrated value of the message transmission line free space capacity and a field indicating the integrated value of the number of transmission lines are added, and each time the message is sent to an adjacent node, the added value is added and sent. Calculates the average transmission path free capacity of the path setting route from the via transmission path free capacity integrated value of the arrived message and the integrated value of the number of via transmission paths, and determines the passing route of the message having the largest average transmission path free capacity. By determining a path setting path, a path of a path that evenly uses a transmission path in a communication network is autonomously selected.

[0006]

Next, an embodiment of the present invention will be described with reference to the drawings.

FIG. 1 is a diagram showing a communication network for explaining an embodiment of the present invention. In the figure, 101 is the start node of the path, 102 and 103 are relay nodes, 104 is the end node of the path, 105 is a connection transmission path with a free capacity of 64 kbps, 106 is a connection transmission path with a free capacity of 32 kbps, and 107 is a connection transmission path with a free capacity of 64 kbps. Connection transmission line, 10
Reference numeral 8 denotes a connection transmission line having a free capacity of 128 kbps, and reference numeral 109 denotes a connection transmission line having a free capacity of 64 kbps.

FIG. 2 shows an example of a route search message 201 to which a field indicating a via-path integrated value and a field indicating a via-path integrated value are added. This message has a message header portion, a path ID, a start node number, an end node number, a via transmission path free capacity integrated value 202, and a via transmission path number integrated value 203.

In this embodiment, the starting node is set to the node 10
1. An example of a path connection in which the terminal node is the node 104 will be described.

First, the node 101 is connected to the connection transmission line 105.
, The free space is set to 64 kbps in the field 202 of the route search message 201, the number of via transmission lines is set to 1 in the field 203, and the route search message 201 is sent to the node 102.

Since the node 102 that has received the message is not the terminal node of the path, the node 102 searches for a connection transmission path having an available bandwidth in order to select a further path.

In the case of FIG. 1, the connection transmission line 106 is selected, the free space 32 kbps is added to the field 202 of the route search message 201 to set 96 kbps, and the number of via transmission lines 1 is added to the field 203 to set 2 Then, a route search message 201 is sent to the node 104.

Since the node 104 is the terminal node of the path, the path search for the path ends here, and the first path setting path 110 is searched.

Further, since the node 101 has connection transmission lines 107 and 108 having free bands, the same processing is performed to search for the second path setting path 111 and the third path setting path 112.

Table 1 shows the integrated value of the transmission path available capacity in the field 202 and the integrated value of the transmission path via the field 203 of the route search message 201 that has arrived at the node 104 which is the terminal node. Below.

[0016]

[Table 1]

Accordingly, the node 104 determines the third path setting path 112 having the largest average free capacity as the path path.

[0018]

As described above, according to the present invention, since the path setting path selection is performed while monitoring the average transmission path free space of the selected path, the path setting using the transmission paths in the network equally is performed. Route can be determined. With this function, the path for which the transmission delay needs to be set to the minimum can be allocated to the shortest path as before, and the other paths can be allocated from the path having the large transmission path free capacity, and efficient network operation can be performed. .

[Brief description of the drawings]

FIG. 1 is a diagram illustrating an example of a network configuration.

FIG. 2 is a diagram showing a route search message.

[Explanation of symbols]

 101 path start-end node 102, 103 relay node 104 path start-end node 105 free capacity 64 kbps connection transmission path 106 free capacity 32 kbps connection transmission path 107 free capacity 64 kbps connection transmission path 108 free capacity 128 kbps connection transmission path 109 free capacity 64 kbps connection transmission path 110 first path setting path 111 second path setting path 112 third path setting path 201 path search message 202 via transmission path empty capacity integrated value field 203 via transmission path number integrated value field

Claims (2)

(57) [Claims] 1. A path setting route search method in a communication network constituted by a multiplexing device, wherein a route search message is provided with a field indicating an integrated value of an available capacity of a route and a number of routes. Each time the message is transmitted, the transmission capacity is added to the available capacity of the transmission path and the number of transmissions, and the terminal node calculates the average transmission path free capacity of the path based on the added value,
Autonomous decentralized path setting path search characterized by determining the route of the message with the largest value as the path setting path, and autonomously selecting the path of the path that evenly uses the transmission path in the communication network. Route determination method in. 2. A method according to claim 1, further comprising the step of searching for a path between a start node and a terminal node of the path in a communication network constituted by a node which is a multiplexing device for multiplex transmission of a plurality of paths and a plurality of transmission paths. A route search message is sent to all adjacent nodes having a free band on the connection transmission path,
The node that has received the message repeats sending the message to all adjacent nodes having an available bandwidth on the connection transmission path, and sets the route via the message that has reached the terminal node of the path as the path setting path. In the distributed route search method, a field indicating the integrated value of the transmission path free space via message and a field indicating the integrated value of the number of via paths are added, and each time the message is sent to an adjacent node, the integrated value is added. The terminal node calculates the average transmission path free capacity of the path setting path from the integrated value of the via transmission path free capacity and the integrated value of the number of via transmission paths of the message that has arrived. By determining the route of the large message as the path setting route, the transmission route in the communication network is used evenly. Characterized by autonomously selecting the path of the path, the path determining method in a distributed path setting route search.