JPS63252088A - Trunk selection system for decentralized exchange - Google Patents

Abstract

PURPOSE:To eliminate effective bypass processing of a subscriber control processor by providing a memory storing whether or not an idle trunk exists corresponding to a trans control processor on a subscriber control processor. CONSTITUTION:Trunk control processors PT1-PTi have a memory TM storing idle and busy trunks in its own processors and if the trunks of its own processor are all busy, it is informed to all subscriber processors PS1-PSk. On the other hand, the subscriber processors PS1-PSk have a memory ITM storing whether or not an idle trunk exists corresponding to the trunk control processors PT1-PTi and the memory ITM is revised by the information informed by the trunk control processors PT1-PTi and the memory ITM is referenced to discriminate whether or not a bypass trunk exists.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a trunk selection scheme in a distributed switch.

[Conventional technology]

FIG. 4 shows the configuration of a trunk selection method of a conventional distributed exchange. However, in FIG. 4, only the configuration of switched call control related to the present invention is described, and parts related to communication paths are omitted.

As shown in FIG. 4, in the distributed exchange A, subscriber STAs are distributed and accommodated in multiple subscriber control processors PS to PSk in order to increase processing power and expandability, and trunk TRK is , In order to improve reliability, a plurality of trunks headed to the same destination are distributed and accommodated in a plurality of trunk control processors PT, ~PT. In this case, the acquisition and release of the trunk TRK is managed by the trunk management memory TM.

When m trunks are accommodated in one trunk control wholesale processor, the trunk management memory 1゛M has a capacity of m bits and stores the empty/occupied status of m trunks TRK under the control of its own processor. and updates the trunk management memory TM according to acquisition/release requests from the subscriber control processors P S + ~PS.

A subscriber S accommodated in a subscriber control processor PS
The TA's outgoing connection processing is performed as follows.

A subscriber control processor PS selects one processor from a plurality of trunk control processors (hereinafter referred to as PT), and an inter-processor network interface N.
INF, via the interprocessor network, the trunk control processor PT.

Sends a trunk acquisition request to. Upon receiving this request, the trunk control processor PT searches the trunk management memory TM for an empty trunk. If there is an empty trunk, the trunk management memory TM corresponding to this trunk is updated to the busy state, a message indicating that the trunk acquisition was successful is returned to the subscriber control processor PS, and the trunk acquisition process is completed. Temporarily trunk system '11
■Processor PT.

If all trunks in the subscriber side are busy,
The processor PS receives the trunk acquisition failure message and issues a similar acquisition request to the subscriber control processor PS again as a detour process.

Thereafter, capture requests are issued to the trunk control processors in sequence until the trunk capture is successful, and if the trunk cannot be captured even after bypassing all trunk control processors, the trunk is blocked and a busy tone is sent to the subscriber STA. .

[Problem that the invention seeks to solve]

In the conventional trunk selection method described above, when traffic increases and trunk utilization increases, detour processing increases, the load on the subscriber control processor PS and trunk control processor PT increases, and the processing capacity of the entire exchange decreases. There is a problem with the decline.

SUMMARY OF THE INVENTION An object of the present invention is to provide a trunk selection method for a distributed switching system that solves these problems.

[Means for solving problems]

In the present invention, a plurality of trunks are respectively distributed and accommodated in a plurality of trunk control processors, a plurality of subscribers are respectively distributed and accommodated in a plurality of subscriber control processors, and the trunk control processor is connected to a plurality of subscriber control processors. In a trunk selection method of a distributed exchange in which a trunk is selected in response to a request from a trunk, the trunk control processor is provided with a first memory that retains the idle/busy status of trunks within the own processor, and the trunk control processor depends on trunk selection.
Means for notifying all the other subscriber control processors that all the trunks of the own processor are in the busy state, and means for notifying the other subscriber control processors that all the trunks of the own processor are no longer in the busy state by trunk release; means for notifying all of the subscriber control processors of the subscriber control processor, and providing the subscriber control processor with a second memory for storing whether or not there is an empty trunk corresponding to the trunk control processor, The user control processor includes means for updating the second memory with information notified from the trunk control processor, and means for issuing a selection request to a trunk control processor in which an empty trunk exists by referring to the second memory. It is characterized by having the following.

[Effect]

According to the present invention, the trunk control processor is provided with a first memory that maintains the idle/busy states of the trunks in its own processor, and the trunk control processor itself selects a trunk so that all the trunks of its own processor are busy. It notifies all other subscriber control processors that the trunk of its own processor is no longer busy due to the trunk release. Make it functional.

On the other hand, the subscriber control processor has trunk control 't11
A second memory is provided for one processor to hold whether or not there is an empty trunk, and the second memory is updated with information notified from the trunk control processor to the subscriber control processor itself. A function is provided to issue a selection request to a trunk-based J111 processor in which a free trunk exists by referring to the memory of the trunk.

This allows the subscriber control 11 processor to know which trunk control processor has an empty trunk when selecting a trunk.

〔Example〕

Hereinafter, the present invention will be explained in detail using the drawings.

FIG. 1 is a diagram showing the configuration of an embodiment of the present invention. 1st
In the figure, subscriber control processors PS1 to psk, trunk control processors PT, to PT,.

Inter-processor network interface NINF
, the functions of the I-rank management memory TM are the same as in the conventional example shown in FIG.

The difference from the conventional example is that an empty trunk existence memory ITM is provided in each of the subscriber control processors ps, -ps. The free trunk existence memory ITM has a capacity of i bits in a system with i trunk control processors PT, and each bit corresponds to a trunk control processor and indicates whether or not a free trunk currently exists in that trunk control processor. Show that.

The control sequence at the time of trunk selection in the embodiment of the present invention will be explained with reference to FIG. The subscriber control processor PS searches the free trunk existence memory ITM (step Sl). If all trunk control processors do not hold empty trunks (step S2), trunk blocking processing is performed (step 34). If an empty trunk exists, the trunk control processor PT that currently holds the empty trunk is known (step S2).

Then, for this trunk control processor PT,
Inter-processor network interface N I N
F. Sends a trunk acquisition request via the inter-processor network (step S3).

Trunk breakage processor PT that received the acquisition request.

searches the trunk management memory TM, selects one vacant trunk, returns the storage position of the acquired trunk to the subscriber control processor PS, and at the same time updates the trunk management memory TM (step S7). On the other hand, the subscriber control processor PS.

Thereafter, the outgoing connection process is continued (step S5).

After updating the trunk management memory TM, the trunk management processor PT, if there are no free trunks due to the current trunk acquisition (steps S8 and S9), further indicates that "all trunks of the own processor PT are busy". This message is sent to all subscriber control processors PS via the inter-processor network interface NINF and the inter-processor network (step 5).
10). Upon receiving this message, the subscriber control processor PS stores an empty trunk existing memory I in its own processor.
TM Trunk Control Processor PT.

The corresponding information is changed to "all trunks busy" (step S6). With this operation, subscriber control processor P
Since S+ knows that there will be no free trunk in the trunk control processor PTL in the next trunk selection, it can avoid the wasteful process of issuing a trunk acquisition request to the trunk control processor PT.

Next, the control sequence when releasing the trunk will be explained with reference to FIG. Subscriber control processor PS.

transmits the accommodation position of the trunk to be released to the trunk control processor PT (step 511). The trunk control processor PT updates the information corresponding to the trunk in the trunk management memory TM to an empty state by a procedure reverse to that at the time of trunk capture (step S12). Further, as a result of the current release process, the own processor checks whether or not the state in which all trunks are busy has changed to "the state in which there is only one free trunk" in step S13. 514)
In such a case, a message saying "an empty trunk has occurred in own processor PT" is sent to all subscriber control processors PS via the inter-processor network interface NINF and the inter-processor network (step 515).

The subscriber control processor PS that has received this mesozage performs the following steps in the reverse order of the trunk acquisition process described above.
Trunk control processor PT of free trunk existence memory ITM within its own processor.

The corresponding information is changed to "empty trunk existence state" (step 516). With this operation, the subscriber control processor PS selects a processor PT for which an empty trunk exists in the next trunk selection.

A trunk acquisition request can be issued by specifying .

〔Effect of the invention〕

As explained above, according to the present invention, the subscriber control processor is able to know which trunk control processor has an empty trunk when selecting a trunk. It is possible to eliminate this, and processing capacity can be improved.

[Brief explanation of the drawing]

FIG. 1 is a diagram showing the configuration of an embodiment of the present invention, FIG. 2 is a diagram showing the sequence at the time of trunk selection in the embodiment of FIG. 1, and FIG. 3 is a diagram showing the trunk release time in the embodiment of FIG. 1. FIG. 4 is a diagram showing the configuration of a trunk selection method of a conventional distributed exchange. PS+""PSa...Subscriber control processor P'r
'+' PT= ...Trunk city IH wholesale processor NINF ...Inter-processor network interface STA ...Subscriber TRK ...Trunk TM ... Trunk management Memory ITM...
...Free trunk existence memory Figure 2 Figure 3

Claims (1)

[Claims] (1) A plurality of trunks are respectively distributed and accommodated in a plurality of trunk control processors, a plurality of subscribers are respectively distributed and accommodated in a plurality of subscriber control processors, and the trunk control processor receives information from the subscriber control processor. In a trunk selection method of a distributed exchange that selects a trunk in response to a request, the trunk control processor is provided with a first memory that maintains the idle/busy status of trunks within its own processor, and the trunk control processor comprises: , due to trunk selection,
Means for notifying all the other subscriber control processors that all the trunks of the own processor are in the busy state, and means for notifying the other subscriber control processors that all the trunks of the own processor are no longer in the busy state by trunk release; means for notifying all of the subscriber control processors of the subscriber control processor, and providing the subscriber control processor with a second memory for storing whether or not there is an empty trunk corresponding to the trunk control processor, The user control processor includes means for updating the second memory with information notified from the trunk control processor, and means for issuing a selection request to a trunk control processor in which an empty trunk exists by referring to the second memory. A trunk selection method for a distributed exchange, characterized by having the following.