JPH0294755A - Minimum fare route selection method - Google Patents

Abstract

PURPOSE:To provide flexibility to the selection of the minimum charge path selection system by allowing a selection using call count means for each channel to select each path in a desired operating rate in advance in response to a path offering minimum charge and the selection and number of use of a table for each path offering non-minimum charge used sequentially. CONSTITUTION:In the case of deciding a path offering a minimum charge in a private branch of exchange, when a dial number 0-45-881-1221 of a general NTT company is dialed by one telephone set 1, the dial is received by an extension interface circuit 2 and stored in a memory 6 via a switch 3 and a processor 5. The processor 5 calculates which NCC line is to be used to offer the minimum charge as to toll stations of the dial number stored in the memory 6, an item number 00AB designating the NCC circuit offering a path of the minimum charge is added and a numeral dialing is sent to the NTT exchange 7 from an office line trunk 4 to use selectively a prescribed NCC circuit shown in common carrier exchanges 8, 9.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a method for selecting a minimum charge route for a private branch exchange using a storage program control method.

[Conventional technology]

As a minimum charge route selection method for long distance calls, 1 Nikkei Communication'/No. 32 (1987, 7° No. 20)
As described on pages 73 to 76, only the common carrier line of the route calculated to have the lowest charge is used.

[Problem to be solved by the invention]

In the prior art minimum charge route selection method, the route with the lowest charge under certain conditions (one call time, one call time, destination destination, etc.) is always selected from among a plurality of common carrier lines. However, with regard to the selection and usage conditions of multiple common carrier lines, simply aiming for the lowest charge may be more expensive than practical.

In other words, although the principle is to select the lowest fare route, it may be necessary to select and use non-minimum fare routes at a certain rate due to capital and business partner relationships. An object of the present invention is to enable selective use of the non-minimum fare routes at a preset rate in order to support the above-mentioned functions.

[Means to solve the problem]

In addition to the conventional function of finding the lowest fare route, the above-mentioned purpose is to count the number of times the corresponding route is selected.

A non-minimum fare route table is provided in which routes other than the lowest fare route are selected and used, and the non-minimum fare routes set in the non-minimum fare route table are sequentially selected from the lowest fare route according to the number of times corresponding to a preset ratio. This can be achieved by selecting and using the route.

In reality, the function can be realized by combining the table for determining the minimum fare route with the non-minimum fare route table information to form one table, and alloting the routes to be selected sequentially according to the number of selections.

[For production]

The means and function of selecting the lowest fare route are well known and will not be discussed here.

The means for counting the number of selectively used calls for each applicable route is a general PBX.
It can be counted in the same manner as the traffic for each route in the PBX, and serves as usage status data for selectively using each common carrier line at a rate desired by the PBX operator. In addition, the table of least toll routes and non-minimum toll routes to be used sequentially will be displayed depending on the selection and number of times each route is used.
It is stipulated in advance that each route should be selected according to the desired usage rate.

〔Example〕

Next, one implementation example of the present invention will be described.

FIG. 1 shows the overall configuration to which the present invention is applied, and a telephone indicated by Tel 1 is housed in a private branch exchange. 2 to 6 are elements constituting the private branch exchange,
2 is the LIF, that is, the interface circuit with the extension telephone;
3 is an exchange switch, 4 is a central office trunk for connection to the NTT exchange network, 5 is a processor of the private branch exchange, and 6 is a memory for storing programs and data tables corresponding to the processor. Also, 7 is N T
8 and 9 respectively indicate the exchanges of NCC (New Class 1 Telecommunications Carrier). is done as follows: First, dial the general NTT dial number (for example, 0-045-881) at Tel 1.
-1221). This dial information is received at the LIF indicated by 2 and stored in the memory at 6.

PR3 of 5 calculates which NCC line to use for the out-of-town area of the dialed number stored in 6 has the lowest charge, and specifies the NCC line of the route with the lowest charge. In the example in Figure 1, add 0OAB) to 4
A number is sent from COT of 7 to NTT of 7, and a predetermined NCC line indicated by 8 or 9 is selectively used.

An example of a method for determining the lowest fare route within a private branch exchange is shown in the second section.
This will be explained using the diagram and FIG.

FIG. 2 is stored in the memory indicated by 6 in FIG.

This is an example of a dialed number analysis table, and the first stage LCR
The table named TBL is indexed by the first two digits of the area code part of the dialed number.

(In the example in Figure 2, the address of 045TBL is obtained by indexing with 04.) The table named 04TBL in the second stage is a table that is indexed with the third digit of the area code on the dial. The table named 045TBL in the second row is indexed by the time of the call, such as daytime, nighttime, or late at night, to find the route number (RTN) with the lowest fare. The lowest fare route "RT N " corresponding to the long distance dial number "045" obtained in FIG. 2 is determined by the RTNTBL stored in the memory in FIG. By indexing it, it is converted into an additional number (for example, 0OAB or 0OCD) corresponding to "RT N ", and is added to the beginning of the dialed number sent to NTT as described above.

Next, functional implementation examples of the present invention will be explained using FIGS. 4 to 8 and FIG. 9. "RTN" shown in Figures 4 to 7
MDF” “MRTNC3T” “MRT N T
”, “M A The RTNMDF table is used by adding one stage during the procedure for calculating the additional number in Figure 3 from ``RTN'' calculated in Figure 2, and is used by adding one stage during the procedure to calculate the additional number in Figure 3. R
Provided for TN.

The MRTNCNT table in FIG. 5 is a table indexed by 'MRTN' taken out from FIG. 4, and is a counter that calculates the number of selections for each detour.
The RTNT table is indexed in the same way as in FIG. 5, but the contents of the table are such that the selection and usable number of times for each detour route are set in advance.

The MAX table in FIG. 7 shows the sum of the minimum toll route and the non-minimum toll route to be detoured, and also shows the size of each table in FIGS. 4 to 6. FIG. 8 shows a detour counter.

FIG. 9 also shows a logical example of a program stored in the memory shown at 6 in FIG. 1, and can be easily realized using program logic. Logic of Figure 9 and Figure 4~
Based on the data table shown in FIG. 8, the minimum toll route determined in FIG. 2 is selected and replaced with a plurality of non-minimum toll routes at a predetermined ratio.

Not only the lowest fare route before being reselected, but also the non-minimum toll route that has been reselected is converted into an additional number to be sent to NTT by indexing RTNTBL in Figure 3. This is the same as the minimum fare route selection explained using the diagram.

〔Effect of the invention〕

According to the present invention, while joining multiple NCC line networks and using the lowest rate route selection function of a private branch exchange, on the other hand, due to capital relationships and business partner relationships, a predetermined percentage of routes other than the lowest rate route are selected. This has the effect that route selection can be performed automatically.

[Brief explanation of drawings]

FIG. 1 is an overall configuration diagram of one embodiment of the present invention, FIGS. 2 and 3 are table configuration diagrams of an example of conventional means for realizing the lowest fare route selection, and FIGS. 4 to 8 are diagrams of the present invention. FIG. 9, which is a table configuration diagram of an example of implementing the invention, is a logical example of implementing the invention using the tables shown in FIGS. 2, 3, and 4 to 8. It is a program logic explanatory diagram. 1...Telephone, 2...Extension interface circuit, 3
... switch, 4 ... central office line trunk, 5 ... processor. 6...Memory, 7...NTT exchange, 8,9...
Common carrier exchange. Flute 1 Diagram 2 Matatai Tori Tsuna 4 Tasu 3 η Mouth Blade Matatai Tori Tsuna 5 Aro de... 7 Pu Otsu Memory 7 NTT Snake Flame 89 Mosoyaria Onna j Figure 3 Figure 4 Figure 8 Figure 7 Figure 8

Claims (1)

[Claims] 1. In a storage program type private branch exchange, by providing a function to select the lowest fare route, and a function to remove the lowest fare route selection function at a preset ratio and select a non-minimum fare route, multiple A minimum charge route selection method that is characterized by being able to automatically use different common carrier circuits at any ratio.