JPH06284457A - Call control processor - Google Patents

Abstract

PURPOSE:To operate a call number hunt processing without applying a limit at the time of designs at a caller side and a calling side, and to improve a throughput by operating an exclusive processing even when a hunt request is issued from the different priority side. CONSTITUTION:In a hant processing 40 at the caller side whose priority order is low, the content of a present CR empty/full table access area 23 in a memory 20 is updated at first, and an empty CR is searched in according to the contents of a calling side CR bit access area 21 and a CR empty/full table 10. In the hunt processing at the calling side whose priority order is high, the empty CR is searched at first according to the contents of a calling side CR bit access area 22 and the CR empty/full table 10, the position indicated by the content of the present empty/full table access are is checked, and when it is the same, the empty CR is researched.

Description

Detailed Description of the Invention

[0001]

FIELD OF THE INVENTION The present invention is used in a digital exchange. The present invention is used in a digital exchange. It is used for a call control processor that performs call control using the call reference of the switching system. In particular, the present invention relates to a vacancy management and hunt processing system of a call reference (call reference, hereinafter referred to as CR) of a call control processing device.

[0002]

2. Description of the Related Art Conventionally, a call control processor has added a CR in order to distinguish which call is controlled by a message to be transferred when a call is set up or released, and this CR is hunted. If you want to use a free CR without performing exclusive processing
Was searching for.

Call control in layer 3 will now be described by taking ISDN (Integrated Services Digital Network) as an example. FIG. 4 is a diagram showing the function of layer 3 of the integrated service digital network and its application target. In FIG.
In Layer 3, call control messages are transferred on the signal transfer logical link set on the D channel, and call control from the beginning to the end of each communication is performed.

At the time of call setup, a plurality of channels (B channel, D channel, etc.) existing in the user / network interface are selected and set, and a transmission medium in the network and a necessary transmission medium are selected based on a service request from the user. It provides functions for selecting and activating additional service processing functions, routing to the other party of communication, and transmitting information for confirming communication availability between communication terminals.

Layer 3 is functional even during a call and can transfer Layer 3 messages over the D channel.
A typical example thereof is interruption / resumption associated with terminal switching or movement. Also, the call is released at the end of the call. That is, the channel used for the call is released, and the transmission medium, call number, and other resources in the network are released, and the next call is prepared for use. Further, various messages are exchanged between the user and the network in order to provide the above function. For further details, see Ohmsha's "ISDN Picture Booklet", revised May 30, 1992.

FIG. 5 is a diagram showing the structure of the layer 3 message of the integrated service digital network, and shows the general structure of the layer 3 message. The layer 3 message is composed of a protocol identifier, a call number, a message type code as a common part, an essential information element and an additional information element as an individual part, followed by a multiple of octets. The common part is included in all messages of layer 3, and the individual part differs depending on the type of each message. The layer 3 message having the configuration shown in FIG. 5 is transferred as it is in the I field of the layer 2 or the I field of the UI frame.

Here, the function of the common part, which is the first part of the message particularly related to the call number, is as described below. Protocol Identifier The protocol identifier is DSS1 (Digital Subscriber s
It is provided to distinguish the ignalling System No. 1) layer 3 message from other signaling messages that may be defined in the future. For the time being, the protocol identifier is set to “Q.931.” In the case of packet communication, the X.25 packet transferred on the D channel is
The service access point identifier (SAPI) included in the I field of the I frame as it is and in the layer 2 address indicates that the I field contains packet information. Therefore, in this case, the protocol identifier is not included. Call number In ISDN user-network interface, a call number is used to distinguish which call is controlled by a layer 3 message for controlling a plurality of different calls on one layer 2 logical link. To be Call numbers are typically 1 octet for basic access, 2 octets for primary rate access, and a maximum allowed length of 3 octets. This length is indicated by a binary number on the length display section.
Bit 8 of the first octet of the call number is called a flag,
It indicates whether the call is activated on the network side (incoming call) or activated on the user side (outgoing call). This flag allows
If there is an outgoing call and an incoming call at the same time, they can be reliably distinguished even if the same call number is used. Message type The message type indicates what the message means during call processing, such as setting up a call or initiating a release.

[0008]

However, in such a conventional call control processor, the tasks of the calling side and the called side requesting the CR hunt must have the same priority, and the CR hunt is required. There is a drawback in that a condition must be set so that the process must not be interrupted.

Further, although a processing method of masking the CR hunt processing can be considered in response to a case where hunts are requested from different priorities, the masking has a drawback that the processing capability is reduced by that amount.

The present invention solves the above-mentioned drawbacks and allows call number hunt processing to be performed without restriction when designing the calling side and the called side, and the hunt is requested from the side having different priorities. Even in such a case, it is an object to provide a call control processing device that performs exclusive processing and has high processing capability.

[0011]

SUMMARY OF THE INVENTION According to the present invention, a free / busy management means for managing free / busy of a call number assigned to each of a calling party and a called party, and a free call number based on the contents of the free / busy management means. A call control processing device comprising hunt processing means for performing a hunt processing for searching and making the searched call number in use, and call control means for activating the hunt processing means and performing call control by the searched empty call number. In the above, the air-busy management means has an air-busy table in which bits indicating the number of air-bulbs corresponding to the number of call numbers are arranged, and a space accessed during hunt processing from one side of the calling side or the called side. A hunt management data memory including a current empty / closed table access area for storing the position of the closed / closed table, wherein the hunt processing means simultaneously and in parallel from the calling side and the called side on the empty / closed table. Means for executing a search and means for detecting that the same position on the free / busy table is accessed based on the contents of the current free / busy table access area during hunt processing from the other side of the calling side or the called side And a means for executing the search from the other side again when there is a detection output of the detecting means.

Further, according to the present invention, in the empty / busy table, bits indicating the empty / busy are arranged in order of call numbers, and the hunt management data memory stores latest call numbers of a calling side and a called side, respectively. In the case of hunt processing from the calling side, the hunt processing means includes a bit address area, and in the case of hunt processing from the calling side, based on the contents of the empty / busy table, the vacant call numbers are assigned in ascending order from the contents of the calling side bit address area. In the case of means to search and hunt processing from the called side,
Means for searching for an empty call number from the contents of the bit address area on the called side in the order of old number based on the contents of the empty / busy table.

Further, according to the present invention, the hunt processing means updates the contents of the current empty / closed table access area in the case of hunt processing from the one side, and later searches for an empty call number. In the case of the hunt process from the other side, a search for a free call number is performed first, and if the position of the searched call number in the free / busy table and the content of the current free / busy table access area are the same, the search is made again. Means may be included for performing the search.

According to the present invention, the hunt processing means is
A means for storing the latest call number in the bit address area of the calling side after performing hunt processing from the calling side, and a bit address area of the called side after performing hunt processing from the called side. Means for storing the latest call number.

[0015]

A free / busy table arranged corresponding to a mounted call number and including bits indicating a free / busy state of the call number, a bit access area for storing the latest call numbers of the calling side and the called side, and a calling side There is provided a current empty / busy table access area for storing the position of the current empty / busy table to be accessed at the time of hunt processing from one of the calling side and the called side. In the hunt process from one side, the contents of the current empty / busy table access area are updated, and then the empty call number is searched by the bit access area on one side and the contents of the empty / busy table, and the other of the calling side or the called side is searched. In the hunt process from the side, the free call number is searched first for the free call number based on the contents of the bit access area and the free / busy table on the other side, and the position of the searched free call number and the content of the current free / busy table access area are searched. Are compared, and if they are the same, search again. This allows
Without any restrictions when designing the calling and called parties,
Hunt processing can be performed, and even when a hunt request is made from different priority sides, exclusive processing can be performed to increase processing capacity.

[0016]

Embodiments of the present invention will be described with reference to the drawings.

FIG. 1 is a block diagram of a call control processor according to an embodiment of the present invention. In Figure 1, 0/1 0 is CR
In use and 1 indicates CR vacancy, CR value = 8n + m 0 ≦ m <8 0 ≦ n <(number of CRs provided by switching system-1) / 8 +
It is 1. The call control processing device manages the availability of a call number assigned to each caller and called party.
And a hunt processing means 40 that searches for an empty call number based on the contents of the open / close management means 30 and performs a hunt process in which the searched call number is in use; And a call control means 50 for performing call control according to.

Here, the feature of the present invention resides in that the empty / busy management means 30 is a CR empty / busy table 10 as an empty / busy table in which bits indicating the number of empty / busy corresponding to the number of call numbers are arranged. It is currently used as a current air-closed table access area that stores the position of the CR air-closed table 10 that is accessed during hunt processing from one side of the calling side or the called side (herein, the calling side having a lower priority). CR CR As a hunt management data memory including a blank access table access area 23
A hunt management data memory 20 is provided, and the hunt processing means 40 has means for executing a search for a vacant call number on the CR empty / busy table 10 simultaneously in parallel from the calling side and the called side, and the calling side or the called side. During the hunt process from the other side of the calling side (herein, the called side having a higher priority), the same position on the CR empty / closed table 10 is accessed based on the contents of the current CR empty / closed table access area 23. This means is to include means for detecting this, and means for re-executing the search from the other side (called side) when there is a detection output of this detecting means.

Further, in the CR empty / closed table 10, the bits indicating the empty / closed areas are arranged in the order of call numbers, and the CR hunt management data memory 20 stores the bit addresses for storing the latest call numbers of the calling side and the called side, respectively. Calling party C as area
In the case of hunt processing from the calling side, the hunt processing means 40 includes an R bit address area 21 and a called side CR bit address area 22, and the calling side CR bit address based on the contents of the CR blockage table 10. In the case of a hunt process from the called side in the order of searching for empty call numbers from the contents of the area 21, and in the case of hunt processing from the called side, from the contents of the called side CR bit address area 22 to the old number And means for searching for available call numbers in sequence.

Further, the hunt processing means 40 is means for updating the contents of the current CR empty / closed table access area 23 in the case of the hunt processing from the one side (calling side) and later searching for an empty call number. In the case of hunt processing from the other side (callee side), an empty call number is searched first, and the position of the searched call number in the CR empty / closed table and the current CR empty / closed table access area 23 are searched. When the contents are the same, a means for executing the search again is included.

Further, the hunt processing means 40 carries out the hunt processing from the calling side and then stores the latest call number in the CR bit address area 21 of the calling side and the hunt processing from the called side. And a means for storing the latest call number in the CR bit address area 22 of the called side.

The operation of the call control processor having such a configuration will be described. FIG. 2 is a flowchart showing the operation on the calling side of the call control processing device of the present invention. FIG. 3 is a flowchart showing the operation on the called side of the call control processing device of the present invention. 1 to 3 CR for each outgoing or incoming call
In order to allocate the number of 8 bits, the CR empty / occurrence table 10 in which the number of installed CRs provided by the switching system is prepared in row units, and the latest CR (bit address of the calling side and the called side) is allocated. ) Are stored respectively in the calling side and the called side CR bit address area 21 (initial value is 0) and the called side CR bit address area 22 (the initial value is set to the number of CR implementations of the switching system minus 1). Current CR empty / closed table access area [calling side of calling side at the time of CR hunt from the side with low priority (here, calling side) to realize mutual exclusion processing by activating hunting processing between calling sides Area for storing a pointer of a type (char type)] 23 and CR hunt processing is performed.

At the time of CR hunt from the calling side, an empty CR in the CR empty / closed table 10 is searched and arrived from the bit address of the CR stored in the calling side CR bit address area 21 backward (in order from the smallest number). During the CR hunt process from the calling side, the C stored in the called side CR bit address area 22
An empty CR in the CR empty / occlusion table 10 is searched forward (in order of old number) from the bit address of R.

Here, the CR of the calling side (side with lower priority)
In the hunt processing, the current CR empty / closed table access area 23 (character type pointer) on the calling side is updated before searching for an empty CR, and then an empty bit (CR) is searched. Further, in the CR hunt process from the called side (the side with high priority), the empty CR is searched first, and when the empty CR is found, the CR empty / closed table 10 of the searched empty CR (the called side). When the position of the CR bit address area 3) is the same as the position stored in the current CR empty / closed table access area 23 of the calling side (the side with lower priority), the CRs to be given may conflict. Therefore, here, without hunting, the pointer is moved to the next area (the pointer is moved forward by one), and the process of searching for the next empty CR is performed.

[0025]

As described above, the present invention has an excellent effect that the call number hunt process can be realized without any restrictions in designing the calling side and the called side. Further, even when a hunt request is made from different priority sides, there is an advantage that exclusive processing can be performed to increase processing capacity.

[Brief description of drawings]

FIG. 1 is a block configuration diagram of a call control processing device according to an embodiment of the present invention.

FIG. 2 is a flowchart showing the operation on the calling side of the call control processing device of the present invention.

FIG. 3 is a flowchart showing the operation on the called side of the call control processing device of the present invention.

FIG. 4 is a diagram showing functions and application targets of layer 3 of the integrated service digital network.

FIG. 5 is a diagram showing a structure of a layer 3 message of the integrated service digital network.

[Explanation of symbols]

10 CR empty / closed table 20 CR hunt management data memory 21 Calling side CR bit address area 22 Called side CR bit address area 23 Current CR empty / closed table access area (low priority side, calling side) 30 Overflow management Means 40 Hunt processing means 50 Call control means

Claims (4)

[Claims] 1. A free / busy management means for managing free / busy of a call number assigned to each of a calling party and a called party, and a free call number is searched based on the content of the free / busy management means, and the searched call number is In a call control processing device comprising a hunt processing means for performing a hunt processing that is in use and a call control means for activating the hunt processing means and performing call control by the searched idle call number, , The current state that stores the position of the free / busy table in which bits indicating the number of free / busy corresponding to the number of call numbers are arranged and the position of the free / busy table to be accessed at the time of hunt processing from either the calling side or the called side. A hunt management data memory including an empty / busy table access area, wherein the hunt processing means executes a search for an empty call number on the empty / busy table simultaneously in parallel from a calling side and a called side. A means for detecting access to the same position on the empty / busy table based on the contents of the current empty / busy table access area during hunt processing from the other side of the calling side or the called side, and this detecting means And a means for re-executing the search from the other side when there is a detection output of the call control processing device. 2. The empty / busy table has bits indicating the empty / busy arranged in the order of call numbers, and the hunt management data memory has a bit address area for storing the latest call numbers of the calling side and the called side, respectively. In the case of hunt processing from the calling side, the hunt processing means includes means for searching idle call numbers in ascending order of number from the contents of the bit address area of the calling side based on the contents of the empty / closed table. ,
2. The call according to claim 1, further comprising: in the case of a hunt process from the called side, a means for searching an empty call number in the order of old number from the contents of the bit address area of the called side based on the contents of the empty / busy table. Control processor. 3. The hunt processing means, in case of hunt processing from the one side, means for updating the contents of the current empty / closed table access area and later searching for an empty call number, and from the other side. In the case of the hunt processing, the free call number is searched first, and if the position of the searched call number in the free / busy table and the content of the current free / busy table access area are the same, the search is performed again. The call control processor according to claim 1, further comprising means. 4. The hunt processing means stores the latest call number in the bit address area of the calling side after performing the hunt processing from the calling side, and performs the hunt processing from the called side. 3. The call control processor according to claim 2, further comprising means for storing the latest call number in the bit address area of the called side.