CN105830517A - Service scheduling method and device - Google Patents

Service scheduling method and device Download PDF

Info

Publication number
CN105830517A
CN105830517A CN201480002667.3A CN201480002667A CN105830517A CN 105830517 A CN105830517 A CN 105830517A CN 201480002667 A CN201480002667 A CN 201480002667A CN 105830517 A CN105830517 A CN 105830517A
Authority
CN
China
Prior art keywords
service
scheduling
scheduling priority
user equipment
priority
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
Application number
CN201480002667.3A
Other languages
Chinese (zh)
Inventor
李亮亮
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Publication of CN105830517A publication Critical patent/CN105830517A/en
Pending legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H04L47/62—Queue scheduling characterised by scheduling criteria
    • H04L47/622—Queue service order
    • H04L47/6225—Fixed service order, e.g. Round Robin
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/30—Flow control; Congestion control in combination with information about buffer occupancy at either end or at transit nodes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H04L47/62—Queue scheduling characterised by scheduling criteria
    • H04L47/622—Queue service order
    • H04L47/623—Weighted service order
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/56—Allocation or scheduling criteria for wireless resources based on priority criteria
    • H04W72/566—Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient
    • H04W72/569—Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient of the traffic information
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/52—Allocation or scheduling criteria for wireless resources based on load
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/54—Allocation or scheduling criteria for wireless resources based on quality criteria

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Quality & Reliability (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

Provided are a service scheduling method and the apparatus, and the method and apparatus are used for improving user awareness rate in a finite package scene. The apparatus mainly includes: an obtaining unit for obtaining the first scheduling priority of a first service; a determination unit for determining the second scheduling priority of the first service according to the data amount of the first service in a transmission buffer, air-interface transmission capability of the user equipment establishing the first service and the first scheduling priority of the first service; and a scheduling unit for scheduling the first service according to the second scheduling priority.

Description

Service scheduling method and device Technical Field
The present invention relates to the field of wireless technologies, and in particular, to a service scheduling method and device.
Background
In a wireless communication system, a plurality of user equipments may exist in a cell and perform uplink or downlink communication with a base station at the same time, wherein each user equipment establishes one or more uplink or downlink services, each service is composed of one or more data packets, and the total lengths of the data packets corresponding to each service are different. And a scheduler of the base station performs scheduling and system resource allocation according to each service, or performs scheduling and system resource allocation according to each user equipment, wherein one user equipment can be regarded as one service when performing scheduling and system resource allocation according to the user equipment, and the rest steps are the same. In particular, when each user equipment has only one service established, per-user equipment scheduling and per-service scheduling are fully equivalent. The method for scheduling and allocating system resources according to each service is used for description, one user equipment in the method can be regarded as one service processing according to the method for scheduling and allocating system resources by each user equipment, and other steps are the same.
As shown in fig. 1, services 1 to N are uplink or downlink services established by mobile stations MS1 to MS K, the MS1 to MS K communicate with a base station through an air interface, and a scheduler belongs to a part of the base station, and when multiple services (belonging to one or more user equipments) are waiting for allocating system resources for data transmission in a cell, the scheduler determines a scheduling order of the services and allocates the system resources for the services.
The scheduler calculates the scheduling priority of each service according to some known parameters (such as instantaneous rate, average rate, service quality of the service, first packet delay of the service and the like) and a scheduling algorithm, the scheduler performs service scheduling and allocates system resources according to the scheduling priority, and the service with higher priority schedules and allocates the system resources preferentially. The System resource herein refers to a limited resource that needs to be allocated to each service or used by a user equipment establishing each service in a wireless communication System, for example, a physical channel resource (physical resource block, precoding matrix, antenna, etc.) of a Long Term Evolution (LTE) System, and a Code channel resource (Walsh Code, etc.) of a Universal Mobile Telecommunications System (UMTS).
As shown in fig. 2, the scheduler calculates a first scheduling priority of each service according to any one or any combination of instantaneous channel information of the user equipment, average channel information, QoS information of the service, first packet delay information of the service, and the like, and performs scheduling and system resource allocation for each service according to the first scheduling priority, where the instantaneous channel information or the average channel information of the user equipment refers to instantaneous channel information or average channel information of the user equipment that establishes the service. The instantaneous Channel information includes parameters that can reflect the instantaneous Channel quality of the user equipment, such as instantaneous rate, instantaneous spectrum efficiency, instantaneous Channel Quality Index (CQI)/Modulation Code Scheme (MCS), and an instantaneous Multiple Input Multiple Output (MIMO) mode; the average channel information includes parameters that can reflect the average channel quality of the user equipment, such as average rate, average spectral efficiency, average CQI/MCS, average MIMO mode, etc.
The scheduler can be generally divided into an uplink scheduler and a downlink scheduler, and the uplink scheduler and the downlink scheduler have no difference in the scheduling algorithm used. Classical scheduling algorithms include Proportional Fair (PF) scheduling algorithm, Maximum Rate (Max-Rate) scheduling algorithm, Round Robin (RR) scheduling algorithm, Maximum Weighted Delay First (M-LWDF) scheduling algorithm, EXP/PF (exponnarial/probabilistic Fair) scheduling algorithm.
In each of the following algorithms, r is assumedi(t) instantaneous rate, R, of the service or of the user equipment setting up the servicei(t) represents average rate, Priority of the service or the user equipment establishing the serviceiIndicating the scheduling priority of the traffic.
The PF scheduling algorithm is expressed by equations 1 and 2 as:
t is a constant, the PF scheduling algorithm considers the instantaneous rate of the user equipment and the average rate of the user equipment, so that the fairness of the user equipment can be ensured, and good cell rate performance can be obtained.
The Max-Rate scheduling algorithm is expressed by equation 3 as:
Priorityi＝ri(t) (3)
the Max-Rate scheduling algorithm only considers the instantaneous rates of the user equipments, and schedules the user equipment with the largest instantaneous Rate each time, so that the best Rate performance is achieved in the cell, but the worst fairness of the user equipments is achieved.
The Round Robin scheduling algorithm is expressed by equation 4 as:
round Robin scheduling in the Round Robin scheduling algorithm is equal in the chance of scheduling and allocating system resources for each user equipment, which means that user equipment fairness is the best. But since the Round robin scheduling algorithm does not consider the instantaneous rate of the user equipment at all, it is also the worst in cell rate performance.
The M-LWDF scheduling algorithm is expressed by equation 5 as:
Wi(t) is the first Packet delay of Service i, i.e. Packet k belongs to Service i and represents all data packets belonging to Service i, TimeNowCurrent Time, Timek,InRepresenting the time when the data packet k enters the queue to be scheduled; tau isiRepresenting the maximum latency tolerable by service i, deltaiRepresents an event { Wi(t)>τiThe maximum probability of allowable occurrence; the M-LWDF scheduling algorithm considers not only the HOL, but also the instantaneous rate and the average rate, so that the M-LWDF scheduling algorithm can not only ensure that the probability of packet loss is lower due to overtime, but also obtain better cell rate performance while being compatible with the fairness of the user equipment.
The EXP/PF scheduling algorithm is represented by equation 6 as:
real Time (RT) services, mainly services sensitive to Time delay, such as video and voice services; Non-Real Time (NRT) services, which are mainly less sensitive to delay, such as File Transfer Protocol (FTP) download services; i belongs to the RT and represents that the service i belongs to the real-time service; a isiAnd Wi(t) is as defined above; n is a radical ofRTRepresenting the total number of the user equipment establishing the real-time service; m (t) represents the average number of RT data packets waiting for scheduling in the cell at the time t; epsilon and k are constants,
In the EXP/PF scheduling algorithm, for a mixed service scenario in which an RT service and an NRT service coexist, the delay of the RT service in the first packet is close to the maximum latency, and the scheduling priority is generally higher than that of the NRT service. In a mixed service scene, the EXP/PF scheduling algorithm can well ensure that the first packet delay of the service does not exceed the maximum waiting delay of the service as much as possible, and can also well give consideration to the fairness of user equipment and the rate performance of a cell.
In addition to the above classical scheduling algorithm, there are some other variations, as shown in equation 7:
k, α, β and lambda are constants, and similar deformation formulas are more and are not listed.
In the third generation partnership project (3)rdGeneration Partnership Project, 3GPP), a definition of an infinite packet (Full Buffer) service and a finite packet (Non-Full Buffer) service is given, wherein the infinite packet service is defined as continuous transmission of uplink or downlink traffic data, and the finite packet service is defined as burst transmission of uplink or downlink traffic data.
The above formulas 1 to 7 are designed under the infinite packet Service, and the instantaneous channel information (such as instantaneous rate or instantaneous spectrum efficiency), the average channel information (such as average rate or average spectrum efficiency) of the user equipment, the first packet delay information and Quality of Service (QoS) information of the Service, etc. are used as inputs to calculate the scheduling priority of each Service, and then the system resources are allocated to the Service according to the scheduling priority.
In a limited packet scene, the existing scheduling algorithm has poor user perception rate and influences user experience.
Disclosure of Invention
The embodiment of the invention provides a service scheduling method and equipment, which are used for improving the user perception rate in a limited packet scene.
The embodiment of the invention provides the following specific technical scheme:
in a first aspect, an apparatus for scheduling a service is provided, including:
the system comprises an acquisition unit, a scheduling unit and a scheduling unit, wherein the acquisition unit is used for acquiring a first scheduling priority of a first service;
a determining unit, configured to determine a second scheduling priority of the first service according to a data amount of the first service in a sending buffer, an air interface transmission capability of a user equipment that establishes the first service, and a first scheduling priority of the first service;
and the scheduling unit is used for scheduling the first service according to the second scheduling priority.
With reference to the first aspect, in a first possible implementation manner, the second scheduling priority of the first service is inversely proportional to a data amount of the first service in a transmission buffer, is directly proportional to an air interface transmission capability of a user equipment that establishes the first service, and is directly proportional to the first scheduling priority of the service;
alternatively, the first and second electrodes may be,
the second scheduling priority of the first service is inversely proportional to the data amount of the first service in the transmission buffer and directly proportional to the air interface transmission capability of the user equipment which establishes the first service.
With reference to the first possible implementation manner of the first aspect, in a second possible implementation manner, the determining unit is specifically configured to:
determining a weight factor of the first service according to the data volume of the first service in a sending buffer area and the air interface transmission capacity of the user equipment for establishing the first service, wherein the weight factor of the first service is inversely proportional to the data volume in the sending buffer area of the first service and is directly proportional to the air interface transmission capacity of the user equipment for establishing the first service;
and determining a second scheduling priority of the first service according to the weight factor of the first service and the first scheduling priority of the first service, wherein the second scheduling priority of the first service is in direct proportion to the weight factor of the first service.
With reference to any one of the first aspect to the second possible implementation manner, in a third possible implementation manner, the obtaining unit is specifically configured to:
determining a first scheduling priority of the first service according to any one or combination of instantaneous channel information, average channel information, quality of service (QoS) information and first packet delay information of the first service; alternatively, the first and second electrodes may be,
and acquiring the first scheduling priority preset for the first service.
With reference to any one of the first aspect to the third possible implementation manner, in a fourth possible implementation manner, the scheduling unit is specifically configured to:
and scheduling the first service and allocating system resources according to the second scheduling priority from high to low in a scheduling period.
With reference to the fourth possible implementation manner of the first aspect, in a fifth possible implementation manner, the determining unit is further configured to:
and after the scheduling unit schedules the first service and allocates system resources in the scheduling period according to the sequence of the second scheduling priority from high to low, the second scheduling priority of the first service is determined again before the next scheduling period comes.
With reference to any one of the first aspect to the second possible implementation manner, in a sixth possible implementation manner, the air interface transmission capability of the user equipment is any one or a combination of instantaneous channel information of the user equipment and average channel information of the user equipment.
In a second aspect, a service scheduling method is provided, including:
acquiring a first scheduling priority of a first service;
determining a second scheduling priority of the first service according to the data volume of the first service in a sending buffer, the air interface transmission capability of user equipment for establishing the first service and the first scheduling priority of the first service;
and scheduling the first service according to the second scheduling priority.
With reference to the second aspect, in a first possible implementation manner, the second scheduling priority of the first service is inversely proportional to a data amount of the first service in a transmission buffer, is directly proportional to an air interface transmission capability of a user equipment that establishes the first service, and is directly proportional to the first scheduling priority of the service;
alternatively, the first and second electrodes may be,
the second scheduling priority of the first service is inversely proportional to the data amount of the first service in the transmission buffer and directly proportional to the air interface transmission capability of the user equipment which establishes the first service.
With reference to the first possible implementation manner of the second aspect, in a second possible implementation manner, determining a second scheduling priority of the first service according to the data amount of the first service in the transmission buffer, the air interface transmission capability of the user equipment that establishes the first service, and the first scheduling priority of the first service includes:
determining a weight factor of the first service according to the data volume of the first service in a sending buffer area and the air interface transmission capacity of the user equipment for establishing the first service, wherein the weight factor of the first service is inversely proportional to the data volume in the sending buffer area of the first service and is directly proportional to the air interface transmission capacity of the user equipment for establishing the first service;
and determining a second scheduling priority of the first service according to the weight factor of the first service and the first scheduling priority of the first service, wherein the second scheduling priority of the first service is in direct proportion to the weight factor of the first service.
With reference to the second aspect to the second possible implementation, in a third possible implementation, the acquiring the first scheduling priority of the first service includes:
determining a first scheduling priority of the first service according to any one or combination of instantaneous channel information, average channel information, quality of service (QoS) information and first packet delay information of the first service; alternatively, the first and second electrodes may be,
and acquiring the first scheduling priority preset for the first service.
With reference to the second aspect to the third possible implementation, in a fourth possible implementation, scheduling the first service according to the second scheduling priority includes:
and scheduling the first service and allocating system resources according to the second scheduling priority from high to low in a scheduling period.
With reference to the fourth possible implementation manner of the second aspect, in a fifth possible implementation manner, after the first service is scheduled and system resources are allocated in the scheduling period according to the second scheduling priority in the order from high to low, the second scheduling priority of the first service is determined again before a next scheduling period comes.
With reference to the second aspect to the second possible implementation manner, in a sixth possible implementation manner, the air interface transmission capability of the user equipment is any one or a combination of instantaneous channel information of the user equipment and average channel information of the user equipment.
In a third aspect, an apparatus is provided that includes a processor and a memory;
the processor is used for reading a preset program in the memory and executing the following processes according to the program:
acquiring a first scheduling priority of a first service;
determining a second scheduling priority of the first service according to the data volume of the first service in a sending buffer, the air interface transmission capability of user equipment for establishing the first service and the first scheduling priority of the first service;
and scheduling the first service according to the second scheduling priority.
Based on the above technical solution, in the embodiment of the present invention, a second scheduling priority of a service is determined according to a data amount of the service in a sending buffer, an air interface transmission capability of a user equipment that establishes the service, and a first scheduling priority of the service, and the service is scheduled according to the second scheduling priority, so that in a limited packet scenario, the data amount of the service in the sending buffer and the air interface transmission capability of the user equipment that establishes the service are comprehensively considered to determine the second scheduling priority, so that a user sensing rate can be effectively increased when the service is scheduled according to the second scheduling priority, and user experience is further improved.
Drawings
Fig. 1 is a schematic diagram of a conventional service scheduling;
FIG. 2 is a schematic diagram of a conventional scheduler;
fig. 3 is a schematic structural diagram of a service scheduling apparatus in an embodiment of the present invention;
FIG. 4 is a schematic diagram of an apparatus according to an embodiment of the present invention;
FIG. 5 is a schematic diagram of a service scheduling process in an embodiment of the present invention;
FIG. 6 is a timing diagram illustrating business scheduling according to a first scheduling priority;
FIG. 7 is a timing diagram illustrating traffic scheduling according to a second scheduling priority in an embodiment of the present invention;
fig. 8 is a schematic diagram of service scheduling in an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention clearer, the present invention will be described in further detail with reference to the accompanying drawings, and it is apparent that the described embodiments are only a part of the embodiments of the present invention, not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
In a real wireless network, the network is a limited packet scene, and the number and the length of the data packets of the service are limited. In a limited packet scenario, the user perceived rate is defined as the total number of bits of a burst service divided by the time required to transmit the burst service, where the time required to transmit the burst service is: the first data packet of the burst service arrives at the transmission buffer of the base station end or the user equipment end as the starting time TstartThe last data packet of the burst service is correctly received as the end time TendThe time required for transmitting the burst service is Tend-Tstart。
In the following embodiments, when scheduling and system resource allocation are performed for each ue, the scheduling priority may also be for the ue; the scheduling priorities of the same service in different sub-channels in the multi-carrier system may also be different, in which case the scheduling priority of the service may be for a specific sub-channel. The following embodiments are described with a basic unit of scheduling based on a service, and a procedure of scheduling based on a unit of user equipment or a subchannel of the service is the same as a procedure of scheduling based on a unit of the service.
In the embodiment of the present invention, as shown in fig. 3, the service scheduling apparatus mainly includes:
an obtaining unit 301, configured to obtain a first scheduling priority of a first service;
a determining unit 302, configured to determine a second scheduling priority of the first service according to a data amount of the first service in a sending buffer, an air interface transmission capability of a user equipment that establishes the first service, and a first scheduling priority of the first service;
a scheduling unit 303, configured to schedule the first service according to the second scheduling priority.
The second scheduling priority of the first service is inversely proportional to the data volume of the first service in a sending buffer, is directly proportional to the air interface transmission capability of the user equipment which establishes the service, and is directly proportional to the first scheduling priority of the service;
alternatively, the first and second electrodes may be,
the second scheduling priority of the first service is inversely proportional to the data amount of the first service in the transmission buffer and directly proportional to the air interface transmission capability of the user equipment which establishes the first service.
Preferably, the determining unit 302 is specifically configured to:
determining a weight factor of the first service according to the data volume of the first service in a sending buffer area and the air interface transmission capacity of the user equipment for establishing the first service, wherein the weight factor of the first service is inversely proportional to the data volume in the sending buffer area of the first service and is directly proportional to the air interface transmission capacity of the user equipment for establishing the first service;
and determining a second scheduling priority of the first service according to the weight factor of the first service and the first scheduling priority of the first service, wherein the second scheduling priority of the first service is in direct proportion to the weight factor of the first service.
Preferably, the obtaining unit 301 is specifically configured to:
determining a first scheduling priority of the first service according to any one or combination of instantaneous channel information, average channel information, quality of service (QoS) information and first packet delay information of the first service; alternatively, the first and second electrodes may be,
and acquiring the first scheduling priority preset for the first service.
Preferably, the scheduling unit 303 is specifically configured to:
and scheduling the first service and allocating system resources according to the second scheduling priority from high to low in a scheduling period.
Preferably, the determining unit 302 is further configured to:
after the scheduling unit 303 schedules the first service and allocates system resources in the scheduling cycle in the order from the high scheduling priority to the low scheduling priority, the second scheduling priority of the first service is determined again before the next scheduling cycle comes.
Based on the same inventive concept, as shown in fig. 4, an embodiment of the present invention further provides an apparatus, where the apparatus mainly includes a processor 401 and a memory 402, and the processor 401 is configured to read a program preset in the memory 402, and execute the following processes according to the program:
acquiring a first scheduling priority of a first service;
determining a second scheduling priority of the first service according to the data volume of the first service in a sending buffer, the air interface transmission capability of user equipment for establishing the first service and the first scheduling priority of the first service;
and scheduling the first service according to the second scheduling priority.
The second scheduling priority of the first service is inversely proportional to the data volume of the first service in a sending buffer, is directly proportional to the air interface transmission capability of the user equipment which establishes the service, and is directly proportional to the first scheduling priority of the service;
alternatively, the first and second electrodes may be,
the second scheduling priority of the first service is inversely proportional to the data amount of the first service in the transmission buffer and directly proportional to the air interface transmission capability of the user equipment which establishes the first service.
Preferably, the processor 401 determines a weight factor of the first service according to the data volume of the first service in the transmission buffer and the air interface transmission capability of the user equipment that establishes the first service, where the weight factor of the first service is inversely proportional to the data volume in the transmission buffer of the first service and is directly proportional to the air interface transmission capability of the user equipment that establishes the first service;
and determining a second scheduling priority of the first service according to the weight factor of the first service and the first scheduling priority of the first service, wherein the second scheduling priority of the first service is in direct proportion to the weight factor of the first service.
Preferably, the processor 401 determines the first scheduling priority of the first service according to any one or a combination of instantaneous channel information, average channel information, quality of service (QoS) information and first packet delay information of the first service; alternatively, the first and second electrodes may be,
and acquiring the first scheduling priority preset for the first service.
Preferably, the processor 401 schedules the first service and allocates system resources in the scheduling period according to the second scheduling priority from high to low.
Preferably, after the first service is scheduled and the system resources are allocated in the scheduling period according to the second scheduling priority in the order from high to low, the processor 401 determines the second scheduling priority of the first service again before the next scheduling period comes.
Based on the same inventive concept, in the embodiment of the present invention, as shown in fig. 5, a detailed method flow for performing service scheduling is as follows:
step 501: and acquiring a first scheduling priority of the first service.
When a plurality of services exist, the first scheduling priority of each service is acquired respectively, and the acquisition mode of the first scheduling priority of each service is the same as that of the first scheduling priority of the first service.
The first scheduling priority of the first service may be obtained in various ways, including but not limited to:
determining a first scheduling priority of a first service according to any one or combination of instantaneous channel information (instantaneous rate), average channel information (average rate), quality of service (QoS) information and first packet delay information of the first service; alternatively, the first and second electrodes may be,
and acquiring a first scheduling priority preset for the first service.
In specific implementation, the first scheduling priority of the first service may be calculated by adopting a PF scheduling algorithm, a Max-Rate scheduling algorithm, a Round Robin scheduling algorithm, an M-LWDF scheduling algorithm, an EXP/PF scheduling algorithm, and other classical scheduling algorithms, or the first scheduling priority of the first service may be calculated by adopting a variant algorithm of the classical scheduling algorithm, or the first scheduling priority of the first service may be pre-specified.
Wherein the first scheduling Priority may be any normal number, e.g., the first scheduling Priorityi＝1。
The present invention does not limit the manner of obtaining the first scheduling priority of the first service, and all manners of obtaining the first scheduling priority of the first service, which are available to those skilled in the art without inventive labor, can be applied to the present invention.
Step 502: and determining a second scheduling priority of the first service according to the data volume of the first service in a sending buffer, the air interface transmission capability of the user equipment for establishing the first service and the first scheduling priority of the first service.
When a plurality of services exist, the determination mode of the second scheduling priority of each service is the same as the determination mode of the second scheduling priority of the first service.
The second scheduling priority of the first service is inversely proportional to the data volume of the first service in the transmission buffer, is directly proportional to the air interface transmission capability of the user equipment establishing the first service, and is directly proportional to the first scheduling priority of the first service;
alternatively, the first and second electrodes may be,
the second scheduling priority of the first service is inversely proportional to the data amount of the first service in the transmission buffer and directly proportional to the air interface transmission capability of the user equipment which establishes the first service.
Specifically, when the first scheduling priority of the first service is any preset normal number, the second scheduling priority of the first service may be inversely proportional to the data amount of the first service in the transmission buffer and directly proportional to the air interface transmission capability of the user equipment that establishes the first service.
In a specific implementation, the data amount of the first service in the sending buffer specifically refers to: the number of data bits of the first service waiting for transmission in the buffer at the base station side during downlink transmission, or the number of data bits of the first service waiting for transmission in the buffer at the user equipment side during uplink transmission.
The air interface transmission capability of the user equipment may specifically be any one or a combination of instantaneous channel information (instantaneous rate) and average information (average rate).
Preferably, a weight factor of the first service is determined according to a data volume of the first service in a sending buffer and an air interface transmission capability of the user equipment for establishing the first service, where the weight factor of the first service is inversely proportional to the data volume of the first service in the sending buffer and directly proportional to the air interface transmission capability of the user equipment for establishing the first service;
and determining a second scheduling priority of the first service according to the weight factor of the first service and the first scheduling priority of the first service, wherein the second scheduling priority of the first service is in direct proportion to the weight factor of the first service.
In the embodiment of the present invention, a specific conversion relationship between the weight factor and the data amount in the transmission buffer and the air interface transmission capability of the user equipment is not limited, and the present invention can be applied only if the weight factor is in inverse proportion to the data amount in the transmission buffer of the service and in proportion to the air interface transmission capability of the user equipment establishing the service.
For example, the traffic i weight factor is represented as ρiThe amount of data in the transmission buffer of service i is denoted by psiiThe air interface transmission capability of the user equipment for establishing the service i is expressed as gammaiThen the weighting factor can be formulated as:
or, etc., where a, b, c, d are positive real numbers other than 0, and e is a real number. Here, the relation between the weighting factor and the amount of data in the transmission buffer of the service and the capacity of the air interface transmission of the ue in the specific implementation is not limited to this example.
Similarly, in the embodiment of the present invention, the specific conversion relationship between the second scheduling priority and the weight factor and the first scheduling priority is not limited, and the second scheduling priority may be directly proportional to the weight factor and directly proportional to the first scheduling priority.
For example, the weight factor for traffic i is denoted as ρiThe first scheduling Priority of service i is represented as PriorityiAnd the second scheduling priority of the service i is expressed as follows: or, etc., where a, b, c, d are positive real numbers other than 0, and e is a real number. The relationship between the second scheduling priority and the first scheduling priority and the weighting factor in the implementation is not limited to this example.
Step 503: and scheduling the first service according to the second scheduling priority.
Preferably, the first service is scheduled and the system resources are allocated in the current scheduling period according to the second scheduling priority from high to low. When a plurality of services to be scheduled exist, the user equipment with higher second scheduling priority in the plurality of services to be scheduled gets the scheduling with higher priority and allocates the system resources with priority.
Preferably, after the first service is scheduled and the system resources are allocated according to the second scheduling priority from high to low in the current scheduling period, the second scheduling priority of the first service is determined again before the next scheduling period comes, and when the next scheduling period comes, the first service is scheduled and the system resources are allocated according to the second scheduling priority determined again in the scheduling period.
The following describes, by way of a first specific embodiment, a manner in which service scheduling is performed on a first scheduling priority obtained by using an existing scheduling algorithm, and scheduling is performed by using a second scheduling priority in the embodiment of the present invention.
In the first embodiment, it is assumed that there are 2 services in a cell and data of the 2 services simultaneously arrives at a transmission buffer, and a scheduler schedules one service to use channel resources of a full system bandwidth for data transmission at each Transmission Time Interval (TTI). Assuming that service1 has 1000 bits (bit), and the data volume of the transmission buffer and the transmission capability of the air interface are considered comprehensively, 2 TTIs are needed for the data transmission of service 1. Assuming that the service2 also has 1000 bits, and comprehensively considering the data volume of the sending buffer and the transmission capability of the air interface, the data transmission of the service2 needs 3 TTIs. For simplicity, it is assumed here that once the data of the service is scheduled, it is correctly received right away, i.e. the time delay between the scheduler to the receiver is 0 TTIs. Of course, it can be assumed here that the delay between the scheduler and the receiver is some other fixed value, which does not affect the conclusion.
In the first embodiment, if the data amount of the service transmission buffer and the air interface transmission capability of the user equipment are not considered comprehensively, the first scheduling priority is calculated by using the existing scheduling algorithm, and a typical scheduling timing chart when scheduling is performed according to the first scheduling priority is shown in fig. 6:
data for service1 and service2 arrive at TTI 1 simultaneously, and scheduling for service2 and TTI4Service1 (service 1 needs to transmit 2 TTIs, so that service1 is scheduled in TTI4, and the whole transmission time of service1 is TTI 1 to TTI 4), and service2 is scheduled in TTI 1, TTI 3, and TTI 5 (service 2 needs to transmit 3 TTIs, so that service2 is scheduled in TTI 5, and the whole transmission time of service2 is TTI 1 to TTI 5). The data transmission of the service1 occupies 4 TTIs, the data transmission of the service2 occupies 5 TTIs, and the user perception rate of the service1 is obtained by calculation according to a calculation formula of the user perception rate given by the 3GPPService1And user perceived rate PerceidRate of service2Service2Respectively expressed as:
in this first specific embodiment, if the data size of the transmission buffer of the service and the air interface transmission capability of the user equipment are considered comprehensively, that is, scheduling is performed according to the second scheduling priority, so that the service with the shortest transmission time is scheduled in the first priority, the scheduling timing sequence at this time is as shown in fig. 7, the data transmission of the service1 occupies 2 TTIs, the data transmission of the service2 occupies 5 TTIs, and it is known that the user sensing rate of the service1 and the user sensing rate of the service2 are respectively represented as follows:
as can be seen from the comparison in the first embodiment, compared with the service scheduling method using the first scheduling priority obtained by using the existing scheduling algorithm, the service scheduling method using the second scheduling priority obtained by comprehensively considering the data amount of the service transmission buffer and the air interface transmission capability of the user equipment can improve the user perception rate.
In the following, in a second specific embodiment, LTE downlink scheduling is taken as an example for description.
In the second specific embodiment, as shown in fig. 8, it is assumed that there are two Physical Resource Blocks (PRBs) in the system: PRB1 and PRB2, MS1 establishes two services, Service1 and Service2, MS2 establishes one Service3, the rate and data volume information of each Service is shown in Table 1, wherein rMS1,PRB1(t) represents the instantaneous rate, r, of the user equipment MS1 on the PRB1MS1,PRB2(t) represents the instantaneous rate, r, of the user equipment MS1 on the PRB2MS2,PRB1(t) denotes the user equipment MS2 on PRB1Instantaneous rate, rMS2,PRB2(t) represents the instantaneous rate of the user equipment MS2 on PRB 2; r isService1,PRB1(t) represents the instantaneous rate of the Service1 on the PRB1, rService1,PRB2(t) represents the instantaneous rate of the Service1 on the PRB2, rService2,PRB1(t) represents the instantaneous rate of the Service2 on the PRB1, rService2,PRB2(t) represents the instantaneous rate of the Service2 on the PRB2, rService3,PRB1(t) represents the instantaneous rate of the Service3 on the PRB1, rService3,PRB2(t) represents the instantaneous rate of the Service3 on the PRB2, RService1(t) represents the average rate of Service1, RService2(t) represents the average rate of Service2, RService3(t) represents the average rate of Service 3.
TABLE 1
In the second specific embodiment, the first scheduling Priority is obtained according to any one or a combination of instantaneous channel information, average channel information, QoS information of a service, and first packet delay information of the servicei. For example, the PF algorithm is used to calculate the first scheduling priority of each Service1, Service2, Service3 on the PRB1 and PRB2, respectively:
the first scheduling priority of Service1 on PRB1 is:
the first scheduling priority of Service2 on PRB1 is:
the first scheduling priority of Service3 on PRB1 is:
the first scheduling priority of Service1 on PRB2 is:
the first scheduling priority of Service2 on PRB2 is:
the first scheduling priority of Service3 on PRB2 is:
calculating to obtain a weight factor rho according to the data volume in the sending buffer of the service and the actual transmission capability of the user equipment establishing the servicei. In this specific embodiment, the instantaneous rate of the service represents the actual transmission capability of the ue, and the weight factor calculation formula is as follows:
the weight factors ρ of the services Service1, Service2 and Service3 can be obtainedService1、ρService2、ρService3The following were used:
according to the first scheduling Priority of the serviceiAnd a weight factor p for the serviceiObtaining the second scheduling priority of the service in this embodiment, it is assumed that the second scheduling priority calculation formula is:
the second scheduling priority of each Service1, Service2, Service3 on the PRB1 and PRB2 respectively can be obtained:
the second scheduling priority of Service1 on PRB1 is:
the second scheduling priority of Service2 on PRB1 is:
the second scheduling priority of Service3 on PRB1 is:
the second scheduling priority of Service1 on PRB2 is:
the second scheduling priority of Service2 on PRB2 is:
the second scheduling priority of Service3 on PRB2 is:
scheduling each Service according to a second scheduling priority and allocating system resources, wherein PRB1 is allocated to Service2 in the highest priority; since the PRB2 is most preferentially allocated to the Service 2.
Based on the above technical solution, in the embodiment of the present invention, a second scheduling priority of a service is determined according to a data amount of the service in a sending buffer, an air interface transmission capability of a user equipment that establishes the service, and a first scheduling priority of the service, and the service is scheduled according to the second scheduling priority, so that in a limited packet scenario, the data amount of the service in the sending buffer and the air interface transmission capability of the user equipment that establishes the service are comprehensively considered to determine the second scheduling priority, so that a user sensing rate can be effectively increased when the service is scheduled according to the second scheduling priority, and user experience is further improved.
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, 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.
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 (15)

  1. A traffic scheduling apparatus, comprising:
    the system comprises an acquisition unit, a scheduling unit and a scheduling unit, wherein the acquisition unit is used for acquiring a first scheduling priority of a first service;
    a determining unit, configured to determine a second scheduling priority of the first service according to a data amount of the first service in a sending buffer, an air interface transmission capability of a user equipment that establishes the first service, and a first scheduling priority of the first service;
    and the scheduling unit is used for scheduling the first service according to the second scheduling priority.
  2. The apparatus of claim 1, wherein the second scheduling priority of the first service is inversely proportional to an amount of data of the first service in a transmission buffer, proportional to an air interface transmission capability of a user equipment that establishes the service, and proportional to the first scheduling priority of the service;
    alternatively, the first and second electrodes may be,
    the second scheduling priority of the first service is inversely proportional to the data amount of the first service in the transmission buffer and directly proportional to the air interface transmission capability of the user equipment which establishes the first service.
  3. The apparatus of claim 2, wherein the determination unit is specifically configured to:
    determining a weight factor of the first service according to the data volume of the first service in a sending buffer area and the air interface transmission capacity of the user equipment for establishing the first service, wherein the weight factor of the first service is inversely proportional to the data volume in the sending buffer area of the first service and is directly proportional to the air interface transmission capacity of the user equipment for establishing the first service;
    and determining a second scheduling priority of the first service according to the weight factor of the first service and the first scheduling priority of the first service, wherein the second scheduling priority of the first service is in direct proportion to the weight factor of the first service.
  4. The apparatus according to any one of claims 1 to 3, wherein the obtaining unit is specifically configured to:
    determining a first scheduling priority of the first service according to any one or combination of instantaneous channel information, average channel information, quality of service (QoS) information and first packet delay information of the first service; alternatively, the first and second electrodes may be,
    and acquiring the first scheduling priority preset for the first service.
  5. The apparatus of any one of claims 1-4, wherein the scheduling unit is specifically to:
    and scheduling the first service and allocating system resources according to the second scheduling priority from high to low in a scheduling period.
  6. The apparatus of claim 5, wherein the determination unit is further to:
    and after the scheduling unit schedules the first service and allocates system resources in the scheduling period according to the sequence of the second scheduling priority from high to low, the second scheduling priority of the first service is determined again before the next scheduling period comes.
  7. The apparatus of any one of claims 1 to 3, wherein the air interface transmission capability of the user equipment is any one or a combination of instantaneous channel information of the user equipment and average channel information of the user equipment.
  8. A method for scheduling traffic, comprising:
    acquiring a first scheduling priority of a first service;
    determining a second scheduling priority of the first service according to the data volume of the first service in a sending buffer, the air interface transmission capability of user equipment for establishing the first service and the first scheduling priority of the first service;
    and scheduling the first service according to the second scheduling priority.
  9. The method of claim 8, wherein the second scheduling priority of the first service is inversely proportional to an amount of data of the first service in a transmission buffer, directly proportional to an air interface transmission capability of a user equipment that establishes the service, and directly proportional to the first scheduling priority of the service;
    alternatively, the first and second electrodes may be,
    the second scheduling priority of the first service is inversely proportional to the data amount of the first service in the transmission buffer and directly proportional to the air interface transmission capability of the user equipment which establishes the first service.
  10. The method of claim 9, wherein determining the second scheduling priority of the first service according to the data amount of the first service in a transmission buffer, an air interface transmission capability of a user equipment that establishes the first service, and the first scheduling priority of the first service comprises:
    determining a weight factor of the first service according to the data volume of the first service in a sending buffer area and the air interface transmission capacity of the user equipment for establishing the first service, wherein the weight factor of the first service is inversely proportional to the data volume in the sending buffer area of the first service and is directly proportional to the air interface transmission capacity of the user equipment for establishing the first service;
    and determining a second scheduling priority of the first service according to the weight factor of the first service and the first scheduling priority of the first service, wherein the second scheduling priority of the first service is in direct proportion to the weight factor of the first service.
  11. The method of any of claims 8-10, wherein obtaining the first scheduling priority for the first service comprises:
    determining a first scheduling priority of the first service according to any one or combination of instantaneous channel information, average channel information, quality of service (QoS) information and first packet delay information of the first service; alternatively, the first and second electrodes may be,
    and acquiring the first scheduling priority preset for the first service.
  12. The method of any of claims 8-11, wherein scheduling the first traffic according to the second scheduling priority comprises:
    and scheduling the first service and allocating system resources according to the second scheduling priority from high to low in a scheduling period.
  13. The method of claim 12, wherein after scheduling the first traffic and allocating system resources in the scheduling period in order of the second scheduling priority from high to low, the second scheduling priority for the first traffic is re-determined before a next scheduling period comes.
  14. The method according to any one of claims 8 to 10, wherein the air interface transmission capability of the user equipment is any one or a combination of instantaneous channel information of the user equipment and average channel information of the user equipment.
  15. An apparatus comprising a processor and a memory;
    the processor is used for reading a preset program in the memory and executing the following processes according to the program:
    acquiring a first scheduling priority of a first service;
    determining a second scheduling priority of the first service according to the data volume of the first service in a sending buffer, the air interface transmission capability of user equipment for establishing the first service and the first scheduling priority of the first service;
    and scheduling the first service according to the second scheduling priority.
CN201480002667.3A 2014-11-26 2014-11-26 Service scheduling method and device Pending CN105830517A (en)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2014/092240 WO2016082115A1 (en) 2014-11-26 2014-11-26 Service scheduling method and device

Publications (1)

Publication Number Publication Date
CN105830517A true CN105830517A (en) 2016-08-03

Family

ID=56073322

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201480002667.3A Pending CN105830517A (en) 2014-11-26 2014-11-26 Service scheduling method and device

Country Status (6)

Country Link
US (1) US20160278111A1 (en)
EP (1) EP3171655A4 (en)
JP (1) JP2017532888A (en)
KR (1) KR20170043611A (en)
CN (1) CN105830517A (en)
WO (1) WO2016082115A1 (en)

Families Citing this family (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107770736B (en) * 2016-08-18 2021-08-10 中国移动通信集团重庆有限公司 Data service issuing and scheduling method and device
KR102331114B1 (en) 2017-05-25 2021-11-26 삼성전자 주식회사 The method and apparatus for guaranteeing quality of service in wireless communication system
CN107800648B (en) * 2017-10-17 2020-12-08 北京邮电大学 Data packet scheduling method and device
CN110582069B (en) * 2018-06-08 2022-07-19 成都鼎桥通信技术有限公司 Resource allocation method and device based on CBTC (communication based train control) service
US10567983B2 (en) * 2018-07-02 2020-02-18 Ford Global Technologies, Llc Method and apparatus for adaptive network slicing in vehicles
CN111918328A (en) * 2019-05-09 2020-11-10 大唐移动通信设备有限公司 User equipment resource scheduling method and device

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1718002A1 (en) * 2005-04-29 2006-11-02 Siemens S.p.A. User selection method and device for data packet services in wireless communication systems
EP2244516A1 (en) * 2009-04-23 2010-10-27 Alcatel Lucent Relaying data between a base station and user equipment
CN102164417A (en) * 2010-02-21 2011-08-24 株式会社Ntt都科摩 Method and device for determining scheduling priority of terminal
CN102186256A (en) * 2011-05-27 2011-09-14 华南理工大学 Method for determining user priority order in long term evolution (LTE) scheduling
CN102264143A (en) * 2010-05-28 2011-11-30 鼎桥通信技术有限公司 User access adaptive scheduling method and device in TD-SCDMA (Time Division-Synchronization Code Division Multiple Access) system
CN103974436A (en) * 2014-04-18 2014-08-06 大唐移动通信设备有限公司 Adjustment method and device for dispatching priority

Family Cites Families (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP3737353B2 (en) * 2000-09-28 2006-01-18 株式会社エヌ・ティ・ティ・ドコモ COMMUNICATION DEVICE AND COMMUNICATION LINE ALLOCATION METHOD
US7411961B2 (en) * 2002-11-18 2008-08-12 Samsung Electronics Co., Ltd. Apparatus and method for scheduling forward channel transmissions in a wireless network base station
JP2004187237A (en) * 2002-12-06 2004-07-02 Matsushita Electric Ind Co Ltd Base station device, and packet transmission scheduling method
US8098666B2 (en) * 2004-08-12 2012-01-17 Stmicroelectronics, Inc. Method and system for providing a priority-based, low-collision distributed coordination function using a super-frame structure
KR100660054B1 (en) * 2004-09-01 2006-12-20 한국전자통신연구원 Method for Downlink Packet Scheduling using Service Delay Time and Channel State
WO2008001481A1 (en) * 2006-06-29 2008-01-03 Mitsubishi Electric Corporation Communication system, base station, and mobile station
EP2036266B1 (en) * 2006-06-30 2018-08-01 Telefonaktiebolaget LM Ericsson (publ) Enhanced packet service for telecommunications
TWI391911B (en) * 2008-04-15 2013-04-01 Novatek Microelectronics Corp Memory access apparatus and display using the same
US8897237B2 (en) * 2011-04-29 2014-11-25 Motorola Solutions, Inc. Granting scheduling requests in a wireless communication system
JP5347039B2 (en) * 2012-03-06 2013-11-20 株式会社エヌ・ティ・ティ・ドコモ Wireless base station
US20140101312A1 (en) * 2012-10-09 2014-04-10 Transpacific Ip Management Group Ltd. Access allocation in heterogeneous networks
US9396735B2 (en) * 2013-01-03 2016-07-19 Google Inc. System for real time audio processing driven by interrupt and timer event

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1718002A1 (en) * 2005-04-29 2006-11-02 Siemens S.p.A. User selection method and device for data packet services in wireless communication systems
EP2244516A1 (en) * 2009-04-23 2010-10-27 Alcatel Lucent Relaying data between a base station and user equipment
CN102164417A (en) * 2010-02-21 2011-08-24 株式会社Ntt都科摩 Method and device for determining scheduling priority of terminal
CN102264143A (en) * 2010-05-28 2011-11-30 鼎桥通信技术有限公司 User access adaptive scheduling method and device in TD-SCDMA (Time Division-Synchronization Code Division Multiple Access) system
CN102186256A (en) * 2011-05-27 2011-09-14 华南理工大学 Method for determining user priority order in long term evolution (LTE) scheduling
CN103974436A (en) * 2014-04-18 2014-08-06 大唐移动通信设备有限公司 Adjustment method and device for dispatching priority

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
N.NASSER: "A performance comparison of class-based scheduling algorithms in future UMTS access", 《IEEE》 *

Also Published As

Publication number Publication date
EP3171655A1 (en) 2017-05-24
US20160278111A1 (en) 2016-09-22
EP3171655A4 (en) 2017-10-18
JP2017532888A (en) 2017-11-02
WO2016082115A1 (en) 2016-06-02
KR20170043611A (en) 2017-04-21

Similar Documents

Publication Publication Date Title
US20160278111A1 (en) Service scheduling method and device
EP3322241B1 (en) Method for reducing resource conflicts, and ue
WO2012079517A1 (en) Resource scheduling method, apparatus, and base station
WO2011025426A1 (en) Methods and arrangements for allocating scheduling request resources in a wireless communication system
HUE032114T2 (en) Uplink resource allocation in a mobile communication system
CN107872892B (en) Wireless resource allocation method and device
JP5138724B2 (en) Base station and method in mobile communication system
JP5523627B2 (en) Base station and resource allocation method in mobile communication system
JP5651236B2 (en) Base station and resource allocation method in mobile communication system
CN108781375A (en) The method and apparatus of transmitting uplink data
KR101145489B1 (en) Method and apparatus for downlink packet scheduling in a wireless communication system
WO2013026403A1 (en) Resource allocation method and device
CN105474736B (en) Method and device for transmitting data
CN104066197A (en) Real-time low-packet-loss service scheduling method in TD-LTE
CN111436065A (en) Method and equipment for transmitting data and indicating data transmission
JP5179613B2 (en) Base station and scheduling method in mobile communication system
CN107005974B (en) Method, equipment and system for scheduling physical wireless resource blocks
WO2017024464A1 (en) Method for uplink data transmission, base station and terminal
CN107155220B (en) Resource scheduling method and device
EP3503616A1 (en) Multi-air interface communication method and device
CN111385900B (en) Uplink scheduling method and device
US9999098B2 (en) Base station and scheduling method for wireless network
Afrin et al. A packet age based LTE uplink packet scheduler for M2M traffic
CN111385883B (en) Data transmission method and device, storage medium and terminal
EP3198813B1 (en) Method, apparatus and system

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
WD01 Invention patent application deemed withdrawn after publication
WD01 Invention patent application deemed withdrawn after publication

Application publication date: 20160803