JP2972434B2 - Optimal route selection method for exchanges - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to an exchange and, more particularly, to the creation of a route table that is referred to when the exchange relays a call and makes a call to another station.

[0002]

2. Description of the Related Art Conventionally, this type of route table is registered as station data in advance, and every time a change occurs, the route table is rewritten from a system console or the like attached to an exchange.

[0003]

In this conventional route table creation, since it must be registered in advance as station data, every time a network configuration is changed or a trunk line is added, the route of all exchanges in the network is changed. The table must be rewritten from the system console. When the quality of the line temporarily deteriorates, the operator changes the route table at the discretion of the operator. For this purpose, the operator must constantly monitor the line. Therefore, the conventional method has a problem that the burden on the operator is large.

An object of the present invention is to provide an optimum route selection method for an exchange which grasps the configuration of a network and the state of a line, determines an optimum route, and creates and automatically updates a route table.

[0005]

According to the optimum route selection method for exchanges of the present invention, each exchange exchanges the network configuration by transmitting and receiving the configuration information of its own node, the quality of the trunk line, and the traffic volume between the exchanges. , The shortest number of switching stages is calculated, the optimum route is determined from the line quality of each route and the traffic volume, and a route table is automatically created.

[0006]

DESCRIPTION OF THE PREFERRED EMBODIMENTS Next, the present invention will be described with reference to the drawings. FIG. 1 is a network configuration diagram showing the flow of α and β of the line quality information when the line quality between the exchanges A and D is deteriorated. The exchanges A, B, C and D are connected. Α and β of the line quality information are notified to all exchanges in the network.

When the line quality falls below or exceeds the reference value, the state change is regarded as line quality deterioration or restoration, and the line quality information α and β are used. β is reported from the exchange A to all the exchanges B, C and D in the network. Further, in order to prevent the notification at the time of the state change from being missed, in addition to notifying the line quality of all the routes at a fixed period, the notification is also performed by adding traffic information.

FIG. 2 is a diagram showing an example in which the exchange A receiving the line quality information α from the exchange D selects an optimum route and creates a route table.

On the basis of the network configuration information L, M, N of the exchanges D, B, C shown in FIG.
The route between them is analyzed, and a route table Y is created in ascending order of the number of switching stages (the number of links). Next, the optimum route is analyzed from the shortest route based on the line quality and traffic information received at the time of a state change or periodically, and the pair D managed by the exchange A as shown in the route table X shown in FIG.
Change the network configuration information of the exchange. For the route a whose line quality has fallen below the reference value, the priority of the route table is set to the lowest, and the priorities of the routes b and c are moved up to create the optimum route table Z. The creation of the optimum route table is performed at the time of receiving the status change notification of the line quality and at a constant cycle time.

[0010]

As described above, according to the present invention, each exchange exchanges a network configuration information notification, a line quality notification, and a traffic notification to grasp the network configuration and the state of the line and determine the optimum route. , Can automatically change the route table.

[Brief description of the drawings]

FIG. 1 is a network configuration diagram showing a flow of various information when the line quality of a trunk line between A and D is deteriorated.

FIG. 2 is a diagram showing the creation of a route table of the exchange A when the line quality of the trunk line between A and D is degraded.

[Explanation of symbols]

A to D exchanges A to D α The line quality calculated by exchange D β The line quality calculated by exchange A X The pair D of exchange A after the line quality of the line (route a) from exchange D to exchange A is reduced Exchange network configuration information Y Route table of exchange A before the line quality of the line (route a) from exchange D to exchange A drops Z The line quality of the line (route a) from exchange D to exchange A Exchange A's route table after

──────────────────────────────────────────────────続 き Continuation of the front page (56) References JP-A-64-84954 (JP, A) JP-A-63-92148 (JP, A) JP-A-1-222556 (JP, A) JP-A 62-84 91049 (JP, A) JP-A-64-81443 (JP, A) JP-A-4-180498 (JP, A) (58) Fields investigated (Int. Cl. ⁶ , DB name) H04M 3/00 H04M 3 / 16-3/20 H04M 3/38-3/40 H04M 7/00-7/16 H04Q 3/54-3/56

Claims (1)

(57) [Claims] 1. By transmitting and receiving the configuration information of its own node, the trunk line quality, and the traffic volume between each exchange, each exchange grasps the network configuration, calculates the shortest number of exchange stages, and calculates the minimum number of exchange stages. An optimum route selection method for an exchange, wherein an optimum route is determined from the line quality and the traffic amount, and a route table is automatically created.