WO2004004387A1

WO2004004387A1 - Radio base station apparatus and resource assignment controlling method

Info

Publication number: WO2004004387A1
Application number: PCT/JP2003/008181
Authority: WO
Inventors: Motofumi Hanada
Original assignee: Nec Corporation
Priority date: 2002-06-28
Filing date: 2003-06-27
Publication date: 2004-01-08
Also published as: JP2004032610A

Abstract

A radio base station apparatus has a plurality of CH card groups for performing baseband signal processings and also has means for assigning a CH card resource to a requested call; examining the usage state of the CH card groups; shifting an established call, in accordance with the contents thereof, to a different CH card; rearranging the resources of the CH card groups; and reserving a CH card resource for a new call. In the rearrangement process, a linear programming is used to decide, based on the usage state of the CH card groups, the contents of the rearrangement of the CH card resources.

Description

Specification

Radio base station apparatus and resource allocation control method This application is based on Japanese Patent Application No. 200-02-18949, the entire contents of which are incorporated herein by reference. . Technical field

The present invention relates to a method for allocating radio channel resources in an IMT2000 system and other mobile communication systems, and is particularly applied to a radio base station apparatus including a plurality of radio transmission / reception cards (CH cards) and call processing control thereof. It relates to a resource allocation control method. Background art

As is well known, the IMT2000 system and other mobile communication systems include a radio base station that communicates with a plurality of mobile stations, and the call processing control unit of the radio base station device realizes call setup Z release. For this purpose, it is equipped with multiple wireless transmission / reception control cards (hereinafter referred to as CH cards) having a baseband function.

In the call processing control unit of the radio base station apparatus, in order to realize call setup Z release, resource management is performed by allocating resources to a plurality of CH cards and releasing resources. A new call is set by either new setting / HH0 (hard handover).

This type of system is disclosed in Japanese Patent Application Laid-Open No. 9-331569 (“wireless line resource allocation method”). According to the publication, in the technology for sequentially searching for a free line from the youngest carrier of a wireless line and assigning the first free line to a call, the life of the wireless transmission / reception card for the youngest carrier number is the best. Eliminates the inconvenience of running out quickly and allows all wireless transmission and reception without increasing the frequency of using specific cards We are proposing a technology (wireless line utilization method) that allows cards to be used almost equally.

1 (a) and 1 (b) are system configuration diagrams corresponding to a digital MCA (multi-channel access) system (wireless base station) disclosed in the above publication. FIG. 2 is a flowchart for explaining the operation of the apparatus shown in FIG. The reference numerals and the like in the figures conform to the publication. This digital MCA system includes a wireless communication control device 102 and a plurality of mobile stations 101. The wireless communication control device 102 includes a signal transmitting / receiving device 11 and a wireless transmitting / receiving card 12. The signal transmission / reception device 11 has a maximum of 16 wireless transmission / reception cards (CH cards) 321. The wireless transmission / reception card 321 transmits / receives all time slots of, for example, one carrier (16 carriers in total). The wireless control card 12 includes a control unit 5 and a storage unit 6. The control unit 5 includes a communication control unit 1 and a line management unit 2, and the storage unit 6 includes a use management memory 3 and a line management memory 4. Here, the detailed configuration and operation of each part of the system and the description of the flowchart are omitted from the gazette.

In addition, Japanese Patent Application Laid-Open Nos. 2001-285480 and 2001-218260 also disclose a call accommodating device and a call accommodating method for effectively using a card group as a call-channel conversion means for accommodating a call. For example, techniques related to this type of radio base station apparatus and a unit resource management method thereof are disclosed.

By the way, in the conventional radio base station apparatus, when call setting → release → setting → release— is repeated during operation, resources are allocated in a vacant manner, resulting in wasteful resource allocating. . Fig. 6 shows an example of a wasteful resource allocation method. FIG. 6 ((a), (b)) is a diagram schematically showing a change in the usage state of the CH card of the wireless base station device.

Here, it is assumed that the number of mounted CH cards is two and the number of resources per CH card is three. In addition, the base station supports services A, B, and C. It is assumed that The number of resources required to assign each service to the CH card is as follows. That is, the number of resources required to allocate service A to the CH card is 1, the number of resources required to allocate service B to the CH card is 2, and the number of resources required to allocate service C to the CH card is The number of resources is three.

First, at some point, service A (l-user), service A (2nd-user), service A (3rd-user), and service B (l-user) are as shown in Fig. 6 (a). It is assumed that each CH card has been set.

Next, when service A (2nd user) and service A (3rd user) are released, the usage status of the CH card becomes as shown in Fig. 6 (b). Here, it is further assumed that a setting request (new setting) of service C (second user) whose required number of resources is 3 is notified from a higher-level device (RNC: Radio Network Controller). In this case, there are a total of three free resources for the base station apparatus, but this service C cannot be allocated because the setting cannot be made across CH cards. In other words, in the case of FIG. 6 (b), there is a wasteful resource allocation method.

As described above, in the conventional radio base station apparatus, there is a case where a newly set call cannot be set even though the resources are available in the call processing control unit, and the resources cannot be used effectively. There is a problem. Disclosure of the invention

The present invention has been made in order to address the above-described problems. In a CH operation in a call processing control unit of a radio base station apparatus, for example, as shown in FIG. Radio base station apparatus and resource allocation control method capable of avoiding the conventional inconvenience that call setting cannot be performed despite the fact that there is a waste in the method of allocating resources. The purpose is to propose. In order to solve the problem, according to the present invention, a radio base station device having a plurality of CH cards that are assigned to a requested call and perform baseband signal processing is provided for a requested call. While allocating the resources of the CH card, investigating the usage status of the CH card group, moving the set call to another CH card according to the content, and relocating the resources of the CH card group. It includes and configures resource allocation means to secure CH card resources for new calls. The resource allocating means may be configured to determine the content of the resource relocation of the CH card using the linear programming method based on the usage status of the CH card group in the process of the relocation.

Also, the radio base station includes a call reception Z response unit, a plurality of CH cards for performing baseband signal processing, a resource management Z setting unit for performing resource management and the like of the CH cards, and a 再 code rearrangement unit. In cooperation with these parts, the resources of the CH card are allocated to the requested call, and the use of the CH card group is investigated to set the call according to the contents. Move to another CH node and relocate the resources of the CH card group to secure the resources of the CH card for new calls. To determine the content of the resource to be relocated in the CH mode, a linear programming method may be used based on the usage status of the CH card group.

Also, the method of the present invention is a resource allocation method for allocating a CH card resource to a call in a radio base station apparatus provided with a plurality of CH card groups 201 for performing baseband signal processing. A first determination process for determining whether a call that can be assigned to a single channel is assigned, and if the result of the first determination process is assignable, the requester is notified of the fact and the call is notified. To the CH card, and if the result of the first determination process is unassignable, the call already set in the CH card group is rearranged to a predetermined state based on various parameters of the call. The second call to predict whether the requested call can be assigned to a specific single CH card, and if the result of the second call is assignable, notify the requesting source to that effect. Then the CH car If the result of the second determination process cannot be assigned, and if the result of the second determination process cannot be assigned, the request is re-assigned to the request source. And a step of notifying that. . In the second determination step, a linear programming method can be used to predict and determine whether the requested call can be allocated.

The present invention is applied to, for example, an IMT2000 wireless base station apparatus call processing control unit. A feature of the present invention is that, by using a linear programming method, an optimum resource allocation method is calculated as a whole for a plurality of CH cards (modems) having a baseband function, and rearrangement is performed according to the calculation method. The point of control is to avoid the situation where call setup is not possible. BRIEF DESCRIPTION OF THE FIGURES

1 (a) and 1 (b) are system configuration diagrams showing a configuration example of a conventional radio base station, and FIG. 2 is a flowchart for explaining the operation of the conventional system of FIG. FIG. 4 is a block diagram showing the configuration of an embodiment of the base station apparatus according to the present invention. FIG. 4 is a flowchart illustrating the operation of the embodiment. FIG. FIG. 6 is a schematic diagram showing a configuration example of a CH card group in a station device, and FIGS. 6 (a) and (b) are diagrams schematically showing a change in a usage state of a CH card in a wireless base station device. Yes, FIG. 7 (a) is a schematic diagram illustrating the resource allocation state calculated by the linear programming, and FIG. 7 (b) is a schematic diagram illustrating the rearrangement result. BEST MODE FOR CARRYING OUT THE INVENTION

[Examples] Hereinafter, examples of the present invention will be described in detail with reference to the drawings. The configuration of one embodiment of the base station apparatus according to the present invention is shown in the block diagram of FIG. 3 together with the mobile station. FIG. 3 shows only relevant parts related to the present invention. The radio base station device 200 in FIG. 3 includes a CH card group 201 and a call control unit 202. The call control unit 202 includes a call reception Z response unit 203, a resource management / setting unit 204, and a code rearrangement unit 205. It is comprised including. The resource allocation method according to the present invention can be implemented by a resource allocation unit configured as a set of these functional units. The wireless base station device 200 includes A communication control unit and a line management unit, a storage unit (memory) for line management and resource use management, and a main control unit for controlling each unit are provided.

Subsequently, the outline of each functional unit shown in the figure will be briefly described. The operation of each functional unit will be described later in detail as the operation of the embodiment.

First, the call accepting Z response unit 203 performs (A1): reception of a call setting notified from a higher-level device (RNC), (A2): notification of the call setting to the resource management / setting unit 204, (A3): call If setting is possible, ACK is sent; if setting is not possible, Failure is notified to the upper-level device (RNC). It should be noted that resource setting / impossibility is notified from the resource management / setting unit 204.

Next, in the resource management / setting unit 204, (B1): a process of judging whether or not the resources necessary for executing the call setting notified from the call reception / response unit 203 exist in the CH card group 201, B2): If the resource exists, perform call allocation processing to the resource. Note that the determination and assignment method may be a known algorithm that has been conventionally used.

In addition, the same resource management Z setting unit 204 notifies the (B3): call reception / response unit 203 that the call can be set if the call can be assigned in the above determination. However, if the call cannot be assigned in the above judgment, (B4): a start command is sent to the code rearrangement unit 205, and the following various parameters are notified.

(B4-1) Current resource status (what services are set for each CH card and the number of resources used)

(B4-2) Whether the new call is set to new setting / HH0

(B4-3) What is the new call service? Also, the number of resources required for setting

Further, when notified by the code rearrangement section 205 that the resource rearrangement is possible, the resource management / setting section 204 sets the (B5): CH card group 201 so that the resource allocation state calculated by the code rearrangement section 205 is obtained. To the call reception / response unit 203 to notify that it can be set. However, when Code Relocation 14 notifies that relocation is not possible, (B6): Notify the call reception / response unit 203 that the setting cannot be made.

Next, the CH card group 201 maintains (Z1): sets a wireless channel by assigning necessary resources by the resource management / setting unit 204. The CH card group consists of the number of mounted CH cards CHn (η = 1, 2,..., The number of mounted cards), and the number of resources per CH card is CH_Rn (n = l, 2, (See Fig. 5). It should be noted that the resource management / setting unit 204 cannot allocate the resources of one call across a plurality of channels.

Finally, the code rearrangement unit 205 receives (D1): an activation command from the resource management Z setting unit 204, and obtains a resource allocation state in which a call can be set by an algorithm described later. If a resource allocation state in which a call can be set is determined, (D2): the resource management / setting unit 204 is notified that relocation is possible. (D3): Also notifies the determined settable resource allocation status. If a state in which relocation is possible is not found, (D4): the resource management / setting unit 204 is notified that relocation is impossible.

Next, the operation of the present embodiment will be described with reference to the flowcharts of FIGS. First, it is assumed that a new call setting request has been made by the higher-level device (RNC).

(SlOl) o The call reception Z response unit 203 shown in FIG. 3 accepts this, and notifies the resource management Z setting unit 204 of the call setting (S102).

'Next, the resource management Z setting unit 204 determines whether there is a resource necessary for setting the call notified from the call reception / response unit 203 to the CH card group 201 (S103). If the resource exists (S103: Yes), the call is allocated to the resource (S104). In addition, an algorithm that has been conventionally used is used for the determination and assignment method at this time. If there is a resource for which a call can be set, the call acceptance / response unit 203 is notified that the resource can be set (S105).

On the other hand, if the call cannot be assigned (S103: No), a start command is issued to the code rearrangement unit 205, and the following (B4-1) to (B4-1) necessary for the operation of the code rearrangement unit 205 are performed. The user is notified of various parameters (B4-3) (S106). (B4-1) Current resource status (what services are set for each CH card and the number of resources used)

(B4-2) Whether the new call is set to new setting / plate 0

(B4- 3) What is the new call service? Also, the number of resources required for setting

The code rearrangement unit 205 receives a start-up command from the resource management / setting unit 204, and attempts to derive (calculate) a resource allocation state in which a new call can be set based on an “algorithm” described later (S107). ).

If the target resource allocation state can be calculated (S107: Yes)

Then, the resource management Z setting unit 204 is notified of the fact that relocation is possible and the resource allocation state in which call setting is possible (S108). If it cannot be calculated (the solution cannot be found) (S107: No)

Then, the resource management / setting unit 204 is notified that relocation is impossible (S110).

In the resource management Z setting unit 204, when notified by the code rearrangement unit 205 that relocation is possible, the CH card group 201 is set so that the resource allocation state is notified (from the code rearrangement unit 205). The resource relocation is executed, and the call reception / response unit 203 is notified that the call can be set (S109). If the code rearrangement unit 205 notifies that the rearrangement is impossible (S110), the resource management Z setting unit 204 notifies the call reception Z response unit 203 that the setting is impossible (S111).

In response to the notification from the resource management / setting unit 204, the call reception Z response unit 203 notifies the host device (RNC) of an ACK if the call can be set and a Failure if the call cannot be set (S112).

[Algorithm] An algorithm used in this embodiment will be described below. First, definitions of terms used in this algorithm are shown.

Services supported by the base station and the number of resources required for the service: S _k (k = l, 2, ···, number of types of services supported by the base station), required resources Number: Defined as Rs_k (k = l, 2, ..., the number of service types supported by the base station). Next, after the rearrangement, each service set in the CH card CH_n (n = l, 2, ... number of mounted cards): S _k (k = l, 2, ... number of service types supported by the base station) Is represented as CH—n—S_k.

Also, among the services currently set in the CH card group 201, a service group excluding the service with the smallest number of resources is referred to as S'_k (k is the same as k of S_k. However, the number of resources is the smallest. The k of the service S _k is assumed to be a missing number), and the number currently set for the CH card CH—n (n = l, 2,… the number of mounted cards) for this S′—k ′ is CH_n_S ′ Expressed as _k.

Finally, the service of the newly set call and the resources required for the call are required. The service of the new call: NS_k (k is the corresponding service among the services S_k supported by the base station), required Resource: NRs_k (k is the same value as k of NS_k). In the algorithm of the present embodiment, A1: it is determined whether a call to be newly set is a new setting or a call due to HH 0. A2: Solve each linear programming problem shown below corresponding to the new setting or dish 0. A3: If the solution of the linear programming is found, the solution is in the state after rearrangement, and it can be rearranged. If no solution is found, relocation is not possible.

[Linear programming problem when a new call is set up by new setting]

Objective function:

Max.f = total number of resources set to GH force group after relocation

n = number of boards installed k = number of service types supported by the base station

= ∑ Zj CH_n_S_k * Rs_k… [Equation 1]

n = 1 k = 1 Constraints:

: Number of service types supported by the base station

£ CH_n_S_k * Rs_k≤CH_Rn (n = 1,2, .., number of packages) ... [Equation ₂ ]

k = 1

n = number of mounted

y CH_n_S_k

n = 1 Total number of services S_k currently set in the CH card group

(S_k ≠ NS_k)

Total number of services S_k currently set for CH card group + 1

(S_k = NS_k)

(k = 1, 2,-, the number of service types supported by the base station) '[Equation 3]

CH_n_S_k = CH_n_S '1 k

(n = 1, 2,..., mounted number / k = 1, 2,..., the number of types of services supported by the base station.

However, this does not apply to services where S_k = NS_k) ... [Equation 4]

CH_n_S_k≥0

(n = 1, 2,..., number of mounted units / k = l, 2,..., number of types of services supported by the base station) · ■■ [Equation 5]

[Linear programming problem when a new call is set up by HH0]

Objective function:

Max. Total number of resources set for GH cards after relocation

Number of mounted devices k = number of service types supported by base station

∑CH_n S k * Rs_k '6] n = 1 Constraint condition (n = 1, 2, ..., number of mounted units)' [Equation 7]

Total number of services S-k currently set in CH card group

(S_k ≠ NS_k and S_k ≠ HH0 original call service)

Total number of services S—k currently set for the CH card group + 1

(S_k = NS_k)

Total number of services S-k currently set in CH power group-1

(k = 1, 2,-, the number of service types supported by the base station)… [Equation 8] CH_n_S_k = CH_n_S '_k

(n = l, 2,… Number of mounted devices / k = 1, 2, ■ ····, Number of types of services supported by the base station.

(Excluding S_k = HH0 original call service and service where S_k = NS—k holds)… [Equation 9]

CH_n_S_k≥0

(n = 1, 2, ···, number of mounted / k = l, 2, ■ · ·, number of types of services supported by the base station)… [Equation 10] Note that the new setting / HH0 is simplex Select a pivot so that each element in the table is always an integer. If it is not an integer or if there is no solution, relocation is not possible.

This is the basic idea of the algorithm shown above,

• Newly set call resources cannot be secured across CH cards. The maximum number of resources that can be set per CH card is fixed. … [Restriction 1]

· For each service, the number to be set in the CH card group 201 is determined. … Under the constraint of [Restriction 2], the condition that the number of resources that can be set in the CH card group 201 is maximized is determined. Finding the state in which the number of resources is maximized is equivalent to finding the case where all the calls to be set can be set in the CH card group 201 in the case of the above constraint conditions. [Equation 2] and [Equation 7] mentioned above represent [Constraint 1], and [Equation 3] and [Equation 8] represent [Constraint 2].

The service to be relocated was also restricted to the call with the least number of resources among the set services ([Restriction 3]). This is to minimize the load on the call processing control function unit due to the movement of the call. The above [Equation 4] and [Equation 9] represent [Constraint 3]).

Finally, the differences between the case of HH0 and the case of the new setting appear in [Equations 3, 4] and [Equations 8, 9]. At the time of dish 0, the resources of the original call of dish 0 disappear, so [Equations 4, 9] are derived from [Equations 3, 8].

In the following, the effect of the embodiment will be specifically shown taking the case illustrated in FIG. 5 as an example. You. In the case of (c) in Fig. 5, a new call for service C (request resource 3) cannot be allocated as it is. In the present invention, when such a situation occurs, the Code placement unit 205 is activated. In the case of the embodiment, the activated code rearrangement unit 205 solves the following linear programming problem in accordance with the above algorithm.

[Linear programming problem]

Objective function: Max. F = CH_1 _S—1 + 2 * CH—1 _S— 2 + 3 * CH_l _S—3

+ CH-1 2 1 S _l + 2 * CH I J _2i3 * CH_2 _S-1 3 …… [From equation 1]

Restrictions:

CH_1 — S _1 + 2 * CH _1 _S— 2 + 3 * CH-1 1 _S _3 ≤3

CH_2 _S—1 + 2 * CH I — S _2 + 3 * CH_2-one S—3 ≤3 …… [From equation 2]

CH_1 _S _1 + CH I _S _1 = 1

CH_1 _S _2 + CH—1 _S J = l

CH_1 — S _3 + CH I _S J = l …… [From equation 3]

CH_1 _S _2 = 0, CH_2 _S—2 = 1-… "[From equation 4]

CH—n _S ≥0-··· [Equation 5]

、

CH_1 _S _1 Number of services A assigned to CH card CH-1 after relocation, CH-1 _S I Number of services B assigned to CH card CHJ after relocation, CH_1 _S _3 Assigned to CH card CH_1 after relocation Number of services C, CH_2 _S _1 Number of services A allocated to CH-CH 2 after relocation, CH_2—Number of services B allocated to CH card CH-2 after relocation, CH 2 S 3 Number of services C assigned to CH card CHJ after deployment,

Rs-1 1 The number of resources required to allocate service A to the CH card is 1,

Rs_2 The number of resources required to assign service B to the CH card is 2,

Rs 3 The number of resources required to allocate service C to the CH card is 3, And

Solving this linear programming problem gives

CH_1 one S _1 = 0, CH-1 1 _S _2 = 0, CH_1 one S _3 = 1, CH_2— S—1 = 1, CH _2—S _2 = 1, CH—2 _S—3 = 0 (7th (The state in Fig. (A)) is calculated. This is a resource allocation state in which a new call (service C) can be set up. Therefore, as shown in FIG. 7 (b) (relocation result), the resource management / setting unit 204 only needs to relocate according to the calculated resource allocation state, and thereby a new call (service C ) Can be set. Industrial applicability

The effect of the embodiment described above is that it is possible to effectively prevent a situation in which the resource allocation is wasted in the call setting Z release operation, which makes it impossible to set a call newly set subsequently. is there. This is because the optimal allocation of resources can be calculated using linear programming.

An advantage of the present invention is that it is possible to effectively prevent a situation in which a resource setting is wasted in a call setting release operation, and a call newly set thereafter cannot be set. The reason is that the optimal allocation of resources can be calculated using linear programming. Note that the method of the present invention also exerts its effect in the call processing control function unit of the IMT2000 wireless base station apparatus.

Claims

The scope of the claims

1. In a radio base station apparatus having a plurality of CH cards for performing baseband signal processing allocated to a requested call,

In addition to allocating the resources of the CH card to the requested call, the usage status of the CH card group is investigated, and the set call is moved to another CH card according to the content, and the CH card group is set. A radio base station apparatus comprising resource allocation means for rearranging resources and securing resources of a CH card for a new call.

2. The resource allocation means according to claim 1, wherein, in the relocation process, the relocation content of the resources of the CH card is determined by using a linear programming method based on the usage status of the CH card group. The wireless base station device according to claim 1.

3. A radio base station including a call reception Z response section, a plurality of CH cards for performing baseband signal processing, a resource management Z setting section for performing resource management and the like of the CH cards, and a code rearrangement section. A device,

The call accepting Z response unit accepts the call setting and notifies the resource management / setting unit, and notifies the call request source whether or not the call can be set from the resource management setting unit corresponding to the call setting,

Resource management The Z setting unit determines whether or not the resources required to execute the call setting notified by the call reception / response unit exist in the CH card group, and if the resources exist, the call reception / response. Notifying that the call can be set, and processing for allocating the call to the relevant resource. If the call cannot be allocated in the same determination, a start command is sent to the Code rearrangement unit, and the specified various parameters are set. If the code relocation unit reports that relocation is possible, the call relocation is performed on the CH card group so that the resource allocation status calculated by the code relocation unit is reached. Notify the call accepting / responding section that the setting is possible, and if the relocation is notified from the code relocation, notify the call accepting Z responding section that the setting is not possible, The code rearrangement unit receives a start command from the resource management Z setting unit, obtains a resource allocation state in which the requested call can be set by rearranging the set resources according to a predetermined algorithm, and determines a resource allocation state in which the request call can be set. If found, the resource management status is notified to the resource management Z setting unit together with the derived resource allocation status information, but if the status is not determined, the resource management Z setting unit is notified that relocation is not possible. Notify to

A radio base station apparatus characterized by the above-mentioned.

4. The radio base station apparatus according to claim 3, wherein an algorithm executed by the code rearrangement unit is based on a linear programming.

5. A resource allocation method for allocating a resource of a CH card to a call in a wireless base station apparatus configured with a plurality of CH cards for performing base-span signal processing,

The first decision process that determines whether the requested call can be assigned to a single CH card, and if the result of the first decision process is assignable, the requester is notified of the fact and the call is sent to the CH card. The process of assigning to the card,

If the result of the first determination process is unassignable, the call requested by relocating the call already set in the CH card group to a predetermined state based on the various parameters of the call is determined. A second determination process for predicting whether or not it can be assigned to a specific single CH card;

If the result of the second determination process is assignable, the request source is notified of the fact, the set call of the CH card group is rearranged to the predetermined state, and the request call is transferred to the specific single CH. The process of assigning to the card,

If the result of the second determination process is unallocatable, the requesting source is notified of the fact.

6. In the second determination process, a linear measurement is performed to determine whether the requested call can be allocated. 6. The resource allocation method according to claim 5, wherein a drawing method is used.