JPH0191596A - Line acquisition system for exchange - Google Patents

Abstract

PURPOSE:To reduce the processing quantity of an exchange at high traffic where the probability of all line busy state especially by providing a path state memory so as to decide immediately whether or not the line of each path is fully busy thereby reducing the search time. CONSTITUTION:A sender subscriber exchange is provided with a path selection table T storing the priority of selecting plural paths and a path state memory Mb representing whether or not plural lines belonging to each path is fully busy and the path to be selected according to the selected priority stored in the path selection table T is decided in the line acquisition of the sender subscriber line exchange. When the path state memory Mb corresponding to the path is not in the busy state display, the line of the relevant path is acquired and when the path state memory Mb is in the full busy display conversely, as to the path of the next order shown in the path selection table T, the line acquisition processing using the memory Mb is transited similarly. Thus, the time required for line acquisition is shortened and the processing quantity of exchange is reduced.

Description

[Detailed Description of the Invention] [Field of Industrial Application] The present invention relates to a circuit acquisition method in an exchange, and particularly to a communication network in which there are multiple routes and each route has multiple lines. This invention relates to a line acquisition method when setting up a line via .

[Conventional technology]

FIG. 4 is a diagram showing the configuration of this type of communication network, and when setting up a line between originating terminal A and terminating terminal B,
This is an example of a network configuration in which multiple routes exist. That is, between the originating local switch LSS that accommodates the originating terminal A and the terminating local switching LSD that accommodates the terminating terminal B,
There are a total of N routes: route 1 via transit exchanges TS+s and TS+o, route 2 via transit exchanges TS23 and TSzo, and route N passing through transit exchanges TSNs and TSND. Furthermore, each of the routes 1 to N includes a plurality of lines.

Therefore, in such a network configuration, when setting up a call path from originating terminal A to terminating terminal B, the originating local switch LSS selects one route from among N routes, and then It is necessary to select one available line from among the plurality of lines on this route.

By the way, in recent years the telecommunications business has been opened to the general public, and each route shown in Figure 4 has come to be operated by multiple carriers with different line quality and fee structures. There is now a need for a function to select the most suitable line when setting up a call route. In particular, from the perspective of subscriber services, the ability to select the cheapest line from multiple routes with different rates is important.
Such functions are LCR (Least Co5t Rou
ting), and has conventionally been realized using the configuration and procedure shown below.

First, regarding the configuration, if there are N routes each having a different fare system, a route selection table is provided that specifies the order in which routes are selected in descending order of fares. for example,
In Figure 4, route 1 has the cheapest fare, followed by route 2.
If the route N is the highest, the route selection table will have a configuration like the route selection table T shown in FIG.

Further, when each route has a maximum of M lines, a line status memory Ma shown in FIG. 5 is provided for each route in order to manage the idle/busy status of these multiple lines.

These route selection table T and line status memory Ma are provided in the exchange, and the line is set by selecting and capturing a line in the following manner.

That is, the originating local switch LSS that receives a connection request from the originating terminal A to the terminating terminal B refers to the route selection table T and line status memory Ma shown in FIG. Select the cheapest route using the procedure shown in . To explain specifically, first, in step 601, 1 is assigned to i, and an attempt is made to select the line of route 1 specified in the first position of the route selection table T in FIG. 5 (step 602).
), searches the line status memory Ma corresponding to route 1 (
Step 603). Next, in step 604, it is determined whether there is an idle line, and if there is an idle line, it is acquired, and the line status memory corresponding to the acquired line is set to a busy state (step 607), and the acquisition is successful. If all lines of route 1 are busy and cannot be selected, steps 604 to 60
5 and adds 1 to i, and then in step 606 i
Determine whether ≦N or i>N, and if i≦N, step 602
, and attempts to select the line of the route (that is, route 2) indicated by the next content in the route selection table T. The above procedure is repeated, and if all the lines up to the final content of the route selection table T (route N in this case) are busy, it is determined that the line acquisition has failed.

[Problem that the invention seeks to solve]

However, in the conventional line acquisition method described above, when selecting a line for the route specified in the route selection table T, the line status memory Ma is searched for an empty line, resulting in high traffic and As the busy rate increases, the time required to search the line status memory Ma also increases, increasing the processing time of the exchange. Particularly, when the line to be selected is all busy, the search process for the line status memory Ma has the disadvantage that it becomes an invalid process.

SUMMARY OF THE INVENTION An object of the present invention is to provide a line acquisition method for an exchange that can shorten the time required for line acquisition and reduce the processing amount of the exchange.

[Means for solving problems]

The present invention is an exchange for setting up a line between one subscriber line exchange and another subscriber line exchange via a communication network in which there are a plurality of routes and a plurality of lines in each route. In the line acquisition method, a route selection table storing the selection order for selecting the plurality of routes and a route status memory indicating whether all the plurality of lines belonging to each route are busy are provided in the exchange. When the subscriber line exchange on the originating side acquires a line, the route selection table and the route status memory are used to determine the route to be selected according to the selection order of the route selection table, and to determine which route to select. Depending on whether or not the route status memory corresponding to the route indicates that all lines are busy, the line is captured on the selected route, but the line is captured on the route below the next rank indicated by the route selection table. It is characterized by deciding whether to migrate.

[Effect]

The originating subscriber line exchange is provided with a route selection table that stores the order of selection of multiple routes, and a route status memory that indicates whether or not all of the multiple lines belonging to each route are busy. When acquiring a line at the originating subscriber line exchange, the route to be selected is determined according to the selection order stored in the route selection table, and the route status memory corresponding to that route is displayed during all calls. If not, the line for that route will be captured, and if the route status memory shows all busy, the line using the route status memory will be captured for the next route indicated by the route selection table. Shift to capture processing.

〔Example〕

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

1 to 3 show an embodiment of the present invention. The configuration of the communication network to which the line acquisition method of this embodiment is applied is the same as that of FIG. 4 used in the conventional example. In order to solve the problems shown in the conventional example, in this embodiment, as shown in FIG. As shown in FIG. 1, a route status memory Mb is provided which indicates whether a plurality of lines (M lines in the example of FIG. 1) in each route are all busy.

This route status memory Mb is used as follows when setting up a line.

In other words, when a route is determined according to the selection order stored in the route selection table T, if the route status memory corresponding to that route does not display all busy, the lines of that route are captured and all When the busy display is displayed, it is determined whether or not the all-busy display is displayed for the next route, and the line is captured for the route that is not displayed as the all-busy display.

In this way, in this embodiment, the originating local line exchange LSS
In a communication network where there are multiple routes 1 to N when setting up a line between the LSD and the LSD of the local switch on the originating side, the order of selection of multiple routes is stored in the LSS on the originating side. A route selection table T and a route status memory Mb indicating whether or not all of the plurality of lines belonging to each route are busy are provided. The route to be selected is determined according to the selection order stored in When the all-busy display is displayed, the line is captured for the next route indicated by the route selection table T using the selection method described above.

Next, an example of a procedure for acquiring a line using the route status memory Mb will be explained with reference to FIG.

In addition, in FIG. 2, steps 201, 202゜20
4 to 206 are steps 60L in FIG. 6 602.60
It is the same as 4-606.

First, as in the conventional example, when receiving a connection request from originating terminal A to terminating terminal B in the communication network shown in FIG. An attempt is made to select the first specified route 1 line, but this process ends by simply checking the route status memory corresponding to route 1 (step 203 in FIG. 2). That is, if the route status memory indicates that all lines are busy, the value of i is immediately increased and an attempt is made to select the line for the next route (route 2 in the example of FIG. 1) (steps 204 to 206). .

As a result of step 203, if there is an idle line, this line is captured and the line status memory is set to busy (step 207).

Next, check the line status memory to determine whether or not the current selection has made all lines in this route busy. If all lines have become busy, the route status memory will also display all busy lines. and the acquisition is successful (steps 208 to 2 in Figure 2).
10).

In the case of the conventional method, when selecting and setting a line, the line status memory is searched each time to find an empty line among multiple (for example, M) lines on that route, so it takes a long time to acquire the line. In contrast, in this method, the route status memory immediately determines whether all lines in each route are busy, or in other words, whether line setting is impossible or whether line setting is possible when there are free lines. Therefore, the search time for the line status memory can be shortened accordingly.

FIG. 3 shows the line release procedure. When releasing a line, as shown in FIG. 3, the line status memory corresponding to the line to be released is displayed as empty (step 301), and the route status memory corresponding to the route of that line is also displayed as empty (step 30).
2). This makes it possible to cancel the all-busy display in the route status memory.

〔Effect of the invention〕

As explained above, according to the present invention, by providing a route status memory, it is possible to immediately determine whether all lines of each route are busy, so the search time can be shortened compared to the conventional method. Particularly, the processing amount of the exchange can be reduced during high traffic times when the probability that all lines are busy is high.

[Brief explanation of the drawing]

FIG. 1 is a diagram showing the configuration of each table used in an embodiment of the present invention, FIG. 2 is a diagram showing an example of a line acquisition procedure, FIG. 3 is a diagram showing an example of a line release procedure, and FIG. 4 is a diagram showing an example of a line release procedure. FIG. 5 is a diagram showing an example of a communication network to which the present invention can be applied; FIG. 5 is a configuration diagram of a table used in the conventional method; and FIG. 6 is a diagram showing a line acquisition procedure in the conventional method. T... Route selection table Ma... Line status memory Mb... Route status memory A... Originating terminal B... Destination terminal LSS... Originating Side subscriber line switch LSD... Destination subscriber line switch TS+s, TS+a, 'r'Szs, TSzo
, '・'TSNs, TSNo... Trunk switch agent Patent attorney Yuki Iwasa Figure 2 Figure 4 T route selection diful Ma line status memory □Total 1
No.5 Figure 6

Claims (1)

[Claims] (1) An exchange for setting up a line between one subscriber line exchange and another subscriber line exchange via a communication network where there are multiple routes and multiple lines exist in each route. In the line acquisition method, the exchange is provided with a route selection table storing the selection order for selecting the plurality of routes, and a route status memory indicating whether or not all the plurality of lines belonging to each route are busy. , When the originating subscriber line exchange performs line acquisition, the route selection table and route status memory are used to determine the route to be selected according to the selection order of the route selection table, and to Depending on whether or not the corresponding route status memory shows all busy, the line is captured on the selected route, or the line is captured on the next or lower route indicated by the route selection table. A circuit acquisition method for an exchange, which is characterized in that it determines whether to