CN102083221A - Resource scheduling method and device based on HSDPA (high speed downlink packet access) - Google Patents

Abstract

The invention discloses a HSDPA-based resource scheduling method and its device. The method of the invention has the following steps: acquiring channel quality parameters, times of being scheduled, cumulative throughput, and quality of service (QoS) levels of each user to be scheduled; according to the acquired Determine the scheduling priority of each user to be scheduled according to the channel quality parameters, number of times scheduled, cumulative throughput, and QoS level of each user to be scheduled; according to the scheduling priority of each user to be scheduled, select the scheduling user and provide Scheduling users for resource allocation. By adopting the invention, the QoS requirements of different service types can be guaranteed under the precondition of both throughput and user fairness during resource scheduling.

Description

A resource scheduling method and device based on HSDPA

technical field

The present invention relates to the field of wireless communication, in particular to an HSDPA-based resource scheduling method and device thereof.

Background technique

In order to improve the download rate of TD (time division) network (such as TD-SCDMA time division-synchronous code division multiple access wireless access network), R5 introduces HSDPA (High Speed Downlink Packet Access) technology, single carrier can Achieve a peak rate of 2.8Mbps. TD-SCDMAHSDPA system involves five channels, namely:

HS-PDSCH: High-Speed Physical Downlink Shared Channel, high-speed physical downlink shared channel, is an HSDPA service channel, used to carry high-level data of each UE (user equipment);

HS-SICH: High-Speed Shared Information Channel for HS-DSCH high-speed downlink shared channel shared information channel, is the HSDPA uplink control channel, used to carry and HS-DSCH (high-speed downlink shared channel, the corresponding physical channel is HS-PDSCH ) related signaling information, which may include HARQ acknowledgment/negative acknowledgment (ACK/NACK), downlink channel quality indication (CQI);

HS-SCCH: High-Speed Shared Control Channel, high-speed shared control channel, is an HSDPA downlink control channel, used to carry downlink signaling information, these signaling information can include channelization code set, time slot information, modulation mode , transmission block size, HARQ process number (HARQ Process ID), redundancy version, new data flag, HS-SCCH cycle sequence number and UE ID (UE identification), etc.;

ULA-DPCH: HSDPA uplink accompanying channel, used to carry the high-level data of each UE (user equipment) and uplink accompanying signaling;

DL A-DPCH: HSDPA downlink accompanying channel, used to carry downlink accompanying signaling, and used for physical layer control (including synchronization and power control) of uplink DPCH.

It can be seen that the service channel HS-PDSCH of HSDPA is a shared channel, that is, the channel resources need to be allocated by multiple users, which requires consideration of which strategy to use to use channel resources more effectively and better meet user needs. .

At present, the classic resource scheduling algorithms in the TD network mainly include: Max C/I algorithm, RR (round robin) algorithm and PF (proportional fair) algorithm.

The Max C/I algorithm takes the channel quality of the UE as the primary criterion for resource allocation. The scheduler first sorts the UEs waiting for service according to the channel quality, that is, the carrier-to-interference ratio (C/I, or signal-to-interference ratio) value during the corresponding frame transmission, and the scheduler transmits the data of the UE with the highest C/I value , until the UE data queue is empty, or until user data with a higher C/I value arrives, or until a retransmission with a higher priority is scheduled. This type of scheduling algorithm always assigns resources to the UE with the best channel conditions first, so as to maximize the data throughput of the cell. Due to the poor fairness of resource allocation, this algorithm is basically not used in the live network.

The RR algorithm does not consider the channel quality of each UE, but uses a round-robin scheduling method, that is, to arrange all UEs in a sequence, and assign the same service time slice to each UE. After the current time slice ends, the currently served UE will Will back off to the end of the sequence to wait for the next service. The goal of this algorithm is to ensure that each user can get a certain service time and meet the minimum delay requirements. The algorithm is better than MaxC/I in terms of fairness, and the algorithm is simple to implement, so it has certain application value in the existing network.

The PF algorithm calculates the priority of resource allocation based on the channel quality of each UE. It is assumed that the throughput of the kth user within a service time window (such as a TTI (Transmission Time Interval)) is T _k , and it is assumed that the kth user The current channel condition of the user is: (C/I) _k . Then, its fairness factor is:

${\mathrm{<span\; class="notranslate">\; a</span>}}_{\mathrm{<span\; class="notranslate">\; k</span>}}<span\; class="notranslate">\; =</span>\frac{{<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; C</span>}<span\; class="notranslate">\; /</span>\mathrm{<span\; class="notranslate">\; I</span>}<span\; class="notranslate">\; )</span>}_{\mathrm{<span\; class="notranslate">\; K</span>}}}{{\mathrm{<span\; class="notranslate">\; T</span>}}_{\mathrm{<span\; class="notranslate">\; K</span>}}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; [</span>\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; ]</span>$

It can be seen from Equation [1] that users with better channel conditions and relatively few services have a higher comprehensive priority, and user service priority is determined by the fairness factor a _k , so it has the maximum fairness Factor users will get scheduled first. The PF scheduling algorithm solves the contradiction between cell throughput and service fairness. The scheduling algorithm also has the advantages of easy implementation and fast response speed, and is relatively better among all packet scheduling algorithms.

In the process of realizing the present invention, the inventor found that:

The Max C/I algorithm only considers throughput. Although this scheduling algorithm can achieve the maximum cell throughput, it does not consider the fairness of resource allocation, resulting in UEs with poor channel conditions being blocked for a long time;

The RR algorithm can ensure that each user gets the same scheduling probability, but because the channel quality of the user is not considered in the scheduling process, the currently scheduled user may not be able to fully utilize the occupied channel resources, so although the fairness of the user is guaranteed performance, but the actual throughput of the cell is affected, making it difficult to make full use of system resources to achieve a higher system capacity;

The PF algorithm balances the two factors of channel quality and user's current cumulative throughput, and achieves both cell throughput and user fairness in the scheduling process. However, since the user's fairness is mainly determined by the user's current cumulative throughput, this algorithm can only guarantee long-term fairness (that is, in a long period of time, the average rate of each user is basically the same) , but it cannot guarantee user fairness in a relatively short period of time, especially when users request services with high latency requirements, the existing resource scheduling methods cannot meet the service needs of these users.

To sum up, the existing resource scheduling methods cannot satisfy users' needs for services with different delay requirements while taking into account throughput and user fairness.

Contents of the invention

The embodiment of the present invention provides an HSDPA-based resource scheduling method and device thereof, so as to ensure QoS requirements of different service types under the premise of taking into account both throughput and user fairness during resource scheduling.

The resource scheduling method based on HSDPA provided by the embodiment of the present invention includes the following steps:

Obtain the channel quality parameters, times of being scheduled, accumulated throughput, and QoS level of each user to be scheduled;

Determine the scheduling priority of each user to be scheduled according to the obtained channel quality parameters, times of scheduling, cumulative throughput, and QoS level of each user to be scheduled;

According to the scheduling priority of each user to be scheduled, a scheduling user is selected and resource allocation is performed for the selected scheduling user.

The HSDPA-based resource scheduling device provided by the embodiment of the present invention includes:

An acquisition module, configured to acquire channel quality parameters, times of scheduling, cumulative throughput, and QoS levels of each user to be scheduled;

A scheduling priority determination module, configured to determine the scheduling priority of each user to be scheduled according to the respective channel quality parameters, number of times scheduled, cumulative throughput, and QoS level of each user to be scheduled obtained by the acquisition module;

The resource allocation module is configured to select a scheduling user and perform resource allocation for the selected scheduling user according to the scheduling priority of each user to be scheduled determined by the scheduling priority determination module.

In the above embodiments of the present invention, when performing resource scheduling, on the basis of the original channel quality parameters and cumulative throughput, the number of times users are scheduled and the QoS level are introduced to determine the scheduling priority, so that the determined scheduling priority is in While taking into account throughput and user fairness, it also reflects user service QoS requirements. Moreover, after introducing the number of times a user is scheduled, the user's scheduling priority can be determined according to the user's past scheduling situation, thereby further reflecting user fairness.

Description of drawings

FIG. 1 is a schematic diagram of a HSDPA resource allocation process provided by an embodiment of the present invention;

FIG. 2 is a schematic flow diagram of selecting and scheduling UE provided by an embodiment of the present invention;

FIG. 3 is a schematic structural diagram of a resource allocation device provided by an embodiment of the present invention.

Detailed ways

In view of the problems existing in the existing resource scheduling mechanism, the embodiment of the present invention mainly addresses the requirements of multi-user and multi-service, and expands the basis of resource scheduling, that is, the UE channel quality and UE cumulative On the basis of the throughput factor, two factors of QoS (Quality of Service) level and scheduling times are introduced in the resource scheduling process, so as to ensure the QoS requirements of the business while taking into account user fairness and throughput.

Since the embodiment of the present invention introduces the two factors of QoS level and scheduling times into the scheduling process, correspondingly, a method for calculating the scheduling priority factor is provided.

If Q represents the QoS level of the UE, and Δt represents the number of times the UE is scheduled, then within a service time window (such as a TTI), the cumulative throughput of the kth user (denoted as UE _k ) is T _k , and UE _k The number of scheduled times is Δt _k , the QoS level of UE _k is Q _k , and the current channel quality parameter of UE _k is expressed as (C/I) _k , then the formula for calculating the scheduling priority factor of UE _k is:

${\mathrm{<span\; class="notranslate">\; \&alpha;</span>}}_{\mathrm{<span\; class="notranslate">\; k</span>}}<span\; class="notranslate">\; =</span>\frac{{<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; C</span>}<span\; class="notranslate">\; /</span>\mathrm{<span\; class="notranslate">\; I</span>}<span\; class="notranslate">\; )</span>}_{\mathrm{<span\; class="notranslate">\; k</span>}}}{{\mathrm{<span\; class="notranslate">\; T</span>}}_{\mathrm{<span\; class="notranslate">\; k</span>}}<span\; class="notranslate">\; \&times;</span>{\mathrm{<span\; class="notranslate">\; \&Delta;t</span>}}_{\mathrm{<span\; class="notranslate">\; k</span>}}}<span\; class="notranslate">\; \&times;</span>{\mathrm{<span\; class="notranslate">\; Q</span>}}_{\mathrm{<span\; class="notranslate">\; k</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; [</span>\mathrm{<span\; class="notranslate">\; 2</span>}<span\; class="notranslate">\; ]</span>$

Considering the primary and secondary relationship of each factor in the scheduling priority factor calculation formula (including channel quality parameters, cumulative throughput of UE, number of scheduling times of UE, QoS level), that is, the importance of each factor to determine the scheduling priority, can be Modify the formula [1] to get

${\mathrm{<span\; class="notranslate">\; \&alpha;</span>}}_{\mathrm{<span\; class="notranslate">\; k</span>}}<span\; class="notranslate">\; =</span>\frac{{{<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; C</span>}<span\; class="notranslate">\; /</span>\mathrm{<span\; class="notranslate">\; I</span>}<span\; class="notranslate">\; )</span>}_{\mathrm{<span\; class="notranslate">\; k</span>}}}^{\mathrm{<span\; class="notranslate">\; \&alpha;</span>}}}{{{\mathrm{<span\; class="notranslate">\; T</span>}}_{\mathrm{<span\; class="notranslate">\; k</span>}}}^{\mathrm{<span\; class="notranslate">\; \&beta;</span>}}<span\; class="notranslate">\; \&times;</span>{{\mathrm{<span\; class="notranslate">\; \&Delta;t</span>}}_{\mathrm{<span\; class="notranslate">\; k</span>}}}^{\mathrm{<span\; class="notranslate">\; \&gamma;</span>}}}<span\; class="notranslate">\; \&times;</span>{{\mathrm{<span\; class="notranslate">\; Q</span>}}_{\mathrm{<span\; class="notranslate">\; k</span>}}}^{\mathrm{<span\; class="notranslate">\; \&delta;</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; [</span>\mathrm{<span\; class="notranslate">\; 3</span>}<span\; class="notranslate">\; ]</span>$

Among them, α is the weight factor of the channel quality parameter, β is the weight factor of the user’s cumulative throughput, γ is the weight factor of the scheduling times, and δ is the weight factor of the QoS level, each factor can be adjusted according to the actual situation in the scheduling priority factor proportion. Formula [3] can also be used as a general formula for calculating the scheduling priority factor in the embodiment of the present invention. When the weight factors in formula [3] have the same values, formula [3] and formula [2] have the same expression form.

Considering that the carrier-to-interference ratio (C/I) can be characterized by CQI (Channel Quality Indicator), formula [2] or formula [3] can be modified, that is, the carrier-to-interference ratio (C/I) can be replaced by CQI, if the formula [3] is modified, we get

${\mathrm{<span\; class="notranslate">\; \&alpha;</span>}}_{\mathrm{<span\; class="notranslate">\; k</span>}}<span\; class="notranslate">\; =</span>\frac{{{<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; CQI</span>}<span\; class="notranslate">\; )</span>}_{\mathrm{<span\; class="notranslate">\; k</span>}}}^{\mathrm{<span\; class="notranslate">\; \&alpha;</span>}}}{{{\mathrm{<span\; class="notranslate">\; T</span>}}_{\mathrm{<span\; class="notranslate">\; k</span>}}}^{\mathrm{<span\; class="notranslate">\; \&beta;</span>}}<span\; class="notranslate">\; \&times;</span>{{\mathrm{<span\; class="notranslate">\; \&Delta;t</span>}}_{\mathrm{<span\; class="notranslate">\; k</span>}}}^{\mathrm{<span\; class="notranslate">\; \&gamma;</span>}}}<span\; class="notranslate">\; \&times;</span>{{\mathrm{<span\; class="notranslate">\; Q</span>}}_{\mathrm{<span\; class="notranslate">\; k</span>}}}^{\mathrm{<span\; class="notranslate">\; \&delta;</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; [</span>\mathrm{<span\; class="notranslate">\; 4</span>}<span\; class="notranslate">\; ]</span>$

According to the above formula, the scheduling priority is directly proportional to the QoS level, that is, the higher the QoS level of the user (for example, the higher the QoS level for real-time services), the higher the scheduling priority and the higher the possibility of obtaining scheduling; The level is also inversely proportional to the number of times the UE is scheduled, that is, the more times the user is scheduled, the lower the possibility of being scheduled. In this way, on the one hand, it is guaranteed that in the user group with the same QoS level, each user can obtain a more balanced scheduling opportunity according to the three factors of scheduling times, channel quality, and cumulative throughput when the throughput is guaranteed. ; On the other hand, due to the introduction of the factor of scheduling times, it can be guaranteed that even users with lower QoS levels will get certain scheduling opportunities. In this way, the QoS of user services can be fairly guaranteed.

For TD-SCDMA network, 3GPP defines 4 types of services, as shown in Table 1:

Table 1. Business types and characteristics

In the embodiment of the present invention, corresponding QoS levels are set for the service types shown in Table 1, and the corresponding QoS levels decrease in order according to the order of C>S>I>B. Considering that the data services in the TD-SCDMA network are mainly three types: S, I, and B, the embodiment of the present invention only considers these three types of services. Since these three types of services have different requirements for delay, the QoS level is set according to the method of S>I>B. The higher the value of the QoS level, the more priority scheduling is required. For example, the QoS levels are set to 3, 2, and 1 respectively.

Resource scheduling is usually performed by the equipment responsible for resource scheduling on the network side (such as base station equipment). The following describes the flow of resource scheduling by taking the base station equipment in the TD-SCDMAHSDPA network as the execution subject of resource scheduling.

In the resource scheduling mechanism based on HSDPA, when resource scheduling is required (such as the arrival of the resource scheduling period), the base station equipment starts the HSDPA resource scheduling process, as shown in Figure 1, the process mainly includes:

Step 101. For each of the UEs currently to be scheduled, the base station equipment obtains the channel quality parameters of each UE according to the channel quality information reported by the UE, such as the channel quality indicator (CQI), or further obtains the corresponding carrier according to the CQI. Interference ratio (C/I), in addition, it also obtains the cumulative throughput of the UE, obtains the number of times the UE is scheduled, and determines the QoS level corresponding to the service type requested by the UE (that is, the QoS level of the UE);

Step 102, the base station equipment adopts formula [2] or formula [ 3] or formula [4] to calculate the scheduling priority of each UE;

Step 103, the base station equipment selects UEs to be scheduled this time according to the scheduling priority of each UE and the number of HS-SCCHs.

When selecting the UEs to be scheduled, start from the UE with the highest scheduling priority, and select UEs whose number is the same as the number of HS-SCCHs. If the number of UEs with the highest scheduling priority exceeds the number of HS-SCCHs, select UEs with the same number as HS-SCCH from the UEs with the highest scheduling priority for scheduling; if the number of UEs with the highest scheduling priority is not If the number of HS-SCCHs is exceeded, all users with the highest scheduling priority can be selected, and then UEs are selected from the remaining users to be scheduled according to the order of scheduling priority from high to low, until the total number of selected UEs is the same as that of HS-SCCH .

In the HSDPA mechanism, since the base station sends downlink indication information to the scheduled UEs through the HS-SCCH, the number of scheduled UEs will not exceed the number of HS-SCCHs.

Considering that in practical applications, the number of UEs to be scheduled in each resource scheduling cycle is usually huge, and the number of UEs with the highest scheduling priority usually exceeds the number of HS-SCCHs. Therefore, for this situation, Figure 2 shows a UE selection process.

Step 104, the base station equipment allocates resources for the scheduled UE, and completes this scheduling.

Referring to FIG. 2 , in step 103 of the flow shown in FIG. 1 , in the case where the number of UEs with the highest scheduling priority exceeds the number of HS-SCCHs, the base station equipment selects the flow of scheduled UEs, including:

Step 201, the base station equipment judges whether the number of UEs with the highest scheduling priority is equal to the number of HS-SCCHs, if so, execute step 203; otherwise, execute step 202;

Step 202, the base station equipment randomly selects a corresponding number of UEs from the UEs with the highest scheduling priority according to the number of HS-SCCHs, and increases the scheduling priorities of these UEs, such as adding 1 to the scheduling priorities of these UEs, and then Go to step 203;

Step 203, the base station equipment selects the UE with the highest scheduling priority as the UE for this scheduling.

In step 101 of the process shown in Figure 1, the base station device can determine the carrier-to-interference ratio (C/I) of the UE according to the CQI (Channel Quality Indicator, Channel Quality Indicator) information reported by each UE to indicate the channel quality. In the HSDPA mechanism, the CQI feedback on the UE side is realized by looking up a table, that is, a CQI indication table (CQI Table) is pre-defined, which contains several CQI numbers (CQI Index), and each CQI Index corresponds to a set of CQI parameters (including load-to-interference ratio parameters, etc.). In this way, the UE only needs to feed back a CQI Index, and the base station device can obtain corresponding CQI parameters (including carrier-to-interference ratio parameters, etc.) by querying the predefined CQI Table.

In step 101 of the process shown in Figure 1, the base station device can count the number of scheduling times corresponding to each UE ID according to the UE ID carried in the downlink signaling information transmitted through the HS-SCCH. In the HSDPA mechanism, the base station equipment uses HS-SCCH to transmit downlink indication information (including channelization code set, time slot information, modulation mode, transport block size, UE ID, etc.) for the currently scheduled UE, so , the base station equipment can count the number of times the UE is scheduled by counting the UE ID carried in the downlink signaling information transmitted by the HS-SCCH.

In step 101 of the process shown in FIG. 1, the base station device can according to the service type indicated by the Traffic class (service type) field in the RAB (Radio Access Bearer) parameter of the UE, and further according to the service type defined in the embodiment of the present invention The corresponding relationship between the service type and the QoS level determines the QoS level of the UE.

Preferably, after selecting the UEs scheduled this time, the base station device may update the number of times the UEs are scheduled, for example, adding 1 to the counters corresponding to these UEs for recording the number of times the UEs are scheduled. The above operation is performed every time the base station equipment selects the currently scheduled UE. When the base station equipment needs to perform resource scheduling, the number of times each UE is scheduled can be known according to the counter value corresponding to each UE for recording the number of scheduled times.

Based on the same technical concept, the embodiment of the present invention also provides a resource allocation device. The resource allocation device is usually set with the base station equipment.

Referring to FIG. 3 , it is a schematic structural diagram of a resource allocation device provided by an embodiment of the present invention. The device includes: an acquisition module 301, a scheduling priority determination module 302, and a resource allocation module 303, wherein:

The obtaining module 301 is used to obtain the channel quality parameters (such as CQI, or the carrier-to-interference ratio (C/I) obtained according to the CQI) of each UE to be scheduled, the number of times to be scheduled, the cumulative throughput, and the quality of service QoS level;

The scheduling priority determination module 302 is used to determine the scheduling priority of each UE to be scheduled according to the respective channel quality parameters, the number of times scheduled, the cumulative throughput, and the quality of service QoS level of each UE to be scheduled obtained by the acquisition module 301; When the channel quality parameter is the carrier-to-interference ratio (C/I), the scheduling priority determination module 302 may calculate the scheduling priority of each UE to be scheduled according to formula [2] or formula [3] or formula [4];

The resource allocation module 303 is configured to select a scheduling UE and perform resource allocation for the selected scheduling UE according to the scheduling priority of each UE to be scheduled determined by the scheduling priority determination module 302 .

In the above apparatus, when obtaining the QoS level of the UE to be scheduled, the obtaining module 301 obtains, for each UE to be scheduled, the service type information carried in the RAB parameter of the UE to be scheduled, and according to the obtained The service type information determines the service type of the UE to be scheduled, and determines the QoS class corresponding to the service type of the UE to be scheduled according to the preset correspondence between the service type and the QoS class.

In the above-mentioned apparatus, after the resource allocation module 303 selects the scheduling UE, it can also update the number of times the selected UE is scheduled, and obtain the record of the number of times that each UE to be scheduled is scheduled after the resource scheduling, so that the acquisition module 301 can be used in the next resource scheduling. When , obtain the record of the number of times that each UE to be scheduled is currently scheduled, and obtain the number of times that each UE to be scheduled is scheduled.

In the above device, the QoS levels corresponding to the service types are decremented successively according to the order of the service types being session type, streaming media type, interactive type, and background type. In this case, when selecting UEs for scheduling, the resource allocation module 303 selects UEs to be scheduled that are equal to the number of HS-SCCHs in descending order of scheduling priorities. If the number of UEs to be scheduled with the highest scheduling priority exceeds the number of HS-SCCHs, the resource allocation module 303 selects UEs to be scheduled that are equal to the number of HS-SCCHs from the UEs to be scheduled with the highest scheduling priority.

In summary, when determining user scheduling priority, the embodiment of the present invention introduces two factors into consideration, QoS level and scheduling times, and can adjust the proportion of each factor in the priority factor according to the network operation situation through the weight factor. proportion. Based on the above ideas, the embodiment of the present invention is finally reflected in the determination of the QoS level of the service by the service type represented by the RAB parameter; at the same time, according to the user information contained in the HS-SCCH, the number of times each user is scheduled is counted, and the QoS level and the number of times of scheduling are calculated. Incorporate into the calculation formula of scheduling priority in a feasible manner. Compared with the shortcoming that the PF algorithm cannot guarantee the service QoS, since the embodiment of the present invention introduces the service QoS level and the number of times of scheduling in the scheduling process, the user can take into account the service QoS requirements in the scheduling process, so that users with high QoS can Priority is given to scheduling opportunities, and at the same time, the number of times the scheduling is introduced also takes into account the fairness of each user of the same/different types of services.

Obviously, those skilled in the art can make various changes and modifications to the present invention without departing from the spirit and scope of the present invention. Thus, if these modifications and variations of the present invention fall within the scope of the claims of the present invention and equivalent technologies thereof, the present invention also intends to include these modifications and variations.

Claims (16)

1. the resource regulating method based on high-speed downlink packet access HSDPA is characterized in that, comprises the steps:

Obtain and respectively treat dispatched users channel quality parameter, the number of times that is scheduled, accumulative total throughput, service quality QoS grade separately;

Respectively treat separately channel quality parameter of dispatched users, the number of times that is scheduled, accumulative total throughput, service quality QoS grade according to what get access to, determine respectively to treat the dispatching priority of dispatched users;

According to the dispatching priority of respectively treating dispatched users, choose dispatched users and also carry out resource allocation for the dispatched users of choosing.

2. the method for claim 1 is characterized in that, for treating that respectively in the dispatched users each treat dispatched users, determines dispatching priority according to following formula:

3. method as claimed in claim 2 is characterized in that, after channel quality parameter, the number of times that is scheduled, accumulative total throughput, QoS grade and weighted value are separately multiplied each other, determines dispatching priority according to described formula again.

4. as claim 1,2 or 3 described methods, it is characterized in that described channel quality parameter is carrier/interface ratio or CQI.

5. the method for claim 1 is characterized in that, for treating that respectively in the dispatched users each treat dispatched users, obtains the QoS grade, is specially:

Obtain the traffic type information of carrying in the RAB information for the treatment of dispatched users, and determine the type of service that this treats dispatched users according to the traffic type information that gets access to;

According to the corresponding relation of predefined type of service and QoS grade, determine to treat the corresponding QoS grade of type of service of dispatched users with this.

6. the method for claim 1 is characterized in that, also comprises after choosing dispatched users: upgrade the user's who is selected the number of times that is scheduled, obtain respectively treating after this time scheduling of resource the number of times record that is scheduled of dispatched users;

During first resource scheduling instantly, obtain the current number of times record that is scheduled of respectively treating dispatched users, respectively treated the number of times that is scheduled of dispatched users.

7. as claim 1-3,5,6 each described methods, it is characterized in that, is the order of interactive, Streaming Media type, interactive, back bench-type according to type of service, and the QoS grade corresponding with type of service successively decreased successively;

Choose dispatched users, be specially:, choose the treat dispatched users identical with high-speed shared control channel HS-SCCH quantity according to dispatching priority order from high to low.

8. method as claimed in claim 7, it is characterized in that, if having, the dispatched users quantity for the treatment of of high dispatching priority surpasses HS-SCCH quantity, then choose the treat dispatched users identical, be specially with HS-SCCH quantity: from have the highest dispatching priority treat choose the treat dispatched users identical the dispatched users with HS-SCCH quantity.

9. the resource scheduling device based on HSDPA is characterized in that, comprising:

Acquisition module is used to obtain and respectively treats dispatched users channel quality parameter, the number of times that is scheduled, accumulative total throughput, service quality QoS grade separately;

The dispatching priority determination module is used for respectively treating separately channel quality parameter of dispatched users, the number of times that is scheduled, accumulative total throughput, service quality QoS grade according to what described acquisition module got access to, determines respectively to treat the dispatching priority of dispatched users;

Resource distribution module is used for the dispatching priority of respectively treating dispatched users determined according to described dispatching priority determination module, chooses dispatched users and carries out resource allocation for the dispatched users of choosing.

10. device as claimed in claim 9 is characterized in that, described dispatching priority determination module specifically is used for: treat dispatched users for each that respectively treat dispatched users, determine dispatching priority according to following formula:

11. device as claimed in claim 10, it is characterized in that, described dispatching priority determination module specifically is used for: after channel quality parameter, the number of times that is scheduled, accumulative total throughput, QoS grade and weighted value are separately multiplied each other, determine dispatching priority according to described formula again.

12., it is characterized in that the channel quality parameter that described acquisition module obtains is carrier/interface ratio or CQI as claim 9,10 or 11 described devices.

13. device as claimed in claim 9, it is characterized in that, described acquisition module specifically is used for: treat dispatched users for each that respectively treat dispatched users, obtain this and treat the traffic type information of carrying in the RAB information of dispatched users, and determine the type of service that this treats dispatched users according to the traffic type information that gets access to, according to the corresponding relation of predefined type of service and QoS grade, determine to treat the corresponding QoS grade of type of service of dispatched users with this.

14. device as claimed in claim 9 is characterized in that, described resource distribution module is further used for: after choosing dispatched users, upgrade the user's be selected the number of times that is scheduled, obtain respectively treating after this time scheduling of resource the number of times record that is scheduled of dispatched users;

Described acquisition module is further used for: during first resource scheduling instantly, obtain the current number of times record that is scheduled of respectively treating dispatched users, respectively treated the number of times that is scheduled of dispatched users.

15., it is characterized in that as claim 9,10,11,13 or 14 described devices, be the order of interactive, Streaming Media type, interactive, back bench-type according to type of service, the QoS grade corresponding with type of service successively decreased successively;

Described resource distribution module specifically is used for: according to dispatching priority order from high to low, choose the treat dispatched users identical with high-speed shared control channel HS-SCCH quantity.

16. device as claimed in claim 15, it is characterized in that, described resource distribution module specifically is used for: the dispatched users quantity for the treatment of of high dispatching priority surpasses HS-SCCH quantity if having, then from have the highest dispatching priority treat choose the treat dispatched users identical the dispatched users with HS-SCCH quantity.

Images