WO2018072259A1

WO2018072259A1 - Resource scheduling method and device

Info

Publication number: WO2018072259A1
Application number: PCT/CN2016/107614
Authority: WO
Inventors: 张奇勋; 王勤龙; 冯志勇; 冯建元; 徐鹤铭
Original assignee: 北京邮电大学
Priority date: 2016-10-18
Filing date: 2016-11-29
Publication date: 2018-04-26
Also published as: CN106455084A

Abstract

Provided is a resource scheduling method and device. The method comprises: determining use priorities of a plurality of carriers in a network for a plurality of terminals accessing the network, wherein the plurality of terminals are single carrier terminals accessing the network, and the use priority is determined according to a signal condition, a carrier load size, and a carrier bandwidth of a carrier of the terminal; using a carrier having a highest priority as a used carrier for each terminal; allocating, on the used carrier, resource blocks (RBs) for transmitting data for the plurality of terminals; determining whether the total RB allocation for each terminal that does not have a guaranteed a bit rate service exceeds a total sending cache amount of the terminal; and for those terminals whose total RB allocation amount exceeds the total sending cache amount thereof and that do not have a guaranteed a bit rate service, allocating RBs that exceed the total sending cache amount of the terminal to a terminal whose total RB allocation amount does not exceed the total sending cache amount thereof and that does not have a guaranteed a bit rate service. Embodiments of the application can ensure that a terminal operates a service under an optimal channel condition, thereby ensuring service quality.

Description

Resource scheduling method and device

The present application claims priority to Chinese Patent Application Serial No. No. No. No. No. No. No. No. No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No

Technical field

The present application relates to the field of network communication technologies, and in particular, to a resource scheduling method and apparatus.

Background technique

The LTE-A (Long Term Evolution Advanced) network is a subsequent evolution technology of the LTE (Long Term Evolution) network. The LTE-A network uses a carrier aggregation technology to aggregate the frequency bands used by the network system from multiple LTE carriers, thereby greatly increasing the system bandwidth.

An LTE terminal is a single-carrier terminal, and an LTE-A terminal can also be regarded as a single-carrier terminal when performing single-carrier service. When the LTE-A network transmits data to the single-carrier terminal, the LTE-A network allocates one of the aggregated carriers to the terminal, and then allocates the RB (Resource Block) in the single carrier to the terminal.

The existing LTE-A network allocates a carrier to the terminal according to the load information of the carrier, that is, when the network has a newly accessed terminal, allocates the carrier with the smallest load among all the carriers of the LTE-A network to the newly accessed terminal. .

However, when the terminal is allocated according to the load information of the carrier, there is a problem that the carrier that is allocated each time can satisfy the optimal channel condition on the terminal.

Summary of the invention

The present application provides a resource scheduling method and apparatus, which can ensure that each allocated carrier can satisfy the optimal channel condition of the terminal.

To achieve the above objective, the embodiment of the present application discloses a resource scheduling method, including:

Determining a priority of use of a plurality of carriers in the network for accessing a plurality of terminals of the network, the plurality of terminals being single-carrier terminals accessing the network, the use priority being according to signal conditions and carriers of the terminal on the carrier Load size, carrier bandwidth determination;

For each terminal, the carrier with the highest priority will be used as the carrier used;

A resource block RB used for transmitting data is allocated to the used carriers of the plurality of terminals.

Preferably, the allocating the RBs used by the multiple terminals to transmit data on the used carrier includes:

Determining a service type of the multiple terminals, where the service type includes a guaranteed bit rate service and a non-guaranteed bit rate service;

For the terminal whose service type is the guaranteed bit rate service, the RB used for transmitting the data is allocated on the used carrier, so that the terminal whose service type is the guaranteed bit rate service satisfies the minimum bit rate requirement;

Among the remaining RBs of the plurality of carriers, the RBs used for transmitting the data are allocated on the used carrier for the terminal whose service type is the non-guaranteed bit rate service.

Preferably, in the remaining RBs of the multiple carriers, the RBs used by the terminal whose service type is the non-guaranteed bit rate service to allocate the transmission data on the used carrier include:

Generating a utility value of the terminal of each of the non-guaranteed bit rate services with respect to the RB, where the utility value is determined according to a current transmission bit rate, a historical average transmission bit rate, and a delay factor of the terminal of the non-guaranteed bit rate service;

The remaining RBs are sequentially allocated to the terminal of the non-guaranteed bit rate service in order of high to low utility values.

Preferably, the generating the utility value of the terminal of each of the non-guaranteed bit rate services with respect to the RB comprises: generating a utility value of the terminal of each of the non-guaranteed bit rate services with respect to the RB according to the following formula:

Where i denotes the i-th terminal, j denotes the j-th carrier, k denotes the k-th RB, u _i,j,k denotes the utility value when the k-th RB on the carrier j is allocated to the terminal i, r _{i , j, k} represents the current transmission bit rate of the kth RB of the terminal i on the carrier j,

Indicates the historical average transmission bit rate of the terminal i; f(τ _i ) represents the delay factor of the i-th terminal.

Preferably, the terminal that is a service type that does not guarantee the bit rate service is divided on the used carrier. After the RB used to transmit the data, the method further includes:

Determining whether the total amount of RB allocation of each terminal that does not guarantee the bit rate service exceeds the total amount of the terminal transmission buffer;

In a terminal that allocates a total amount of RBs beyond the non-guaranteed bit rate service of the total amount of the terminal transmission buffer, the RB that exceeds the total amount of the terminal transmission buffer is allocated to the terminal that does not exceed the total amount of the terminal transmission buffer and does not guarantee the bit rate service. .

Preferably, in the terminal that allocates the total amount of RBs beyond the total amount of the transmission buffer of the terminal, the RBs that exceed the total amount of the transmission buffer of the terminal are not guaranteed to be allocated to the total amount of the RBs. Terminals for bit rate services, including:

The terminal that does not guarantee the bit rate service whose total RB allocation exceeds the total amount of the terminal transmission buffer is classified into the cache terminal set;

The terminal that does not guarantee the bit rate service whose total RB allocation does not exceed the total amount of the terminal transmission buffer is classified into the cache terminal set;

And sequentially selecting one of the excess cached terminal sets as the distribution terminal;

Obtaining a utility value of the allocation terminal relative to the RB and a utility value of each terminal in the set of not exceeding the cached terminal with respect to the RB;

Generating a difference between a utility value of the allocation terminal relative to the RB and a utility value of the terminal not exceeding the RB in the set of buffered terminals, the difference being a utility loss;

Allocating the RBs beyond which the allocation terminal exceeds the terminal in the set of cached terminals that has the least utility loss.

Preferably, the determining, by the plurality of carriers in the network, the use priorities of the multiple terminals of the access network includes: determining, according to the following formula, the use priority of the multiple carriers in the network to the multiple terminals of the access network:

Where j denotes the jth carrier, k denotes the kth RB in carrier j, i denotes the i th terminal, N _j denotes the number of RBs in carrier j, B denotes the bandwidth of one RB in carrier j, Γ _{i, k} represents the signal to interference and noise ratio of terminal i on RB k,

Indicates the total amount of buffered packets of the terminal of the same service type on the carrier j, and p _j represents the priority of the use of the carrier j for the terminal.

To achieve the above objective, the embodiment of the present application discloses a resource scheduling apparatus, including:

a first determining module, configured to determine a usage priority of multiple carriers in the network to access multiple terminals of the network, where the multiple terminals are single carrier terminals that access the network, and the usage priority is based on the terminal Signal condition on the carrier, carrier load size, carrier bandwidth determination;

a selection module for using, for each terminal, the carrier with the highest priority as the used carrier;

And a first allocation module, configured to allocate, by using the plurality of terminals, the RB used for transmitting data on the used carrier.

Preferably, the first allocation module further includes:

Determining a submodule, configured to determine a service type of the multiple terminals, where the service type includes a guaranteed bit rate service and a non-guaranteed bit rate service;

a first allocation submodule, configured to allocate, by using a carrier whose carrier type is a bit rate service, a RB used for transmitting data on a used carrier, so that a terminal whose service type is a guaranteed bit rate service satisfies a minimum bit rate requirement;

And a second allocation submodule, configured to allocate, in the remaining RBs of the multiple carriers, RBs used for transmitting data on a used carrier by a terminal whose service type is a non-guaranteed bit rate service.

Preferably, the second distribution submodule comprises:

a generating unit, configured to generate a utility value of the terminal of each non-guaranteed bit rate service with respect to the RB, where the utility value is determined according to a current transmission bit rate, a historical average transmission bit rate, and a delay factor of the terminal that does not guarantee the bit rate service;

And an allocating unit, configured to sequentially allocate the remaining RBs to the terminal that does not guarantee the bit rate service according to the order of the utility value from high to low.

Preferably, the generating unit is further configured to generate, according to the following formula, a utility value of the terminal for each non-guaranteed bit rate service with respect to the RB:

Preferably, the resource scheduling apparatus further includes:

a second determining module, configured to determine whether a total RB allocation of each terminal that does not guarantee the bit rate service exceeds a total amount of the terminal sending buffer;

The second allocation module is configured to allocate, in the terminal that does not exceed the total amount of the RB, the non-guaranteed bit rate service of the terminal to send the buffer, and the RB that exceeds the total amount of the terminal to send the buffer to the RB allocation does not exceed the total amount of the terminal sending buffer. Terminals that do not guarantee bit rate services.

Preferably, the second distribution module further comprises:

a first sub-module, configured to classify a terminal of the unguaranteed bit rate service whose total RB allocation exceeds the total amount of the terminal transmission buffer into the cache terminal set;

a second sub-module, configured to classify the terminal of the unguaranteed bit rate service whose total RB allocation does not exceed the total amount of the terminal transmission buffer into the cache terminal set;

Selecting a sub-module for sequentially selecting one of the excess terminals in the set of cached terminals as the distribution terminal;

Obtaining a sub-module, configured to obtain a utility value of the allocation terminal relative to the RB and a utility value of each terminal in the set of the cached terminal relative to the RB;

Generating a submodule, configured to generate a difference between a utility value of the allocation terminal relative to the RB and a utility value of each terminal in the set of the buffered terminal relative to the RB, the difference being a utility loss;

And a third allocation submodule, configured to allocate, to the terminal in the set of the cached terminals, the RBs that are allocated by the terminal for the terminal in the set of the cached terminals.

To achieve the above objective, the embodiment of the present application discloses a control device, including: a processor, Memory, communication interface and bus;

The processor, the memory, and the communication interface are connected by the bus and complete communication with each other;

The memory stores executable program code;

The processor runs a program corresponding to the executable program code by reading executable program code stored in the memory for executing the resource scheduling method.

To achieve the above objective, an embodiment of the present application discloses an application program for executing the resource scheduling method at runtime.

To achieve the above objective, the embodiment of the present application discloses a storage medium for storing executable code, and the executable code is used to execute the resource scheduling method.

It can be seen from the foregoing technical solutions that, in the solution provided by the embodiment of the present application, by determining the priority of the use of the carrier for the terminal, the carrier is allocated to the terminal according to the use priority, thereby ensuring that the terminal runs the service under the optimal channel condition, thereby ensuring Quality of business.

DRAWINGS

In order to more clearly illustrate the embodiments of the present application and the technical solutions of the prior art, the following description of the embodiments and the drawings used in the prior art will be briefly introduced. Obviously, the drawings in the following description are only Some embodiments of the application may also be used to obtain other figures from those of ordinary skill in the art without departing from the scope of the invention.

1 is a schematic diagram of a resource management framework of an LTE-A network system;

2 is a flowchart of a resource scheduling method according to an embodiment of the present application;

FIG. 3 is a first structural diagram of a resource scheduling apparatus according to an embodiment of the present application;

FIG. 4 is a second structural diagram of a resource scheduling apparatus according to an embodiment of the present application.

detailed description

In order to make the objects, technical solutions, and advantages of the present application more comprehensible, the present application will be further described in detail below with reference to the accompanying drawings. It is apparent that the described embodiments are only a part of the embodiments of the present application, and not all of them. All other embodiments obtained by a person of ordinary skill in the art based on the embodiments of the present application without departing from the inventive scope are the scope of the present application.

Under the condition of carrier aggregation, the resource management framework of the LTE-A network system is shown in FIG. 1. A plurality of terminals (terminals 1 to i) perform data transmission of different service types, for example, terminal 1 performs voice service. Transmitting voice data packets between the base station and the base station, and transmitting video data packets between the base station and the base station when the terminal 2 performs video viewing, and transmitting FTP (File Transfer Protocol) data packets between the base station and the base station, respectively. The transmission buffer that enters the base station is allocated to different RBs of different carriers after carrier aggregation. For an LTE-A terminal with carrier aggregation function, RBs of multiple carriers in the system can be used, but for an LTE single carrier terminal, only RBs on a certain carrier can be used. Therefore, when an LTE single-carrier terminal or an LTE-A terminal that performs single-carrier service accesses the LTE-A system, it needs to allocate a certain carrier to perform resource scheduling.

The embodiment of the present application discloses a resource scheduling method. Referring to FIG. 2, FIG. 2 is a flowchart of a resource scheduling method according to an embodiment of the present application, where the method includes:

S101: Determine a priority of using multiple carriers in the network to access multiple terminals of the network, where multiple terminals are single-carrier terminals that access the network, and use priorities according to signal conditions of the terminal on the carrier, and load of the carrier. Size, carrier bandwidth is determined.

Generally, multiple carrier frequency bands are included in one network, and the terminal accesses the corresponding carrier frequency band for data transmission. The single-carrier terminal may be a terminal that supports only single-carrier transmission and reception on the hardware, such as an LTE terminal, or may be a multi-carrier terminal when performing single-carrier service, such as an LTE-A terminal. When a multi-carrier terminal performs a service with a small data transmission bit rate (for example, a language service), high bandwidth is not required, and a single carrier can ensure normal service.

The LTE-A network is a technical upgrade version of the LTE network. The LTE-A network is used as an example. In the embodiment of the present application, when a carrier is allocated for a single-carrier terminal, the priority of the carrier to the terminal is determined first, and the priority is related to the terminal. The signal condition on the carrier, the load size of the carrier, and the carrier bandwidth. The better the signal condition of the terminal on the carrier, the higher the priority of the carrier to the terminal; the smaller the load of the carrier, the higher the priority of the carrier to the terminal; the wider the bandwidth of the carrier, the priority of the carrier to the terminal The higher the level. Therefore, according to the signal condition of the terminal on the carrier, the load size of the carrier, and the carrier bandwidth, the priority of the carrier to the terminal can be determined. By determining the priority of the carrier for the terminal, the carrier with the highest priority is allocated to the terminal, thereby ensuring that the allocated carrier satisfies the optimal channel condition of the terminal.

The functional relationship of priority is:

Where j denotes the jth carrier, k denotes the kth RB in carrier j, i denotes the i th terminal, N _j denotes the number of RBs in carrier j, B denotes the bandwidth of a single RB in carrier j, Γ _{i, k} represents the signal to interference and noise ratio of terminal i on RB k,

Indicates the total number of buffered packets of the terminal of the same service type on the carrier j, and p _j represents the priority of the use of the carrier j for the terminal, and determines the priority of the corresponding carrier to the terminal by the functional relationship of the priority.

S102: For each terminal, the carrier with the highest priority will be used as the used carrier.

The functional relationship of priority takes into account the relationship between the carrier bandwidth, the signal condition on the carrier, and the carrier load size. This formula can be used to determine the priority of each carrier for the terminal, by using the carrier with the highest priority. The terminal will have the best signal transmission conditions, so as to ensure the normal operation of the service on the terminal.

S103: Allocating RBs used for transmitting data on a used carrier by a plurality of terminals.

The LTE-A system includes carriers of a plurality of frequency ranges, each of which is an electromagnetic wave having a certain frequency range. A plurality of RBs are included on each carrier, where RB is the smallest unit allocated to the terminal by the LTE-A system downlink. Usually, one carrier is allocated to multiple terminals, so the RBs in the carrier are also allocated to different terminals accordingly. After the terminal selects the carrier with the highest priority, the system allocates the RBs in the carrier to the corresponding terminals in an integer. When the RB is allocated, the RB in the carrier can be scheduled to the terminal according to the proportional fair scheduling method, that is, according to the ratio of the instantaneous transmission rate of the terminal on the RB to the long-term average transmission rate of the terminal. The proportional fair scheduling method is the prior art, and the specific allocation process of the RB is not repeated here.

In the first embodiment of the present application, by determining the priority of the use of the carrier for the terminal, the carrier is allocated according to the use priority, so that the terminal can operate the service under the optimal channel condition, thereby ensuring the service quality.

The present application further discloses a second embodiment of a resource scheduling method. Preferably, the allocation of RBs in a carrier is optimized based on the first embodiment of the present application, including:

S201: Determine a service type of the multiple terminals, where the service type includes a guaranteed bit rate service and a non-guaranteed bit rate service.

Whether it is a single-carrier terminal or a multi-carrier terminal, the type of service is not static, but varies according to the user's business needs. For example, when a user makes a video call or a voice call, the user has a low bit rate requirement but a high delay requirement, because once the time delay is high, the card may be stuck and intermittent, which may affect the call quality; for example, the user performs file downloading. Or when watching streaming media, users have high bit rate requirements but low latency requirements, because once the bit rate is reduced, it will result in slow downloads or long buffering of streaming media, which also affects the user experience.

According to different service types of the terminal, the service type is divided into a guaranteed bit rate service and a non-guaranteed bit rate service, wherein the guaranteed bit rate service includes a video call service and a voice call service; and the bit rate service is not guaranteed to include a streaming media service and an FTP service. . Specifically, the streaming media service may be listening to songs online or watching videos online, and the FTP service may be a file downloading service.

S202: Allocating RBs for transmitting data on a used carrier by a terminal whose service type is a guaranteed bit rate service, so that a terminal whose service type is a guaranteed bit rate service satisfies a minimum bit rate requirement, and is expressed as:

Where j denotes the jth carrier, k denotes the kth RB in the carrier j, i denotes the i th terminal, N _j denotes the number of RBs in the carrier j, and a _{i, j} =1 denotes the i th terminal Accessing the jth carrier, otherwise a _i,j =0; b _i,j,k =1, indicating that the kth RB on the jth carrier is allocated to the i th terminal, otherwise b _{i,j, k} =0, r _i,j,k represents the transmission rate obtained by the ith terminal on the kth RB of the jth carrier,

Representing the minimum bit rate required for the terminal i guaranteeing the bit rate service, U _GBR represents the set of all guaranteed bit rate service terminals.

Guaranteed bit rate services Due to the high bit rate requirements, it is necessary to allocate enough RBs to ensure normal operation of the service. Therefore, under the premise of satisfying the minimum bit rate requirement of the guaranteed bit rate service, the system preferentially allocates the RBs in the carrier for the terminal of the guaranteed bit rate service, which can ensure the normal operation of the service and minimize the RB waste.

S203: In the remaining RBs of the multiple carriers, the RB used for transmitting the data is allocated to the used carrier by the terminal whose service type is the non-guaranteed bit rate service.

After the RBs in the carrier are allocated to the terminal that guarantees the bit rate service, there are remaining RBs, and the system allocates the RBs to the terminals that do not guarantee the bit rate service. The specific allocation method is as follows:

S2031: Generate a utility value of the terminal for each non-guaranteed bit rate service with respect to the RB, wherein the utility value is determined according to a current transmission bit rate, a historical average transmission bit rate, and a delay factor of the terminal that does not guarantee the bit rate service.

When allocating the remaining RBs, the system needs to allocate in a certain order, otherwise it will easily cause confusion in distribution. Determining, according to the current transmission bit rate, the historical average transmission bit rate, and the delay factor of the terminal that does not guarantee the bit rate service, the utility value of the terminal for each non-guaranteed bit rate service relative to the RB, according to the utility value allocation of the terminal relative to the RB The remaining RBs are given to different terminals, which can avoid RB allocation confusion and improve the working efficiency of the terminal.

The utility value of the terminal that does not guarantee the bit rate service relative to the RB is:

Indicates the historical average transmission bit rate of terminal i; f(τ _i ) represents the delay factor of the i-th terminal.

The delay factor f(τ _i ) is determined according to different service types of the service that does not guarantee the bit rate, wherein the delay factor f(τ _i ) of the streaming media service is:

Where τ _i represents the time waiting for the first packet of the queue in the buffer queue of terminal i, and τ _max represents the maximum waiting time that the data packet can be allowed, and beyond this waiting time, the data packet will be discarded;

Due to the FTP service, when the channel condition is good, it is transmitted more. When the channel condition is poor, the transmission is less, and the delay requirement is very low. Therefore, the delay factor f(τ _i ) of the preset FTP service is 1.

S2032: The remaining RBs are sequentially allocated to the terminal that does not guarantee the bit rate service according to the order of the utility values from high to low.

In the process of allocating the remaining RBs, the RBs are first allocated to the terminals with high utility values, and the remaining RBs are allocated to the terminals with the second highest utility value, and so on, until all terminal allocations are completed. Where the allocation rule is expressed as:

The above formula indicates that for the kth RB on the jth carrier, calculate the utility value of all the terminals of the non-guaranteed bit rate service on the RB, select the user terminal i ^* with the largest utility value, and assign the RB to the terminal i. ^* . Where j denotes the jth carrier, k denotes the kth RB in carrier j, i denotes the ith terminal, a _i,j =1 means that terminal i can use carrier j, otherwise a _i,j =0;u _{i, j, k} represents the utility value brought by the terminal i allocated by the kth RB on the jth carrier, and U _nonGBR represents the set of terminals of all the _services that do not guarantee the bit rate.

The second embodiment of the present application divides the service type of the terminal into a guaranteed bit rate service and a non-guaranteed bit rate service, and preferentially schedules the RB in the carrier to the terminal of the guaranteed bit rate service according to different service types, and then Scheduling the remaining RBs to the terminal of the non-guaranteed bit rate service, thereby ensuring Quality of service for different business types.

The present application further discloses a third embodiment of a resource scheduling method. Preferably, on the basis of the second embodiment, the terminal that allocates the RB after the service type is not guaranteed to guarantee the bit rate service, so as to improve The use of RB is as follows:

S301: Determine whether the total RB allocation of each terminal that does not guarantee the bit rate service exceeds the total amount of the terminal sending buffer.

When the system allocates RBs for the terminal that does not guarantee the bit rate service, it is inevitable that the total RB allocation exceeds the total amount of the terminal transmission buffer, and the excess RB is in an idle state, resulting in waste of resources. Therefore, it is necessary to check whether the total amount of RB allocation of each terminal that does not guarantee the bit rate service exceeds the total amount of the terminal transmission buffer, thereby determining which are the terminals that the RB exceeds and which are the terminals that the RB does not exceed.

S302: In the terminal that allocates the total amount of RBs beyond the non-guaranteed bit rate service of the total amount of the terminal transmission buffer, the RBs that exceed the total amount of the transmission buffer of the terminal are allocated to the unguaranteed bit rate service whose total amount of RB allocation does not exceed the total amount of the terminal transmission buffer. Terminal, the specific allocation method is:

S3021: The terminal that does not guarantee the bit rate service whose total RB allocation exceeds the total amount of the terminal transmission buffer is classified into the cache terminal set.

S3022: The terminal that does not guarantee the bit rate service whose total RB allocation does not exceed the total amount of the terminal transmission buffer is classified as not exceeding the cache terminal set.

S3023: Select one of the excess terminals in the cached terminal set as the allocation terminal.

S3024: Acquire a utility value of the allocation terminal relative to the RB and a utility value of each terminal in the set of the buffered terminal relative to the RB.

S3025: Generate a difference between the utility value of the allocation terminal relative to the RB and the utility value of each terminal in the set of the buffered terminal relative to the RB, wherein the difference represents the utility loss.

S3026: The RB exceeding the allocated terminal of the terminal allocation in the set of the cached terminal is minimized for the utility loss.

The third embodiment of the present application determines whether the RB exceeds the terminal and the RB does not exceed the terminal by checking whether the total RB allocation of the terminal of each non-guaranteed bit rate service exceeds the total amount of the terminal transmission buffer. Reassigning RBs that are exceeded in the terminal to the terminal that has not exceeded the terminal, improving the load The utilization rate of RB in the wave.

The present application further discloses a fourth embodiment of a resource scheduling method. After the RB allocation is completed, all the terminals that do not guarantee the bit rate service are checked to check whether all terminals are satisfied: whether the transmission rate of the allocated RB exceeds the terminal. The total number of packets in the send buffer, expressed as:

Where j denotes the jth carrier, k denotes the kth RB in carrier j, i denotes the ith terminal, N _j denotes the number of RBs in carrier j, a _i,j denotes =1 means that terminal i can be used Carrier j, otherwise a _i,j =0, b _i,j,k denotes =1 indicating that the kth RB on the jth carrier is allocated to terminal i, otherwise b _i,j,k =0,r _{i,j k} represents the transmission rate obtained by the kth RB on the jth carrier allocated to the terminal i, L _i represents the total number of data packets in the terminal transmission buffer, and U _nonGBR represents the set of all terminals which do not guarantee the bit rate service.

If L _i is exceeded, the user terminal is classified as a collection

Otherwise classified as a collection

for

Terminal i, selects part of RBs among all RBs assigned to i to be reassigned to

User terminal in the terminal, so that terminal i satisfies the inequality

In style

When allocated the j-th k-th carrier in the RB, the terminal can utility value i ₀ of the RB up to u _{i, j, k,} if assigned to the

For other terminals i _{0 in the set} , the utility value u _{i,j,k of} the RB will be reduced, and the utility value loss in defining the redistribution process is as follows:

Where u _i,j,k represents the utility value of the allocation terminal i on the carrier j for the kth RB,

Representing the utility value of terminal i ₀ on the carrier j for the kth RB,

Indicates a loss of utility value.

For collection

All terminals i ₀ in the terminal, select the terminal that minimizes the loss of the utility value of the kth RB on the jth carrier

Expressed as:

The RB allocation principle is the same for different carriers in the system. Taking the j ^* th carrier as an example, selecting the k ^* th RB on the j ^* th carrier is allocated to the user terminal.

Minimizing the utility value loss of the RB, expressed as:

among them,

Representing the selected k ^* th RB allocated to the j ^* th carrier beyond the buffer terminal to be allocated to the cache terminal not exceeded

Indicates that the kth RB on the jth carrier is allocated to

The minimum value of the system utility function loss of terminal i ₀ in

Representing the selection (i ₀ , j, k) minimizes system utility losses.

Among them, the entire RB allocation process can be expressed in the form of pseudo code, the pseudo code is as follows:

The embodiment of the present application further discloses a resource scheduling apparatus. Referring to FIG. 3, FIG. 3 is a schematic diagram of a first structure of a resource scheduling apparatus according to an embodiment of the present application, which corresponds to the process shown in FIG.

The first determining module 401 is configured to determine a priority of using multiple carriers in the network to access multiple terminals of the network, where multiple terminals are single-carrier terminals that access the network, and the priority is used according to signal conditions of the terminal on the carrier. , carrier load size, carrier bandwidth determination;

The selecting module 402 is configured to use, for each terminal, the carrier with the highest priority as the used carrier;

The first allocation module 403 is configured to allocate, by using a plurality of terminals, the RBs used for transmitting data on the used carrier.

The first determining module 401 is further configured to: determine, according to the following formula, a priority of using multiple carriers in the network to access multiple terminals of the network:

Indicates the total amount of buffered packets of the terminal of the same service type on carrier j, and p _j represents the priority of carrier j for the terminal.

The first allocation module 403 further includes:

a determining submodule 4031, configured to determine a service type of the multiple terminals, where the service type includes a guaranteed bit rate service and a non-guaranteed bit rate service;

a first allocation sub-module 4032, configured to allocate, by using a carrier whose service type is a guaranteed bit rate service, an RB used for transmitting data on a used carrier, so that a terminal whose service type is a guaranteed bit rate service satisfies a minimum bit rate requirement;

The second allocation sub-module 4033 is configured to allocate, in the RBs of the plurality of carriers, RBs used for transmitting data on the used carrier by the terminal whose service type is not guaranteed to be the bit rate service.

The second distribution submodule 4033 includes:

a generating unit 40331, configured to generate a utility value of the terminal for each non-guaranteed bit rate service with respect to the RB, where the utility value is determined according to a current transmission bit rate, a historical average transmission bit rate, and a delay factor of the terminal that does not guarantee the bit rate service;

The allocating unit 40332 is configured to sequentially allocate the remaining RBs to the terminal that does not guarantee the bit rate service according to the order of the utility values from high to low.

The generating unit 40331 is further configured to generate, according to the following formula, a utility value of the terminal for each non-guaranteed bit rate service with respect to the RB:

The resource scheduling apparatus provided in this embodiment is used to implement the scheduling of the resource scheduling method provided by the embodiment of the present application, and the implementation principle and the technical effect are similar, and details are not described herein again.

The embodiment of the present application further discloses a resource scheduling apparatus. As shown in FIG. 4, FIG. 4 is a schematic diagram of a second structure of a resource scheduling apparatus according to an embodiment of the present application. include:

a second determining module 404, configured to determine whether a total RB allocation of each terminal that does not guarantee the bit rate service exceeds a total amount of the terminal sending buffer;

The second allocation module 405 is configured to allocate, in the terminal of the non-guaranteed bit rate service, where the total amount of RB allocation exceeds the total amount of the terminal transmission buffer, the total number of RBs allocated to the RB allocation exceeding the total amount of the terminal transmission buffer does not exceed the total amount of the terminal transmission buffer. The terminal does not guarantee the bit rate service.

The second distribution module 405 further includes:

The first dividing sub-module 4051 is configured to classify the terminal of the unguaranteed bit rate service whose total RB allocation exceeds the total amount of the terminal sending buffer into the cache terminal set;

The second dividing sub-module 4052 is configured to classify the terminal of the unguaranteed bit rate service whose total RB allocation does not exceed the total amount of the terminal sending buffer into the set of not exceeding the buffer terminal;

The selecting sub-module 4053 is configured to sequentially select one of the excess terminals in the set of cached terminals as the allocation terminal;

The obtaining sub-module 4054 is configured to obtain a utility value of the allocation terminal relative to the RB and a utility value of each terminal in the set of the buffered terminal relative to the RB;

a generating sub-module 4055, configured to generate a difference between a utility value of the allocation terminal relative to the RB and a utility value of each terminal in the set of the buffered terminal relative to the RB, where the difference is a utility loss;

The third allocation sub-module 4056 is configured to allocate, for the terminal in the set of the cached terminals that has the smallest utility loss, the RBs that are allocated by the terminal.

The resource scheduling apparatus of the foregoing embodiment of the present application determines whether the RB exceeds the terminal and the RB does not exceed the terminal by checking whether the total RB allocation of the terminal of each non-guaranteed bit rate service exceeds the total amount of the terminal transmission buffer. The RB that exceeds the excess in the terminal is reassigned to the terminal that is not exceeded, and the utilization of the RB in the carrier is improved.

A specific embodiment of the control device provided by the embodiment of the present application includes:

a processor, a memory, a communication interface, and a bus;

The memory stores executable program code;

The processor runs a program corresponding to the executable program code by reading executable program code stored in the memory for execution:

For the specific process, refer to the description of the first embodiment, and the description is not repeated here.

It can be seen from the above that, in the solution provided by the embodiment of the control device of the present application, the processor determines the use priority of the carrier for the terminal by reading the executable program code stored in the memory, thereby assigning according to the use priority. The carrier is provided to the terminal to ensure that the terminal runs the service under the optimal channel condition, thereby ensuring the service quality.

The embodiment of the present application further provides an application program, which is used to execute the resource scheduling method of the first embodiment or the second embodiment of the present application at runtime, and the specific process is referred to the first embodiment of the method or The description of the second embodiment will not be repeated here.

It can be seen from the above that, in the solution provided by the application embodiment of the present application, the control device determines the use priority of the carrier for the terminal by executing the application, so that the carrier is allocated to the terminal according to the use priority, and the terminal can be guaranteed to be in the optimal channel. Run the business under conditions to ensure the quality of the business.

A specific embodiment of the storage medium provided by the embodiment of the present application is configured to store executable code, where the executable code is used to execute the resource scheduling method according to the embodiment of the present application. Or the description of the second embodiment, the description will not be repeated here.

In the solution provided by the embodiment of the storage medium of the present application, the control device determines the priority of use of the carrier for the terminal by executing the executable code stored in the storage medium, thereby The priority is assigned to the terminal to ensure that the terminal runs the service under the optimal channel conditions, thereby ensuring service quality.

For the system, the control device, the application program and the storage medium embodiment, since it is basically similar to the method embodiment, the description is relatively simple, and the relevant parts can be referred to the description of the method embodiment.

It should be noted that, in this context, relational terms such as first and second are used merely to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply such entities or operations. There is any such actual relationship or order between them. Furthermore, the term "comprises" or "comprises" or "comprises" or any other variations thereof is intended to encompass a non-exclusive inclusion, such that a process, method, article, or device that comprises a plurality of elements includes not only those elements but also Other elements, or elements that are inherent to such a process, method, item, or device. An element that is defined by the phrase "comprising a ..." does not exclude the presence of additional equivalent elements in the process, method, item, or device that comprises the element.

A person skilled in the art can understand that all or part of the steps in implementing the above method embodiments can be completed by a program to instruct related hardware, and the program can be stored in a computer readable storage medium, as referred to herein as storage. Media, such as: ROM / RAM, disk, CD, etc.

The above is only the preferred embodiment of the present application, and is not intended to limit the present application. Any modifications, equivalent substitutions, improvements, etc., which are made within the spirit and principles of the present application, should be included in the present application. Within the scope of protection.

Claims

A resource scheduling method, the method comprising:

Determining a priority of use of a plurality of carriers in the network for accessing a plurality of terminals of the network, the plurality of terminals being single-carrier terminals accessing the network, the use priority being according to signal conditions and carriers of the terminal on the carrier Load size, carrier bandwidth determination;

For each terminal, the carrier with the highest priority will be used as the carrier used;

A resource block RB used for transmitting data is allocated to the used carriers of the plurality of terminals.
The method according to claim 1, wherein the allocating the RBs used by the plurality of terminals to transmit data on the used carrier comprises:

Determining a service type of the multiple terminals, where the service type includes a guaranteed bit rate service and a non-guaranteed bit rate service;

For the terminal whose service type is the guaranteed bit rate service, the RB used for transmitting the data is allocated on the used carrier, so that the terminal whose service type is the guaranteed bit rate service satisfies the minimum bit rate requirement;

Among the remaining RBs of the plurality of carriers, the RBs used for transmitting the data are allocated on the used carrier for the terminal whose service type is the non-guaranteed bit rate service.
The method according to claim 2, wherein, in the remaining RBs of the plurality of carriers, the RB used for transmitting data is allocated to the used carrier by the terminal whose service type is not guaranteed bit rate service, include:

Generating a utility value of the terminal of each of the non-guaranteed bit rate services with respect to the RB, where the utility value is determined according to a current transmission bit rate, a historical average transmission bit rate, and a delay factor of the terminal of the non-guaranteed bit rate service;

The remaining RBs are sequentially allocated to the terminal of the non-guaranteed bit rate service in order of high to low utility values.
The method according to claim 3, wherein the generating a utility value of the terminal of each of the non-guaranteed bit rate services with respect to the RB comprises: generating each of the non-guaranteed bit rate services according to the following formula Utility value of the terminal relative to the RB:

Where i denotes the i-th terminal, j denotes the j-th carrier, k denotes the k-th RB, u i,j,k denotes the utility value when the k-th RB on the carrier j is allocated to the terminal i, r i , j, k represents the current transmission bit rate of the kth RB of the terminal i on the carrier j,
Indicates the historical average transmission bit rate of the terminal i; f(τ i ) represents the delay factor of the i-th terminal.
The method according to claim 2, wherein the method further comprises: after the terminal that is the service type of the non-guaranteed bit rate service allocates the RB used for transmitting the data on the used carrier, the method further includes:

Determining whether the total amount of RB allocation of each terminal that does not guarantee the bit rate service exceeds the total amount of the terminal transmission buffer;

In a terminal that allocates a total amount of RBs beyond the non-guaranteed bit rate service of the total amount of the terminal transmission buffer, the RB that exceeds the total amount of the terminal transmission buffer is allocated to the terminal that does not exceed the total amount of the terminal transmission buffer and does not guarantee the bit rate service. .
The method according to claim 5, wherein in the terminal that does not allocate the total amount of RBs to exceed the total amount of the transmission buffer of the terminal, the RB that exceeds the total amount of the transmission buffer of the terminal is allocated to the total amount of RB allocation. A terminal that does not exceed the total amount of the terminal's transmission buffer and does not guarantee the bit rate service, including:

The terminal that does not guarantee the bit rate service whose total RB allocation exceeds the total amount of the terminal transmission buffer is classified into the cache terminal set;

The terminal that does not guarantee the bit rate service whose total RB allocation does not exceed the total amount of the terminal transmission buffer is classified into the cache terminal set;

And sequentially selecting one of the excess cached terminal sets as the distribution terminal;

Obtaining a utility value of the allocation terminal relative to the RB and a utility value of each terminal in the set of not exceeding the cached terminal with respect to the RB;

Generating a difference between a utility value of the allocation terminal relative to the RB and a utility value of the terminal not exceeding the RB in the set of buffered terminals, the difference being a utility loss;

Allocating the RBs beyond which the allocation terminal exceeds the terminal in the set of cached terminals that has the least utility loss.
The method according to any one of claims 1 to 6, wherein the determining, by the plurality of carriers in the network, the priority of using the plurality of terminals of the access network comprises: determining, according to the following formula, multiple carriers in the network Priority of use of multiple terminals accessing the network:

Where j denotes the jth carrier, k denotes the kth RB in carrier j, i denotes the i th terminal, N j denotes the number of RBs in carrier j, B denotes the bandwidth of one RB in carrier j, Γ i, k represents the signal to interference and noise ratio of terminal i on RB k,
Indicates the total amount of buffered packets of the terminal of the same service type on the carrier j, and p j represents the priority of the use of the carrier j for the terminal.
A resource scheduling device, the device comprising:

a first determining module, configured to determine a usage priority of multiple carriers in the network to access multiple terminals of the network, where the multiple terminals are single carrier terminals that access the network, and the usage priority is based on the terminal Signal condition on the carrier, carrier load size, carrier bandwidth determination;

a selection module for using, for each terminal, the carrier with the highest priority as the used carrier;

And a first allocation module, configured to allocate, by using the plurality of terminals, the RB used for transmitting data on the used carrier.
The device according to claim 8, wherein the first allocating module further comprises:

Determining a submodule, configured to determine a service type of the multiple terminals, where the service type includes a guaranteed bit rate service and a non-guaranteed bit rate service;

a first allocation submodule, configured to allocate, by using a carrier whose carrier type is a bit rate service, a RB used for transmitting data on a used carrier, so that a terminal whose service type is a guaranteed bit rate service satisfies a minimum bit rate requirement;

And a second allocation submodule, configured to allocate, in the remaining RBs of the multiple carriers, RBs used for transmitting data on a used carrier by a terminal whose service type is a non-guaranteed bit rate service.
The device according to claim 9, wherein the resource scheduling device further comprises:

a second determining module, configured to determine whether a total RB allocation of each terminal that does not guarantee the bit rate service exceeds a total amount of the terminal sending buffer;

The second allocation module is configured to allocate, in the terminal that does not exceed the total amount of the RB, the non-guaranteed bit rate service of the terminal to send the buffer, and the RB that exceeds the total amount of the terminal to send the buffer to the RB allocation does not exceed the total amount of the terminal sending buffer. Terminals that do not guarantee bit rate services.
A control device, comprising: a processor, a memory, a communication interface, and a bus;

The processor, the memory, and the communication interface are connected by the bus and complete communication with each other;

The memory stores executable program code;

The processor executes a program corresponding to the executable program code by reading the executable program code stored in the memory for performing the resource scheduling method according to any one of claims 1-7.
An application, the application being operative to perform the resource scheduling method of any one of claims 1-7 at runtime.
A storage medium, characterized in that the storage medium is for storing executable code for performing the resource scheduling method according to any one of claims 1-7.