CN1968195A - Communication system scheduling method - Google Patents

Abstract

The invention discloses a dispatching method of a communication system. The dispatching method comprises the following steps: step A) setting a dispatching period, and judging whether a user terminal has received satisfactory service within the dispatching period; if the user terminal has obtained satisfactory service, the user The priority of the terminal is lowered, and the scheduling resource is preferentially assigned to other user terminals that do not meet the guaranteed rate; otherwise, the priority of the user terminal is increased, so that the user terminal is given priority to the scheduling resource. The dispatching method of the communication system of the present invention can enable as many users as possible to obtain a rate equal to GBR in each dispatching cycle, thereby increasing the number of user terminals that are overall satisfied in the system.

Description

Scheduling method of a communication system

technical field

The invention relates to the communication field, in particular to a scheduling method of a communication system.

Background technique

In the Wideband Code Division Multiple Access (WCDMA) R5 version, a new high-speed data transmission technology - High Speed Downlink Packet Access (HSDPA) is introduced. This technology mainly uses adaptive coding and modulation (Adaptive Modulation and Coding, AMC), fast hybrid automatic repeat request (Hybrid Automatic Repeat request, HARQ) and fast scheduling technologies to further increase the downlink packet data rate. In this way, the capacity and spectrum efficiency of the system are greatly improved, and the quality of user terminal services is also improved.

Currently, in a high-speed downlink packet access communication system, user terminal data is transmitted through a high-speed downlink shared channel (High Speed Downlink Shared Channel, HS-DSCH). One HS-DSCH channel can undertake the data transmission tasks of multiple user terminals. All user terminals carried on this channel can share the channel by time and different channel codes. If the high-speed downlink shared channel sends data once every 2ms (transmission time interval TTI=2ms), then different user terminals can transmit in different Data can be sent within a time interval, or different channel codes can be used for data transmission within the same transmission time interval. The specific sending time of each user terminal data is determined by the scheduling algorithm.

Generally, both conversational and streaming services have guaranteed bit rate (Guaranteed Bit Rate, GBR) service requirements. Guaranteed bit rate is defined as: when the transmission rate of the business is greater than or equal to GBR, the quality of service of the business is satisfactory; when the transmission rate of the business is less than GBR, the quality of service of the business is unacceptable.

The scheduling algorithm can determine the service priority for each user terminal, so it is very important whether the user terminal can obtain the GBR rate.

Currently, there are three commonly used scheduling algorithms:

(1) Round Robin (RR) algorithm

The basic idea of the RR algorithm is to ensure that the user terminals in the cell cycle occupy wireless resources of equal time in a certain order to communicate. Each user terminal corresponds to a queue to store data to be transmitted, and the non-empty queues receive services in a round-robin manner during scheduling to transmit data. The scheduling algorithm is to schedule all user terminals simultaneously carried on the HS-DSCH channel in turn.

Specifically, after each user terminal establishes or sends data once, it starts a timer to indicate the length of waiting time. In each transmission time interval, according to the length of each user terminal's waiting time, queue up from large to small , giving priority to dispatching user terminals with a long waiting time.

Although the algorithm has fairness in scheduling opportunities, because it does not take into account the specific conditions of the wireless channels of different user terminal equipment, the scheduling time for each user terminal equipment is relatively fixed, and differentiated services cannot be provided; moreover, This method cannot make full use of the time period when the channel quality of the user terminal equipment is high, and more data is sent during this time period, so that the system resource utilization efficiency and system throughput are very low; in addition, this method does not consider the user terminal to ensure GBR demand, so that user terminal satisfaction is very low.

(2) Maximum Carrier to Interference (Max C/I) algorithm

The Max C/I algorithm is a typical scheduling algorithm that utilizes the "multi-user terminal diversity effect" to maximize system capacity. The basic idea is: sort all user terminal devices according to their channel quality indicator (CQI) prediction values, and send data in descending order.

Specifically, in each transmission time interval, firstly, the CQIs reported by the user terminals that can send data are queued from large to small; then, the data of the user terminal equipments are sent sequentially according to the sequence of CQIs from large to small.

Although this algorithm can obtain the maximum system throughput, the service obtained by the user terminal is very unfair. The user terminal equipment close to the base station will always receive the service due to its good channel conditions, while the user terminal equipment at the edge of the cell is due to its poor communication quality. The quality indicator is low, so there is no service opportunity, and the user terminal with low channel quality will even be "starved to death"; in addition, this scheme does not consider the GBR requirements of the user terminal, so that the user terminal with high channel quality can obtain a rate much higher than that of GBR. , and user terminals with low channel quality cannot get GBR rate service, and the satisfaction rate of user terminals is low.

(3) Proportional Fair algorithm

The PF algorithm assigns a corresponding priority to each user terminal equipment, and the user terminal equipment with the highest priority receives services first.

Specifically, in each transmission time interval, the priority of the user terminals that can send data is calculated according to the following formula, and then the user terminals are scheduled according to the priority from high to low:

$\mathrm{<span\; class="notranslate">\; Prioritize</span>}{\mathrm{<span\; class="notranslate">\; the\; y</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; =</span>\frac{{\mathrm{<span\; class="notranslate">\; R</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}<span\; class="notranslate">\; \_</span>\mathrm{<span\; class="notranslate">\; max</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; t</span>}<span\; class="notranslate">\; )</span>}{{\mathrm{<span\; class="notranslate">\; r</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; t</span>}<span\; class="notranslate">\; )</span>}\mathrm{<span\; class="notranslate">\; i</span>}<span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; 1,2,3</span>}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>\mathrm{<span\; class="notranslate">\; N</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>$

Wherein, R _{i_max} (t) is the maximum transmission rate supported by the location of the user terminal at time t, and _ri (t) represents the scheduling rate actually obtained by the user terminal in the previous period.

Although the algorithm makes the ratio of the rate that the user terminal can obtain in the same cell to the rate that the location can provide basically unchanged, that is, the probability that the user terminal equipment obtains the service at any time is almost the same, but it does not consider the user terminal GBR requirements , it may be due to the existence of a large number of user terminals with low channel quality that a large number of opportunities are allocated to user terminals with low channel quality, so that user terminals with high channel quality cannot get enough scheduling opportunities, and the number of satisfactory user terminals in the system Low.

If the service established in the communication system is a streaming type (for example: video on demand, video telephony, etc.), the service usually requires a GBR.

If the established business is other type of business that does not require GBR, if GBR is not configured for the user terminal, then the user terminal will not be dissatisfied if the service is not provided when the system resources are tight; if a suitable GBR is also configured, then the User terminals can also get a basic quality of service. This can provide a richer operating strategy.

Therefore, it is necessary to design a method for providing GBR rate services for most user terminals as much as possible according to the GBR required by the user terminals, so that the number of user terminals with satisfactory rates is the largest.

Contents of the invention

The invention aims to provide a scheduling method of a communication system.

The scheduling method of the communication system of the present invention comprises the following steps:

Step A) Set the scheduling cycle, and within the scheduling cycle, judge whether the user terminal is satisfied with the service; if the user terminal has been satisfied with the service, then reduce the priority of the user terminal, and assign scheduling resources to other users who do not meet the guaranteed rate terminal; otherwise, the priority of the user terminal is increased, so that the user terminal obtains scheduling resources preferentially.

Wherein, said step A) may include the following steps:

Step A11) In the first TTI of the scheduling period that includes multiple TTIs, the amount of data that each user terminal has been scheduled in the scheduling period is set to 0;

Step A12) putting each user terminal into a high-priority queue and a low-priority queue respectively;

Step A13) In each priority queue, perform priority queuing for each user terminal according to the scheduling algorithm;

Step A14) According to the order of queuing in step A13), sequentially schedule the user terminal data in the high-priority queue until the scheduling resources are exhausted;

Step A15) updating the amount of data that has been scheduled by the user terminal in the current scheduling period;

Step A16) When entering the next TTI, repeat steps A11) to A15).

The scheduling method of the communication system of the present invention may also include the following steps: when the amount of data sent by the user terminal is greater than or equal to the product of the GBR and the scheduling period, it is considered that the user terminal has received satisfactory service.

Wherein, said step A12) may include the following steps:

Step A121) In the current scheduling period, put the user terminals that are satisfied with the service into the low-priority queue;

Step A122) Put the user terminals that are not served satisfactorily into a high priority queue.

Wherein, said step A14) may also include the following steps:

Step A141) If the scheduling resources are still left after the user terminal data in the high-priority queue has been scheduled, schedule the user terminal data in the low-priority queue sequentially.

Wherein, said step A) may include the following steps:

Step A21) calculating the scheduling rate that the user terminal has obtained;

Step A22) putting each user terminal into a high-priority queue and a low-priority queue respectively according to the scheduling rate obtained by the user terminal in step A21);

Step A23) In each priority queue, perform priority queuing for each user terminal according to the scheduling algorithm;

Step A24) according to the order of queuing in step A23), sequentially schedule the user terminal data in the high-priority queue until the scheduling resources are exhausted;

Step A25) When entering the next TTI, repeat step A21) to step A24).

The scheduling method of the communication system of the present invention may also include the following steps:

When the scheduling rate obtained by the user terminal is greater than or equal to the GBR, it is considered that the user terminal has received satisfactory service.

Wherein, said step A22) may include the following steps:

Step A221) In the current scheduling cycle, put the user terminals that are satisfied with the service into the low-priority queue;

Step A222) Put the user terminals that are not served satisfactorily into a high priority queue.

Wherein, the scheduling rate obtained by the user terminal is the actual scheduling rate of the user terminal within the smoothing time obtained through low-pass smoothing filtering;

The smoothing time constant is 800.

Wherein, said step A23) may include the following steps:

Step A231) If the scheduling resources are still left after the user terminal data in the high-priority queue has been scheduled, schedule the user terminal data in the low-priority queue sequentially.

In the scheduling method of the communication system of the present invention, the scheduling algorithm may be a MAX C/I algorithm, or a Round Robin algorithm, or a Proportional Fair algorithm.

In the scheduling method of the communication system of the present invention, the scheduling can be air interface HSDPA data scheduling or Iub interface data scheduling.

In the communication system scheduling method of the present invention, the communication system may be a WCDMA communication system, a CDMA2000 communication system or a TD-SDCDMA communication system.

Beneficial effects of the present invention: According to the dispatching method of the communication system of the present invention, as many users as possible can obtain a rate greater than or equal to GBR in each dispatching period, thereby increasing the number of overall satisfactory user terminals in the system.

Description of drawings

Fig. 1 is a flowchart of a communication system scheduling method according to an embodiment of the present invention;

Fig. 2 is a flowchart of a communication system scheduling method according to another embodiment of the present invention.

Detailed ways

The scheduling method of the communication system of the present invention will be described in detail below with reference to the accompanying drawings 1-2.

The embodiment of the present invention takes a wideband code division multiple access (WCDMA) communication system that can support the third generation (3G) wireless mobile communication technology, especially the HSDPA system of the WCDMA communication system as an example to the scheduling method of the communication system of the present invention be described, but the present invention is equally applicable to other mobile communication systems except the above-mentioned mobile communication network, such as Code Division Multiple Access 2000 (CDMA2000) communication system or Time Division Duplex-Synchronous Code Division Multiple Access (TD-SCDMA) The condition of the communication system.

Embodiment one:

For most services that require GBR rate, the demand for transmission rate is relatively stable. If the rate fluctuates too much, it may cause temporary interruption of data transmission, thereby affecting service quality. Therefore, when the service is carried on the HS-DSCH channel When , in order to provide a relatively stable service rate, a scheduling algorithm based on the scheduling period is adopted, so that as many user terminals as possible can obtain a rate greater than or equal to GBR in each scheduling period, and the size of the scheduling period should meet the rate allowed by the service within the fluctuation range.

Specifically, firstly, the entire scheduling time is divided into multiple scheduling periods, and each scheduling period includes multiple TTIs. Here, the length of the scheduling period can be determined according to the rate fluctuations tolerated by the service. For example, a scheduling period can include 150 to 1000 TTIs; then, based on whether the amount of data sent by the user terminal is greater than or equal to "GBR×scheduling period" as the basis for judging whether the user terminal obtains satisfactory service quality, put the user terminal into two priority levels In the queue; then, in each priority queue, each user terminal is prioritized according to an existing algorithm (for example, MAX C/I algorithm, or RoundRobin algorithm, or Proportional Fair algorithm, or other sorting algorithms, etc.) Queue, and dispatch the user terminal data in the high-priority queue sequentially until the HSDPA resources are exhausted.

Below, the implementation process of the scheduling method of the communication system of the present embodiment is described in detail (refer to FIG. 1):

Step 11) judging whether the current TTI is the first TTI of the current scheduling cycle, if so, the amount of data that has been scheduled by each user terminal in the current scheduling cycle is set to 0, otherwise the original value is maintained;

Step 12) Whether the user terminal is satisfied with the service whether the product of the amount of data sent by the user terminal is greater than or equal to the product of the GBR and the scheduling period, puts all user terminals into 2 queues: a high-priority queue and a low-priority queue;

Wherein, step 12) further comprises the following steps:

Step 121) In the current scheduling period, the user terminal whose data volume has been sent by the user terminal is greater than or equal to "GBR×scheduling period" is put into a low-priority queue;

Step 122) the user terminal has sent the user terminal whose data volume is less than "GBR×scheduling period" into the high priority queue;

Step 13) in each priority queue, according to algorithms such as MAX C/I, or Round Robin, or Proportional Fair, carry out priority queuing to each user terminal, the order is from high to low;

Step 14) according to the sequence from high to low in step 13), sequentially schedule the user terminal data in the high priority queue until the HSDPA resources are exhausted;

Wherein, step 14) also includes the following steps:

Step 141) if the HSDPA resources still remain, schedule the user terminal data in the low-priority queue sequentially;

Step 15) updating the amount of data that the user terminal has been scheduled in the current scheduling period;

Step 16) Go to the next TTI, repeat step 11) to step 15).

According to this embodiment, by dividing the scheduling time into scheduling periods, each scheduling period includes multiple transmission time intervals TTI, and according to whether the amount of data sent by the user terminal is greater than "GBR x scheduling period" as a measure of whether the user terminal Obtain the judgment basis of satisfactory service quality, put the user terminal into two queues with different priority levels, according to the existing algorithm (for example, the maximum load-to-interference ratio algorithm, or the length of waiting time, or the rate ratio obtained or other sorting algorithms etc.) to allocate scheduling opportunities for user terminals, when the user terminal has reached a satisfactory service, then reduce the scheduling priority of the user terminal, so that the remaining resources can be allocated to other user terminals that need more scheduling, thereby improving the efficiency of the system. The number of overall satisfactory user terminals.

Embodiment two:

Embodiment 1 of the present invention is to measure whether the user terminal obtains satisfactory service quality by setting the scheduling period and using whether the amount of data sent by the user terminal is greater than "GBR×scheduling period". The difference between the scheduling algorithm of the communication system in this embodiment and the scheduling algorithm of the communication system in Embodiment 1 of the present invention is that this embodiment measures whether the user terminal is satisfied by calculating whether the scheduling rate obtained by the user terminal is greater than or equal to GBR. ,

In the following, as shown in FIG. 2, the implementation process of the scheduling method of the communication system in this embodiment is described in detail:

Step 21) calculate the scheduling rate that the user terminal has obtained; the scheduling rate that the user terminal has obtained is calculated by the following formula:

${\mathrm{<span\; class="notranslate">\; r</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; t</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; =</span><span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; -</span>\frac{\mathrm{<span\; class="notranslate">\; 1</span>}}{\mathrm{<span\; class="notranslate">\; Tc</span>}}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; \&times;</span>{\mathrm{<span\; class="notranslate">\; r</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; t</span>}<span\; class="notranslate">\; -</span>\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; +</span>\frac{\mathrm{<span\; class="notranslate">\; 1</span>}}{\mathrm{<span\; class="notranslate">\; Tc</span>}}<span\; class="notranslate">\; \&times;</span>{\mathrm{<span\; class="notranslate">\; R</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; t</span>}<span\; class="notranslate">\; -</span>\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; )</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>$

That is, the scheduling rate r _i (t) already obtained by the user terminal is obtained by low-pass smoothing filtering from the actual scheduling rate of the user terminal within the smoothing time Tc.

Among them, r _i (t) is the scheduling rate that the user terminal has obtained, Tc is the smoothing time constant, and the unit is TTI, indicating how many TTIs the time length for smoothing the rate is; R _i (t) is the user terminal at time t The actual dispatch rate of . If the user terminal is not scheduled at time t, then R _i (t)=0.

The value of the smoothing time constant Tc should be selected large enough to ensure smoothing out the influence of fast fading, but should also be short enough so that the calculated rate can reflect the shadow fading environment.

Preferably, the smoothing time constant Tc takes a value of 800.

Step 22) put all user terminals into 2 queues: high priority queue and low priority queue;

Wherein, step 22) further comprises the following steps:

Step 221) When r _i (t)>=GBR, it is considered that the user terminal is satisfied, and the user terminal is put into a low-priority queue;

Step 222) When r _i (t)<GBR, it is considered that the user terminal is not satisfied, and the user terminal is put into a high-priority queue;

Step 23) in each priority queue, according to MAX C/I, or Round Robin, or Proportional Fair algorithm, or other sorting algorithms, carry out priority queuing to each user terminal, the order is from high to low;

Step 24) according to the sequence from high to low in step 23), sequentially schedule the user terminal data in the high priority queue until the HSDPA resources are exhausted;

Wherein, step 24) also includes the following steps:

Step 241) If the HSDPA resources still remain, then schedule the user terminal data in the low priority queue in turn;

Step 25) Enter the next TTI, and repeat steps 21) to 24).

According to this embodiment, the scheduling rate that the user terminal has obtained is calculated by formula (2), and then whether the scheduling rate r _i (t) that the user terminal has obtained is greater than or equal to GBR is used as the basis for judging whether the user terminal obtains satisfactory service quality , put the user terminal into two queues with different priority levels, and allocate scheduling opportunities for the user terminal according to the existing algorithm (for example, the maximum load-to-interference ratio algorithm, or the length of waiting time, or the obtained rate ratio or other sorting algorithms), When the user terminal has reached a satisfactory service, the scheduling priority of the user terminal is lowered, so that the remaining resources can be allocated to other user terminals that need more scheduling, thereby increasing the number of satisfactory user terminals in the system as a whole.

It can be understood that, the above only describes the present invention by taking the air interface HSDPA data scheduling of the WCDMA system as an example, but the present invention is not limited thereto, and the method of the present invention can also be applied to the data scheduling of the Iub interface.

To sum up, according to the scheduling algorithm of the communication system of the present invention, by setting the scheduling cycle, the user terminal can obtain the guaranteed rate as much as possible within the scheduling cycle; Scheduling priority, assigning scheduling resources to other user terminals that have not received satisfactory service for priority use, and according to existing algorithms (for example, the maximum carrier-to-interference ratio algorithm, or the length of waiting time, or the obtained rate ratio or other sorting algorithms) Assign scheduling opportunities to user terminals in each priority queue. When the user terminal has received satisfactory service, reduce the scheduling priority of the user terminal, so that the remaining scheduling resources can be allocated to other user terminals that need more scheduling. Thereby increasing the number of user terminals that are overall satisfactory in the system.

The above description is to facilitate those of ordinary skill in the art to understand the present invention and describe the present invention in detail, but it is conceivable that other changes and modifications can be made without departing from the scope covered by the claims of the present invention. These changes All modifications and modifications are within the protection scope of the present invention.

Claims (14)

1. A scheduling method for a communication system, comprising the following steps: Step A) Set the scheduling cycle, and within the scheduling cycle, judge whether the user terminal is satisfied with the service; if the user terminal has been satisfied with the service, then reduce the priority of the user terminal, and assign scheduling resources to other users who do not meet the guaranteed rate terminal; otherwise, the priority of the user terminal is increased, so that the user terminal obtains scheduling resources preferentially. 2. The scheduling method of communication system as claimed in claim 1, is characterized in that, described step A) comprises the following steps: Step A11) In the first TTI of the scheduling period that includes multiple TTIs, the amount of data that each user terminal has been scheduled in the scheduling period is set to 0; Step A12) putting each user terminal into a high-priority queue and a low-priority queue respectively; Step A13) In each priority queue, perform priority queuing for each user terminal according to the scheduling algorithm; Step A14) According to the order of queuing in step A13), sequentially schedule the user terminal data in the high-priority queue until the scheduling resources are exhausted; Step A15) updating the amount of data that has been scheduled by the user terminal in the current scheduling period; Step A16) When entering the next TTI, repeat steps A11) to A15). 3. The dispatching method of communication system as claimed in claim 2, is characterized in that, also comprises the following steps: When the amount of data sent by the user terminal is greater than or equal to the product of the GBR and the scheduling period, it is considered that the user terminal is served satisfactorily. 4. The scheduling method of communication system as claimed in claim 3, is characterized in that, described step A12) comprises the following steps: Step A121) In the current scheduling period, put the user terminals that are satisfied with the service into the low-priority queue; Step A122) Put the user terminals that are not served satisfactorily into a high priority queue. 5. The dispatching method of communication system as claimed in claim 2, is characterized in that, described step A14) also comprises the following steps: Step A141) If the scheduling resources are still left after the user terminal data in the high-priority queue has been scheduled, schedule the user terminal data in the low-priority queue sequentially. 6. The scheduling method of communication system as claimed in claim 1, is characterized in that, described step A) comprises the following steps: Step A21) calculating the scheduling rate that the user terminal has obtained; Step A22) putting each user terminal into a high-priority queue and a low-priority queue respectively according to the scheduling rate obtained by the user terminal in step A21); Step A23) In each priority queue, perform priority queuing for each user terminal according to the scheduling algorithm; Step A24) according to the order of queuing in step A23), sequentially schedule the user terminal data in the high-priority queue until the scheduling resources are exhausted; Step A25) When entering the next TTI, repeat step A21) to step A24). 7. The scheduling method of communication system as claimed in claim 6, is characterized in that, also comprises the following steps: When the scheduling rate obtained by the user terminal is greater than or equal to the GBR, it is considered that the user terminal has received satisfactory service. 8. The dispatching method of communication system as claimed in claim 7, is characterized in that, described step A22) comprises the following steps: Step A221) In the current scheduling cycle, put the user terminals that are satisfied with the service into the low-priority queue; Step A222) Put the user terminals that are not served satisfactorily into a high priority queue. 9. The scheduling method of the communication system according to claim 7, wherein the scheduling rate obtained by the user terminal is obtained by low-pass smoothing filtering from the actual scheduling rate of the user terminal within the smoothing time. 10 . The scheduling method of the communication system according to claim 9 , wherein the smoothing time constant is 800. 11 . 11. The scheduling method of communication system as claimed in claim 6, is characterized in that, described step A23) comprises the following steps: Step A231) If the scheduling resources are still left after the user terminal data in the high-priority queue has been scheduled, schedule the user terminal data in the low-priority queue sequentially. 12. The scheduling method of communication system as claimed in claim 2 or 6, is characterized in that, described scheduling algorithm is MAX C/I algorithm, or Round Robin algorithm, or Proportional Fair algorithm. 13. The scheduling method of communication system as claimed in claim 1 or 2 or 6, is characterized in that, described scheduling is air interface HSDPA data scheduling or Iub interface data scheduling. 14. The scheduling method of a communication system according to claim 1, 2 or 6, wherein the communication system is a WCDMA communication system, or a CDMA2000 communication system, or a TD-SDCDMA communication system.

Images