JPH088589B2 - Packet call processing method - Google Patents

Description

Description: TECHNICAL FIELD The present invention relates to a packet call processing system, and in particular, in a high-speed packet communication system using slots, both terminals and exchanges are lightly loaded, and call setting and transfer efficiency are high. The present invention relates to a flow rate control method.

[Conventional technology]

Conventionally, as a method of performing packet-type communication on a fixed route, for example, "Statistical, switching, architectures, four, future, servicing" (Kultzer, Montgomery: Statistical
switching architectures for future services, IS
S'84, May 1984) is a high-speed packet switching system. In the above packet switching system, as the flow control logic for call setup, the calling subscriber is allowed to declare the maximum throughput of the call at the time of call setup, and routing is performed by this declared value. The throughput here means the number of packets transferred per unit time, and in the case of the slot type, the number of slots.

FIG. 5 is a diagram showing a configuration example of a packet switch in the above system. In FIG. 5, 1 and 12 are subscriber lines or relay lines, 2 is an exchange, 3 is a receiving circuit, 4 is a packet type determination circuit, 5 is a data transfer processing circuit, 6 is a call control packet analysis circuit, and 7 is a call. Setting / disconnecting circuit, 8 is a counter circuit for counting the total value of throughput of calls using each trunk line, 9 is a processing circuit for controlling call control other than call setting / disconnecting, and 10 is packet assembly. A circuit, 11 is a transmission circuit.

When the exchange 2 receives a call request packet from the incoming subscriber line or the trunk line 1, the switch type determination circuit 4 and the call control packet analysis circuit 6 determine that the call request packet and set the call. -Activate the disconnection circuit 7. The call setup / disconnection circuit 7 selects a candidate for the data relay line based on the destination subscriber address, and the counter circuit 8
Refer to to obtain the total throughput of calls using each candidate circuit, and select the trunk line whose difference between the maximum throughput and the total throughput value exceeds the declared throughput of the calling subscriber as the outgoing trunk line. . Then, after performing various other processes required for call setting, the calling packet is sent to the selected outgoing relay line 12 via the packet assembling circuit 10 and the transmitting circuit 11 and transferred to the next-stage packet switch. To do. In addition, the call setup / disconnection circuit 7 uses the counter circuit 8 corresponding to the outgoing relay line 12 to determine the call throughput newly set.
Then, the counter circuit 8 adds this throughput value. By performing such an operation by each exchange 2 between the originating and terminating subscriber terminals, the route connecting both subscriber terminals is determined, and the incoming call acceptance packet is returned from the terminating subscriber terminal to complete the call setup. After the call setup is completed, the data transfer processing circuit 5 in FIG. 5 transmits / receives the data transfer packet on the above route. After that, when the call is disconnected, the call setup / disconnection circuit 7 of each exchange determines the throughput of the disconnected call by the counter circuit 8 corresponding to the outgoing relay line 12.
And the counter circuit 8 subtracts this throughput value.

[Problems to be solved by the invention]

In such a conventional technique, since the usage status of the line is grasped based on the maximum throughput requested by each subscriber, even if each subscriber sends only a packet lower than the maximum throughput, There is a problem that the difference cannot be used for other calls, resulting in a decrease in the efficiency of use of the trunk line and a decrease in the number of calls that can be connected to the network.

It is an object of the present invention to improve such conventional problems, reduce the load on both terminals and exchanges, and improve the usage efficiency of the trunk line and the number of connected calls while suppressing the occurrence of congestion. It is to provide a possible packet call processing method.

[Means for solving problems]

In order to achieve the above object, the packet processing method of the present invention is such that, when an information block is transmitted and received between a calling subscriber terminal via an exchange, a calling subscriber address and a unit time are set from a calling subscriber at the time of call setting. In the packet call processing method of notifying the exchange of the assumed maximum value of the number of packets per unit (hereinafter, referred to as throughput), the exchange, for each subscriber line or each relay line, starts from the maximum throughput value A that the line can carry. The transferable throughput X is obtained by subtracting the measured throughput B during transfer, and this X is b _i-1 <X ≦ b _i
When the condition is satisfied, the trunk line state is changed to S _i (i = 1,2,3, ...
., A) (b ₁ , b ₂ , ... b _a is b ₁ (= 0) <b ₂ <
・ ・ ・ <A positive integer that satisfies b _a (= A)), the probability that the state of the relay line changes from S _i to S _j Q _ij (i = 1,2, ..., a)
The state probability transition matrix Q that represents is defined as follows, At the time of call setup, the relay exchange uses the transferable throughput X at that time, the assumed throughput R notified by the calling subscriber, and the above-mentioned state probability transition matrix Q for the candidate of the outgoing trunk line that can be identified by the called subscriber address. ,
The acceptance / rejection of the incoming call is determined, the outgoing trunk line is selected, and at the time of call setup, the incoming call exchange determines the transferable throughput X of the incoming subscriber line at that time and the assumed throughput notified by the outgoing subscriber. The feature is that the incoming of the call is permitted or rejected by R and the state probability transition matrix Q.

[Action]

In the present invention, the call setup and the flow rate control of the network are performed in accordance with the assumed maximum throughput notified by the calling subscriber terminal at the time of calling, and the fixed routing is performed for each call. That is, in the present invention, the exchange periodically counts the number of data transfer packets transferred for each relay line, and calculates the transferable throughput at that time of the relay line from the counting result, The state transition probability of the transferable throughput group that changes in each cycle is calculated, and the state probability transition matrix is stored. Then, at the time of call setting, whether or not to accept the call is determined based on the above-mentioned monitored transferable throughput value, the assumed throughput value displayed by the calling subscriber, and the above state probability transition matrix. Also, the calculation result based on these is used for selecting the outgoing relay line in the call setting processing circuit. In addition, in the setting example of the throughput value,
(A) A setting method in which the maximum throughput value that the line can carry is A, and (b) A setting method in which the sum of the maximum throughput value that the line can carry and the maximum throughput value that the sending buffer can handle for the line is A There is.

〔Example〕

Hereinafter, embodiments of the present invention will be described in detail with reference to the drawings.

FIG. 6 is a diagram of an example of creating the state probability transition matrix Q used in the present invention.

First, with respect to A according to (a) or (b) above, this A is divided into a groups by a size unit (constant or variable), and the state transition probabilities corresponding to these groups are derived to obtain the state probabilities. Create a transition matrix Q.
An example thereof is shown in FIG.

Next, with respect to A according to (a) or (b) above, this A is divided into a groups by attribute unit, and the state transition probabilities corresponding to these groups are derived to create a state probability transition matrix Q. To do. For example, by dividing the throughput group into the dangerous state group a ₁ and the safe state group a ₂ and deriving the state transition probability between these two groups, the state probability transition matrix shown in (a = 2) of FIG. Create Q.

As another example, the throughput group is
The state probability transition matrix shown in (a = 3) of FIG. 6 is obtained by dividing the dangerous state group a ₁ , the boundary state group a ₂ , and the safe state group a ₃ and deriving the state transition probability between these three groups. Create Q. The same grouping can be applied to other attribute grouping.

As yet another embodiment, a state in which the transmission buffer corresponding to the line overflows, that is, a state in which the transmission buffer exceeds A, is added to divide into, for example, an overflow state group a ₁ , a dangerous state group a ₂ , and a safe state group a ₃ . By deriving the state transition probabilities between these groups, the state probability transition matrix Q shown in (a = 3) of FIG. 6 is created. The same grouping can be applied to other attribute-based grouping considering the overflow of the transmission buffer corresponding to the other line.

FIG. 1 is a block diagram of an exchange showing a first embodiment of the present invention. FIG. 1 shows a case where the state probability transition matrix Q is fixedly handled in the data transfer phase. That is, it is a slot type interface, and the exchange 2 fixedly handles any one of the state probability transition matrices Q described in FIG.

1 to 7 and 9 to 12 in FIG. 1 represent the same devices as the corresponding devices in FIG. In Fig. 1, 21,24,2
Each circuit of 5,26,27,31,32 is newly provided. Reference numeral 21 is a counter for counting the used slots, 24 is a memory circuit for storing the state probability transition matrix, 25 is an arithmetic circuit, 26 is a register, 27 is a comparison / determination circuit, and 31 and 32 are AND gates. Of these, the counter 21, the memory circuit 24, and the register 26 are provided for the outgoing subscriber line or the trunk line.

When the calling subscriber sends the call request packet to the exchange 2, the calling subscriber sets an assumed throughput (here, its value is R).

Each time the packet assembling circuit 10 inserts a packet into the slot of the outgoing subscriber line or the relay line, it issues an addition instruction to the corresponding counter 21. The gate circuit 31 in front of the counter 21 is opened by a timer for a certain period of time (for example, 125 μS per second), and as a result, the counting by the counter 21 is executed only within that time, and the counting result is the counting end time. The operation circuit 25 is activated by the AND gate 32 which is opened only. In the arithmetic circuit 25, the transferable throughput X is calculated by subtracting the measured throughput value B from one of the upper limit throughput values A described in FIG. 6, and the result is stored in the register 26.

Upon receipt of the call request packet, the calling subscriber terminal accommodating exchange or the transit exchange 2 activates the call setup / disconnection circuit 7 in the same manner as in the conventional case. The call setup / disconnection circuit 7 selects a candidate outgoing trunk line based on the destination subscriber address when selecting the outgoing trunk line. After that, the call setup / disconnection circuit 7 sends the candidate line number to the comparison / determination circuit 27, and the comparison / determination circuit 27 knows the transferable throughput X of each candidate line at that time by referring to the register 26. And the state probability transition matrix Q stored in the storage circuit 24 and the assumed throughput R set by the calling subscriber, and as a result of applying the algorithm for determining whether the line is selected and the call is connected, the smallest probability Pr is obtained. If there is only one trunk line, that line is selected, and if there are multiple trunk lines, one outgoing line is selected. When the relay line satisfies the reception permission condition, the relay line is set as an outgoing line, the line number is notified to the call setup / disconnection circuit 7, and the subsequent processing of the call setup / disconnection circuit 7 that received the relay line is The same as before. On the other hand, when the reception permission condition is not satisfied, the call setup / disconnection circuit 7 is notified that the call cannot be accepted. Call setup / disconnection circuit 7 that received this
The subsequent processing of is the same as the conventional one.

Next, the receiving subscriber terminal accommodating exchange 2 which has received the call request packet performs call setting / setting in the same manner as in the conventional case.
When the disconnection circuit 7 is activated, the call setup / disconnection circuit 7 sends the destination subscriber address to the comparison / determination circuit 27. Comparison judgment circuit 27
Is the current transferable throughput X of the called subscriber circuit.
By referring to the register 26, an algorithm for determining whether or not a call can be connected is applied to this, the assumed throughput R set by the calling subscriber, and the state probability transition matrix Q stored in the storage circuit 24. By
It is determined whether or not the reception of the call is accepted, and the fact is notified to the call setup / disconnection circuit 7. Subsequent processing of the call setup / disconnection circuit 7 which has received the notification is the same as the conventional one. on the other hand,
When the reception permission condition is not satisfied, the call setup / disconnection circuit 7 is notified that the call cannot be accepted. Subsequent processing of the call setup / disconnection circuit 7 receiving this is the same as the conventional case.

Here, the case of the slot type interface has been described, but even if it is not the slot type interface, it can be realized by almost the same as the above description or by simplifying it.

FIG. 2 is a block diagram of an exchange showing a second embodiment of the present invention. In FIG. 2, a slot type interface is shown, and the exchange 2 shows a case where any one of the state probability transition matrices Q described in FIG. 6 is fixedly handled.
1 to 7, 9 to 12, 21, 24 to 27, 31, 32 in FIG. 2 are the first
It represents the same as the corresponding device in the figure. In FIG. 2, 28, 29, 30 are additionally provided. 28 is a storage area for storing past states [M] that are periodically counted, and 29 is a change rate [measurement packet throughput-gradient of time characteristics] that indicates recent increase / decrease in measured throughput based on the M data. An arithmetic circuit for deriving the above, 30 is a register for storing the rate of change of this throughput. Of these, the counter 21, the storage circuits 24 and 28, and the registers 26 and 30 are provided for the outgoing subscriber line or the trunk line.

Each time the packet assembling circuit 10 inserts a packet into the slot of the outgoing subscriber line or the relay line 12, the packet assembling circuit 10 gives an addition instruction to the corresponding counter 21. Before the counter 21
The AND gate 31 is opened by the timer for a certain period of time (for example, 125 μS per second), and as a result, the counting by the counter 21 is executed only within that period. The counting result of the counter 21 is opened only at the counting end time AND gate 32
The arithmetic circuit 25 is activated by this, and in this arithmetic circuit 25, the transferable throughput X is calculated by subtracting the measured throughput value B from one of the upper limit throughput values A described in FIG. Register 26
To be stored. Further, the counting result of the counter 21 is stored in the memory circuit 28 by the AND gate 32 which opens only for the counting end time. The storage circuit 28 has a capacity capable of storing M counting results (M is a positive integer of 2 or more) and stores the counting results of M times backward from the latest result. When the contents of the memory circuit 28 are updated, the arithmetic circuit 29 uses the first-order approximation of the M count results to change the throughput K (a positive or negative real number).
Is calculated and the calculation result is stored in the register 30.

Upon receipt of the call request packet, the calling subscriber terminal accommodating exchange or the transit exchange 2 activates the call setup / disconnection circuit 7 in the same manner as in the conventional case. The call setup / disconnection circuit 7 selects a candidate outgoing trunk line based on the destination subscriber address when selecting the outgoing trunk line. After that, the call setup / disconnection circuit 7 sends the candidate line number to the comparison and determination circuit 27, and the comparison and determination circuit 27 knows the transferable throughput X of each candidate line at that time by referring to the register 26, This throughput X and the assumed throughput R set by the calling subscriber
And the state probability transition matrix Q stored in the memory circuit 24, as a result of applying an algorithm for judging whether or not the line is selected and the connection of the call is established, when there is only one relay line having the smallest probability Pr, , That line is selected, and if there are multiple lines, the register 30 corresponding to each line is referred to, so that only one relay line having the latest minimum change rate K of throughput is selected and that line is selected. If multiple lines exist, select any line.
When the reception permission condition is satisfied, the trunk line is set as an outgoing line, and the line number is notified to the call setup / disconnection circuit 7, so that the call setup / disconnection circuit 7 that has received the relay line uses the same method as the conventional method. Set up the call. On the other hand, when the reception permission condition is not satisfied, if the call setup / disconnection circuit 7 is notified that the call cannot be accepted, the call setup / disconnection circuit 7
In response to this, the call is disconnected in the same manner as the conventional method.

Further, the called subscriber terminal accommodating exchange 2 which has received the call request packet activates the call setup / disconnection circuit 7 in the same manner as in the conventional case, and the call setup / disconnection circuit 7 compares and determines the called subscriber address. Send to circuit 27. The comparison / determination circuit 27 knows the transferable throughput X of the called subscriber circuit at that time by referring to the register 26, and at the same time,
By referring to 30, the latest rate of change in throughput K is known. The comparison / determination circuit 27 determines the values of X and K, the estimated throughput R set by the calling subscriber, and the state probability transition matrix Q stored in the storage circuit 24.
By applying an algorithm for determining whether or not the call can be connected, it is determined whether or not the reception of the call is accepted, and the call setting / disconnection circuit 7 is notified of this. Subsequent processing of the call setup / disconnection circuit 7 receiving this is the same as the conventional case.

It should be noted that, when deriving the rate of change K of the throughput, the same can be realized even in the case where the estimation is not performed by the first-order approximation of the past M throughput values.

Even if it is not a slot type interface, it can be realized by almost the same as the above description or by simplifying it.

FIG. 3 is a block diagram of an exchange showing a third embodiment of the present invention.

In FIG. 3, a slot type interface is shown, and the exchange 2 shows a case where any one of the state probability transition matrices Q described in FIG. 6 is updated at every throughput counting cycle. For example, in the above embodiment,
In the state of the relay line obtained from the cyclically counted actual throughput of the subscriber line or the relay line, when the latest state is SJ and the previous state is SI, the state probability transition matrix Q is On the other hand, the state transition probability Qij (i, j ＝
1,2, ... a) is changed to Qij → Qij · N / (N + 1) + 1 / (N + 1) (where i = I and j = J) Qij → Qij · N / (N + 1) (where , I ≠ I or j ≠ J), it is also possible to determine and update every cycle.
1 to 7, 9 to 12, 21, 24 to 27, 31, 32 represent the same devices as the corresponding devices in FIG. In FIG. 3, in addition,
22 and 23 are newly added. Reference numeral 22 is a memory circuit that stores past states that are periodically counted, and 23 is an arithmetic circuit that derives a state probability transition. Of these, the counter 21, the memory circuits 22 and 24, and the register 26 are installed for the outgoing subscriber line or the trunk line.

Each time the packet assembling circuit 10 inserts a packet into the slot of the outgoing subscriber line or the relay line, it issues an addition instruction to the corresponding counter 21. AN in front of counter 21
The D gate 31 is opened by a timer for a certain period of time (for example, 125 μS per second), and as a result, the counter 2
Counting by 1 is performed only within that time. The counting result is stored in the memory circuit 22 by the AND gate 32 which is opened only during the counting end time. The storage circuit 22 has a capacity to store two counting results and stores the counting results twice, starting from the latest result. When the contents of the memory circuit 22 are updated, the arithmetic circuit 23 updates each state transition probability according to the state probability transition matrix update algorithm. On the other hand, similarly to the case of FIG. 1, the counting result by the counter 21 activates the arithmetic circuit 25 by the AND gate 32 which is opened only during the counting end time. In the arithmetic circuit 25, the transferable throughput X is obtained by subtracting the measured throughput value B from the upper limit throughput A indicating the execution capacity of the line.
Is stored in the register 26.

When the calling subscriber terminal accommodating exchange or the transit exchange 2 that receives the call request packet activates the call setup / disconnection circuit 7 in the same manner as in the conventional case, the call setup / disconnection circuit 7
When selecting an outgoing trunk line, a candidate outgoing trunk line is selected based on the destination subscriber address. After that, when the call setup / disconnection circuit 7 sends the candidate line number to the comparison / decision circuit 27, the comparison / decision circuit 27 knows the transferable throughput X of each candidate line at that time by referring to the register 26. As a result of applying an algorithm for judging the line selection and call connection availability to the assumed throughput R set by the calling subscriber and the state probability transition matrix Q stored in the storage circuit 24, the smallest probability Pr is obtained. If there is only one trunk line, select that line, if there are multiple trunk lines, select one outgoing line, and if the reception permission condition is satisfied, make that trunk line an outgoing line, and select that line. The number is notified to the call setup / disconnection circuit 7. Subsequent processing of the call setup / disconnection circuit 7 receiving this is the same as the conventional case.
On the other hand, when the reception permission condition is not satisfied, the call setup / disconnection circuit 7 is notified that the call cannot be accepted. Subsequent processing of the call setup / disconnection circuit 7 receiving this is still the same as the conventional case.

In addition, the called subscriber terminal accommodating exchange 2 that receives the call request packet performs call setup / setting in the same manner as in the conventional case.
When the disconnection circuit 7 is activated, the call setup / disconnection circuit 7 sends the called subscriber address to the comparison / determination circuit 27. Comparison judgment circuit 27
Is the current transferable throughput X of the called subscriber circuit.
By referring to the register 26, the throughput X, the estimated throughput R set by the calling subscriber, and the state probability transition matrix Q stored in the storage circuit 24.
By applying an algorithm for determining whether or not the call can be connected, it is determined whether or not the reception of the call is accepted, and the fact is notified to the call setting / disconnecting circuit 7. Subsequent processing of the call setup / disconnection circuit 7 receiving this is the same as the conventional case. On the other hand, when the reception permission condition is not satisfied, the call setup / disconnection circuit 7 is notified that the call cannot be accepted. Receiving this, the call setup / disconnection circuit 7 disconnects the call in the same manner as in the conventional case. In addition,
Even if it is not a slot type interface, it can be realized by almost the same as the above description or by simplifying it.

FIG. 4 is a block diagram of an exchange showing a fourth embodiment of the present invention. FIG. 4 also shows a case where the exchange is a slot type interface, and the exchange updates one of the state probability transition matrices Q described in FIG. 6 at every throughput counting cycle. That is, in the data transfer phase, the state probability transition matrix Q
This is the case where is treated variably. Where 1-7, 9-12, 21-
27,31,32 are the same as the corresponding devices in FIG.
9,30 is the same as the corresponding device in FIG. Of these, the counter 21, the memory circuits 22, 24 and 28, and the register 25
And 30 are installed for the outgoing subscriber line or the trunk line, respectively.

Each time the packet assembling circuit 10 puts a packet into the slot of the outgoing subscriber line or the trunk line 12, it gives an addition instruction to the corresponding counter 21. The AND gate 31 in the preceding stage of the counter 21 opens a fixed period (for example, 125 μS per second) at a constant cycle by the timer, and as a result, the counter 21
Counting is performed only during that time. The counting result is
It is stored in the memory circuit 22 by the AND gate 32 which opens only the counting end time. The memory circuit 22 has a capacity for storing two counting results, and stores two counting results retroactively from the latest result. When the contents of the memory circuit 22 are updated, the arithmetic circuit 23 updates each state transition probability according to the state probability transition matrix update algorithm, and at the same time, the second
As in the embodiment shown in the figure, the calculation result of the transferable throughput X is stored in the register 26, and the change rate K of the throughput is calculated.
The calculation result of is stored in the register 30.

When the calling subscriber terminal accommodating exchange or the transit exchange 2 that receives the call request packet activates the call setup / disconnection circuit 7 in the same manner as in the conventional case, the call setup / disconnection circuit 7
When selecting an outgoing trunk line, a candidate outgoing trunk line is selected based on the destination subscriber address. After that, the call setup / disconnection circuit 7 sends the candidate line number to the comparison and determination circuit 27, and the comparison and determination circuit 27 knows the transferable throughput X of each candidate line at that time by referring to the register 26, As a result of applying the algorithm for judging the line selection and call connection availability to the throughput X, the assumed throughput R set by the calling subscriber, and the state probability transition matrix Q stored in the storage circuit 24, the result is the smallest. Probability Pr
If there is only one trunk line that has the line, select that line, and if there are multiple trunk lines, refer to the register 30 corresponding to each line to determine the minimum value of the latest throughput change rate K. Select only one trunk line to have, and if there are multiple lines, select any line. When the reception permission condition is satisfied, the trunk line is set as an outgoing line, and the line number is notified to the call setup / disconnection circuit 7. The call setup / disconnection circuit 7 receives the received line number as in the conventional case. In this way, call setting processing is performed. On the other hand, if the reception permission condition is not satisfied, the call setup / disconnection circuit 7 is notified of the line number that the call cannot be accepted, and the call setup / disconnection circuit 7 receives the received line number. Disconnect the call as in.

When the called subscriber terminal accommodating exchange 2 that receives the call request packet activates the call setup / disconnection circuit 7 for the line number in the same manner as in the conventional case, the call setup / disconnection circuit 7 causes The personal address is sent to the comparison / determination circuit 27. The comparison / determination circuit 27 refers to the register 26 to know the transferable throughput X of the called subscriber circuit at that time, and at the same time, refers to the register 30 to find the latest change rate K of the throughput. The comparison / determination circuit 27 applies an algorithm for determining whether or not the call can be connected to these values of X and K and the state probability transition matrix Q stored in the storage circuit 24, thereby It is determined whether or not to accept the reception, and the line number is notified to the call setup / disconnection circuit 7 to that effect. The subsequent processing of the call setup / disconnection circuit 7 that receives the line number is the same as the conventional case.

When deriving the rate of change K of the throughput, it can be realized in the same manner even when it is not estimated by the first-order approximation of the past M throughput values. Even if the interface is not a slot type interface, it can be realized in the same manner as in the above-described embodiment or by simplifying it.

In addition, for the candidate of the outgoing relay line that can be identified by the called subscriber address, the latest transferable throughput value X of the actual throughput that is periodically counted in the relay line is calculated.
And the expected throughput value R depending on the calling subscriber (X-
R) determines the state Si to which it belongs, and for each state (Si) of all candidate outgoing lines of the outgoing trunk line, if i ≦ c (c is a predetermined constant value (state value)), When there is an outgoing line candidate that rejects the reception of the call and the outgoing trunk line state Si satisfies i> c, from the state Si to the outgoing line candidate,
Sum of probabilities of transition to any state Sj that satisfies 1 ≦ j ≦ c
Pr Then, the outgoing relay line with the smallest Pr value is selected, and by comparing the Pr value with the probability P0 (P0 is a predetermined value), if Pr ≦ P0, reception is permitted. , Pr> P0, it is possible to reject the reception.

In addition, the increase / decrease coefficient of the measured throughput B for the selection of the relay line and the reception permission / rejection setting algorithm,
That is, a process of comparing the transition change rate K of the past M samples (K is a positive or negative real number) and K0 determined by the Pr value is added, and the outgoing trunk line having the smallest Pr value is selected. When there are a plurality of trunk lines, the outgoing trunk line having the smallest estimated change rate K value is selected, and when Pr ≦ P0 and K ≦ K0, reception is permitted for the outgoing trunk line. , Pr
If> P0 or K> K0, it is possible to reject the reception, and otherwise treat the same as before.

From the state Si to which the difference (X-R) between the most recent transferable throughput X of the actual throughputs of the called subscriber line and the expected throughput value R of the calling subscriber belongs, 1 ≦ j ≦ Sum Pr of probabilities of transition to an arbitrary state S _j that satisfies d (d is a predetermined value) And the probability P1 value (P1 is a predetermined value),
When i> d and Pr ≦ P1, it is possible to permit the reception, and when i ≦ d or Pr> P1, it is possible to reject the reception.

A comparison process of the increase / decrease coefficient of the measured throughput B, that is, the estimated change rate K of M samples in the past and K1 determined by the Pr value is added to the reception permission / rejection setting algorithm, and i> c And Pr ≦ P1 And K ≦ K1
In the case of 1, the reception is permitted, and in the case of i ≦ c or Pr> P1 or K> K1, the reception is rejected, and the others can be handled in the same manner as described in the previous section.

Thus, at the time of call setup, the subscriber declares the maximum value of the throughput used in the call, so that the exchange 2 constantly scans the throughput of the trunk line periodically,
At the same time as grasping the surplus capacity, the rate of change in the measured throughput is calculated, and at the time of call setup request, the state probability transition matrix that is set or updated periodically and the declared value from the subscriber and the surplus capacity value that is grasped. The surplus capacity value at the time of the next cycle is estimated for each candidate line from the rate of change in the measured throughput, and whether or not the call can be accepted and the output path is selected (routing). This allows the trunk line to be used efficiently.

〔The invention's effect〕

As described above, according to the present invention, the usage status of the trunk line or the called subscriber line is periodically measured and the transferable capacity of the line is determined based on the result, so that the trunk line utilization efficiency is improved. In addition, the number of call connections can be improved.

[Brief description of drawings]

FIG. 1 is a block diagram of a slot type interface showing a first embodiment of the present invention, and is a block diagram of an exchange which handles a fixed state probability transition matrix, and FIG. 2 is a slot type interface showing a second embodiment of the present invention. A block diagram of an exchange that handles a fixed state probability transition matrix and also considers the rate of change of the measured throughput, and FIG. 3 shows a third embodiment of the present invention. FIG. 4 shows a block diagram of an exchange that updates every counting cycle, and FIG. 4 shows a fourth embodiment of the present invention. The state probability transition matrix is updated every throughput counting cycle, and the rate of change in measurement throughput is also taken into consideration. 5 is a block diagram of a conventional exchange, FIG. 5 is a block diagram of a conventional exchange, and FIG. 6 is a diagram showing a configuration example of a state probability transition matrix. 1: Subscriber line or trunk line, 2: Switch, 3: Receiver circuit,
4: Packet type determination circuit, 5: Data transfer processing circuit, 6: Call control packet analysis circuit, 7: Call setup / disconnection circuit, 8: Counter circuit, 9: Processing circuit that manages call control other than call setup / disconnection,
10: Packet assembly circuit, 11: Transmission circuit, 12: Subscriber line or relay line, 21: Counter, 22: Storage circuit of past packet throughput value, 23: State transition probability calculation circuit, 24: State probability transition matrix Memory circuit, 25: transferable throughput value calculation circuit, 26: transferable throughput value register, 27: comparison judgment circuit, 28: past throughput value storage circuit, 29: throughput change rate Arithmetic circuit for calculation, 30: register for storing rate of change of throughput, 31, 32: AND gate.

Claims (14)

[Claims] 1. When transmitting and receiving an information block between calling subscriber terminals via an exchange, at the time of call setting, the calling subscriber addresses the called subscriber and the number of packets per unit time (hereinafter referred to as throughput). In the packet call processing method of notifying the exchange of the assumed maximum value of (1), the exchange measures, for each subscriber line or each relay line, from the maximum throughput value A that the line can carry to the measured throughput B during transfer.
To obtain transferable throughput X,
When −1 <X ≦ bi is satisfied, the trunk line state is set to Si (i
= 1,2,3, ..., a) (b1, b2, ... ba is b1
(= 0) <b2 <... <a positive integer that satisfies ba (= A)), the probability Qij that the status of the trunk line changes from Si to Sj
The state probability transition matrix Q representing (i = 1,2, ..., a) is defined as follows, At the time of call setup, the relay exchange uses the transferable throughput X at that time, the assumed throughput R notified by the calling subscriber, and the above state probability transition matrix Q for the candidate of the outgoing trunk line that can be identified by the called subscriber address. , Whether to accept or reject the incoming call and select an outgoing trunk line, and at the time of call setup, the incoming exchange is assumed to notify the transferable throughput X of the incoming subscriber line at that time and the calling subscriber. A packet call processing method characterized by permitting or rejecting an incoming call according to the throughput R and the state probability transition matrix Q. 2. A packet call processing method according to claim 1, wherein a state probability transition matrix Q is created in advance and the state probability transition matrix Q is fixedly handled. Processing method. 3. The packet processing method according to claim 1, wherein the latest state of the trunk line obtained from the periodically counted actual throughput of the subscriber line or the trunk line is SJ. Yes, when the previous state is SI, the state transition probability Qij (i, j = 1,2, ... a) for the state probability transition matrix Q is Qij → Qij · N / (N + 1) + 1 / (N + 1) (where i = I and j = J) Qij → Qij · N / (N + 1) (where i ≠ I or j ≠ J) (where N is a predetermined constant) Value), the packet processing method characterized in that it is determined and updated every cycle. 4. A packet call processing method according to any one of claims 1 to 3, wherein a cycle of a trunk line with respect to an outgoing trunk line candidate that can be identified by a called subscriber address. The state Si to which the difference (X-R) between the most recent transferable throughput value X of the actual throughputs and the assumed throughput value R of the calling subscriber belongs is determined, and all candidate outgoing lines of the outgoing trunk line are determined. For each state (Si) of, if i ≦ c (c is a predetermined constant value (state value)), the call is rejected and the outgoing trunk line state Si satisfies i> c. If there is an outgoing line candidate to be processed, the sum Pr of the probabilities of transition from the state Si to any state Sj satisfying 1 ≦ j ≦ c for the outgoing line candidate Then, the outgoing relay line with the smallest Pr value is selected, and by comparing the Pr value with the probability P0 (P0 is a predetermined value), if Pr ≦ P0, reception is permitted. , Pr> P0, the packet call processing method is characterized by rejecting the reception. 5. In the packet call processing method according to any one of claims 1 to 3, a cycle of a trunk line for a candidate of a trunk line that can be identified by a called subscriber address. The state Si to which the difference (X-R) between the most recent transferable throughput value X of the actual throughputs and the assumed throughput value R of the calling subscriber belongs is determined, and all candidate outgoing lines of the outgoing trunk line are determined. For each state (Si) of, if i ≦ c (c is a predetermined constant value (state value)), the call is rejected and the outgoing trunk line state Si satisfies i> c. If there is an outgoing line candidate to be processed, the sum Pr of the probabilities of transition from the state Si to any state Sj satisfying 1 ≦ j ≦ c for the outgoing line candidate And increase / decrease coefficient of the measurement throughput B, that is,
The transition change rate K (K is a positive or negative real number) of the past M samples is compared with K0 determined by the Pr value, the outgoing trunk line having the smallest Pr value is selected, and the plural outgoing trunk lines exist. In this case, the outgoing relay line having the smallest estimated change rate K value is selected, and Pr ≦ P0 and K ≦ K0 are selected for the outgoing relay line.
In the case of, the packet call processing method is characterized in that the reception is permitted, and in the case of Pr> P0 or K> K0, the reception is rejected. 6. A packet call processing method according to any one of claims 1 to 3, wherein the newest transferable throughput of the periodically counted actual throughputs of the incoming subscriber lines. The probability of transition from the state Si to which the difference (X-R) between X and the expected throughput value R of the calling subscriber belongs to any state Sj that satisfies 1 ≦ j ≦ d (d is a predetermined value) Sum Pr And the probability P1 value (P1 is a predetermined value),
A packet call processing method characterized by permitting reception when i> d and Pr ≦ P1 and rejecting reception when i ≦ d or Pr> P1. 7. A packet call processing method according to any one of claims 1 to 3, wherein the latest transferable throughput of the periodically counted actual throughputs of the incoming subscriber lines. The probability of transition from the state Si to which the difference (X-R) between X and the expected throughput value R of the calling subscriber belongs to any state Sj that satisfies 1 ≦ j ≦ d (d is a predetermined value) Sum Pr And the probability P1 value (P1 is a predetermined value), and the increase / decrease coefficient of the measured throughput B, that is, the past M
By comparing the estimated change rate K of the sample with K1 determined by the Pr value, if i> c and Pr ≦ P1 and K ≦ K1, reception is permitted, and i ≦ c or Pr> P1 or K> K1 In some cases, the packet call processing method is characterized by rejecting the reception. 8. When transmitting / receiving an information block between calling subscriber terminals via an exchange, at the time of call setting, the calling subscriber addresses the called subscriber and the number of packets per unit time (hereinafter referred to as throughput). In the packet call processing method of notifying the exchange of the assumed maximum value of), in the exchange, for each subscriber line or each relay line, the maximum throughput value that can be carried by the line and the maximum throughput that the sending buffer can handle for the line. The transferable throughput X is obtained by subtracting the measured throughput B during transfer from the throughput sum A.
When X satisfies bi−1 <X ≦ bi, the trunk line state is set to Si (i = 1,2,3, ..., a) (b1, b2 ,.
Is a positive integer that satisfies b1 (= 0) <b2 <... <ba (= A)), and the probability Qi that the state of the trunk line changes from Si to Sj.
The state probability transition matrix Q representing j (i = 1, 2, ..., A) is defined as follows, At the time of call setup, the relay exchange uses the transferable throughput X at that time, the assumed throughput R notified by the calling subscriber, and the above-mentioned state probability transition matrix Q for the candidate of the outgoing trunk line that can be identified by the called subscriber address. ,
The acceptance / rejection of the incoming call is determined, the outgoing trunk line is selected, and at the time of call setup, the incoming call exchange determines the transferable throughput X of the incoming subscriber line at that time and the assumed throughput notified by the outgoing subscriber. A packet call processing method characterized by permitting or rejecting the incoming of the call according to R and the state probability transition matrix Q. 9. A packet call processing method according to claim 8, wherein a state probability transition matrix Q is created in advance and the state probability transition matrix Q is fixedly handled. Processing method. 10. The packet processing method according to claim 8, wherein the latest state of the relay line obtained from the periodically counted actual throughput of the subscriber line or the relay line is SJ. Yes, when the previous state is SI, the state transition probability Qij (i, j = 1,2, ... a) for the state probability transition matrix Q is Qij → Qij · N / (N + 1) + 1 / (N + 1) (where i = I and j = J) Qij → Qij · N / (N + 1) (where i ≠ I or j ≠ J) (where N is a predetermined constant) Value), the packet processing method characterized in that it is determined and updated every cycle. 11. A packet call processing method according to any one of claims 8 to 10, wherein a cycle of a trunk line for an outgoing trunk line candidate that can be identified by a called subscriber address. The state Si to which the difference (X-R) between the most recent transferable throughput value X of the actual throughputs and the assumed throughput value R of the calling subscriber belongs is determined, and all candidate outgoing lines of the outgoing trunk line are determined. For each state (Si) of, if i ≦ c (c is a predetermined constant value (state value)), the call is rejected and the outgoing trunk line state Si satisfies i> c. If there is an outgoing line candidate to be processed, the sum Pr of the probabilities of transition from the state Si to any state Sj satisfying 1 ≦ j ≦ c for the outgoing line candidate Then, the outgoing relay line with the smallest Pr value is selected, and by comparing the Pr value with the probability P0 (P0 is a predetermined value), if Pr ≦ P0, reception is permitted. , Pr> P0, the packet call processing method is characterized by rejecting the reception. 12. A packet call processing method according to any one of claims 8 to 10, wherein a cycle of a trunk line for an outgoing trunk line candidate that can be identified by a called subscriber address. The state Si to which the difference (X-R) between the most recent transferable throughput value X of the actual throughputs and the assumed throughput value R of the calling subscriber belongs is determined, and all candidate outgoing lines of the outgoing trunk line are determined. For each state (Si) of, if i ≦ c (c is a predetermined constant value (state value)), the call is rejected and the outgoing trunk line state Si satisfies i> c. If there is an outgoing line candidate to be processed, the sum Pr of the probabilities of transition from the state Si to any state Sj satisfying 1 ≦ j ≦ c for the outgoing line candidate And increase / decrease coefficient of the measurement throughput B, that is,
The transition change rate K of the past M samples (K is a positive or negative real number) is compared with K0 determined by the Pr value, the outgoing trunk line having the smallest Pr value is selected, and there are a plurality of outgoing trunk lines. In this case, the outgoing relay line having the smallest estimated change rate K value is selected, and Pr ≦ P0 and K ≦ K0 are selected for the outgoing relay line.
In the case of, the packet call processing method is characterized in that the reception is permitted, and in the case of Pr> P0 or K> K0, the reception is rejected. 13. A packet call processing method according to any one of claims 8 to 10, wherein the newest transferable throughput of the periodically counted actual throughputs of the incoming subscriber lines. State Si to which the difference (X-R) between X and the expected throughput value R by the calling subscriber belongs
From the sum Pr of the probabilities of transition to an arbitrary state Sj that satisfies 1 ≦ j ≦ d (d is a predetermined value) And the probability P1 value (P1 is a predetermined value),
A packet call processing method characterized by permitting reception when i> d and Pr ≦ P1 and rejecting reception when i ≦ d or Pr> P1. 14. A packet call processing system according to any one of claims 8 to 10, wherein the newest transferable throughput of the periodically counted actual throughputs of the incoming subscriber lines. State Si to which the difference (X-R) between X and the expected throughput value R by the calling subscriber belongs
From the sum Pr of the probabilities of transition to an arbitrary state Sj that satisfies 1 ≦ j ≦ d (d is a predetermined value) And the probability P1 value (P1 is a predetermined value), and the increase / decrease coefficient of the measured throughput B, that is, the past M
By comparing the estimated change rate K of the sample with K1 determined by the Pr value, if i> c and Pr ≦ P1 and K ≦ K1, reception is permitted, and i ≦ c or Pr> P1 or K> K1 In some cases, the packet call processing method is characterized by rejecting the reception.