JPH0270192A - Call allotting system to plural line groups - Google Patents

Abstract

PURPOSE:To perform the highly precise allotment of call through the use of a less storage area by providing every line group with the storage area, and allotting the call to each line group by performing arithmetic operation according to allotted allotting ratio at every incoming call. CONSTITUTION:A number corresponding to the allotting ratio and an initial value are set in allotting ratio memories B1 to Bn and work memories W1 to Wn respectively from an initialization circuit 10. When the incoming call arises, a pulse circuit 11 is operated at every incoming call, and the values stored in the memories B1 to Bn are added to the contents of the memories W1 to Wn, and the sums are stored in the memories W1 to Wn, and simultaneously, are transferred to a comparing/operating means 12. As the result of comparison/operation, a work memory number to show the maximum value is transferred to a line group selecting means 13, and simultaneously, the total value of the numbers corresponding to the allotting ratio is subtracted from the work memory having shown the maximum value. Thus, the highly precise allotment can be performed through the use of the less storage area.

Description

DETAILED DESCRIPTION OF THE INVENTION (Field of Industrial Application) The present invention relates to a method for allocating calls to each line group according to a predetermined ratio when allocating calls to a plurality of line groups.

(Prior Art) FIG. 5 is a connection configuration diagram showing a processing system to which a proportional call distribution method to multiple line groups is applied.

A call addressed to processing system Y that comes into processing system X is
According to the distribution ratios set and stored in advance in the processing system X, the lines are distributed proportionally to the line groups CI, C2, C3, . . . Cn.

The traditional method of proportionally allocating calls to multiple line groups is
There is a method in which an allocation pattern is set in advance in a memory, and this pattern is read out each time a call arrives to determine the allocation destination.

FIG. 6 shows a specific example of the conventional method. Here, when allocating with an accuracy of 1%, table T(0) to table T
The allocation destinations are recorded in the 100 types of tables (99), the pointer is incremented each time a call is received, and the line group to which the call is allocated is determined from the contents of the table indicated by the pointer.

For example, when allocating to each line group with line group A = 70% and line group B = 30%, (A, A, B, A, A, B, A, A,
Patterns A and B) are written in a table, the pointer is incremented each time an incoming call occurs, and the line group to which the call is allocated is determined from the contents of the table indicated by the pointer.

(Problems to be Solved by the Invention) As a method of allocating calls to multiple line groups, conditions that are particularly suitable for switching processing are as follows: (1) Calls do not concentrate on a specific line group in a short period of time and Being able to prorate calls (
2) The required memory area must be small.

In the conventional method shown in Figure 6, all allocation patterns are stored in memory, so for example, if allocation is to be performed with an accuracy of 0.1%, storage areas for 1000 types must be secured. First, to increase the accuracy by 10 times, a storage area of 10 times is required. Additionally, a separate procedure is required for setting the allocation pattern to storage areas.

The present invention aims to improve this point and perform accurate allocation with a small storage area.

(Means for Solving the Problems) The present invention was invented in view of the above-mentioned points, and includes a work table corresponding to each line group, and call proportional allocation for each line group each time an incoming call occurs. By performing calculations according to the calculation results and determining to which line group the incoming call is to be allocated according to the calculation results, appropriate proportional call allocation is possible.

(Function) A number of work tables corresponding to multiple line groups are provided, and when an incoming call occurs, the value in the work table is calculated using a value corresponding to the call proportional allocation for each line group, and the calculation is performed. The results are compared and calculated, and a line group to which the call is to be allocated is selected based on the calculation results.

By performing this operation every time an incoming call occurs, the memory area used is small and an appropriate proportionate allocation of calls to a plurality of line groups can be realized.

In addition, in order to increase the precision of proportional allocation by 10 times, in the conventional example, the number of pattern tables must be increased by 10 times, but in the present invention, the number of count digits of each work table can be increased by one digit. Does not often require large storage space.

(Example 1) FIG. 1 is a block diagram of this system. The initial value setting circuit IO sets a number corresponding to the distribution ratio in the distribution rate memories B(1) to B(n) and initial values to the work memories W(1) to W(n) (n is the line group number parameter).

Next, when an incoming call occurs, the pulse circuit 11 is operated for each incoming call, and the contents of the work memories W (1) to W (n) are stored in the allocation rate memories B (1) to B (n). The sum is added to the work memory w (i) ~ W (n
) and transferred to the comparison/calculation means 12.

The comparison/calculation means 12 uses the transferred work memory W.
(1) Compare/calculate the values of ~W(n) and find the maximum value,
The work memory number that was the maximum value is selected by line group selection means 1.
At the same time, a fixed value (total value of numbers corresponding to the allocation ratio) is subtracted from the work memory which was the maximum value.

The line group selection means 13 selects the line group corresponding to the work memory number which is the maximum value. Thereafter, by repeating the above operation every time an incoming call occurs, calls can be allocated proportionally and a line group can be selected.

FIG. 2(a) shows the initial value setting processing procedure in this method.

FIG. 2(b) shows the line group selection processing procedure.

FIG. 3(a) shows the memory configuration of the allocation ratio table.

FIG. 3(b) shows the memory configuration of the work table.

(N is the total number of line groups, n is the line group number parameter) Table 1 shows a numerical example, and the allocation ratio to 6 line groups is 50%.
, 20%, 15%, 10%, 5%, and 0%, respectively, shows changes in the contents of the work table used in this method.

(Margin below) strategy” - person The mouth indicates choice.

The processing procedure of this method is as follows.

Step 1. Initial value setting procedure In FIG. 2(a), (1) the allocation ratio corresponding to each line group is set in allocation ratio tables B(1) to B(n) (100).

(2) Setting the initial value to the work table W(n) (
+02).

In the numerical example of Table 1, the number corresponding to the allocation ratio is added to allocation ratio table B (n) as allocation ratio table B (1) = 50.
．． B(2)=20...B(6)=O is set, and the initial value 100 is set in each of the work tables W(1) to W(6).

Procedure Line group selection procedure activated every 20 people calls Figure 2 (b
), (1) Add each work table W(n) value and distribution ratio table B(n) value (104 to 114)
. Note that N is the number of line groups, and MAX and n are variables.

(2) Work tables W(1) to W( after each addition
6) Compare/calculate the values and select the line group corresponding to the work table (MAX,) with the maximum work table value (116).

(3) Work table (MAX
n) subtract a fixed value from the value (118);

In Table 1, the initial values of the work table W(n) are all 100, and at the first incoming call, a number corresponding to the allocation ratio corresponding to the line group is added to this value.

Therefore, W(1) = 150, W(2) = 120
, W(3) =115, W(4) =110
, W(5) = 105, W(6) = 100, the line group corresponding to n=1, which has the maximum W(n) value, is selected, and the fixed value 100 is subtracted from the W(1) value.

The values of the work table W(n) are each W(1)
=50. W(2) = 120, W(3) = 11
5, W(4)=110, W(5)=105
, W(6) = 100, and waits for the next incoming call.

For the second call, W(In=W(1) +B(1) =
50+50=100, W(2)=120+20
=140, W(3)=130, W(4)=1
20, W(5) =110, W(6) =10
0 and the line group corresponding to n=2 with the maximum W(n) value is selected, and 100 is subtracted from the W(2) value. (W
(2) =40).

Thereafter, similar processing is performed for each incoming call to select a line group.

Note that in this example, if there are identical values in determining the maximum value, the line group with the smaller n is selected preferentially.

In Table 1, work tables W(1) to W are used for each incoming call.
The total of (n) is the sum of the numbers corresponding to the allocation ratio (=10
However, after the line group is selected, the fixed value (=lOO) is subtracted from the work table value selected for the line group, so the total does not change.

Therefore, it is not necessary to secure a large area as the memory size for each work table W(1) to W(n).

In this method, the value of the work table W(n) corresponding to the line group once selected is subtracted, and the interval until the next selection is longer for the line group with a smaller allocation ratio. In the example shown in Table 1, the unit is 5%, so 20
The value of the work table is returned to the initial value by the second selection, and this selection pattern is repeated.

In this way, if you set the accuracy in units of 1%, 0.1%, and 0.01%, it will be 100 times, 1000 times, and 10 times, respectively.
After 000 selections, the call returns to the initial value and appropriate call allocation is performed according to the allocation ratio set during this time.

As described above, this method consists of adding allocation ratios, comparing the addition results, and subtracting fixed values, and enables call allocation with arbitrary ratios and arbitrary precision using a simple algorithm. In principle, there are no restrictions on the number of allocation destinations, accuracy, or ratio.

(Example 2) As a method of comparing the addition results, in addition to the method of taking the maximum value as described above, it is also possible to determine the line group by comparing with a fixed value, which has the advantage of further simplifying the program. However, it has the characteristic that the selection order differs depending on the order of comparison.

FIG. 4 and Table 2 show examples of this method.

(n+ is a parameter from 1 to n + n2 is a work memory number from 1 to N) The initial value is set in the same manner as in the first embodiment.

In Figure 4, for each work table W
Calculate (n,) = W (n,) + B (n+) (150-156). W(1) = 150, W(
2) =120, W(3) =115, W(4
) =110, W(5) =105, W(6)
=100. Since the initial value is 100, W(1
) to W(5) exceeds 100. Here, it is assumed that the line group with the smaller line group number n2 is selected preferentially, and n
Select the line group corresponding to 2=1 (158-162),
After selecting the line group, a fixed value of 100 is subtracted from the selected W(1) (164).

For the second call, W(1) = W(1) +B(1)
'=50+50=100, W(2) =120+
20=140, W(3) =130, W(4)
=120, W(5) =110, W(6)
= 100, W(2) to W(5) exceed 100, but the line group corresponding to n2=2 is selected according to the priority order of selecting the line group with smaller n2, and the line group After selection, a fixed value of 100 is subtracted from the selected W(2).

Thereafter, similar processing is performed for each incoming call to select a line group.

Table 2 shows an example of line group selection under the same conditions (allocation ratio and initial value) as in Table 1.

(Margin below) Hidden alone The mouth indicates choice.

(Effects of the Invention) As explained above, the present invention enables proportional call allocation to multiple line groups using a simple algorithm and a small amount of memory while avoiding concentration of calls on a specific line group. ,
Effective for processing that requires real-time performance.

In particular, according to this system, randomly incoming calls are rarely allocated to the same line group consecutively, so call smoothing can be expected, favorable characteristics for switching processing can be obtained, and switching equipment congestion can be achieved. This is effective in preventing the occurrence of invalid calls.

Furthermore, since calls are allocated appropriately according to the allocation ratio, network design can be facilitated.

In this method, the total allocation ratio does not necessarily need to be 100 (%), and the call allocation to a specific line group can be temporarily set to zero by simply changing the initial value, subtraction value, and addition value. This is also possible, and even when an abnormal condition occurs, it can be effectively dealt with by changing the above setting values.

[Brief explanation of the drawing]

FIG. 1 is a block diagram of the call allocation method according to the present invention, FIG. 2 is a diagram showing the processing procedure of this processing method, FIG. 3 is a diagram showing the memory configuration used in this processing method, and FIG. 4 is a diagram showing the present invention. FIG. 5 shows an example of a connection configuration of a call distribution processing system, and FIG. 6 shows a conventional example. B(1) to B(n): Distribution ratio memory, W (+) to W(n); Work memory, 10; Initial value setting circuit, 11; Pulse circuit, 12; Comparison/calculation means, 13: Line Group selection means, 15 (1) to 15 (
n); Adder.

Claims (2)

[Claims] (1) In a call distribution method that allocates calls to multiple line groups at a predetermined allocation ratio, a storage area is created for each line group, a predetermined initial value is set in each storage area, and each call is Add the contents of the storage area and the number corresponding to the allocation ratio assigned to each line group, allocate the incoming call to the line group for which the sum of the addition results is the maximum value, and calculate the number of allocated line groups. A method for allocating calls to a plurality of line groups, characterized in that a predetermined value is subtracted from the contents of a storage area. (2) In a call distribution method that allocates calls to multiple line groups at a predetermined allocation ratio, a storage area is created for each line group, a predetermined initial value is set in each storage area, and each incoming call is The contents of each storage area and the number corresponding to the allocation ratio assigned to each line group are added, and the line group with the highest predetermined priority among the line groups for which the addition result exceeds the initial value. A method for allocating calls to a plurality of line groups, characterized in that the incoming call is allocated to a plurality of line groups, and a predetermined value is subtracted from the contents of a storage area of the allocated line group.