KR20000060459A - Call table resource assignment and removal of the base control station using Circular Queue - Google Patents

Abstract

PURPOSE: A method for allocating and releasing a call table resource of a control station using a circular queue is provided for using a circular queue in a call control processor in a control station of a mobile communication system, maintaining the circular queue using an index of a call table capable of allocating a call resource and deleting a call table index in the circular queue when allocating the call resource. CONSTITUTION: An index of an allocable call table is inserted into a call table index of a circular queue(S1). A call resource allocation request is received for a call process of a new transmission/arrival signal from a base station or a switch(S2). A call control process of a control station judged whether the positions of a circular queue indicated by an allocation pointer and a release pointer are same(S3) in accordance with a request(S2).

Description

Call table resource assignment and removal of the base control station using Circular Queue

The present invention provides a mobile communication system employing a code division multiple access (CDMA) scheme such as a digital cellular system (hereinafter referred to as 'DCS') or a personal communication system (hereinafter referred to as 'PCS'). Call Control Processor (CCP) in a control station of a communication system, which uses a circular queue to manage call resource allocation and release to a call table, regardless of the increase of the lake. The present invention relates to a method for allocating and releasing call table resources at a control station using an annular queue to keep a resource allocation time constant.

In general, a mobile communication system such as a DCS or a PCS includes a mobile terminal 1, a base station 2 that wirelessly transmits and controls data to and from the mobile terminal 1, and the base station. And a switch station 4 and a switch station 4 for transmitting and receiving data to and from the data, and in particular, the control station 3 is an originating call of the base station 2 and an incoming call request of the exchange 4. Perform call processing according to

That is, if there is a call request from the base station 2 through the mobile station 1 or an incoming call request from the switch 4, the call control processor in the control station 3 uses the call processing program to empty the call table. It fills in the call resource information of the originating / incoming signal and creates a child process to perform call processing.

In this case, as a method of finding an empty place of a call table, the call table index for searching the call table is initialized to '0', and if the call table index exceeds the value of '1920', an error message is returned. If the call table index does not exceed '1920', it checks whether the call table indicated by the call table index is used by another call.

If the call table indicated by the call table index is used by another call, the call table index is incremented by 1 and the procedure is repeated to check whether the call table index exceeds '1920'.

However, if the call table indicated by the call table index is not used by another call, the call table is filled with call resource information and terminated.

As described above, the conventional call table resource allocation is operated by sequentially searching whether a corresponding call table is being used by another call for each call table index, and finding call spaces to allocate call resources.

However, if the number of calls in progress is small, it will not be a big problem for call table resource allocation.However, if the number of calls increases considerably, the number of calls is gradually reduced, and the step of checking whether the call table index has exceeded '1920' You must continue to iterate up to the stage where you need to increase the call table index by one.

Therefore, such a conventional call table resource allocation causes a call processing program in the call control processor in the control station 3 to become overloaded as time passes, and also because the resource allocation time continues to increase. There was a problem in that the failure of the program could not satisfy the real-time call processing characteristics of the program.

The present invention has been made to solve the above problems, and an object thereof is to use one annular queue in a call control processor in a control station of a mobile communication system, and use this annular queue as an index of a call table to which call resources can be allocated. After the call resource allocation, the call table index is deleted from the annular queue when the call resource is allocated and the call table index is inserted into the annular queue when the call resource is released. The present invention provides a method for allocating and releasing call table resources at a control station using an annular queue to stably perform call processing at a station.

1 is a block diagram of a general mobile communication system;

2 is a diagram illustrating a structure of an annular queue and a call table for call table resource allocation and release at a control station according to the present invention;

3 is an operation flowchart showing a call table resource allocation method in a control station according to the present invention;

4 is a flowchart illustrating a method of releasing a call table resource at a control station according to the present invention;

Figs. 5A to 5 are diagrams for explaining call table resource allocation and release operations in a control station according to the present invention, for example.

<Description of the code | symbol about the principal part of drawing>

1 mobile terminal 2 base station

3: control station 4: switchboard

10: annular queue 20: arc table

The method for allocating and releasing call table resources at the control station using the annular queue of the present invention for achieving the above object is to initialize the call processing program in the call control processor of the control station so that all the indexes of the call table that can be allocated are assigned to the annular queue. After inserting, when call resource allocation request is requested, the call table index stored in the annular queue pointed to by the allocation pointer is read, and the call resource information is set while the availability field is used at the call table corresponding to this index. Stored in the field, and then initializes the call table index to null at the position of the annular queue pointed to by the allocating pointer previously, and increments the allocating pointer by one. To store the index of the call table to be released and the call resource information to be released. The information field is initialized to null while the table is searched and the use field is set to unused, and then the release pointer is increased by one.

In this case, when the allocation pointer or the release pointer indicates the last position of the annular queue, the position of the pointer increased by 1 indicates the first position of the annular queue.

Hereinafter, a call table resource allocation and release method in a control station using an annular queue according to the present invention will be described in detail with reference to the accompanying drawings.

2 is a view showing a ring queue and a call table for call table resource allocation and release at a control station according to the present invention, one ring queue 10 storing an index of a call table to which call resources can be allocated; One call table 20 for managing the incoming / outgoing signals processed by the control station, an allocation pointer for storing two variables for managing the annular queue 10, i.e., an indirect position of the place to allocate; It consists of a release pointer that stores the position of the release.

The annular cue 10 is configured to be larger than the size of the call table 20, which is to distinguish whether the annular cue 10 is empty or full, and if the size of the annular cue 10 is If the size of the call table 20 is the same, the empty and the full cannot be distinguished.

The annular queue 10 has two fields: a queue index 11 for referring to an actual annular queue, and a call table index 12 for storing an index of the call table 20. The call table 20 includes a call table index 21 for referring to an actual call table, a use field 22 for distinguishing whether a call table of the corresponding index is used by a specific call, and It consists of an information field 23 for storing other information such as a process ID (ID).

3 is a flowchart illustrating a method of allocating a call table resource at a control station according to the present invention, and FIG. 4 is a flowchart illustrating a method of releasing a call table resource at a control station according to the present invention. A call table resource allocation and release method in a control station using an annular queue is as follows.

At the time of call resource allocation, as shown in the flowchart of FIG. 3, first, the call table index of the annular queue 10 is converted into an index 21 of the call table 20 that can be allocated by initializing the call processing program in the call control processor of the control station. 12), all of them are inserted (S1), and a call resource allocation request for call processing of a new incoming / outgoing signal is received from a base station or an exchange (S2).

In response to the request of step S2, the call control processor in the control station determines whether the positions of the annular queue 10 indicated by the allocation pointer and the release pointer are the same (S3).

If the positions of the annular queue 10 indicated by the allocation pointer and the release pointer are the same in step S3, all of the empty spaces of the call table 20 are filled, indicating that the call resource information can no longer be stored (S4). If the position of the annular queue 10 indicated by the allocation pointer and the release pointer is not the same as each other, the position of the annular queue 10 currently indicated by the allocation pointer is found (S5). The table index 12 is read (S6).

Subsequently, the position of the call table 20 corresponding to the call table index 12 read in step S6 is found and the use field 22 at this position is set to busy (O) (S7). The call resource information is stored in the field 23 (S8).

Thereafter, the call table index 12 is initialized to the null state at the position of the annular queue 10 previously indicated by the allocation pointer, and the allocation pointer is increased by one (S9).

In this case, it is determined whether the allocation pointer increased in the step S9 is greater than the maximum call table index + 1 (10) (S10). If the allocation pointer is large, the allocation pointer is assigned to the first position of the annular queue 10, that is, the queue index ( 11) indicates a position of '0' (S11), and if it is small, the process returns to the step S2 and repeats the following operation continuously.

Next, the call table resource release method shown in the flowchart of FIG. 4 will be described.

When the call control processor in the control station receives a call resource release request from the base station or the exchange (S21), it is determined whether the index of the annular queue 10 indicated by the release pointer is smaller by 1 than the index of the annular queue 10 indicated by the allocation pointer. If (S22), if there is little call resource allocation attempts to release the call resources even if there is no error message output (S23), if not, find the position of the annular queue 10 pointed to by the release pointer (S24) the annular The index 21 of the call table 20 to be released from the call table 20 is stored at the position of the queue 10, that is, the call table index 12 (S25).

Subsequently, the call table 20 storing call resource information to be released is found, the use field 22 is set to unused (S26), and the information field 23 is initialized to null state to delete call resource information. (S27).

Thereafter, the release pointer is increased by 1 (S28).

In this case, it is determined whether the release pointer increased in the step S28 is larger than the maximum call table index + 1 (10) (S29). If the release point is large, the release pointer is the first position of the annular queue 10, that is, the queue index. (11) points to a place where it is '0' (S30), and if it is small, returns to the step (S21) to continue to perform the following operation repeatedly.

As described above, the present invention is a method for allocating and releasing call resources using an allocation pointer and a release pointer. The present state of the call table 20 is provided by placing a call table index 12 field on the annular queue 10. By matching with, it is possible to maintain the call resources currently allocated in the annular queue 10 in real time.

5A to 5D illustrate, by way of example, call table resource allocation and release operations in a control station according to the present invention. FIG. 5A is a circular queue 10 and a call table during initial initialization. A diagram showing the state of (20) is shown first, so that the assignment pointer and the release pointer point to the first index (0) of the annular queue 10, and whether the use field 22 of the call table 20 is unused. It initializes to medium (X) and initializes all the information fields 23 which store call resource information, such as a process ID, to a null state.

After initializing the call table 20 as described above, the call table 20 is sequentially searched from the beginning, and the index 21 of the call table 20 which is not used is stored in the annular queue 10 and the release pointer is stored. The size of the call table 20 (in the present invention, the size is set to '10') is increased.

In this case, the difference between the allocation pointer and the release pointer indicates the number of call tables that can be allocated at initialization.

As described above, the annular queue 10 always stores the call table index 21 for the currently assignable call table 20.

(B) is a diagram of allocating call resources to three call tables 20 in the initial state of (A). When allocating one call resource, the call table index of the annular queue 10 indicated by the allocation pointer is indicated. (12), the call field information corresponding to this call table index 12 is filled with call resource information such as processor ID in the information field 23 in the index 21 of the call table 20, and the use field 22 is being used ( O), and then initializes the call table index 12 of the annular queue 10 to a null state.

Then, the assignment pointer is increased by one.

The result of allocating three call resources by the above method is shown in FIG.

(C) is a diagram in the case of releasing a call resource whose call table index 21 of the call table 20 is '2' in the state of FIG. 5B, and the annular queue 10 indicated by the release pointer. The call table index 21 to be released in the call table index 12, i.e., '2', is stored in the call table 20, and the call resource information of the information field 23 is initialized to null state. (22) is displayed as unused (X).

Then, the release pointer is increased by one.

At this time, since the release pointer indicates the last position in (b) of FIG. 5 due to the property of the annular queue 10, when the number is increased by one, the first position of the annular queue 10 is again indicated.

(D) is a diagram in which two call resources are allocated again in the state of (C) of FIG. 5, and the two call resources are allocated and the allocation pointer is increased, and the corresponding information field 23 of the call table 20 corresponds to the corresponding information. Fill in call resource information.

FIG. 5E is a diagram when the call resources whose call table indexes 21 are '1' and '3' of the call table 20 are released in the state of FIG. Releases the call resources stored in the information field 23 of the call table 20 with '1' and '3' and assigns the indexes of '1' and '3' to the call table index 12 of the annular queue 10. After saving, increase the release pointer by 2.

(A) is a diagram in which two call resources are allocated again in the state of (e) of FIG. 5, and (g) shows that the call table index of the call table 20 is '6' in the state of (b) of FIG. (A) is a diagram in which four new call resources are allocated, and four call resources are allocated and the allocation pointer exceeds the maximum size of the annular queue 10. Point to the first of the annular queue (10).

Lastly, (i) is a diagram in the case of releasing call resources whose call table index 21 of call table 20 is '7' and '8'.

The call resource allocation and release method in the call table of the present invention as described above is preferably applied when the conventional sequential resource allocation method is used.

For example, when performing a vocoder resource allocation in a call processing program in the call control processor of a control station for one call processing, the fact that the status of the vocoder is actually added should be added. Instead of inserting the index into the annular queue, the vocoder's resources are checked by looking at the current state of the vocoder and inserting it into the annular queue only when the status is normal, or by checking the vocoder's state once again and assigning it even if a single vocoder resource is allocated. Allow the assignment to be performed.

As described above, in the present invention, unlike the conventional method in which the allocation time for call resources increases exponentially as the call increases, the allocation time does not increase even if the number of calls increases according to the annular queue. Because of this, there is an effect that can be stable call processing.

In addition, there is an advantage in that real-time call processing is possible to sufficiently satisfy the characteristics of the call processing program.

Claims (3)

A call table resource allocation and release method in a call control processor in a control station of a mobile communication system, One call queue in the call control processor is provided with one annular queue 10 that stores the index 21 of the call table 20 to which call resources can be allocated among the call tables 20 for processing and managing incoming / outgoing signals. Initializing the annular queue 10 by sequentially inserting the index 21 of the call table 20 to which call resources are allocated in the call table 20 in the call table index 12 of the annular queue 10 according to the processing program. A first process of doing; After performing the first process, when the call resource allocation request is made, the call resource is allocated to the index 21 of the call table 20 corresponding to the call table index 12 of the annular queue 10 indicated by the assigning pointer using the assigning pointer. A second step of increasing the allocation pointer after allocating; After performing the second process, when the call resource release request is performed, an index of the call table 20 storing the call resource to be released in the call table index 12 of the annular queue 10 indicated by the release pointer using the release pointer ( 21) storing the call resource and releasing the call resource and increasing the release pointer; After the allocation pointer and the release pointer are increased in the second and third processes, when the increased allocation pointer and the release pointer are larger than the maximum call table index + 1 (10), the allocation pointer and the release pointer are annular queues. 10) A method for allocating and releasing call table resources at a control station using an annular queue, characterized by comprising a fourth step of pointing to the first position of 10). 2. The method of claim 1, wherein in the second process, when a call resource allocation request for a call processing of a new incoming / outgoing signal is received from a base station or an exchange, positions of the annular queue 10 indicated by the allocation pointer and the release pointer are mutually different. If the first step of judging whether the same and the position of the annular queue 10 indicated by the allocation pointer and the release pointer in the first step are the same, all the empty spaces of the call table 20 are filled to store the call resource information. If the position of the annular cue 10 indicated by the assignment pointer and the release pointer is not the same, the position of the annular queue 10 currently indicated by the allocation pointer is found and the position of the annular queue 10 is indicated. The second step of reading the stored call table index 12 and the position of the call table 20 corresponding to the call table index 12 read in the second step are found and used at this position. A third step of setting the subfield 22 to in use (O) and storing call resource information in the information field 23, and after performing the third step, the annular queue 10 previously indicated by the allocation pointer. A fourth step of initializing the call table index 12 to a null state and increasing the allocation pointer by 1 at the position of; and, if the allocation pointer increased in the fourth step is smaller than the maximum call table index + 1 (10); 5. A method for allocating a call table resource at a control station using an annular queue, comprising the fifth step of returning to the first step and continuously performing the following operations. According to claim 1, wherein the third process, when receiving a call resource release request from the base station or exchange, the index of the annular queue 10 indicated by the release pointer is 1 than the index of the annular queue 10 indicated by the allocation pointer. If the index of the annular queue 10 indicated by the release pointer is less than the index of the annular queue 10 indicated by the allocation pointer in the first step, and if the index is less than 1, an error message is output. A second step of finding the position of the annular queue 10 indicated by the release pointer and storing an index of the call table to be released from the call table 20 at the position of the annular queue 10; and after performing the second step, A third step of searching for a call table 20 storing call resource information to be released, setting the use availability field 22 to unused, and initializing the information field 23 to a null state to delete call resource information; The above After performing step 3, if the release pointer is increased by 1 and the release pointer increased in the fourth step is smaller than the maximum call table index + 1 (10), the process returns to the first stage and continues the following operation. And a fifth step of repeatedly performing the call table resource release method in the control station using the annular queue.