CN104066193A - Scheduling method and device - Google Patents
Scheduling method and device Download PDFInfo
- Publication number
- CN104066193A CN104066193A CN201410250311.3A CN201410250311A CN104066193A CN 104066193 A CN104066193 A CN 104066193A CN 201410250311 A CN201410250311 A CN 201410250311A CN 104066193 A CN104066193 A CN 104066193A
- Authority
- CN
- China
- Prior art keywords
- mrow
- msub
- bearer
- scheduling
- absolute
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 26
- 230000005540 biological transmission Effects 0.000 claims description 84
- 230000011664 signaling Effects 0.000 claims description 27
- 230000002776 aggregation Effects 0.000 claims description 9
- 238000004220 aggregation Methods 0.000 claims description 9
- 230000007246 mechanism Effects 0.000 abstract description 9
- 238000004590 computer program Methods 0.000 description 15
- 102100035409 Dehydrodolichyl diphosphate synthase complex subunit NUS1 Human genes 0.000 description 9
- 101100240466 Homo sapiens NUS1 gene Proteins 0.000 description 9
- 238000010586 diagram Methods 0.000 description 9
- 230000006870 function Effects 0.000 description 8
- 238000012986 modification Methods 0.000 description 5
- 230000004048 modification Effects 0.000 description 5
- 238000004458 analytical method Methods 0.000 description 3
- 230000006855 networking Effects 0.000 description 3
- 238000003860 storage Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 239000002356 single layer Substances 0.000 description 2
- 230000004075 alteration Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 230000007774 longterm Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000008447 perception Effects 0.000 description 1
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a scheduling method and device. The method comprises the steps that an absolute scheduling priority of each load is determined; a relative scheduling priority of each load is determined according to at least one service quality parameter; resource scheduling is conducted on the loads according to the descending order of the absolute scheduling priorities and when the absolute scheduling priorities of at least two loads are identical, resource scheduling is conducted on the load with the higher relative scheduling priority. According to the technical scheme, a reasonable scheduling priority mechanism is achieved so that a series of problems caused by the unreasonable scheduling priorities can be avoided.
Description
Technical Field
The present invention relates to the field of wireless communications technologies, and in particular, to a scheduling method and apparatus.
Background
In a Long Term Evolution (LTE) system, wired connection modes are adopted between base stations and between a base station and a core network, which brings great deployment difficulty and high network deployment cost to operators. To solve the above problems, the third generation partnership project (3GPP) introduced a radio Relay technology (Relay) in the evolved LTE (LTE-a). And three types of Relay are defined in version R10, with the most widely studied being Type1 Type of Relay. The Relay referred to hereinafter are all types of Relay of Type 1. The Relay adopts the same frequency resources at the Un interface and the Uu interface, and two links adopt a time division working mode to avoid interference between the Uu interface and the Un interface. Meanwhile, a Time Division Duplex (TDD)/Frequency Division Duplex (FDD) -supported Un subframe configuration mode is given in LTE-a, and the number of Un subframes is usually smaller in the subframe configuration mode compared with the conventional subframe configuration of a Uu interface. And the Macro (Macro) station on the Un subframe not only needs to schedule Relay belonging to the Macro station, but also needs to schedule User Equipment (UE) belonging to Macro, so limited wireless resources can be contended between Relay and UE belonging to Macro on the Un subframe, if no reasonable scheduling priority mechanism exists, data buffered in Relay can be transitionally stacked or frequently scheduled to be empty, and the transitive stacking and scheduling empty can affect performance indexes such as throughput and the like of UE belonging to Relay to different degrees, thereby affecting User perception.
Disclosure of Invention
The invention aims to provide a scheduling method and a scheduling device so as to realize a reasonable scheduling priority mechanism.
The purpose of the invention is realized by the following technical scheme:
a method of scheduling, comprising:
determining absolute scheduling priority of each bearer, wherein the absolute scheduling priority of the bearer for transmitting signaling is higher than the absolute scheduling priority of the bearer for transmitting service, and the absolute scheduling priority of the bearers for different transmitting services is determined according to the service quality class identifier of the bearer;
determining the relative scheduling priority of each bearer according to at least one service quality parameter;
and performing resource scheduling for each bearer in a descending order according to the absolute scheduling priority, and when the absolute scheduling priorities of at least two bearers are the same, preferentially performing resource scheduling for the bearer with high relative scheduling priority.
According to the technical scheme provided by the embodiment of the invention, the scheduling priority is composed of an absolute scheduling priority and a relative scheduling priority. And during scheduling, scheduling according to the descending order of the absolute scheduling priority, wherein the absolute scheduling priority of the bearer for transmitting the signaling is higher than the absolute scheduling priority of the bearer for transmitting the service, the absolute scheduling priorities of the bearers for different transmission services are determined according to the loaded QCI, and the QCI can comprehensively express the service quality index and is suitable for rate-guaranteed bearer and non-rate-guaranteed bearer. When the absolute scheduling priorities are the same, the bearers with the relative scheduling priorities are scheduled preferentially, the relative scheduling priorities are determined according to at least one service quality parameter, and the service quality parameters for determining the relative scheduling priorities can be selected as required. Therefore, the technical scheme provided by the embodiment of the invention realizes a reasonable scheduling priority mechanism, thereby avoiding a series of problems caused by unreasonable scheduling priority.
Preferably, the relative scheduling priority of each bearer is determined according to at least one of the following quality of service parameters:
the parameter of scheduling fairness, the parameter of bearing time delay and the parameter of bearing transmission rate are embodied.
Preferably, determining the relative scheduling priority of each bearer according to the parameter representing scheduling fairness, the parameter representing bearer delay, and the parameter representing bearer transmission rate includes:
determining the relative scheduling priority of each bearer according to the following formula:
wherein, PR(in)(t) represents the relative scheduling priority of the nth bearer of terminal i in the current scheduling period,a parameter that embodies the fairness of scheduling is represented,weights, R, representing parameters embodying scheduling fairnessin(t) represents an applied transmission rate of the bearer in the current scheduling period determined according to the channel quality information of the modified bearer,indicating the average transmission rate of the bearer during the current scheduling period,a parameter representing the delay of the bearer is indicated,weights representing parameters embodying the bearer delay, Din(T) represents the packet latency, T, of the bearer to the current scheduling periodin(t)Representing the maximum transmission delay of the bearer under the quality of service requirement,representing a parameter that characterizes the rate of transmission of the bearer,weight, V, representing a parameter representing the transmission rate of the bearerinAnd (t) denotes a contracted rate of the bearer.
Based on any of the above method embodiments, preferably, after performing resource scheduling for each bearer according to the absolute scheduling priority and the relative scheduling priority, if there are remaining resources, the method further includes:
according to the absolute scheduling priority and the relative scheduling priority, descending the order to ensure that the sum of the rates of the non-guaranteed rate bearing is not more than the non-guaranteed rate bearing scheduling residual resources of the terminal with the maximum bit rate of the user aggregation;
and when the sum of the rates of the non-guaranteed rate bearers of all the terminals meets the maximum bit rate aggregated by the user, remaining resources still exist, and the remaining resources are dispatched for the guaranteed rate bearers according to the descending order of the absolute dispatching priority and the relative dispatching priority.
Based on the same inventive concept as the method, an embodiment of the present invention further provides a scheduling apparatus, including:
an absolute scheduling priority determining module, configured to determine an absolute scheduling priority of each bearer, where the absolute scheduling priority of the bearer for transmitting the signaling is higher than the absolute scheduling priority of the bearer for transmitting the service, and the absolute scheduling priorities of the bearers for different transmission services are determined according to the service quality class identifier of the bearer;
a relative scheduling priority determining module, configured to determine a relative scheduling priority of each bearer according to at least one qos parameter;
and the scheduling module is used for performing resource scheduling on each bearer according to the descending order of the absolute scheduling priority, and preferentially performing resource scheduling on the bearer with the high relative scheduling priority when the absolute scheduling priorities of at least two bearers are the same.
According to the technical scheme provided by the embodiment of the invention, the scheduling priority is composed of an absolute scheduling priority and a relative scheduling priority. And during scheduling, scheduling according to the descending order of the absolute scheduling priority, wherein the absolute scheduling priority of the bearer for transmitting the signaling is higher than the absolute scheduling priority of the bearer for transmitting the service, the absolute scheduling priorities of the bearers for different transmission services are determined according to the loaded QCI, and the QCI can comprehensively express the service quality index and is suitable for rate-guaranteed bearer and non-rate-guaranteed bearer. When the absolute scheduling priorities are the same, the bearers with the relative scheduling priorities are scheduled preferentially, the relative scheduling priorities are determined according to at least one service quality parameter, and the service quality parameters for determining the relative scheduling priorities can be selected as required. Therefore, the technical scheme provided by the embodiment of the invention realizes a reasonable scheduling priority mechanism, thereby avoiding a series of problems caused by unreasonable scheduling priority.
Preferably, the relative scheduling priority determining module is specifically configured to:
determining the relative scheduling priority of each bearer according to at least one of the following service quality parameters:
the parameter of scheduling fairness, the parameter of bearing time delay and the parameter of bearing transmission rate are embodied.
Preferably, the relative scheduling priority determining module is specifically configured to:
determining the relative scheduling priority of each bearer according to the following formula:
wherein, PR(in)(t) denotes the nth bearer of terminal iAt the relative scheduling priority of the current scheduling period,a parameter that embodies the fairness of scheduling is represented,weights, R, representing parameters embodying scheduling fairnessin(t) represents an applied transmission rate of the bearer in the current scheduling period determined according to the channel quality information of the modified bearer,indicating the average transmission rate of the bearer during the current scheduling period,a parameter representing the delay of the bearer is indicated,weights representing parameters embodying the bearer delay, Din(T) represents the packet latency, T, of the bearer to the current scheduling periodin(t) represents the maximum transmission delay of the bearer under the quality of service requirement,representing a parameter that characterizes the rate of transmission of the bearer,weight, V, representing a parameter representing the transmission rate of the bearerinAnd (t) denotes a contracted rate of the bearer.
Preferably, after performing resource scheduling for each bearer according to the absolute scheduling priority and the relative scheduling priority, if there are remaining resources, the scheduling module is further configured to:
according to the absolute scheduling priority and the relative scheduling priority, descending the order to ensure that the sum of the rates of the non-guaranteed rate bearing is not more than the non-guaranteed rate bearing scheduling residual resources of the terminal with the maximum bit rate of the user aggregation;
and when the sum of the rates of the non-guaranteed rate bearers of all the terminals meets the maximum bit rate aggregated by the user, remaining resources still exist, and the remaining resources are dispatched for the guaranteed rate bearers according to the descending order of the absolute dispatching priority and the relative dispatching priority.
Based on the same inventive concept as the method, an embodiment of the present invention further provides a scheduling apparatus, where the scheduling apparatus at least includes:
a processor configured to execute a computer program having the following functions: determining absolute scheduling priority of each bearer, wherein the absolute scheduling priority of the bearer for transmitting signaling is higher than the absolute scheduling priority of the bearer for transmitting service, and the absolute scheduling priority of the bearers for different transmitting services is determined according to the service quality class identifier of the bearer; determining the relative scheduling priority of each bearer according to at least one service quality parameter; performing resource scheduling for each bearer in descending order according to the absolute scheduling priority, and when the absolute scheduling priorities of at least two bearers are the same, preferentially performing resource scheduling for the bearer with high relative scheduling priority;
a memory configured to hold code of the computer program.
According to the technical scheme provided by the embodiment of the invention, the scheduling priority is composed of an absolute scheduling priority and a relative scheduling priority. And during scheduling, scheduling according to the descending order of the absolute scheduling priority, wherein the absolute scheduling priority of the bearer for transmitting the signaling is higher than the absolute scheduling priority of the bearer for transmitting the service, the absolute scheduling priorities of the bearers for different transmission services are determined according to the loaded QCI, and the QCI can comprehensively express the service quality index and is suitable for rate-guaranteed bearer and non-rate-guaranteed bearer. When the absolute scheduling priorities are the same, the bearers with the relative scheduling priorities are scheduled preferentially, the relative scheduling priorities are determined according to at least one service quality parameter, and the service quality parameters for determining the relative scheduling priorities can be selected as required. Therefore, the technical scheme provided by the embodiment of the invention realizes a reasonable scheduling priority mechanism, thereby avoiding a series of problems caused by unreasonable scheduling priority.
Preferably, the relative scheduling priority of each bearer is determined according to at least one of the following quality of service parameters:
the parameter of scheduling fairness, the parameter of bearing time delay and the parameter of bearing transmission rate are embodied.
Preferably, the relative scheduling priority of each bearer is determined according to the following formula:
wherein, PR(in)(t) represents the relative scheduling priority of the nth bearer of user equipment i in the current scheduling period,a parameter that embodies the fairness of scheduling is represented,weights, R, representing parameters embodying scheduling fairnessin(t) represents an applied transmission rate of the bearer in the current scheduling period determined according to the channel quality information of the modified bearer,indicating the average transmission rate of the bearer during the current scheduling period,a parameter representing the delay of the bearer is indicated,weights representing parameters embodying the bearer delay, Din(t) denotes bearer to current schedulingPeriodic packet latency, Tin(t) represents the maximum transmission delay of the bearer under the quality of service requirement,representing a parameter that characterizes the rate of transmission of the bearer,weight, V, representing a parameter representing the transmission rate of the bearerinAnd (t) denotes a contracted rate of the bearer.
Preferably, after scheduling resources for each bearer according to the absolute scheduling priority and the relative scheduling priority, if there are remaining resources, the processor is further configured to execute a computer program having the following functions: according to the absolute scheduling priority and the relative scheduling priority, descending the order to ensure that the sum of the rates of the non-guaranteed rate bearing is not more than the non-guaranteed rate bearing scheduling residual resources of the terminal with the maximum bit rate of the user aggregation; and when the sum of the rates of the non-guaranteed rate bearers of all the terminals meets the maximum bit rate aggregated by the user, remaining resources still exist, and the remaining resources are dispatched for the guaranteed rate bearers according to the descending order of the absolute dispatching priority and the relative dispatching priority. The memory is also configured to hold the code of the computer program described above.
Drawings
FIG. 1 is a flow chart of a method provided by an embodiment of the present invention;
FIG. 2 is a schematic diagram of an apparatus according to an embodiment of the present invention;
fig. 3 is a schematic view of another apparatus according to an embodiment of the present invention.
Detailed Description
The technical solutions provided by the embodiments of the present invention will be described in detail below with reference to the accompanying drawings.
The scheduling method provided by the embodiment of the invention is shown in fig. 1, and specifically includes the following operations:
and step 100, determining the absolute scheduling priority of each bearer.
The absolute scheduling priority of the bearer for transmitting signaling is higher than the absolute scheduling priority of the bearer for transmitting service, and the absolute scheduling priorities of the bearers for different transmission services are determined according to quality of service Class identifiers (QCIs) of the bearers.
In the embodiment of the present invention, the QCI of the bearer is the QCI of the service transmitted in the bearer.
If there is retransmission signaling or service, the absolute scheduling priority of the retransmission bearer may be higher than the absolute scheduling priority of the signaling-transmitting bearer, or may be lower than the absolute scheduling priority of the signaling-transmitting bearer but higher than the absolute scheduling priority of the service-transmitting bearer, which is not limited in the present invention.
Step 110, determining the relative scheduling priority of each bearer according to at least one service quality parameter.
The qos parameter for determining the relative scheduling priority of the bearer may be selected according to actual needs, which is not limited in the present invention.
And 120, performing resource scheduling on each bearer in a descending order according to the absolute scheduling priority, and preferentially performing resource scheduling on the bearer with the high relative scheduling priority when the absolute scheduling priorities of at least two bearers are the same.
According to the technical scheme provided by the embodiment of the invention, the scheduling priority is composed of an absolute scheduling priority and a relative scheduling priority. And during scheduling, scheduling according to the descending order of the absolute scheduling priority, wherein the absolute scheduling priority of the bearer for transmitting the signaling is higher than the absolute scheduling priority of the bearer for transmitting the service, the absolute scheduling priorities of the bearers for different transmitting services are determined according to the QCI of the bearer, and the QCI can comprehensively represent quality of service (QoS) indexes and is suitable for guaranteed Rate (GBR) bearer and non-guaranteed Rate (NGBR) bearer. When the absolute scheduling priorities are the same, the bearers with the relative scheduling priorities are scheduled preferentially, the relative scheduling priorities are determined according to at least one service quality parameter, and the service quality parameters for determining the relative scheduling priorities can be selected as required. Therefore, the technical scheme provided by the embodiment of the invention realizes a reasonable scheduling priority mechanism, thereby avoiding a series of problems caused by unreasonable scheduling priority.
Preferably, the relative scheduling priority of each bearer may be determined according to at least one of the following quality of service parameters:
the parameter of scheduling fairness, the parameter of bearing time delay and the parameter of bearing transmission rate are embodied.
When determining the relative scheduling priority of each bearer according to all three service quality parameters, the QoS index can be considered comprehensively, and meanwhile, the transmission rate, the time delay and the scheduling fairness are considered.
The scheduling fairness of the service is considered when the relative scheduling priority is determined, and the condition that the load with poor channel condition and low throughput can obtain the transmission opportunity is ensured under the current channel quality and the average transmission rate. Correspondingly, the parameter representing the scheduling fairness can be determined by the application transmission rate and the average transmission rate determined by the carried corrected channel quality information.
The time delay of the bearer is considered when the relative scheduling priority is determined, which is reflected in that the bearer close to the time delay limit is preferentially scheduled, and packet loss caused by overlong buffer time is avoided. Accordingly, the parameter representing the bearer delay may be determined by the packet latency from the bearer to the current time and the allowed maximum transmission delay.
The transmission rate of the bearer is considered when determining the relative scheduling priority, and for the GBR bearer, on the premise of ensuring the GBR, the transmission rate can not be considered to be increased; for NGBR bearer, the difference is reflected under the condition of satisfying the minimum Rate of the application, and the influence of the User aggregation Maximum Bit Rate (UE-AMBR) needs to be considered. Accordingly, the parameter representing the bearer transmission rate may be determined by the subscription rate and the average transmission rate.
The technical scheme provided by the embodiment of the invention can determine the absolute scheduling priority and the relative scheduling priority in each scheduling period, and further carry out resource scheduling according to the determined absolute scheduling priority and the determined relative scheduling priority. Or determining the absolute scheduling priority and the relative scheduling priority when the set triggering condition is met, and scheduling the resources according to the absolute scheduling priority and the relative scheduling priority determined at the last time in each scheduling period.
The length of the scheduling period may be one subframe, may also be multiple subframes, and may also be configured with other durations.
Taking the determination of the absolute scheduling priority and the relative scheduling priority in each scheduling period as an example, assuming that the relative scheduling priority of each bearer is determined according to all the three quality of service parameters, the relative scheduling priority of the nth bearer of the terminal i may be specifically determined according to the following formula:
wherein, PR(in)(t) represents the relative scheduling priority of the nth bearer of the terminal i in the current scheduling period.
A parameter that embodies the fairness of scheduling is represented,representing parameters embodying scheduling fairnessThe weight of (c).
Rin(t) represents the application transmission rate of the bearer in the current scheduling period determined according to the modified Channel Quality Information (CQI) of the nth bearer of the terminal i; specifically, a CQI value is adjusted up or down according to CQI information (e.g., wideband CQI) reported by the terminal i, and the application transmission rate of the current scheduling period is estimated by using a backoff method for the modified CQI value. The value of the back-off value can be configured, and the application rate carried in the current scheduling period is an instantaneous rate and is not the maximum rate which can be transmitted in the current scheduling period.
Representing the average transmission rate of the nth bearer of the terminal i in the current scheduling period; specifically, the calculation can be obtained by the following formula:
wherein R isin(t-1) denotes the nth receiver of terminal iAverage Rate, DRC, carried over the previous scheduling periodin(T) represents the actual transmission rate of the nth bearer of terminal i in the current scheduling period, TcIs a weight parameter whose value is related to the longest non-service time that the terminal can bear, TcThe larger the value, the longer the out-of-service time that the terminal can endure, generally T is takencIs 256.
A parameter representing the delay of the bearer is indicated,representing the weight of the parameter embodying the bearer delay.
Din(t) represents the packet waiting delay from the nth bearer of the terminal i to the current scheduling period.
Tin(t) represents the maximum transmission delay allowed for the nth bearer of terminal i under QCI or QoS requirements.
Representing a parameter that characterizes the rate of transmission of the bearer,representing the weight of the parameter embodying the bearer transmission rate.
Vin(t) denotes a subscription rate (MinBR) of the nth bearer of the terminal i. For GBR bearers, Vin(t) is the GBR rate value; for NGBR bearers, VinAnd (t) the minimum BR value applied by the terminal, wherein the sum of the transmission rates borne by the NGBRs of all the terminals is not more than the Rate limit of the user aggregation Maximum Bit Rate (UE-AMBR), and the current buffer data volume is considered.
Wherein,andhas a value range of (0, 1)]，Has a value range of [0, 1 ]]. For the NGBR service, it is possible to,is 0. In the practical application process, the specific requirements of different services of different terminals can be combined with the channel quality adjustmentAndthe influence adjustment of each factor is more flexible.
Based on the above arbitrary method embodiment, after performing resource scheduling for each bearer according to the absolute scheduling priority and the relative scheduling priority (that is, after the MinBR requirement of the terminal is satisfied), if there are remaining resources, the sum of the rates of the NGBR bearers is not greater than the NGBR bearer scheduling remaining resources of the terminal of the UE-AMBR according to the descending order of the absolute scheduling priority and the relative scheduling priority; and when the sum of the rates of the NGBR load bearing of all the terminals meets the UE-AMBR, remaining resources still exist, and the remaining resources are scheduled for the GBR load bearing according to the descending order of the absolute scheduling priority and the relative scheduling priority.
The technical scheme provided by the embodiment of the invention is particularly suitable for Relay/Macro hierarchical network scenes. It should be noted that the technical solution provided by the embodiment of the present invention is also applicable to a hierarchical network scenario in which a macro station and other types of micro stations are networked. Aiming at different service requirements, the technical scheme provided by the embodiment of the invention can also be applied to a single-layer network networking scene.
In the context of a Raley/Macro hierarchical network, the priority processing of Un interface scheduling is taken as an example, and is introduced from uplink scheduling and downlink scheduling respectively.
In the uplink direction, the UE belonging to the Macro station transmits data to the Macro station, and the Relay belonging to the Macro station transmits uplink data to the Macro station.
And the Macro station respectively determines the absolute scheduling priority and the relative scheduling priority of each bearer of each terminal. For the Macro station, the terminals are a UE belonging to the Macro station and a Relay belonging to the Macro station.
The terminal i has a bearer for transmitting signaling, a bearer for retransmission, and a bearer for transmitting service. The absolute scheduling priority of the retransmitted bearer is higher than that of the signaling transmission bearer, and the absolute scheduling priority of the signaling transmission bearer is higher than that of the service transmission bearer. Absolute scheduling priority P of bearers of transmission traffic of terminal iA(in)The determination may be made based on QCI parameters for each service described in the 23.203 protocol. The specific manner of determining the absolute scheduling priority is not unique, and the absolute scheduling priority determined in the embodiment of the present invention is shown in table 1.
Table 1: uplink absolute scheduling priority ranking list
Wherein, the smaller the absolute scheduling priority index value is, the higher the absolute scheduling priority is.
Wherein, the relative scheduling priority P of the nth bearer of the terminal iR(in)(t) can be calculated by referring to the above formula. The uplink bearer (RB) refers to a Logical Channel Group (LCG). UE under Macro station and Relay, D thereof under Macro stationin(t) andhas the specific meaning ofThe differences are specifically shown in table 2.
Table 2: uplink parameter variance analysis
In the downlink direction, the Macro station transmits data to the UE belonging to the Macro station and transmits downlink data to the Relay belonging to the Macro station.
And the Macro station respectively determines the absolute scheduling priority and the relative scheduling priority of each bearer of each terminal. For the Macro station, the terminals are a UE belonging to the Macro station and a Relay belonging to the Macro station.
The terminal i has a bearer for transmitting signaling, a bearer for retransmission, and a bearer for transmitting service. The absolute scheduling priority of the retransmitted bearer is higher than that of the signaling transmission bearer, and the absolute scheduling priority of the signaling transmission bearer is higher than that of the service transmission bearer. Absolute scheduling priority P of bearers of transmission traffic of terminal iA(in)The determination may be made based on QCI parameters for each service described in the 26.203 protocol. The specific way of determining the absolute scheduling priority is not unique. The absolute scheduling priority determined by the embodiment of the present invention is shown in table 3.
TABLE 3 Down Absolute priority ranking Table
Wherein, the smaller the absolute scheduling priority index value is, the higher the absolute scheduling priority is.
Wherein, the relative scheduling priority P of the nth bearer of the terminal iR(in)(t) can be calculated by referring to the above formula. UE under Macro station and Relay, D thereof under Macro stationin(t) andthe specific meanings of (A) are different and are shown in Table 4.
TABLE 4 Downlink parameter Difference analysis
In the following, the Uu interface scheduling priority queuing is taken as an example in a Relay/Macro hierarchical network networking scenario or a single-layer network networking scenario, and is introduced from uplink scheduling and downlink scheduling respectively.
In the uplink direction, the UE belonging to the Macro station sends data to the Macro station, and the UE belonging to the Relay station sends uplink data to the Relay station.
And respectively determining the absolute scheduling priority and the relative scheduling priority of each bearer of each UE.
Wherein the UEiThere are bearers for transmitting signaling, bearers for retransmission, and bearers for transmitting traffic. The absolute scheduling priority of the retransmitted bearer is higher than that of the signaling transmission bearer, and the absolute scheduling priority of the signaling transmission bearer is higher than that of the service transmission bearer. UE (user Equipment)iAbsolute of the bearer of the transport trafficScheduling priority PA(in)The determination may be made based on QCI parameters for each service described in the 23.203 protocol. The specific manner of determining the absolute scheduling priority is not unique, and the absolute scheduling priority determined in the embodiment of the present invention is shown in table 1.
UEiRelative scheduling priority P of the nth bearerR(in)(t) can be calculated by referring to the above formula. The UE comprises UE belonging to Macro station and UE belonging to Relay station, and the uplink RB refers to LCG.
In the downlink direction, the Macro station sends data to the UE belonging to the Macro station, and the Relay station sends downlink data to the UE belonging to the Relay station.
And respectively determining the absolute scheduling priority and the relative scheduling priority of each bearer of each terminal.
Wherein the UEiThere are bearers for transmitting signaling, bearers for retransmission, and bearers for transmitting traffic. The absolute scheduling priority of the retransmitted bearer is higher than that of the signaling transmission bearer, and the absolute scheduling priority of the signaling transmission bearer is higher than that of the service transmission bearer. UE (user Equipment)iAbsolute scheduling priority P of bearers of a transport serviceA(in)The determination may be made based on QCI parameters for each service described in the 26.203 protocol. The specific way of determining the absolute scheduling priority is not unique. The absolute scheduling priority determined by the embodiment of the present invention is shown in table 3.
Wherein the UEiRelative scheduling priority P of the nth bearerR(in)(t) can be calculated by referring to the above formula. The UEs include a UE attributed to a Macro station and a UE attributed to a Relay station, whichThe specific meanings of (A) are different and are shown in Table 5.
TABLE 5 Downlink parameter Difference analysis
Based on the same inventive concept as the method, an embodiment of the present invention further provides a scheduling apparatus, as shown in fig. 2, the scheduling apparatus at least includes:
an absolute scheduling priority determining module 201, configured to determine an absolute scheduling priority of each bearer, where the absolute scheduling priority of the bearer for transmitting signaling is higher than the absolute scheduling priority of the bearer for transmitting a service, and the absolute scheduling priorities of the bearers for different services are determined according to the qos class identifiers of the bearers;
a relative scheduling priority determining module 202, configured to determine a relative scheduling priority of each bearer according to at least one quality of service parameter;
the scheduling module 203 is configured to perform resource scheduling for each bearer in a descending order according to the absolute scheduling priorities, and perform resource scheduling for a bearer with a higher relative scheduling priority when the absolute scheduling priorities of at least two bearers are the same.
According to the technical scheme provided by the embodiment of the invention, the scheduling priority is composed of an absolute scheduling priority and a relative scheduling priority. And during scheduling, scheduling according to the descending order of the absolute scheduling priority, wherein the absolute scheduling priority of the bearer for transmitting the signaling is higher than the absolute scheduling priority of the bearer for transmitting the service, the absolute scheduling priorities of the bearers for different transmission services are determined according to the loaded QCI, and the QCI can comprehensively express the service quality index and is suitable for rate-guaranteed bearer and non-rate-guaranteed bearer. When the absolute scheduling priorities are the same, the bearers with the relative scheduling priorities are scheduled preferentially, the relative scheduling priorities are determined according to at least one service quality parameter, and the service quality parameters for determining the relative scheduling priorities can be selected as required. Therefore, the technical scheme provided by the embodiment of the invention realizes a reasonable scheduling priority mechanism, thereby avoiding a series of problems caused by unreasonable scheduling priority.
Preferably, the relative scheduling priority determining module is specifically configured to:
determining the relative scheduling priority of each bearer according to at least one of the following service quality parameters:
the parameter of scheduling fairness, the parameter of bearing time delay and the parameter of bearing transmission rate are embodied.
Preferably, the relative scheduling priority determining module is specifically configured to:
determining the relative scheduling priority of each bearer according to the following formula:
wherein, PR(in)(t) represents the relative scheduling priority of the nth bearer of user equipment i in the current scheduling period,a parameter that embodies the fairness of scheduling is represented,weights, R, representing parameters embodying scheduling fairnessin(t) represents an applied transmission rate of the bearer in the current scheduling period determined according to the channel quality information of the modified bearer,indicating the average transmission rate of the bearer during the current scheduling period,a parameter representing the delay of the bearer is indicated,weights representing parameters embodying the bearer delay, Din(t) denotes bearerPacket latency to the current scheduling period, Tin(t) represents the maximum transmission delay of the bearer under the quality of service requirement,representing a parameter that characterizes the rate of transmission of the bearer,weight, V, representing a parameter representing the transmission rate of the bearerinAnd (t) denotes a contracted rate of the bearer.
Preferably, after performing resource scheduling for each bearer according to the absolute scheduling priority and the relative scheduling priority, if there are remaining resources, the scheduling module is further configured to: according to the absolute scheduling priority and the relative scheduling priority, descending the order to ensure that the sum of the rates of the non-guaranteed rate bearing is not more than the non-guaranteed rate bearing scheduling residual resources of the terminal with the maximum bit rate of the user aggregation; and when the sum of the rates of the non-guaranteed rate bearers of all the terminals meets the maximum bit rate aggregated by the user, remaining resources still exist, and the remaining resources are dispatched for the guaranteed rate bearers according to the descending order of the absolute dispatching priority and the relative dispatching priority.
Based on the same inventive concept as the method, an embodiment of the present invention further provides a scheduling apparatus, as shown in fig. 3, the scheduling apparatus at least includes:
a processor 301, the processor 301 configured to execute a computer program having the following functions: determining absolute scheduling priority of each bearer, wherein the absolute scheduling priority of the bearer for transmitting signaling is higher than the absolute scheduling priority of the bearer for transmitting service, and the absolute scheduling priority of the bearers for different transmitting services is determined according to the service quality class identifier of the bearer; determining the relative scheduling priority of each bearer according to at least one service quality parameter; performing resource scheduling for each bearer in descending order according to the absolute scheduling priority, and when the absolute scheduling priorities of at least two bearers are the same, preferentially performing resource scheduling for the bearer with high relative scheduling priority;
a memory 302, the memory 302 being configured to hold code of the computer program as described above.
According to the technical scheme provided by the embodiment of the invention, the scheduling priority is composed of an absolute scheduling priority and a relative scheduling priority. And during scheduling, scheduling according to the descending order of the absolute scheduling priority, wherein the absolute scheduling priority of the bearer for transmitting the signaling is higher than the absolute scheduling priority of the bearer for transmitting the service, the absolute scheduling priorities of the bearers for different transmitting services are determined according to the QCI of the bearer, and the QCI can comprehensively represent quality of service (QoS) indexes and is suitable for guaranteed Rate (GBR) bearer and non-guaranteed Rate (NGBR) bearer. When the absolute scheduling priorities are the same, the bearers with the relative scheduling priorities are scheduled preferentially, the relative scheduling priorities are determined according to at least one service quality parameter, and the service quality parameters for determining the relative scheduling priorities can be selected as required. Therefore, the technical scheme provided by the embodiment of the invention realizes a reasonable scheduling priority mechanism, thereby avoiding a series of problems caused by unreasonable scheduling priority.
Preferably, the relative scheduling priority of each bearer is determined according to at least one of the following quality of service parameters:
the parameter of scheduling fairness, the parameter of bearing time delay and the parameter of bearing transmission rate are embodied.
Preferably, the relative scheduling priority of each bearer is determined according to the following formula:
wherein, PR(in)(t) represents the relative scheduling priority of the nth bearer of user equipment i in the current scheduling period,indicating explicit scheduling fairnessIs determined by the parameters of (a) and (b),weights, R, representing parameters embodying scheduling fairnessin(t) represents an applied transmission rate of the bearer in the current scheduling period determined according to the channel quality information of the modified bearer,indicating the average transmission rate of the bearer during the current scheduling period,a parameter representing the delay of the bearer is indicated,weights representing parameters embodying the bearer delay, Din(T) represents the packet latency, T, of the bearer to the current scheduling periodin(t) represents the maximum transmission delay of the bearer under the quality of service requirement,representing a parameter that characterizes the rate of transmission of the bearer,weight, V, representing a parameter representing the transmission rate of the bearerinAnd (t) denotes a contracted rate of the bearer.
Preferably, after scheduling resources for each bearer according to the absolute scheduling priority and the relative scheduling priority, if there are remaining resources, the processor is further configured to execute a computer program having the following functions: according to the absolute scheduling priority and the relative scheduling priority, descending the order to ensure that the sum of the rates of the non-guaranteed rate bearing is not more than the non-guaranteed rate bearing scheduling residual resources of the terminal with the maximum bit rate of the user aggregation; and when the sum of the rates of the non-guaranteed rate bearers of all the terminals meets the maximum bit rate aggregated by the user, remaining resources still exist, and the remaining resources are dispatched for the guaranteed rate bearers according to the descending order of the absolute dispatching priority and the relative dispatching priority. The memory is also configured to hold the code of the computer program described above.
As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
While preferred embodiments of the present invention have been described, additional variations and modifications in those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. Therefore, it is intended that the appended claims be interpreted as including preferred embodiments and all such alterations and modifications as fall within the scope of the invention.
It will be apparent to those skilled in the art that various changes and modifications may be made in the present invention without departing from the spirit and scope of the invention. Thus, if such modifications and variations of the present invention fall within the scope of the claims of the present invention and their equivalents, the present invention is also intended to include such modifications and variations.
Claims (8)
1. A method of scheduling, comprising:
determining absolute scheduling priority of each bearer, wherein the absolute scheduling priority of the bearer for transmitting signaling is higher than the absolute scheduling priority of the bearer for transmitting service, and the absolute scheduling priority of the bearers for different transmitting services is determined according to the service quality class identifier of the bearer;
determining the relative scheduling priority of each bearer according to at least one service quality parameter;
and performing resource scheduling for each bearer in a descending order according to the absolute scheduling priority, and when the absolute scheduling priorities of at least two bearers are the same, preferentially performing resource scheduling for the bearer with high relative scheduling priority.
2. The method of claim 1, wherein determining the relative scheduling priority of each bearer according to at least one of the following quality of service parameters comprises:
the parameter of scheduling fairness, the parameter of bearing time delay and the parameter of bearing transmission rate are embodied.
3. The method of claim 2, wherein determining the relative scheduling priority of each bearer according to the parameter indicative of scheduling fairness, the parameter indicative of bearer delay, and the parameter indicative of bearer transmission rate comprises:
determining the relative scheduling priority of each bearer according to the following formula:
wherein, PR(in)(t) represents the relative scheduling priority of the nth bearer of terminal i in the current scheduling period,a parameter that embodies the fairness of scheduling is represented,weights, R, representing parameters embodying scheduling fairnessin(t) represents an applied transmission rate of the bearer in the current scheduling period determined according to the channel quality information of the modified bearer,indicating the average transmission rate of the bearer during the current scheduling period,a parameter representing the delay of the bearer is indicated,weights representing parameters embodying the bearer delay, Din(T) represents the packet latency, T, of the bearer to the current scheduling periodin(t) represents the maximum transmission delay of the bearer under the quality of service requirement,representing a parameter that characterizes the rate of transmission of the bearer,weight, V, representing a parameter representing the transmission rate of the bearerinAnd (t) denotes a contracted rate of the bearer.
4. A method according to any of claims 1 to 3, wherein after scheduling resources for each bearer according to the absolute scheduling priority and the relative scheduling priority, if there are remaining resources, the method further comprises:
according to the absolute scheduling priority and the relative scheduling priority, descending the order to ensure that the sum of the rates of the non-guaranteed rate bearing is not more than the non-guaranteed rate bearing scheduling residual resources of the terminal with the maximum bit rate of the user aggregation;
and when the sum of the rates of the non-guaranteed rate bearers of all the terminals meets the maximum bit rate aggregated by the user, remaining resources still exist, and the remaining resources are dispatched for the guaranteed rate bearers according to the descending order of the absolute dispatching priority and the relative dispatching priority.
5. A scheduling apparatus, comprising:
an absolute scheduling priority determining module, configured to determine an absolute scheduling priority of each bearer, where the absolute scheduling priority of the bearer for transmitting the signaling is higher than the absolute scheduling priority of the bearer for transmitting the service, and the absolute scheduling priorities of the bearers for different transmission services are determined according to the service quality class identifier of the bearer;
a relative scheduling priority determining module, configured to determine a relative scheduling priority of each bearer according to at least one qos parameter;
and the scheduling module is used for performing resource scheduling on each bearer according to the descending order of the absolute scheduling priority, and preferentially performing resource scheduling on the bearer with the high relative scheduling priority when the absolute scheduling priorities of at least two bearers are the same.
6. The apparatus of claim 5, wherein the relative scheduling priority determination module is specifically configured to:
determining the relative scheduling priority of each bearer according to at least one of the following service quality parameters:
the parameter of scheduling fairness, the parameter of bearing time delay and the parameter of bearing transmission rate are embodied.
7. The apparatus of claim 6, wherein the relative scheduling priority determination module is specifically configured to:
determining the relative scheduling priority of each bearer according to the following formula:
wherein, PR(in)(t) represents the relative scheduling priority of the nth bearer of terminal i in the current scheduling period,a parameter that embodies the fairness of scheduling is represented,weights, R, representing parameters embodying scheduling fairnessin(t) is determined based on the channel quality information of the modified bearerThe requested transmission rate for the bearer in the current scheduling period,indicating the average transmission rate of the bearer during the current scheduling period,a parameter representing the delay of the bearer is indicated,weights representing parameters embodying the bearer delay, Din(T) represents the packet latency, T, of the bearer to the current scheduling periodin(t) represents the maximum transmission delay of the bearer under the quality of service requirement,representing a parameter that characterizes the rate of transmission of the bearer,weight, V, representing a parameter representing the transmission rate of the bearerinAnd (t) denotes a contracted rate of the bearer.
8. The apparatus according to any one of claims 5 to 7, wherein after scheduling resources for each bearer according to the absolute scheduling priority and the relative scheduling priority, if there are remaining resources, the scheduling module is further configured to:
according to the absolute scheduling priority and the relative scheduling priority, descending the order to ensure that the sum of the rates of the non-guaranteed rate bearing is not more than the non-guaranteed rate bearing scheduling residual resources of the terminal with the maximum bit rate of the user aggregation;
and when the sum of the rates of the non-guaranteed rate bearers of all the terminals meets the maximum bit rate aggregated by the user, remaining resources still exist, and the remaining resources are dispatched for the guaranteed rate bearers according to the descending order of the absolute dispatching priority and the relative dispatching priority.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410250311.3A CN104066193A (en) | 2014-06-06 | 2014-06-06 | Scheduling method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410250311.3A CN104066193A (en) | 2014-06-06 | 2014-06-06 | Scheduling method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN104066193A true CN104066193A (en) | 2014-09-24 |
Family
ID=51553665
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410250311.3A Pending CN104066193A (en) | 2014-06-06 | 2014-06-06 | Scheduling method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104066193A (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105873128A (en) * | 2016-05-31 | 2016-08-17 | 杭州电子科技大学 | LTE fairness scheduling method based on time delay sensitivity |
| CN106714324A (en) * | 2017-01-19 | 2017-05-24 | 中国联合网络通信集团有限公司 | Resource scheduling method and device |
| CN107038067A (en) * | 2016-09-07 | 2017-08-11 | 阿里巴巴集团控股有限公司 | The management method and device of process resource in distributed stream processing |
| CN108093485A (en) * | 2017-12-18 | 2018-05-29 | 海能达通信股份有限公司 | A kind of resource allocation methods and device |
| CN109803352A (en) * | 2019-03-08 | 2019-05-24 | 北京邮电大学 | A kind of resource allocation method and device of mist Radio Access Network |
| CN112492635A (en) * | 2020-12-11 | 2021-03-12 | 中国联合网络通信集团有限公司 | Method and device for determining scheduling priority |
Citations (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1710980A (en) * | 2004-06-17 | 2005-12-21 | 大唐移动通信设备有限公司 | Downstream grouped data scheduling method suitable to mobile communication system |
| CN1852581A (en) * | 2005-10-12 | 2006-10-25 | 上海华为技术有限公司 | Method for transmitting data on downward link |
| CN101137196A (en) * | 2006-08-28 | 2008-03-05 | 普天信息技术研究院 | Method of packet scheduling in high speed downlink packet access network |
| WO2008156275A2 (en) * | 2007-06-18 | 2008-12-24 | Lg Electronics Inc. | Method of allocating resources in wireless communication system |
| CN101400139A (en) * | 2008-10-28 | 2009-04-01 | 北京创毅视讯科技有限公司 | Data transmission method and base station in multiple base station collaboration system |
| CN101583193A (en) * | 2009-06-24 | 2009-11-18 | 中国科学院计算技术研究所 | Distribution method for wireless resource ascended by base station terminal in LTE system and device |
| CN101610551A (en) * | 2008-06-20 | 2009-12-23 | 普天信息技术研究院有限公司 | The resource regulating method of a kind of HSUPA |
| CN101651602A (en) * | 2008-08-11 | 2010-02-17 | 华为技术有限公司 | Authority allocation method, device and system |
| CN101827446A (en) * | 2010-04-09 | 2010-09-08 | 新邮通信设备有限公司 | Radio bearer scheduling method and device |
| CN102238644A (en) * | 2010-04-30 | 2011-11-09 | 中兴通讯股份有限公司 | Transmission method and terminal of terminal uplink channel |
| CN102685911A (en) * | 2011-03-15 | 2012-09-19 | 普天信息技术研究院有限公司 | Business scheduling method in LTE system |
| CN102724763A (en) * | 2012-06-07 | 2012-10-10 | 西安交通大学 | Time domain group scheduling method on basis of two-dimensional priority level |
| CN102970763A (en) * | 2012-11-01 | 2013-03-13 | 大唐移动通信设备有限公司 | Resource scheduling method and device based on service qualities |
| CN103068051A (en) * | 2013-01-09 | 2013-04-24 | 上海大唐移动通信设备有限公司 | Distribution method and distribution device of downstream resources |
-
2014
- 2014-06-06 CN CN201410250311.3A patent/CN104066193A/en active Pending
Patent Citations (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1710980A (en) * | 2004-06-17 | 2005-12-21 | 大唐移动通信设备有限公司 | Downstream grouped data scheduling method suitable to mobile communication system |
| CN1852581A (en) * | 2005-10-12 | 2006-10-25 | 上海华为技术有限公司 | Method for transmitting data on downward link |
| CN101137196A (en) * | 2006-08-28 | 2008-03-05 | 普天信息技术研究院 | Method of packet scheduling in high speed downlink packet access network |
| WO2008156275A2 (en) * | 2007-06-18 | 2008-12-24 | Lg Electronics Inc. | Method of allocating resources in wireless communication system |
| CN101610551A (en) * | 2008-06-20 | 2009-12-23 | 普天信息技术研究院有限公司 | The resource regulating method of a kind of HSUPA |
| CN101651602A (en) * | 2008-08-11 | 2010-02-17 | 华为技术有限公司 | Authority allocation method, device and system |
| CN101400139A (en) * | 2008-10-28 | 2009-04-01 | 北京创毅视讯科技有限公司 | Data transmission method and base station in multiple base station collaboration system |
| CN101583193A (en) * | 2009-06-24 | 2009-11-18 | 中国科学院计算技术研究所 | Distribution method for wireless resource ascended by base station terminal in LTE system and device |
| CN101827446A (en) * | 2010-04-09 | 2010-09-08 | 新邮通信设备有限公司 | Radio bearer scheduling method and device |
| CN102238644A (en) * | 2010-04-30 | 2011-11-09 | 中兴通讯股份有限公司 | Transmission method and terminal of terminal uplink channel |
| CN102685911A (en) * | 2011-03-15 | 2012-09-19 | 普天信息技术研究院有限公司 | Business scheduling method in LTE system |
| CN102724763A (en) * | 2012-06-07 | 2012-10-10 | 西安交通大学 | Time domain group scheduling method on basis of two-dimensional priority level |
| CN102970763A (en) * | 2012-11-01 | 2013-03-13 | 大唐移动通信设备有限公司 | Resource scheduling method and device based on service qualities |
| CN103068051A (en) * | 2013-01-09 | 2013-04-24 | 上海大唐移动通信设备有限公司 | Distribution method and distribution device of downstream resources |
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105873128A (en) * | 2016-05-31 | 2016-08-17 | 杭州电子科技大学 | LTE fairness scheduling method based on time delay sensitivity |
| CN105873128B (en) * | 2016-05-31 | 2019-05-14 | 杭州电子科技大学 | A kind of LTE fairness dispatching method based on delay sensitive |
| CN107038067A (en) * | 2016-09-07 | 2017-08-11 | 阿里巴巴集团控股有限公司 | The management method and device of process resource in distributed stream processing |
| CN107038067B (en) * | 2016-09-07 | 2020-12-04 | 创新先进技术有限公司 | Management method and device for processing resources in distributed stream processing |
| CN106714324A (en) * | 2017-01-19 | 2017-05-24 | 中国联合网络通信集团有限公司 | Resource scheduling method and device |
| CN106714324B (en) * | 2017-01-19 | 2019-10-08 | 中国联合网络通信集团有限公司 | A kind of method and device of scheduling of resource |
| CN108093485A (en) * | 2017-12-18 | 2018-05-29 | 海能达通信股份有限公司 | A kind of resource allocation methods and device |
| CN108093485B (en) * | 2017-12-18 | 2020-10-27 | 海能达通信股份有限公司 | Resource allocation method and device |
| CN109803352A (en) * | 2019-03-08 | 2019-05-24 | 北京邮电大学 | A kind of resource allocation method and device of mist Radio Access Network |
| CN109803352B (en) * | 2019-03-08 | 2020-12-01 | 北京邮电大学 | Resource allocation method and device for fog wireless access network |
| CN112492635A (en) * | 2020-12-11 | 2021-03-12 | 中国联合网络通信集团有限公司 | Method and device for determining scheduling priority |
| CN112492635B (en) * | 2020-12-11 | 2023-06-02 | 中国联合网络通信集团有限公司 | Determination method and device for scheduling priority |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110495243B (en) | Transmitting SR before completion of RACH | |
| US9474067B2 (en) | WLAN uplink scheduler for LTE-WLAN aggregation | |
| EP3471456B1 (en) | Congestion control method, base station, and terminal | |
| US8897237B2 (en) | Granting scheduling requests in a wireless communication system | |
| EP2862402B1 (en) | Systems and methods for prioritizing a ue in an uplink scheduler | |
| EP3094028B1 (en) | Data transmission method, device, and system | |
| US20140321376A1 (en) | Lte-wlan centralized downlink scheduler | |
| CN104066193A (en) | Scheduling method and device | |
| CN109982379A (en) | System and method for adaptive transmission time interval (TTI) structure | |
| CN102665270B (en) | Method for reducing uplink voice service transmission delay in long term evolution (LTE) system | |
| CN103856312B (en) | Carrier activation and the method deactivated, equipment | |
| US20160278111A1 (en) | Service scheduling method and device | |
| CN103596285A (en) | Wireless resource scheduling method, wireless resource scheduler and system thereof | |
| CN103442446B (en) | Dynamic and semi-static combined scheduling method in a kind of LTE system | |
| WO2018201902A1 (en) | Data transmission method and device | |
| WO2018028691A1 (en) | Message transmission method, user device, base station, and computer storage medium | |
| CN103945540A (en) | Processing method and device for logical channel priority | |
| JP5523627B2 (en) | Base station and resource allocation method in mobile communication system | |
| JP5651236B2 (en) | Base station and resource allocation method in mobile communication system | |
| US20140376467A1 (en) | Method for User Equipment to Select Resource, and Corresponding User Equipment, Computer Program and Storage Medium | |
| CN106464604B (en) | System, method and apparatus for supporting intra-application stream prioritization | |
| CN110870265B (en) | Scheduling policy for out-of-order grants | |
| US20120099454A1 (en) | Apparatus and method for scheduling in wireless communication system | |
| CN103945436B (en) | It is a kind of to adjust the method and apparatus that enhanced distributed channel accesses parameter value | |
| WO2012124659A1 (en) | Base station in mobile communication system and scheduling method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20140924 |
|
| RJ01 | Rejection of invention patent application after publication |