CN101541044B

CN101541044B - Scheduling method and scheduling processing device

Info

Publication number: CN101541044B
Application number: CN2008100268448A
Authority: CN
Inventors: 刘晟; 肖晓玲; 田辉; 张平; 孙巧云; 董琨
Original assignee: Huawei Technologies Co Ltd
Current assignee: XFusion Digital Technologies Co Ltd
Priority date: 2008-03-18
Filing date: 2008-03-18
Publication date: 2012-04-18
Anticipated expiration: 2028-03-18
Also published as: CN101541044A

Abstract

The invention discloses a scheduling method, which comprises the following steps: receiving a service flow request, grouping the received service flow request based on the service flow type and the service quality requirement, allocating bandwidth and power resources for the service flow group, and performing multi-user single-service scheduling in the service flow group based on the allocated bandwidth and power resources. The invention also discloses a scheduling processing device. By implementing the embodiment of the invention, different service flows are grouped, bandwidth and power resources are allocated to the service flow groups, and the corresponding scheduling strategy is adopted to carry out multi-user single-service scheduling on the services in the service flow groups allocated with the bandwidth and the power resources, so that the utilization rate of system resources is improved.

Description

Scheduling method and scheduling processing device

Technical Field

The present invention relates to the field of communications, and in particular, to a scheduling method and a scheduling processing apparatus.

Background

The Multiple Input Multiple Output (MIMO) technology is to adopt multiple antennas at the transmitting and receiving ends, and can improve the system capacity by multiple times under the condition of limited frequency spectrum and power resources. Orthogonal Frequency Division Multiplexing (OFDM) is a Multiplexing technique that converts a Frequency selective fading channel into a series of flat fading sub-channels, thereby effectively reducing Inter Symbol Interference (ISI). The development of high-speed multimedia services requires that future wireless communication can provide as high a data rate as possible under limited wireless resources and a severe channel environment, while ensuring different quality of Service (QoS) requirements for multi-user multi-Service. To achieve the above object, MIMO technology, OFDM technology, and dynamic resource allocation will be indispensable technologies. In the MIMO-OFDM system, the independent frequency and space selective fading of different users are utilized to carry out the multi-user dynamic resource allocation of the combined space and frequency domain, the space-frequency combined multi-user diversity gain is obtained while the MIMO space multiplexing gain is maximized, and the performance and the resource utilization rate of the system are improved as much as possible on the premise of ensuring the QoS of the users.

In the existing multi-user multi-service MIMO-OFDM system, a scheduling strategy of multi-user multi-service is adopted, a unified scheduling method is adopted for scheduling mixed services, for the scheduling mode, a unified scheduler is adopted for real-time services and non-real-time services, each user is given a certain priority based on a certain criterion, and user grouping scheduling is carried out according to the priority; some adopt the scheduling method based on business differentiation, under this kind of scheduling mode, real-time business adopts the scheduling method suitable for real-time business, and non-real-time business adopts the scheduling method suitable for non-real-time business, in the scheduling process, schedule real-time business first, satisfy the demand of real-time business, the surplus resource is distributed to the non-real-time user. These scheduling methods, while meeting the QoS requirements of real-time traffic, do not fully utilize the limited system resources.

Disclosure of Invention

The technical problem to be solved in the embodiments of the present invention is to provide a scheduling method and a scheduling processing apparatus, which are used for grouping different service flows, allocating bandwidth and power resources to service flow groups, and performing multi-user single-service scheduling on services in the service flow groups allocated with bandwidth and power resources by using corresponding scheduling policies.

In order to solve the above technical problem, an embodiment of the present invention provides a scheduling method, including:

receiving a service flow request;

grouping the received service flow requests based on service flow types and service quality requirements;

allocating bandwidth and power resources to a service flow group, setting the priority of the grouped service flow group when allocating the bandwidth and power resources to the service flow group, detecting the resource performance parameter value of the current service flow group, judging whether a service flow group with the priority lower than that of the current service flow group exists or not when detecting that the resource performance parameter value of the current service flow group is smaller than a preset first threshold of the resource performance of the service flow group, and if so, the base station selectively allocates the resources of the service flow group with the priority lower than that of the current service flow group to the current service flow group; when detecting that the parameter value of the residual resource performance of the current service flow group is larger than a preset second threshold of the resource performance of the service flow group, judging whether the service flow group with the priority lower than that of the current service flow group exists, if so, the base station selectively transfers the residual resource of the current service flow group to the service flow group with the priority lower than that of the current service flow group;

and performing multi-user single-service scheduling in the service flow group based on the allocated bandwidth and power resources.

Correspondingly, an embodiment of the present invention further provides a scheduling processing apparatus, including:

a request receiving unit, configured to receive a service flow request;

a service flow grouping unit, configured to group the received service flow request based on a service flow type and a service quality requirement;

a resource allocation unit, configured to allocate bandwidth and power resources to the service flow group;

a service scheduling unit, configured to perform multi-user single-service scheduling in the service flow group based on the allocated bandwidth and power resources;

the resource allocation unit includes:

a priority setting unit, configured to set a priority of the grouped service flow groups;

a second resource allocation unit, configured to detect a resource performance parameter value of a current service flow group, when detecting that the resource performance parameter value of the current service flow group is smaller than a preset first threshold of resource performance of the service flow group, determine whether a service flow group with a lower priority than the current service flow group exists, and if so, the base station selectively allocates the resource of the service flow group with the lower priority than the current service flow group to the current service flow group; when detecting that the parameter value of the residual resource performance of the current service flow group is larger than a preset second threshold of the resource performance of the service flow group, judging whether a service flow group with a priority lower than that of the current service flow group exists, if so, the base station selectively transfers the residual resource of the current service flow group to the service flow group with the priority lower than that of the current service flow group.

By implementing the embodiment of the invention, different service flows are grouped, bandwidth and power resources are allocated to the service flow groups, and the corresponding scheduling strategy is adopted to carry out multi-user single-service scheduling on the services in the service flow groups allocated with the bandwidth and the power resources, so that the utilization rate of system resources is improved.

Drawings

FIG. 1 is a flowchart illustrating a scheduling method according to a first embodiment of the present invention;

FIG. 2 is a schematic diagram of a scheduling processing apparatus according to an embodiment of the present invention;

fig. 3 is a schematic diagram illustrating a resource allocation unit in a scheduling transformation apparatus according to an embodiment of the present invention.

Detailed Description

In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention will be described in further detail with reference to the accompanying drawings.

The embodiment of the invention provides a scheduling method, which comprises the following steps: receiving a service flow request, grouping the received service flow request based on the service flow type and the service quality requirement, setting a priority for the grouped service flow group, distributing bandwidth and power resources for the service flow group according to the priority, and carrying out multi-user single-service scheduling in the service flow group based on the distributed bandwidth and power resources. The embodiment of the invention also provides a scheduling processing device. Each is described in detail below.

Referring to fig. 1, it is a schematic flowchart of a scheduling method according to a first embodiment of the present invention, including the steps of:

and A1, receiving the service flow request.

A2, grouping the received service flow requests based on the service flow types and the service quality requirements, and setting the priority of the grouped service flow groups.

Here, the Base Station (BS) groups different traffic flows according to the established traffic flow type and QoS requirement, and sets a priority for the grouped traffic flow group.

And A3, allocating bandwidth and power resources for the service stream group.

Here, resources are allocated and adjusted among different service flow groups according to bandwidth requests, service characteristics, QoS requirements of services, queue conditions of a link layer, and channel states of a physical layer.

And A4, performing multi-user single-service scheduling in the service flow group based on the allocated bandwidth and power resources.

Here, after the service flow group acquires the bandwidth and power resources, the different service flow groups select corresponding scheduling strategies according to service characteristics, QoS requirements, and scheduling targets, and perform multi-user single-service scheduling in the service flow group, where the inside of the service flow group performs multi-user single-service scheduling according to the QoS requirements of users, Channel State Information (CSI) of the users, and queue State Information of the users, and determines resource allocation, multiplexing among users, a modulation and coding scheme, and transmission power in a next scheduling period based on the scheduling strategies.

Due to the burstiness of the service flow, the flow of each type of service is constantly changed, the bandwidth and power resources cannot be fixedly allocated, and the bandwidth and power resources are dynamically allocated to the service flow group according to the priority. And allocating bandwidth and power resources to the service flow groups according to the priority when the period of the periodic timer is set, wherein the bandwidth and power resources allocated to the service flow groups are among different service flow groups, and the resources are allocated and adjusted according to bandwidth requests, service characteristics, QoS requirements of services, queue conditions of a link layer and channel states of a physical layer. During the timing period of the periodic timer, in the scheduling process of a single service, if the data volume of the service is suddenly increased to cause that the allocated bandwidth and power resources are insufficient, detecting the resource performance parameter value of the current service flow group, when detecting that the resource performance parameter value of the current service flow group is smaller than a preset first threshold of the resource performance of the service flow group, judging whether a service flow group with a lower priority than the current service flow group exists, if so, the base station performs selective scheduling on the service flow group resources with the lower priority than the current service flow group to the current service flow group; wherein the base station selectively dispatches the service flow group resource with lower priority than the current service flow group to the current service flow group, firstly selectively dispatches the service flow group resource with lower priority than the current service flow group with first lower priority to the current service flow group, if the resource required by the current service flow group is still insufficient, the resource is dispatched from the service flow group resource with lower priority than the current service flow group with second lower priority to the current service flow group, and the resource is dispatched from the service flow group with lower priority than the current service flow group to the current service flow group in turn until the resource requirement of the current service flow group is satisfied; but if the priority of the current service flow group is the first low, resources are not extracted and dispatched to the current service flow group. In the timing period, if the data volume of the service is suddenly reduced, the bandwidth and power resources allocated to the current service flow group are remained, when the condition that the parameter value of the residual resource performance of the current service flow group is larger than the second threshold of the resource performance of the preset service flow group is detected, whether a service flow group with the priority lower than that of the current service flow group exists is judged, if yes, the base station dispatches the residual resources of the current service flow group to the service flow group with the priority lower than that of the current service flow group, namely, the residual resources of the current service flow group are firstly dispatched to the service flow group with the priority higher than that of the current service flow group, and when the resources of the service flow group with the priority higher than that of the current service flow group are met, the residual resources of the service flow group with the priority higher than that of the current service flow group are dispatched to the service flow group with the second higher than that of the current service flow group, and sequentially performing selective dispatching on the service flow groups with the priority lower than that of the current service flow group until the residual resources of the current service flow group are completely performed the selective dispatching. The service flow group resource performance parameters are obtained according to the average time delay and/or the packet loss rate. Corresponding to different service types, parameters describing service performance, such as average time delay, packet loss rate, drop rate and the like, which reflect the resource conditions of a service group generally exist, and in specific implementation, the resource performance parameters of the service flow group can be obtained by calculating the parameters describing service performance, such as average time delay, packet loss rate, drop rate and the like, and similarly, the residual resource performance parameter values of the service flow group can also be obtained by calculating the parameters describing service performance, such as average time delay, packet loss rate, drop rate and the like.

The above-mentioned bandwidth and power resource allocation for the service stream group adopts a mode of combining the periodic trigger and the threshold trigger, and can also adopt only the periodic trigger or only the threshold trigger. Under the condition of only adopting periodic triggering, in the specific implementation, the method mainly comprises the following steps: setting the priority of the grouped service flow group; and allocating bandwidth and power resources to the service flow group according to the priority of the service flow group during the timing period of a periodic timer, wherein the bandwidth and power resources allocated to the service flow group are among different service flow groups, and the resources are allocated and adjusted according to bandwidth requests, service characteristics, QoS requirements of services, queue conditions of a link layer and channel states of a physical layer. Under the condition of only adopting threshold triggering, in the specific implementation, the method mainly comprises the following steps: setting the priority of the grouped service flow group; detecting resource performance parameter values of a current service flow group, judging whether a service flow group with a lower priority than the current service flow group exists or not when detecting that the resource performance parameter values of the current service flow group are smaller than a first threshold of the resource performance of the preset service flow group, and if so, performing extraction and adjustment on the service flow group resources with the lower priority than the current service flow group to the current service flow group by a base station; when detecting that the parameter value of the residual resource performance of the current service flow group is larger than a preset second threshold of the resource performance of the service flow group, judging whether a service flow group with a priority lower than that of the current service flow group exists, if so, the base station selectively transfers the residual resource of the current service flow group to the service flow group with the priority lower than that of the current service flow group.

A specific example will be given below to describe the above method in detail, taking real-time service and non-real-time service as examples.

In a downlink multi-user MIMO-OFDM system, the number of users in a cell is assumed to be K, the total number of subcarriers is assumed to be N, and in order to reduce the amount of user feedback information, adjacent R subcarriers are combined into one subband to serve as a minimum frequency allocation unit. The minimum time unit of scheduling is one subframe (1ms), each subframe is composed of Symbol _ num OFDM symbols. The number of transmit antennas at the base station side is Nt (set to 4), and each user has Nr (set to 2 here) receive antennas. Adaptive Modulation and Coding (AMC) is used in the system to provide variable rate data transmission, and the Modulation Coding Scheme (MCS) is shown in table one:

table one:

Index	Modulation	Coding Rate	SNRreq(dB)
				MCS1	BPSK	1/4	-3.4
MCS2	BPSK	1/2	-0.4
				MCS3	QPSK	1/2	2.2
MCS4	QPSK		3/4					5.2
				MCS5	8PSK		2/3		7.6
MCS6	16QAM		3/4					10.9
				MCS7	64QAM		2/3		14.5

the scheduling scheme is specifically introduced as follows:

assume four different classes of traffic flows: voice over Internet Protocol (VoIP), Video Streaming (Video Streaming), World Wide Web (WWW), and Best Effort (BE). The four traffic flows have different QoS requirements.

(1) Grouping the service flows of different users, wherein the four service flows are grouped into four groups, and the priority order is set as follows:

VoIP＞Video Streaming＞WWW＞BE

(2) according to the MCS in Table one, canTo obtain the number of bits bit _ Persymbol that can be transmitted per OFDM symbol_mAnd m is { 1.·. The bit number that can be carried by one resource when a certain modulation and coding scheme is adopted, that is, the bit number that can be carried by each sub-band of each sub-frame, can be obtained by the following formula:

bits_perblock_m＝bits_persymbol_m*symbols_num*R*min(M_T，M_R)，

m＝{1，...，mcs_num}

listed in Table one are bit _ perblock calculated from the above equation_m，m＝{1，......，mcs_num}。

Then, the number of bits carried by each resource is calculated as follows:

<math> <mrow> <mi>aver</mi> <mo>_</mo> <mi>capacity</mi> <mo>=</mo> <mfrac> <mn>1</mn> <mrow> <mi>mcs</mi> <mo>_</mo> <mi>num</mi> </mrow> </mfrac> <mo>*</mo> <munderover> <mi>Σ</mi> <mrow> <mi>m</mi> <mo>=</mo> <mn>1</mn> </mrow> <mrow> <mi>mcs</mi> <mo>_</mo> <mi>num</mi> </mrow> </munderover> <mi>bits</mi> <mo>_</mo> <mi>perbloc</mi> <msub> <mi>k</mi> <mi>m</mi> </msub> </mrow> </math>

therefore, according to the average estimation condition of the channel, the corresponding bandwidth resource can be allocated to each type of service flow group.

(3) The total number of bits in the user buffer queue of each type of traffic group is first calculated. For the ith user of the service flow class k, the number of bits in the buffer queue is bits _ in _ queue_k，iThen, there are:

<math> <mrow> <mi>bits</mi> <mo>_</mo> <mi>in</mi> <mo>_</mo> <msub> <mi>queue</mi> <mi>k</mi> </msub> <mo>=</mo> <munderover> <mi>Σ</mi> <mrow> <mi>i</mi> <mo>=</mo> <mn>1</mn> </mrow> <mrow> <mi>flow</mi> <mo>_</mo> <msub> <mi>num</mi> <mi>k</mi> </msub> </mrow> </munderover> <mi>bits</mi> <mo>_</mo> <mi>in</mi> <mo>_</mo> <msub> <mi>queue</mi> <mrow> <mi>k</mi> <mo>,</mo> <mi>i</mi> </mrow> </msub> </mrow> </math>

wherein, flow _ num_kIndicates the number of traffic streams contained in the traffic class k. Thus, the number of subbands band _ num required by service k_kCan be calculated from the following formula:

<math> <mrow> <mi>band</mi> <mo>_</mo> <msub> <mi>amount</mi> <mi>k</mi> </msub> <mo>=</mo> <msub> <mi>γ</mi> <mi>k</mi> </msub> <mo>·</mo> <mfrac> <mrow> <mi>bits</mi> <mo>_</mo> <mi>in</mi> <mo>_</mo> <msub> <mi>queue</mi> <mi>k</mi> </msub> </mrow> <mrow> <mi>aver</mi> <mo>_</mo> <mi>capacity</mi> </mrow> </mfrac> </mrow> </math>

wherein, band _ amount_kIs the number of sub-bands required by the service k in the current sub-frame; r is more than 0_k＜1，r_kFor controlling each type of trafficThe flow components reach the amount of resources, so that the waste of the resources is prevented, and the utilization rate of the resources is improved. Since the priority of VoIP is the first highest, when dividing resources, it should allocate resources to VoIP first, then allocate resources to Video Streaming, WWW, BE in turn, until VoIP, Video Streaming, WWW, BE acquire the resources that should BE acquired or the resources are allocated completely.

(4) Due to the burstiness of the service, after the resources are allocated among various service flow groups, the resources need to be readjusted and allocated once every certain period. If the real-time service group is still not satisfied in the period, threshold triggering of insufficient resources occurs, and resources need to be extracted and adjusted from the non-real-time service group to the real-time service group until the requirements of the real-time service group are satisfied. If the resources of the real-time service group are left in the period, the threshold triggering of the resource left will occur, and the left resources of the real-time service group need to be extracted and adjusted to the non-real-time service group. For the threshold trigger of the real-time service group resource surplus, the maximum resource surplus of various service groups is used as a trigger threshold, and the resource surplus refers to the ratio of the number of sub-bands currently occupied by each service to the number of sub-bands currently and actually required by the service. When the resource surplus of the service flow class k exceeds the maximum allowed resource surplus threshold, triggering is generated, and the base station extracts and dispatches the surplus resources from the resources occupied by the real-time service group to the non-real-time service group.

(5) After each type of service flow group obtains corresponding resources, the scheduling of multi-user single service can be carried out in the service flow group. And the scheduling in the service needs to select a proper scheduler, so that the spectrum efficiency of the system is improved on the premise of ensuring the fairness of users and the QoS (quality of service) requirements, and the local optimization of resource allocation is achieved.

The non-real-time service group adopts a classic PF (probability Fairness) algorithm, and the real-time service group adopts an M-LWDF (modified target Weighted Delay first) algorithm. The following description of two algorithms is given in detail:

A. non-real time services

The scheduling of the non-real-time service group adopts a PF (Proportional Fairness) algorithm, and the algorithm is described as follows: suppose that the service gets M_kAnd each sub-band, in the time slot t, the priority of the user i on the sub-band j is as follows:

<math> <mrow> <msub> <mi>priority</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>j</mi> </mrow> </msub> <mo>=</mo> <mfrac> <mrow> <mi>ch</mi> <mo>_</mo> <msub> <mi>rate</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>j</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </mrow> <mrow> <mover> <msub> <mi>r</mi> <mi>i</mi> </msub> <mo>&OverBar;</mo> </mover> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </mrow> </mfrac> </mrow> </math>

wherein ch _ rate_i，j(t) is the number of bits that user i can transmit on sub-band j,

for user i in a time window T_cThe average rate of inner received bits.

For each sub-band j, a priority is selected_i，jMaximum user i^*Namely:

i^{*} = \underset{i = {1, . . ., K}}{\arg \max} {Priority}_{i, j}

the sub-band j is distributed to the corresponding user i^*。

If the user i has no data bit to transmit in the current time slot, the priority is set to 0; in each time slot t, all users update their average rates

The following were used:

<math> <mrow> <mover> <msub> <mi>r</mi> <mi>i</mi> </msub> <mo>&OverBar;</mo> </mover> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> <mo>=</mo> <mrow> <mo>(</mo> <mn>1</mn> <mo>-</mo> <mfrac> <mn>1</mn> <msub> <mi>T</mi> <mi>c</mi> </msub> </mfrac> <mo>)</mo> </mrow> <mo>*</mo> <mover> <msub> <mi>r</mi> <mi>i</mi> </msub> <mo>&OverBar;</mo> </mover> <mrow> <mo>(</mo> <mi>t</mi> <mo>-</mo> <mn>1</mn> <mo>)</mo> </mrow> <mo>+</mo> <mfrac> <mn>1</mn> <msub> <mi>T</mi> <mi>c</mi> </msub> </mfrac> <mo>*</mo> <mi>tran</mi> <mo>_</mo> <msub> <mi>rate</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>-</mo> <mn>1</mn> <mo>)</mo> </mrow> </mrow> </math>

if user i has no transmitted bits in t-1 time slotThen tran _ rate_i(t-1)＝0；

B. Real-time services

The scheduling of the real-time service group adopts an M-LWDF (modified target Weighted Delay first) algorithm, and the existing research shows that the algorithm can achieve the optimal throughput.

Suppose that the service gets M_kAnd (4) sub-bands. In time slot t, the priority of sub-band j corresponding to user i is as follows:

<math> <mrow> <msub> <mi>priority</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>j</mi> </mrow> </msub> <mo>=</mo> <msub> <mi>a</mi> <mi>i</mi> </msub> <mo>*</mo> <msub> <mi>delay</mi> <mi>i</mi> </msub> <mo>*</mo> <mfrac> <mrow> <mi>ch</mi> <mo>_</mo> <msub> <mi>rate</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>j</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </mrow> <mrow> <mover> <msub> <mi>r</mi> <mi>i</mi> </msub> <mo>&OverBar;</mo> </mover> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </mrow> </mfrac> </mrow> </math>

wherein,δ_ithe delay of the first packet in the current buffer queue on behalf of user i exceeds max delay_iThe probability of (d); max _ delay_iMaximum packet delay allowed for user i, delay_iThe delay of the first packet in the queue for user i; ch _ rate_i，j(t) for user i on subband j canThe number of bits to be transmitted,

for user i in a time window T_cThe average rate of inner received bits.

For each sub-band j, a priority is selected_i，jMaximum user i^*Namely:

i^{*} = \underset{i = {1, . . ., K}}{\arg \max} {priority}_{i, j}

the sub-band j is distributed to the corresponding user i^*。

All traffic within a traffic group belong to the same class with the same QoS requirements, then max delay_iAnd delta_iThe same for all users. The priority formula can thus be simplified to:

<math> <mrow> <msub> <mi>priority</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>j</mi> </mrow> </msub> <mo>=</mo> <mfrac> <msub> <mi>delay</mi> <mi>i</mi> </msub> <mrow> <mi>max</mi> <mo>_</mo> <mi>delay</mi> </mrow> </mfrac> <mo>*</mo> <mfrac> <mrow> <mi>ch</mi> <mo>_</mo> <msub> <mi>rate</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>j</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </mrow> <mrow> <mover> <msub> <mi>r</mi> <mi>i</mi> </msub> <mo>&OverBar;</mo> </mover> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </mrow> </mfrac> </mrow> </math>

where max _ delay represents the maximum packet delay allowed for the traffic within the traffic flow group.

And in the process of carrying out multi-user single-service scheduling in the service flow group, determining the resource allocation, the multiplexing among users, the modulation coding mode and the transmission power in the next scheduling period based on the scheduling strategy.

The following describes in detail a scheduling processing apparatus according to the above embodiment.

Referring to fig. 2, a schematic diagram of a scheduling processing apparatus according to an embodiment of the present invention is shown, where the scheduling processing apparatus includes:

a request receiving unit 1, configured to receive a service flow request;

a service flow grouping unit 2, configured to group the received service flow request based on a service flow type and a service quality requirement;

here, the Base Station (BS) groups different traffic flows according to the established traffic flow type and QoS requirement.

A resource allocation unit 3, configured to allocate bandwidth and power resources to the service flow group;

And the service scheduling unit 4 is configured to perform multi-user single-service scheduling in the service flow group based on the allocated bandwidth and power resources.

Here, based on the allocated bandwidth and power resources, the service flow group selects a corresponding scheduling policy according to service characteristics, quality of service requirements, and a scheduling objective, and performs multi-user single-service scheduling in the service flow group. After the service flow group acquires the bandwidth and power resources, the different service flow groups select corresponding scheduling strategies according to service characteristics, QoS requirements and scheduling targets, and perform multi-user single-service scheduling in the service flow groups, wherein the service flow groups perform multi-user single-service scheduling according to the QoS requirements of users, Channel State Information (CSI) of the users and queue State Information of the users, and resource allocation, multiplexing among the users, a modulation coding mode and sending power in the next scheduling period are determined based on the scheduling strategies.

Referring to fig. 3, it is a schematic diagram of a resource allocation unit in a scheduling conversion apparatus according to an embodiment of the present invention, where the resource allocation unit 3 includes:

a priority setting unit 31, configured to set a priority of the grouped service flow groups;

a first resource allocation unit 32, configured to allocate bandwidth and power resources to the service flow group according to the priority of the service flow group during the timing period of the period timer;

here, due to the burstiness of the service flows, each type of service flow is constantly changing, and bandwidth and power resources cannot be fixedly allocated, and the bandwidth and power resources are allocated to the service flow group according to the priority of the service flow group. And allocating bandwidth and power resources for the service flow groups according to the priority and the service flow groups during the timing period of the periodic timer, wherein the bandwidth and power resources allocated for the service flow groups are among different service flow groups, and the resources are allocated and adjusted according to bandwidth requests, service characteristics, the QoS requirements of services, the queue condition of a link layer and the channel state of a physical layer.

A performance parameter obtaining unit 33, configured to obtain the performance parameter of the resource of the service flow group according to the average delay and/or the packet loss rate, and obtain the performance parameter of the remaining resource of the service flow group according to the average delay and/or the packet loss rate.

Here, the service flow group resource performance parameter is obtained according to an average delay and/or a packet loss rate, and generally includes parameters describing service performance, such as an average delay, a packet loss rate, a drop rate, and the like, which reflect conditions of service group resources, corresponding to different service types.

A second resource allocation unit 34, configured to detect a resource performance parameter value of a current service flow group in a timing period of the periodic timer, and when the resource performance parameter value of the current service flow group is detected to be smaller than a first threshold of resource performance of a preset service flow group, determine whether a service flow group with a lower priority than the current service flow group exists, if so, the base station performs selective dispatching on the service flow group resource with the lower priority than the current service flow group to the current service flow group; when detecting that the parameter value of the residual resource performance of the current service flow group is larger than a preset second threshold of the resource performance of the service flow group, judging whether a service flow group with a priority lower than that of the current service flow group exists, if so, the base station selectively transfers the residual resource of the current service flow group to the service flow group with the priority lower than that of the current service flow group.

Here, during the scheduling process of a single service in the timing period of the periodic timer, if the data volume of the service is suddenly increased, which results in insufficient allocated bandwidth and power resources, detecting a current traffic group resource performance parameter value, when it is detected that the current traffic group resource performance parameter value is smaller than a preset traffic group resource performance first threshold, determining whether a traffic group with a lower priority than the current traffic group exists, and if so, the base station performs scheduling on the traffic group resource with the lower priority than the current traffic group to the current traffic group; wherein the base station selectively dispatches the service flow group resource with lower priority than the current service flow group to the current service flow group, firstly selectively dispatches the service flow group resource with lower priority than the current service flow group with first lower priority to the current service flow group, if the resource required by the current service flow group is still insufficient, the resource is dispatched from the service flow group resource with lower priority than the current service flow group with second lower priority to the current service flow group, and the resource is dispatched from the service flow group with lower priority than the current service flow group to the current service flow group in turn until the resource requirement of the current service flow group is satisfied; but if the priority of the current service flow group is the first low, resources are not extracted and dispatched to the current service flow group. In the timing period, if the data volume of the service is suddenly reduced, the bandwidth and power resources allocated to the current service flow group are remained, when the condition that the parameter value of the residual resource performance of the current service flow group is larger than the second threshold of the resource performance of the preset service flow group is detected, whether a service flow group with the priority lower than that of the current service flow group exists is judged, if yes, the base station dispatches the residual resources of the current service flow group to the service flow group with the priority lower than that of the current service flow group, namely, the residual resources of the current service flow group are firstly dispatched to the service flow group with the priority higher than that of the current service flow group, and when the resources of the service flow group with the priority higher than that of the current service flow group are met, the residual resources of the service flow group with the priority higher than that of the current service flow group are dispatched to the service flow group with the second higher than that of the current service flow group, and sequentially performing selective dispatching on the service flow groups with the priority lower than that of the current service flow group until the residual resources of the current service flow group are completely performed the selective dispatching.

The above disclosure is only for the purpose of illustrating the preferred embodiments of the present invention, and it is therefore to be understood that the invention is not limited by the scope of the appended claims.

Claims

1. A method of scheduling, comprising:

receiving a service flow request;

2. The method of claim 1,

detecting resource performance parameter values of a current service flow group in a timing period of a periodic timer, judging whether a service flow group with a lower priority than the current service flow group exists or not when detecting that the resource performance parameter values of the current service flow group are smaller than a first threshold of the resource performance of the preset service flow group, and if so, dispatching the service flow group resources with the lower priority than the current service flow group to the current service flow group by a base station; when detecting that the parameter value of the residual resource performance of the current service flow group is larger than a preset second threshold of the resource performance of the service flow group, judging whether a service flow group with a priority lower than that of the current service flow group exists, if so, the base station selectively transfers the residual resource of the current service flow group to the service flow group with the priority lower than that of the current service flow group.

3. The method according to claim 1 or 2, wherein the traffic group resource performance parameter is obtained according to an average delay and/or a packet loss rate.

4. The method according to claim 1 or 2, wherein the performance parameter of the remaining resources of the service flow group is obtained according to an average delay and/or a packet loss rate.

5. The method according to claim 1 or 2, wherein the specific step of performing multi-user single-service scheduling in the service flow group based on the allocated bandwidth and power resources is:

based on the allocated bandwidth and power resources, the service flow group selects a corresponding scheduling strategy according to service characteristics, service quality requirements and scheduling targets, and multi-user single-service scheduling is performed in the service flow group.

6. A scheduling processing apparatus, comprising:

a request receiving unit, configured to receive a service flow request;

the resource allocation unit includes:

7. The apparatus of claim 6,

a second resource allocation unit, configured to detect a resource performance parameter value of a current service flow group in a timing period of a periodic timer, and when the resource performance parameter value of the current service flow group is detected to be smaller than a first threshold of a preset resource performance of the service flow group, determine whether a service flow group with a lower priority than the current service flow group exists, if so, the base station performs selective dispatching on the service flow group resource with the lower priority than the current service flow group to the current service flow group; when detecting that the parameter value of the residual resource performance of the current service flow group is larger than a preset second threshold of the resource performance of the service flow group, judging whether a service flow group with a priority lower than that of the current service flow group exists, if so, the base station selectively transfers the residual resource of the current service flow group to the service flow group with the priority lower than that of the current service flow group.

8. The apparatus of claim 6 or 7, the resource allocation unit further comprising:

and the performance parameter acquiring unit is used for acquiring the resource performance parameters of the service flow group according to the average time delay and/or the packet loss rate and acquiring the residual resource performance parameters of the service flow group according to the average time delay and/or the packet loss rate.