WO2016082115A1 - 一种业务调度方法及设备 - Google Patents

一种业务调度方法及设备 Download PDF

Info

Publication number
WO2016082115A1
WO2016082115A1 PCT/CN2014/092240 CN2014092240W WO2016082115A1 WO 2016082115 A1 WO2016082115 A1 WO 2016082115A1 CN 2014092240 W CN2014092240 W CN 2014092240W WO 2016082115 A1 WO2016082115 A1 WO 2016082115A1
Authority
WO
WIPO (PCT)
Prior art keywords
service
scheduling
scheduling priority
user equipment
priority
Prior art date
Application number
PCT/CN2014/092240
Other languages
English (en)
French (fr)
Inventor
李亮亮
Original Assignee
华为技术有限公司
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 华为技术有限公司 filed Critical 华为技术有限公司
Priority to JP2017516300A priority Critical patent/JP2017532888A/ja
Priority to KR1020177007435A priority patent/KR20170043611A/ko
Priority to CN201480002667.3A priority patent/CN105830517A/zh
Priority to PCT/CN2014/092240 priority patent/WO2016082115A1/zh
Priority to EP14903503.2A priority patent/EP3171655A4/en
Priority to US15/166,100 priority patent/US20160278111A1/en
Publication of WO2016082115A1 publication Critical patent/WO2016082115A1/zh

Links

Images

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

Definitions

  • the present invention relates to the field of wireless technologies, and in particular, to a service scheduling method and device.
  • a plurality of user equipments in a cell simultaneously perform uplink or downlink communication with a base station, where each user equipment establishes one or more uplink or downlink services, and each service is composed of one or more data packets.
  • the total length of the data packets corresponding to each service is not the same.
  • the 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 according to user equipment scheduling and system resource allocation.
  • Business the remaining steps are the same.
  • the remaining steps are the same.
  • This paper describes the scheduling and system resource allocation according to each service. According to the scheduling and system resource allocation of each user equipment, one user equipment in this paper can be regarded as one service processing, and the remaining steps are the same.
  • service 1 to service N are uplink or downlink services established by mobile stations MS 1 to MS K, and MS 1 to MS K communicate with the base station through air interfaces, and the scheduler belongs to a part of the base station, and there are many cells in the cell.
  • the scheduler determines the sequence of scheduling of each service and allocates system resources for each service.
  • the scheduler calculates the scheduling priority of each service according to some known parameters (such as instantaneous rate, average rate, service quality of service, first packet delay of the service, etc.) and the scheduling algorithm, and the scheduler performs service scheduling according to the scheduling priority.
  • System resources are allocated, and services with higher priority are preferentially scheduled and system resources are preferentially allocated.
  • the system resource here refers to a resource in a wireless communication system that needs to be allocated to each service or user equipment for establishing each service, for example, a physical channel resource of a Long Term Evalution (LTE) system (physical resource block, pre- Encoding matrix and antenna, etc.)
  • a code channel resource such as Walsh Code, etc.
  • UMTS Universal Mobile Telecommunications System
  • the scheduler calculates the first scheduling priority of each service according to any one or any combination of the instantaneous channel information of the user equipment, the average channel information, the QoS information of the service, and the first packet delay information of the service.
  • the scheduling of the service and the allocation of the system resources are performed according to the first scheduling priority, where the instantaneous channel information or the average channel information of the user equipment refers to the instantaneous channel information or the average channel information of the user equipment that establishes the service.
  • the instantaneous channel information includes instantaneous rate, instantaneous spectral efficiency, instantaneous channel quality index (CQI)/modulation coding scheme (MCS), and instantaneous multiple input multiple output (MIMO) mode.
  • the parameter reflecting the instantaneous channel quality of the user equipment; the average channel information includes an average rate, an average spectral efficiency, an average CQI/MCS, an average MIMO mode, and the like, which can reflect the average channel quality of the user equipment.
  • 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.
  • Classic scheduling algorithms include Proportional Fair (PF) scheduling algorithm, Max-Rate scheduling algorithm, Round Robin (RR) scheduling algorithm, and Maximum-Largest Weighted Delay First. , M-LWDF) scheduling algorithm, EXP/PF (EXPonential/Proportional Fair) scheduling algorithm.
  • r i (t) represents the instantaneous rate of the service or the user equipment establishing the service
  • R i (t) represents the average rate of the service or the user equipment establishing the service
  • Priority i represents the scheduling priority of the service.
  • Equation 1 The PF scheduling algorithm is expressed by Equations 1 and 2 as:
  • the PF scheduling algorithm considers both the instantaneous rate of the user equipment and the average rate of the user equipment, which can ensure the fairness of the user equipment and obtain a good cell rate. performance.
  • Equation 3 The Max-Rate scheduling algorithm is expressed by Equation 3 as:
  • the Max-Rate scheduling algorithm only considers the instantaneous rate of the user equipment, and schedules the user equipment with the highest instantaneous rate each time. Therefore, the cell rate performance is the best, but the user equipment fairness is also the worst.
  • Equation 4 The Round Robin scheduling algorithm is expressed by Equation 4 as:
  • Round Robin scheduling algorithm polling schedules each user equipment to be equal in the opportunity to schedule and allocate system resources, which means that user equipment fairness is the best.
  • Round Rubin scheduling algorithm does not consider the instantaneous rate of the user equipment at all, it is also the worst in cell rate performance.
  • Equation 5 The M-LWDF scheduling algorithm is expressed by Equation 5 as:
  • W i (t) is the first packet delay of service i, ie Packet k ⁇ Service i indicates all the packets belonging to service i, Time Now , Time k, In indicates the time when packet k enters the queue to be scheduled; ⁇ i represents the maximum waiting delay that service i can tolerate, ⁇ i represents the maximum probability that event ⁇ W i (t)> ⁇ i ⁇ can be allowed to occur; M-LWDF scheduling algorithm considers HOL, and considers instantaneous rate and The average rate, therefore, the M-LWDF scheduling algorithm can ensure that the probability of packet loss due to timeout is low, and a better cell rate performance can be obtained while being compatible with the fairness of the user equipment.
  • Equation 6 The EXP/PF scheduling algorithm is expressed by Equation 6 as:
  • Real-time (RT) services are mainly services that are sensitive to delays, such as video and voice services.
  • Non-Real Time (NRT) services are mainly services that are not sensitive to delays, such as File Transfer Protocol (FTP) download service;
  • FTP File Transfer Protocol
  • i ⁇ RT indicates that service i belongs to real-time service;
  • a i and W i (t) have the same definitions;
  • N RT represents the total number of user equipments that have established real-time services;
  • M(t) represents the average number of RT data packets waiting to be scheduled in the cell at time t;
  • ⁇ and k are constants,
  • the EXP/PF scheduling algorithm for a mixed service scenario in which both the RT service and the NRT service exist, the RT service is close to the maximum waiting time delay in the first packet delay, and the scheduling priority is generally higher than the NRT service.
  • the EXP/PF scheduling algorithm can ensure that the first packet delay of the service does not exceed the maximum waiting delay of the service, and the user equipment fairness and the cell rate performance are well balanced.
  • K, ⁇ , ⁇ , and ⁇ are constants.
  • deformation formulas There are many similar deformation formulas, and they are not listed one by one.
  • unlimited package In the Third Generation Partnership Project (3 rd Generation Partnership Project, 3GPP ) are given unlimited package (Full Buffer) define business and limited packages (Non-full buffer) business, which is defined as the upstream business unlimited package or For continuous transmission of downlink service data, the limited packet service is defined as burst transmission of uplink or downlink service data.
  • unlimited package In the Third Generation Partnership Project (3 rd Generation Partnership Project, 3GPP ) are given unlimited package (Full Buffer) define business and limited packages (Non-full buffer) business, which is defined as the upstream business unlimited package or For continuous transmission of downlink service data, the limited packet service is defined as burst transmission of uplink or downlink service data.
  • the above formulas 1-7 are all designed under the infinite packet service, with the instantaneous channel information of the user equipment (such as instantaneous rate or instantaneous spectral efficiency), average channel information (such as average rate or average spectral efficiency), and the first package of services.
  • the delay information and the quality of service (QoS) information are used as inputs to calculate the scheduling priority of each service, and then allocate system resources according to the scheduling priority.
  • the existing scheduling algorithm has a poor user perception rate and affects the user experience.
  • the embodiment of the invention provides a service scheduling method and device for improving a user's perceived rate in a limited packet scenario.
  • a service scheduling apparatus including:
  • An obtaining unit configured to acquire a first scheduling priority of the first service
  • a determining unit configured to determine, according to the amount of data in the sending buffer of the first service, the air interface transmission capability of the user equipment that establishes the first service, and the first scheduling priority of the first service, The second scheduling priority of the service;
  • a scheduling unit 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 amount of data in the sending buffer of the first service, and establishing the service
  • the air interface transmission capability of the user equipment is proportional to and proportional to the first scheduling priority of the service
  • the second scheduling priority of the first service is inversely proportional to the amount of data of the first service in the sending buffer, and is proportional to the air interface transmission capability of the user equipment that establishes the first service.
  • the determining unit is specifically configured to:
  • the factor is inversely proportional to the amount of data in the sending buffer of the first service, and is proportional to the air interface transmission capability of the user equipment that establishes the first service
  • Determining, according to the weighting factor of the first service, the first scheduling priority of the first service, the second scheduling priority of the first service, the second scheduling priority of the first service, and the The weighting factor of a business is proportional.
  • the acquiring unit is specifically configured to:
  • the scheduling unit is specifically configured to:
  • the first service is scheduled and allocated system resources in a scheduling period from high to low in the scheduling period.
  • the determining unit is further configured to:
  • the scheduling unit schedules the first service and allocates system resources in a high-to-low order according to the second scheduling priority in the scheduling period, before the next scheduling period arrives, the first is re-determined.
  • the second scheduling priority of the service is re-determined.
  • the air interface transmission capability of the user equipment is the instantaneous channel information of the user equipment and the user equipment Any one or combination of average channel information.
  • a service scheduling method including:
  • Determining the first service according to the amount of data in the sending buffer of the first service, the air interface transmission capability of the user equipment that establishes the first service, and the first scheduling priority of the first service. Second scheduling priority;
  • the second scheduling priority of the first service is inversely proportional to the amount of data in the sending buffer of the first service, and establishing the service
  • the air interface transmission capability of the user equipment is proportional to and proportional to the first scheduling priority of the service
  • the second scheduling priority of the first service is inversely proportional to the amount of data of the first service in the sending buffer, and is proportional to the air interface transmission capability of the user equipment that establishes the first service.
  • the air interface transmission of the user equipment of the first service is established according to the amount of data in the sending buffer of the first service.
  • the capability and the first scheduling priority of the first service determine a second scheduling priority of the first service, including:
  • Determining, according to the weighting factor of the first service, the first scheduling priority of the first service, the second scheduling priority of the first service, the second scheduling priority of the first service, and the The weighting factor of a business is proportional.
  • the first scheduling priority of the first service is obtained, including:
  • the scheduling, by the second scheduling priority, the first service includes:
  • the first service is scheduled and allocated system resources in a scheduling period from high to low in the scheduling period.
  • the first service is scheduled in a high-to-low order according to the second scheduling priority in the scheduling period. After allocating system resources, the second scheduling priority of the first service is re-determined before the next scheduling period.
  • the air interface transmission capability of the user equipment is the instantaneous channel information of the user equipment and the average channel information of the user equipment. Any one or combination.
  • an apparatus including a processor and a memory;
  • the processor is configured to read a preset program in the memory, and perform the following process according to the program:
  • the second scheduling priority of the service is determined according to the amount of data in the sending buffer, the air interface transmission capability of the user equipment that constructs the service, and the first scheduling priority of the service.
  • the service is scheduled according to the second scheduling priority, so that in the limited packet scenario, the second scheduling priority is determined by comprehensively considering the amount of data in the sending buffer and the air interface transmission capability of the user equipment establishing the service, thereby
  • the second scheduling priority scheduling service can effectively improve the user's perceived rate, thereby improving the user experience.
  • FIG. 1 is a schematic diagram of an existing service scheduling
  • FIG. 2 is a schematic diagram of a conventional scheduler
  • FIG. 3 is a schematic structural diagram of a service scheduling apparatus according to an embodiment of the present invention.
  • FIG. 4 is a schematic structural diagram of a device according to an embodiment of the present invention.
  • FIG. 5 is a schematic diagram of a service scheduling process according to an embodiment of the present invention.
  • 6 is a timing diagram of performing traffic scheduling according to a first scheduling priority
  • FIG. 7 is a schematic timing diagram of performing service scheduling according to a second scheduling priority according to an embodiment of the present invention.
  • FIG. 8 is a schematic diagram of service scheduling in an embodiment of the present invention.
  • the user-aware rate is defined as the total number of bits of the burst service divided by the time required to transmit the burst service, and the time required to transmit the burst service refers to: the first of the bursty services
  • the data packet arrives at the transmission buffer of the base station or the user equipment end as the start time T start , and the last data packet of the burst service is correctly received as the end time T end , and the time required for transmitting the burst service is T end - T start .
  • the scheduling priority may also be for the user equipment; in the multi-carrier system, the scheduling priority of the same service in different sub-channels may also be Different, the scheduling priority of the service in this case may be for a specific subchannel.
  • the basic unit in which the service is scheduled is described.
  • the process of scheduling in units of sub-channels of user equipment or services is the same as the process of scheduling in units of services.
  • the service scheduling apparatus mainly includes:
  • the obtaining unit 301 is configured to acquire a first scheduling priority of the first service.
  • the determining unit 302 is configured to determine, according to the amount of data in the sending buffer of the first service, the air interface transmission capability of the user equipment that establishes the first service, and the first scheduling priority of the first service. a second scheduling priority of a service;
  • the scheduling unit 303 is 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 amount of data of the first service in the sending buffer, and is proportional to the air interface transmission capability of the user equipment that establishes the service, and The first scheduling priority of the service is proportional to;
  • the second scheduling priority of the first service is inversely proportional to the amount of data of the first service in the sending buffer, and is proportional to the air interface transmission capability of the user equipment that establishes the first service.
  • the determining unit 302 is specifically configured to:
  • Determining, according to the weighting factor of the first service, the first scheduling priority of the first service, the second scheduling priority of the first service, the second scheduling priority of the first service, and the The weighting factor of a business is proportional.
  • the obtaining unit 301 is specifically configured to:
  • the scheduling unit 303 is specifically configured to:
  • the determining unit 302 is further configured to:
  • the scheduling unit 303 schedules the first service and allocates system resources in a high-to-low order according to the second scheduling priority in the scheduling period, before the next scheduling period arrives, the first determining is performed.
  • the second scheduling priority of a service is performed.
  • an embodiment of the present invention further provides a device, which mainly includes a processor 401 and a memory 402, and the processor 401 is configured to read a preset program in the memory 402, according to The program performs the following process:
  • the second scheduling priority of the first service is inversely proportional to the amount of data of the first service in the sending buffer, and is proportional to the air interface transmission capability of the user equipment that establishes the service, and The first scheduling priority of the service is proportional to;
  • the second scheduling priority of the first service is inversely proportional to the amount of data of the first service in the sending buffer, and is proportional to the air interface transmission capability of the user equipment that establishes the first service.
  • the processor 401 determines, according to the data volume of the first service in the sending buffer, the air interface transmission capability of the user equipment of the first service, the weighting factor of the first service, the first service
  • the weighting factor is inversely proportional to the amount of data in the sending buffer of the first service, and is proportional to the air interface transmission capability of the user equipment that establishes the first service;
  • Determining, according to the weighting factor of the first service, the first scheduling priority of the first service, the second scheduling priority of the first service, the second scheduling priority of the first service, and the The weighting factor of a business is proportional.
  • the processor 401 is configured according to the instantaneous channel information, the average channel information of the first service, Determining, by any one or combination of the QoS information and the first packet delay information, a first scheduling priority of the first service; or
  • the processor 401 schedules the first service and allocates system resources in a scheduling period from high to low in a scheduling period.
  • the processor 401 re-determines the first service period after scheduling the first service and allocating system resources in a high-to-low order according to the second scheduling priority in the scheduling period.
  • the second scheduling priority of a service is a service that is allocated to the first service.
  • the detailed method for performing service scheduling is as follows:
  • Step 501 Acquire a first scheduling priority of the first service.
  • the first scheduling priority of each service is obtained in the same manner as the first scheduling priority of the first service.
  • the first scheduling priority of the first service may be obtained in multiple manners, including but not limited to:
  • Determining a first scheduling priority of the 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 Level; or,
  • the first scheduling priority of the first service may be calculated by using a classical scheduling algorithm such as a PF scheduling algorithm, a Max-Rate scheduling algorithm, a Round Robin scheduling algorithm, an M-LWDF scheduling algorithm, or an EXP/PF scheduling algorithm, or The first scheduling priority of the first service is calculated by using a variant algorithm of the classical scheduling algorithm, or may be a first scheduling priority of the first service.
  • a classical scheduling algorithm such as a PF scheduling algorithm, a Max-Rate scheduling algorithm, a Round Robin scheduling algorithm, an M-LWDF scheduling algorithm, or an EXP/PF scheduling algorithm
  • the present invention does not limit the manner in which the first scheduling priority of the first service is obtained, and all the manners for obtaining the first scheduling priority of the first service that can be obtained by those skilled in the art without creative work can be applied to the present invention. .
  • Step 502 Determine, according to the data volume of the first service in the sending buffer, the air interface transmission capability of the user equipment that establishes the first service, and the first scheduling priority of the first service, The second scheduling priority.
  • the second scheduling priority of each service is determined in the same manner as the second scheduling priority of the first service.
  • the second scheduling priority of the first service is inversely proportional to the amount of data of the first service in the sending buffer, and is proportional to the air interface transmission capability of the user equipment that establishes the first service, and is related to the first service.
  • the first scheduling priority is proportional to;
  • the second scheduling priority of the first service is inversely proportional to the amount of data of the first service in the sending buffer, and is proportional to the air interface transmission capability of the user equipment that establishes the first service.
  • the second scheduling priority of the first service is inversely proportional to the amount of data of the first service in the sending buffer, and the The air interface transmission capability of the user equipment of the first service is directly proportional.
  • the amount of data in the sending buffer of the first service is specifically: the number of data bits waiting to be transmitted by the first service in the buffer of the base station side during downlink transmission, or the number of data buffers in the user equipment side buffer during uplink transmission The number of data bits a service is waiting to transmit.
  • 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 information (average rate).
  • the weighting factor of the first service, the weighting factor of the first service, and the first service are determined according to the amount of data in the sending buffer of the first service, and the air interface transmission capability of the user equipment that establishes the first service.
  • the amount of data in the transmit buffer is inversely proportional to the air interface transmission capability of the user equipment that establishes the first service;
  • the specific conversion relationship between the weighting factor and the amount of data in the sending buffer and the air interface transmission capability of the user equipment is not limited, and only the weighting factor is inversely proportional to the amount of data in the sending buffer of the service. And it can be applied to the present invention in proportion to the air interface transmission capability of the user equipment that establishes the service.
  • the service i weighting factor is expressed as ⁇ i
  • the amount of data in the transmission buffer of service i is represented as ⁇ i
  • the air interface transmission capability of the user equipment establishing service i is expressed as ⁇ i
  • the weighting factor can be expressed by the formula as:
  • the specific switching relationship between the second scheduling priority and the weighting factor and the first scheduling priority is not limited, and only the second scheduling priority is required to be proportional to the weighting factor, and the first scheduling is performed.
  • the priority is directly proportional to the present invention.
  • the weighting factor of service i is represented as ⁇ i
  • the first scheduling priority of service i is represented as Priority i
  • the second scheduling priority of service i is represented as Then the second scheduling priority can be expressed by the formula: or, or, or, or, or, or, Etc., where a, b, c, and d are non-zero positive real numbers, and e is a real number. This is only an example.
  • the relationship between the second scheduling priority and the first scheduling priority and the weighting factor in the specific implementation is not limited thereto.
  • Step 503 Schedule the first service according to the second scheduling priority.
  • the first service is scheduled and allocated system resources in a current scheduling period in descending order of the second scheduling priority.
  • the user equipment with the second scheduling priority among the multiple services to be scheduled is preferentially scheduled and prioritized to allocate system resources.
  • the second scheduling priority of the first service is re-determined before the next scheduling period arrives.
  • the first service is scheduled according to the re-determined second scheduling priority and the system resources are allocated in the scheduling period.
  • the following is a description of the manner in which the first scheduling priority obtained by using the existing scheduling algorithm is used for scheduling, and the scheduling is performed by using the second scheduling priority in the embodiment of the present invention.
  • TTI transmission time interval
  • service 1 has 1000 bits, and considering the amount of transmission buffer data and air interface transmission capacity, the data transmission of service 1 requires two TTIs.
  • service 2 also has 1000 bits, and comprehensively considers the amount of transmission buffer data and air interface transmission capacity, and the data transmission of service 2 requires three TTIs.
  • TTI transmission time interval
  • the first scheduling priority is calculated by using the existing scheduling algorithm, and the scheduling is performed according to the first scheduling priority.
  • a typical scheduling sequence diagram is shown in Figure 6:
  • the data of Service 1 and Service 2 arrive at the same time in TTI 1, and the service 1 is scheduled in TTI 2 and TTI4 (Service 1 needs to transmit 2 TTIs, so Service 1 is scheduled in TTI 4, and the entire transmission time of Service 1 is TTI 1 To TTI 4), traffic 2 is scheduled in TTI 1, TTI 3, and TTI 5 (Service 2 needs to transmit 3 TTIs, so Service 2 is scheduled in TTI 5, and the entire transmission time of Service 2 is TTI 1 to TTI 5).
  • the data transmission of service 1 occupies 4 TTIs, and the data transmission of service 2 occupies 5 TTIs.
  • the user perceptual rate PerceivedRate Service1 and service of service 1 are calculated.
  • the user-aware rate of PerceivedRate Service2 is expressed as:
  • the service with the shortest transmission time can be preferentially scheduled.
  • the data transmission of service 1 occupies 2 TTIs
  • the data transmission of service 2 occupies 5 TTIs.
  • user-aware rate of service 2 Expressed as:
  • the manner of performing service scheduling with respect to the first scheduling priority obtained by using the existing scheduling algorithm is obtained by comprehensively considering the amount of the transmission buffer data of the service and the air interface transmission capability of the user equipment.
  • the second scheduling priority is used for service scheduling, Can increase the user's perceived rate.
  • the LTE downlink scheduling is taken as an example for description.
  • PRBs physical resource blocks
  • PRB1 and PRB2 the mobile station MS1 establishes two services Service1 and Service2, and MS2 is established.
  • r MS1, PRB1 (t) represents the instantaneous rate of user equipment MS1 on PRB1, r MS1, PRB2 (t) represents user equipment MS1
  • the instantaneous rate on PRB2, r MS2, PRB1 (t) represents the instantaneous rate of user equipment MS2 on PRB1, r MS2, PRB2 (t) represents the instantaneous rate of user equipment MS2 on PRB2
  • r Service1, PRB1 (t) Indicates the instantaneous rate of service Service1 on PRB1, r Service1, PRB2 (t) indicates the instantaneous rate of service Service1 on PRB2, r Service2, PRB1 (t) indicates the instantaneous rate of service
  • the first scheduling priority Priority i is obtained according to any one or combination of the instantaneous channel information, the average channel information, the QoS information of the service, and the first packet delay information of the service.
  • the PF algorithm is used to calculate the first scheduling priority of each service Service1, Service2, and Service3 on PRB1 and PRB2:
  • 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:
  • the weighting factor ⁇ i is calculated according to the amount of data in the sending buffer of the service and the actual transmission capacity of the user equipment establishing the service.
  • the actual transmission capacity of the user equipment is represented by the instantaneous rate of the service, and the weighting factor calculation formula is:
  • the weighting factors ⁇ Service1 , ⁇ Service2 , and ⁇ Service3 of each service Service1, Service2, and Service3 are obtained as follows:
  • the second scheduling priority calculation formula is assumed to be:
  • the second scheduling priority of each service Service1, Service2, and Service3 on PRB1 and PRB2 is 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:
  • PRB1 is assigned the highest priority to the service Service2; Therefore, PRB2 is assigned the highest priority to the service Service2.
  • the second scheduling priority of the service is determined according to the amount of data in the sending buffer, the air interface transmission capability of the user equipment that constructs the service, and the first scheduling priority of the service.
  • the service is scheduled according to the second scheduling priority, so that in the limited packet scenario, the second scheduling priority is determined by comprehensively considering the amount of data in the sending buffer and the air interface transmission capability of the user equipment establishing the service, thereby
  • the second scheduling priority scheduling service can effectively improve the user's perceived rate, thereby improving the user experience.
  • embodiments of the present invention can 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 a combination of software and hardware. Moreover, the invention can take the form of a computer program product embodied on one or more computer-usable storage media (including but not limited to disk storage and optical storage, etc.) including computer usable program code.
  • the computer program instructions can also be stored in a computer readable memory that can direct a computer or other programmable data processing device to operate in a particular manner, such that the instructions stored in the computer readable memory produce an article of manufacture comprising the instruction device.
  • the apparatus implements the functions specified in one or more blocks of a flow or a flow and/or block diagram of the flowchart.
  • These computer program instructions can also be loaded onto a computer or other programmable data processing device such that a series of operational steps are performed on a computer or other programmable device to produce computer-implemented processing for execution on a computer or other programmable device.
  • the instructions provide steps for implementing the functions specified in one or more of the flow or in a block or blocks of a flow diagram.

Landscapes

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

Abstract

本发明公开了一种业务调度方法及装置，用以在有限包场景下提高用户感知速率。该装置主要包括：获取单元，用于获取第一业务的第一调度优先级；确定单元，用于根据所述第一业务在发送缓冲区中的数据量、建立所述第一业务的用户设备的空口传输能力以及所述第一业务的第一调度优先级确定所述第一业务的第二调度优先级；调度单元，用于根据所述第二调度优先级调度所述第一业务。

Description

一种业务调度方法及设备 技术领域
本发明涉及无线技术领域，尤其涉及一种业务调度方法及设备。
背景技术
无线通信系统中，一个小区中会存在多个用户设备同时和基站进行上行或下行通信，其中，每个用户设备建立一条或多条上行或下行业务，每条业务由一个或多个数据包组成且每条业务对应的数据包的总长度并不相同。基站的调度器按照每条业务进行调度和系统资源的分配，或者按照每个用户设备进行调度和系统资源的分配，其中，按照用户设备进行调度和系统资源分配时可将一个用户设备看作一条业务，其余步骤相同。特别地，当每个用户设备都只建立了一条业务时，按用户设备调度和按业务调度是完全等价的。本文采用按照每条业务进行调度和系统资源分配的方式进行叙述，按照每个用户设备进行调度和系统资源分配的方式可将本文中的一个用户设备看作一条业务处理，其余步骤相同。
如图1所示，业务1～业务N为移动站MS 1～MS K建立的上行或下行业务，MS 1～MS K通过空口和基站进行通信，调度器属于基站的一部分，当小区内有多条业务(属于一个或多个用户设备)在等待分配系统资源进行数据传输时，由调度器决定各条业务的先后调度次序以及为各业务分配系统资源。
调度器根据一些已知参数(例如瞬时速率、平均速率、业务的服务质量、业务的首包时延等)和调度算法计算每条业务的调度优先级，调度器根据调度优先级进行业务调度并分配系统资源，优先级较高的业务优先调度且优先分配系统资源。这里的系统资源指无线通信系统中有限的、需要分配给各业务或建立各业务的用户设备使用的资源，例如，长期演进(Long Term Evalution，LTE)系统的物理信道资源(物理资源块、预编码矩阵以及天线等)、 通用移动通信系统(Universal Mobile Telecommunications System，UMTS)的码道资源(如Walsh Code等)。
如图2所示，调度器根据用户设备的瞬时信道信息、平均信道信息、业务的QoS信息、业务的首包时延信息等中的任意一种或任意组合计算每条业务的第一调度优先级，根据第一调度优先级为每条业务进行调度和系统资源的分配，其中用户设备的瞬时信道信息或平均信道信息指建立该条业务的用户设备的瞬时信道信息或平均信道信息。瞬时信道信息包括瞬时速率、瞬时频谱效率、瞬时信道质量标识(Channel Quantity Index，CQI)/调制编码方式(Modulation Code Scheme，MCS)、瞬时多输入多输出(Multiple Input Multiple Output，MIMO)模式等能反映用户设备瞬时信道质量的参数；平均信道信息包括平均速率、平均频谱效率、平均CQI/MCS、平均MIMO模式等能反映用户设备平均信道质量的参数。
调度器一般可分为上行调度器和下行调度器，上行调度器和下行调度器在采用的调度算法上并无差异。经典的调度算法包括比例公平(Proportional Fair，PF)调度算法、最大速率(Max-Rate)调度算法、轮询(Round Robin，RR)调度算法、最大权值时延优先(Maximum-Largest Weighted Delay First，M-LWDF)调度算法、EXP/PF(EXPonential/Proportional Fair)调度算法。
以下各算法中，假设ri(t)表示业务或建立该业务的用户设备的瞬时速率、Ri(t)表示业务或建立该业务的用户设备的平均速率、Priorityi表示业务的调度优先级。
PF调度算法用公式1、2表示为：
Figure PCTCN2014092240-appb-000001
Figure PCTCN2014092240-appb-000002
其中，T为常数，PF调度算法既考虑了用户设备的瞬时速率，又兼顾了用户设备的平均速率，既能保证用户设备公平性，又能得到良好的小区速率 性能。
Max-Rate调度算法用公式3表示为：
Priorityi＝ri(t)      (3)
Max-Rate调度算法只考虑用户设备的瞬时速率，每次都调度瞬时速率最大的用户设备，因此在小区速率性能上是最好的，但用户设备公平性却也是最差的。
Round Robin调度算法用公式4表示为：
Figure PCTCN2014092240-appb-000003
Round Robin调度算法中轮询调度每个用户设备在调度和分配系统资源的机会上是均等的，这意味着用户设备公平性是最好的。但由于Round Rubin调度算法完全不考虑用户设备的瞬时速率，因此在小区速率性能上也是最差的。
M-LWDF调度算法用公式5表示为：
Figure PCTCN2014092240-appb-000004
Wi(t)为业务i的首包时延，即
Figure PCTCN2014092240-appb-000005
Packet k∈Service i表示所有属于业务i的数据包，TimeNow当前时刻，Timek,In表示数据包k进入待调度队列的时刻；
Figure PCTCN2014092240-appb-000006
τi表示业务i可忍受的最大等待时延，δi表示事件{Wi(t)>τi}可允许发生的最大概率；M-LWDF调度算法即考虑了HOL，又考虑了瞬时速率和平均速率，因此M-LWDF调度算法既能保证因为超时而丢包的概率较低、又能在兼容用户设备公平性的同时得到一个较好的小区速率性能。
EXP/PF调度算法用公式6表示为：
Figure PCTCN2014092240-appb-000007
实时(Real Time，RT)业务，主要是对时延比较敏感的业务，如视频、语音等业务；非实时(Non-Real Time，NRT)业务，主要是对时延不怎么敏感的业务，如文件传输协议(File Transfer Protocol，FTP)下载业务；i∈RT表示业务i属于实时业务；ai和Wi(t)的定义同上；
Figure PCTCN2014092240-appb-000008
NRT表示建立了实时业务的用户设备总个数；M(t)表示在时刻t小区内等待调度的RT数据包的平均个数；
Figure PCTCN2014092240-appb-000009
ε和k为常数、
Figure PCTCN2014092240-appb-000010
EXP/PF调度算法中，对于同时存在RT业务和NRT业务的混合业务场景，RT业务在首包时延接近最大等待时延时，调度优先级一般比NRT业务要高。EXP/PF调度算法在混合业务场景，既能很好地保证业务的首包时延尽可能不超过该业务的最大等待时延，又能很好地兼顾用户设备公平性和小区速率性能。
除了以上经典调度算法，还有一些其他变形，如公式7所示：
Figure PCTCN2014092240-appb-000011
其中，K、α、β、λ为常数。类似变形公式较多，不再一一列举。
在第三代合作伙伴计划(3rd Generation Partnership Project，3GPP)中，给出了无限包(Full Buffer)业务和有限包(Non-full buffer)业务的定义，其中，无限包业务定义为上行或下行业务数据的连续传输，有限包业务定义为上行或下行业务数据的突发传输。
上述公式1～7都是在无限包业务下设计出来的，以用户设备的瞬时信道信息(如瞬时速率或瞬时频谱效率)、平均信道信息(如平均速率或平均频谱效率)以及业务的首包时延信息和服务质量(Quality of Service，QoS)信息等作为输入去计算每条业务的调度优先级，然后按调度优先级为业务分配系统资源。
现有的调度算法在有限包场景中，用户感知速率较差，影响用户体验。
发明内容
本发明实施例提供一种业务调度方法及设备，用以在有限包场景下提高用户感知速率。
本发明实施例提供的具体技术方案如下：
第一方面，提供了一种业务调度装置，包括：
获取单元，用于获取第一业务的第一调度优先级；
确定单元，用于根据所述第一业务在发送缓冲区中的数据量、建立所述第一业务的用户设备的空口传输能力以及所述第一业务的第一调度优先级确定所述第一业务的第二调度优先级；
调度单元，用于根据所述第二调度优先级调度所述第一业务。
结合第一方面，在第一种可能的实现方式中，所述第一业务的第二调度优先级与所述第一业务在发送缓冲区中的数据量成反比、与建立所述一业务的用户设备的空口传输能力成正比，且与所述业务的第一调度优先级成正比；
或者，
所述第一业务的第二调度优先级与所述第一业务在发送缓冲区中的数据量成反比、与建立所述第一业务的用户设备的空口传输能力成正比。
结合第一方面的第一种可能的实现方式，在第二种可能的实现方式中，所述确定单元具体用于：
根据所述第一业务在发送缓冲区中的数据量、建立所述第一业务的用户设备的空口传输能力，确定所述第一业务的权重因子，所述第一业务的权重 因子与所述第一业务的发送缓冲区中的数据量成反比，且与建立所述第一业务的用户设备的空口传输能力成正比；
根据所述第一业务的权重因子和所述第一业务的第一调度优先级，确定所述第一业务的第二调度优先级，所述第一业务的第二调度优先级与所述第一业务的权重因子成正比。
结合第一方面至第二种可能的实现方式中的任意一种，在第三种可能的实现方式中，述获取单元具体用于：
根据所述第一业务的瞬时信道信息、平均信道信息、服务质量QoS信息和首包时延信息中的任意一种或组合确定所述第一业务的第一调度优先级；或者，
获取针对所述第一业务预设的所述第一调度优先级。
结合第一方面至第三种可能的实现方式中的任意一种，在第四种可能的实现方式中，所述调度单元具体用于：
在调度周期内按所述第二调度优先级从高到低的顺序调度所述第一业务并分配系统资源。
结合第一方面的第四种可能的实现方式，在第五种可能的实现方式中，所述确定单元还用于：
在所述调度单元在所述调度周期内按所述第二调度优先级从高到低的顺序调度所述第一业务并分配系统资源之后，在下一个调度周期到来之前，重新确定所述第一业务的第二调度优先级。
结合第一方面至第二种可能的实现方式中的任意一种，在第六种可能的实现方式中，所述用户设备的空口传输能力为所述用户设备的瞬时信道信息和所述用户设备的平均信道信息中的任意一种或组合。
第二方面，提供了一种业务调度方法，包括：
获取第一业务的第一调度优先级；
根据所述第一业务在发送缓冲区中的数据量、建立所述第一业务的用户设备的空口传输能力以及所述第一业务的第一调度优先级确定所述第一业务 的第二调度优先级；
根据所述第二调度优先级调度所述第一业务。
结合第二方面，在第一种可能的实现方式中，所述第一业务的第二调度优先级与所述第一业务在发送缓冲区中的数据量成反比、与建立所述一业务的用户设备的空口传输能力成正比，且与所述业务的第一调度优先级成正比；
或者，
所述第一业务的第二调度优先级与所述第一业务在发送缓冲区中的数据量成反比、与建立所述第一业务的用户设备的空口传输能力成正比。
结合第二方面的第一种可能的实现方式，在第二种可能的实现方式中，根据所述第一业务在发送缓冲区中的数据量、建立所述第一业务的用户设备的空口传输能力以及所述第一业务的第一调度优先级确定所述第一业务的第二调度优先级，包括：
根据所述第一业务在发送缓冲区中的数据量、建立所述第一业务的用户设备的空口传输能力，确定所述第一业务的权重因子，所述第一业务的权重因子与所述第一业务的发送缓冲区中的数据量成反比，且与建立所述第一业务的用户设备的空口传输能力成正比；
根据所述第一业务的权重因子和所述第一业务的第一调度优先级，确定所述第一业务的第二调度优先级，所述第一业务的第二调度优先级与所述第一业务的权重因子成正比。
结合第二方面至第二种可能的实现方式，在第三种可能的实现方式中，获取所述第一业务的第一调度优先级，包括：
根据所述第一业务的瞬时信道信息、平均信道信息、服务质量QoS信息和首包时延信息中的任意一种或组合确定所述第一业务的第一调度优先级；或者，
获取针对所述第一业务预设的所述第一调度优先级。
结合第二方面至第三种可能的实现方式，在第四种可能的实现方式中，根据所述第二调度优先级调度所述第一业务，包括：
在调度周期内按所述第二调度优先级从高到低的顺序调度所述第一业务并分配系统资源。
结合第二方面的第四种可能的实现方式，在第五种可能的实现方式中，在所述调度周期内按所述第二调度优先级从高到低的顺序调度所述第一业务并分配系统资源之后，在下一个调度周期到来之前，重新确定所述第一业务的第二调度优先级。
结合第二方面至第二种可能的实现方式，在第六种可能的实现方式中，所述用户设备的空口传输能力为所述用户设备的瞬时信道信息和所述用户设备的平均信道信息中的任意一种或组合。
第三方面，提供了一种设备，包括处理器和存储器；
所述处理器用于读取所述存储器中预设的程序，按照所述程序执行以下过程：
获取第一业务的第一调度优先级；
根据所述第一业务在发送缓冲区中的数据量、建立所述第一业务的用户设备的空口传输能力以及所述第一业务的第一调度优先级确定所述第一业务的第二调度优先级；
根据所述第二调度优先级调度所述第一业务。
基于上述技术方案，本发明实施例中，根据业务在发送缓冲区中的数据量、建该业务的用户设备的空口传输能力以及该业务的第一调度优先级确定该业务的第二调度优先级，按照第二调度优先级调度该业务，从而在有限包场景中，综合考虑业务在发送缓冲区中的数据量以及建立该业务的用户设备的空口传输能力确定第二调度优先级，从而在按照第二调度优先级调度业务时能够有效提高用户感知速率，进而改善用户体验。
附图说明
图1为现有的业务调度示意图；
图2为现有的调度器原理示意图；
图3为本发明实施例中业务调度装置结构示意图；
图4为本发明实施例中设备结构示意图；
图5为本发明实施例中业务调度流程示意图；
图6为按照第一调度优先级进行业务调度的时序示意图；
图7为本发明实施例中按照第二调度优先级进行业务调度的时序示意图；
图8为本发明实施例中业务调度示意图。
具体实施方式
为了使本发明的目的、技术方案和优点更加清楚，下面将结合附图对本发明作进一步地详细描述，显然，所描述的实施例仅仅是本发明一部分实施例，而不是全部的实施例。基于本发明中的实施例，本领域普通技术人员在没有做出创造性劳动前提下所获得的所有其它实施例，都属于本发明保护的范围。
在现实的无线网络中都是有限包场景，业务的数据包个数和长度都是有限的。在有限包场景中，用户感知速率定义为突发业务的总比特数除以传输该突发业务所需要的时间，传输该突发业务所需要的时间是指：该突发业务的第一个数据包到达基站端或用户设备端的发送缓冲区作为起始时间Tstart，该突发业务的最后一个数据包被正确接收作为结束时间Tend，传输该突发业务所需要的时间为Tend-Tstart。
以下各实施例中，在按照每个用户设备进行调度和系统资源分配的情况下，调度优先级也可以是针对用户设备的；在多载波系统中同一业务在不同子信道的调度优先级也可以不相同，该情况下业务的调度优先级可以是针对某一具体子信道的。以下各实施例中以业务为调度的基本单位进行说明，对于以用户设备或业务的子信道为单位进行调度的过程与以业务为单位进行调度的过程相同，本领域技术人员应该明白，只要是需要对按照调度优先级进行调度的场合，均可应用以下各实施例所提供的技术方案。
本发明实施例中，如图3所示，业务调度装置主要包括：
获取单元301，用于获取第一业务的第一调度优先级；
确定单元302，用于根据所述第一业务在发送缓冲区中的数据量、建立所述第一业务的用户设备的空口传输能力以及所述第一业务的第一调度优先级确定所述第一业务的第二调度优先级；
调度单元303，用于根据所述第二调度优先级调度所述第一业务。
其中，所述第一业务的第二调度优先级与所述第一业务在发送缓冲区中的数据量成反比、与建立所述一业务的用户设备的空口传输能力成正比，且与所述业务的第一调度优先级成正比；
或者，
所述第一业务的第二调度优先级与所述第一业务在发送缓冲区中的数据量成反比、与建立所述第一业务的用户设备的空口传输能力成正比。
优选地，所述确定单元302具体用于：
根据所述第一业务在发送缓冲区中的数据量、建立所述第一业务的用户设备的空口传输能力，确定所述第一业务的权重因子，所述第一业务的权重因子与所述第一业务的发送缓冲区中的数据量成反比，且与建立所述第一业务的用户设备的空口传输能力成正比；
根据所述第一业务的权重因子和所述第一业务的第一调度优先级，确定所述第一业务的第二调度优先级，所述第一业务的第二调度优先级与所述第一业务的权重因子成正比。
优选地，所述获取单元301具体用于：
根据所述第一业务的瞬时信道信息、平均信道信息、服务质量QoS信息和首包时延信息中的任意一种或组合确定所述第一业务的第一调度优先级；或者，
获取针对所述第一业务预设的所述第一调度优先级。
优选地，所述调度单元303具体用于：
在调度周期内按所述第二调度优先级从高到低的顺序调度所述第一业务 并分配系统资源。
优选地，所述确定单元302还用于：
在所述调度单元303在所述调度周期内按所述第二调度优先级从高到低的顺序调度所述第一业务并分配系统资源之后，在下一个调度周期到来之前，重新确定所述第一业务的第二调度优先级。
基于同一发明构思，如图4所示，本发明实施例中还提供了一种设备，该设备主要包括处理器401和存储器402，处理器401用于读取存储器402中预设的程序，按照该程序执行以下过程：
获取第一业务的第一调度优先级；
根据所述第一业务在发送缓冲区中的数据量、建立所述第一业务的用户设备的空口传输能力以及所述第一业务的第一调度优先级确定所述第一业务的第二调度优先级；
根据所述第二调度优先级调度所述第一业务。
其中，所述第一业务的第二调度优先级与所述第一业务在发送缓冲区中的数据量成反比、与建立所述一业务的用户设备的空口传输能力成正比，且与所述业务的第一调度优先级成正比；
或者，
所述第一业务的第二调度优先级与所述第一业务在发送缓冲区中的数据量成反比、与建立所述第一业务的用户设备的空口传输能力成正比。
优选地，处理器401根据所述第一业务在发送缓冲区中的数据量、建立所述第一业务的用户设备的空口传输能力，确定所述第一业务的权重因子，所述第一业务的权重因子与所述第一业务的发送缓冲区中的数据量成反比，且与建立所述第一业务的用户设备的空口传输能力成正比；
根据所述第一业务的权重因子和所述第一业务的第一调度优先级，确定所述第一业务的第二调度优先级，所述第一业务的第二调度优先级与所述第一业务的权重因子成正比。
优选地，处理器401根据所述第一业务的瞬时信道信息、平均信道信息、 服务质量QoS信息和首包时延信息中的任意一种或组合确定所述第一业务的第一调度优先级；或者，
获取针对所述第一业务预设的所述第一调度优先级。
优选地，处理器401在调度周期内按所述第二调度优先级从高到低的顺序调度所述第一业务并分配系统资源。
优选地，处理器401在所述调度周期内按所述第二调度优先级从高到低的顺序调度所述第一业务并分配系统资源之后，在下一个调度周期到来之前，重新确定所述第一业务的第二调度优先级。
基于同一发明构思，本发明实施例中，如图5所示，进行业务调度的详细方法流程如下：
步骤501：获取第一业务的第一调度优先级。
其中，在有多个业务时，分别获取每个业务的的第一调度优先级，每个业务的第一调度优先级的获取方式与第一业务的第一调度优先级的获取方式相同。
其中，第一业务的第一调度优先级可以通过多种方式获取，包括但不限于：
根据第一业务的瞬时信道信息(瞬时速率)、平均信道信息(平均速率)、服务质量(QoS)信息和首包时延信息中的任意一种或组合确定该第一业务的第一调度优先级；或者，
获取针对该第一业务预设的第一调度优先级。
具体实施中，可以采用PF调度算法、Max-Rate调度算法、Round Robin调度算法、M-LWDF调度算法、EXP/PF调度算法等经典调度算法计算得到第一业务的第一调度优先级，也可以采用经典调度算法的变形算法计算得到第一业务的第一调度优先级，也可以是预先指定第一业务的第一调度优先级。
其中，第一调度优先级可以是任意正常数，例如，第一调度优先级Priorityi＝1。
本发明并不限定第一业务的第一调度优先级的获取方式，对于本领域技术人员不经过创造性劳动即可获得的所有获取第一业务的第一调度优先级的方式均可应用于本发明。
步骤502：根据所述第一业务在发送缓冲区中的数据量、建立所述第一业务的用户设备的空口传输能力以及所述第一业务的第一调度优先级确定所述第一业务的第二调度优先级。
其中，在有多个业务时，每个业务的第二调度优先级的确定方式同第一业务的第二调度优先级的确定方式。
其中，第一业务的第二调度优先级与该第一业务在发送缓冲区中的数据量成反比、与建立该第一业务的用户设备的空口传输能力成正比，且与该第一业务的第一调度优先级成正比；
或者，
第一业务的第二调度优先级与该第一业务在发送缓冲区中的数据量成反比、与建立该第一业务的用户设备的空口传输能力成正比。
具体地，在第一业务的第一调度优先级为任意预设的正常数时，第一业务的第二调度优先级与该第一业务在发送缓冲区中的数据量成反比、与建立该第一业务的用户设备的空口传输能力成正比即可。
具体实施中，第一业务在发送缓冲区中的数据量具体指：下行传输时基站侧缓冲区中该第一业务等待传输的数据比特数，或者，上行传输时用户设备侧缓冲区中该第一业务等待传输的数据比特数。
其中，用户设备的空口传输能力具体可以是瞬时信道信息(瞬时速率)和平均信息信息(平均速率)中的任意一种或组合。
优选地，根据第一业务在发送缓冲区中的数据量、建立该第一业务的用户设备的空口传输能力，确定该第一业务的权重因子，该第一业务的权重因子与该第一业务的发送缓冲区中的数据量成反比，且与建立该的第一业务的用户设备的空口传输能力成正比；
根据该第一业务的权重因子和该第一业务的第一调度优先级，确定该第 一业务的第二调度优先级，该第一业务的第二调度优先级与该第一业务的权重因子成正比。
本发明实施例中，不限定权重因子与发送缓冲区中的数据量和用户设备的空口传输能力之间的具体转换关系，只需满足权重因子与该业务的发送缓冲区中的数据量成反比，且与建立该业务的用户设备的空口传输能力成正比即可应用于本发明。
例如，业务i权重因子表示为ρi，业务i的发送缓冲区中的数据量表示为ψi，建立业务i的用户设备的空口传输能力表示为γi，则权重因子可用公式表示为：
Figure PCTCN2014092240-appb-000012
或者，
Figure PCTCN2014092240-appb-000013
或者，
Figure PCTCN2014092240-appb-000014
或者，
Figure PCTCN2014092240-appb-000015
或者，
Figure PCTCN2014092240-appb-000016
或者，
Figure PCTCN2014092240-appb-000017
或者，
Figure PCTCN2014092240-appb-000018
或者，
Figure PCTCN2014092240-appb-000019
等等，其中，a、b、c、d为非0的正实数，e为实数。此处仅为举例说明，具体实施中权重因子与业务的发送缓冲区中的数据量以及用户设备的空口传输能力之间的关系并不以此为限。
同理，本发明实施例中，不限定第二调度优先级与权重因子和第一调度优先级之间的具体转换关系，只需要满足第二调度优先级与权重因子成正比、与第一调度优先级成正比即可应用于本发明。
例如，业务i的权重因子表示为ρi，业务i的第一调度优先级表示为Priorityi，业务i的第二调度优先级表示为
Figure PCTCN2014092240-appb-000020
则第二调度优先级可用公式表示为：
Figure PCTCN2014092240-appb-000021
或者，
Figure PCTCN2014092240-appb-000022
或者，
Figure PCTCN2014092240-appb-000023
 或者，
Figure PCTCN2014092240-appb-000024
或者，
Figure PCTCN2014092240-appb-000025
或者，
Figure PCTCN2014092240-appb-000026
或者，
Figure PCTCN2014092240-appb-000027
或者，
Figure PCTCN2014092240-appb-000028
等等，其中，a、b、c、d为非0的正实数，e为实数。此处仅为举例说明，具体实施中第二调度优先级与第一调度优先级和权重因子之间的关系并不以此为限。
步骤503：根据第二调度优先级调度第一业务。
优选地，在当前调度周期内按照第二调度优先级从高到低的顺序调度第一业务并分配系统资源。在有多个待调度业务时，待调度的多个业务中第二调度优先级越高的用户设备越优先得到调度并优先分配系统资源。
优选地，在所述当前调度周期内按照第二调度优先级从高到低的顺序调度第一业务并分配系统资源之后，在下一个调度周期到来之前，重新确定第一业务的第二调度优先级，在下一个调度周期到来时，在该调度周期内按照重新确定的第二调度优先级调度第一业务并分配系统资源。
以下通过第一具体实施例，对采用现有的调度算法得到的第一调度优先级进行业务调度，与采用本发明实施例中的第二调度优先级进行调度的方式进行比较说明。
该第一具体实施例中，假设小区内有2个业务且该2个业务的数据同时到达发送缓冲区，调度器在每个发送时间间隔(transmission time interval，TTI)调度一个业务使用全系统带宽的信道资源进行数据传输。假设业务1有1000比特(bit)，且综合考虑发送缓冲区数据量和空口传输能力，业务1的数据传输完需要用2个TTI。假设业务2也有1000bit，且综合考虑发送缓冲区数据量和空口传输能力，业务2的数据传输完需要3个TTI。为简洁起见，这里假设一旦业务的数据被调度，就立刻被正确接收，即调度器到接收机的之间的时延为0个TTI。当然，这里也可以假设调度器到接收机之间的时延为某个其他的固定值，这并不影响结论。
该第一具体实施例中，如果不综合考虑业务的发送缓冲区数据量和用户设备的空口传输能力，使用现有调度算法计算第一调度优先级，并按照第一调度优先级进行调度时的典型调度时序图如图6所示：
业务1和业务2的数据同时在TTI 1到达，并且在TTI 2和TTI4调度业务1(业务1需要传输2个TTI，因此业务1在TTI 4被调度完，业务1的整个传输时间为TTI 1到TTI 4)，在TTI 1、TTI 3和TTI 5调度业务2(业务2需要传输3个TTI，因此业务2在TTI 5被调度完，业务2的整个传输时间为TTI 1到TTI 5)。业务1的数据传输完占用了4个TTI，而业务2的数据传输完占用了5个TTI，按照前面3GPP给出的用户感知速率的计算公式计算得到，业务1的用户感知速率PerceivedRateService1和业务2的用户感知速率PerceivedRateService2分别表示为：
Figure PCTCN2014092240-appb-000029
该第一具体实施例中，如果综合考虑业务的发送缓冲区数据量和用户设备的空口传输能力，即按照第二调度优先级进行调度，可以使得传输时间最短的业务最优先调度，这时的调度时序如图7所示，业务1的数据传输完占用了2个TTI，而业务2的数据传输完占用了5个TTI，可知业务1的用户感知速率
Figure PCTCN2014092240-appb-000030
和业务2的用户感知速率
Figure PCTCN2014092240-appb-000031
分别表示为：
Figure PCTCN2014092240-appb-000032
通过第一具体实施例中的对比可知，相对于采用现有调度算法得到的第一调度优先级进行业务调度的方式，采用综合考虑业务的发送缓冲区数据量和用户设备的空口传输能力后得到的第二调度优先级进行业务调度的方式， 可以提升用户感知速率。
以下在第二具体实施例中，以LTE下行调度为例进行说明。
该第二具体实施例中，如图8所示，假设系统中有两个物理资源块(Physical Resource Block，PRB)：PRB1和PRB2，移动站MS1建立了两条业务Service1和Service2，MS2建立了一条业务Service3，每条业务的速率和数据量信息如表1所示，其中，rMS1,PRB1(t)表示用户设备MS1在PRB1上的瞬时速率，rMS1,PRB2(t)表示用户设备MS1在PRB2上的瞬时速率，rMS2,PRB1(t)表示用户设备MS2在PRB1上的瞬时速率，rMS2,PRB2(t)表示用户设备MS2在PRB2上的瞬时速率；rService1,PRB1(t)表示业务Service1在PRB1上的瞬时速率，rService1,PRB2(t)表示业务Service1在PRB2上的瞬时速率，rService2,PRB1(t)表示业务Service2在PRB1上的瞬时速率，rService2,PRB2(t)表示业务Service2在PRB2上的瞬时速率，rService3,PRB1(t)表示业务Service3在PRB1上的瞬时速率，rService3,PRB2(t)表示业务Service3在PRB2上的瞬时速率，RService1(t)表示Service1的平均速率，RService2(t)表示Service2的平均速率，RService3(t)表示Service3的平均速率。
表1
Figure PCTCN2014092240-appb-000033
该第二具体实施例中，根据瞬时信道信息、平均信道信息、业务的QoS信息和业务的首包时延信息中任意一种或组合获取第一调度优先级Priorityi。例如，使用PF算法计算各业务Service1、Service2、Service3分别在PRB1和PRB2上的第一调度优先级：
Service1在PRB1上的第一调度优先级为：
Figure PCTCN2014092240-appb-000034
Service2在PRB1上的第一调度优先级为：
Figure PCTCN2014092240-appb-000035
Service3在PRB1上的第一调度优先级为：
Figure PCTCN2014092240-appb-000036
Service1在PRB2上的第一调度优先级为：
Figure PCTCN2014092240-appb-000037
Service2在PRB2上的第一调度优先级为：
Figure PCTCN2014092240-appb-000038
Service3在PRB2上的第一调度优先级为：
Figure PCTCN2014092240-appb-000039
根据业务的发送缓冲区中的数据量和建立该业务的用户设备的实际传输能力计算得到权重因子ρi。该具体实施例中，以业务的瞬时速率代表用户设备的实际传输能力，权重因子计算公式为：
Figure PCTCN2014092240-appb-000040
可得到各业务Service1、Service2、Service3的权重因子ρService1、ρService2、ρService3如下：
Figure PCTCN2014092240-appb-000041
Figure PCTCN2014092240-appb-000042
Figure PCTCN2014092240-appb-000043
根据业务的第一调度优先级Priorityi和该业务的权重因子ρi得到该业务的第二调度优先级
Figure PCTCN2014092240-appb-000044
该具体实施例中假设第二调度优先级计算公式为：
Figure PCTCN2014092240-appb-000045
可得到各业务Service1、Service2、Service3分别在PRB1和PRB2上的第二调度优先级：
Service1在PRB1上的第二调度优先级为：
Figure PCTCN2014092240-appb-000046
Service2在PRB1上的第二调度优先级为：
Figure PCTCN2014092240-appb-000047
Service3在PRB1上的第二调度优先级为：
Figure PCTCN2014092240-appb-000048
Service1在PRB2上的第二调度优先级为：
Figure PCTCN2014092240-appb-000049
Service2在PRB2上的第二调度优先级为：
Figure PCTCN2014092240-appb-000050
Service3在PRB2上的第二调度优先级为：
Figure PCTCN2014092240-appb-000051
按照第二调度优先级
Figure PCTCN2014092240-appb-000052
对每条业务进行调度并分配系统资源，由于
Figure PCTCN2014092240-appb-000053
所以PRB1最优先分配给业务Service2；由于
Figure PCTCN2014092240-appb-000054
所以将PRB2最优先分配给业务Service2。
基于上述技术方案，本发明实施例中，根据业务在发送缓冲区中的数据量、建该业务的用户设备的空口传输能力以及该业务的第一调度优先级确定该业务的第二调度优先级，按照第二调度优先级调度该业务，从而在有限包场景中，综合考虑业务在发送缓冲区中的数据量以及建立该业务的用户设备的空口传输能力确定第二调度优先级，从而在按照第二调度优先级调度业务时能够有效提高用户感知速率，进而改善用户体验。
本领域内的技术人员应明白，本发明的实施例可提供为方法、系统、或计算机程序产品。因此，本发明可采用完全硬件实施例、完全软件实施例、或结合软件和硬件方面的实施例的形式。而且，本发明可采用在一个或多个其中包含有计算机可用程序代码的计算机可用存储介质(包括但不限于磁盘存储器和光学存储器等)上实施的计算机程序产品的形式。
本发明是参照根据本发明实施例的方法、设备(系统)、和计算机程序产品的流程图和/或方框图来描述的。应理解可由计算机程序指令实现流程图和/或方框图中的每一流程和/或方框、以及流程图和/或方框图中的流程和/或方框的结合。可提供这些计算机程序指令到通用计算机、专用计算机、嵌入式处理机或其他可编程数据处理设备的处理器以产生一个机器，使得通过计算机或其他可编程数据处理设备的处理器执行的指令产生用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的 装置。
这些计算机程序指令也可存储在能引导计算机或其他可编程数据处理设备以特定方式工作的计算机可读存储器中，使得存储在该计算机可读存储器中的指令产生包括指令装置的制造品，该指令装置实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能。
这些计算机程序指令也可装载到计算机或其他可编程数据处理设备上，使得在计算机或其他可编程设备上执行一系列操作步骤以产生计算机实现的处理，从而在计算机或其他可编程设备上执行的指令提供用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的步骤。
显然，本领域的技术人员可以对本发明进行各种改动和变型而不脱离本发明的精神和范围。这样，倘若本发明的这些修改和变型属于本发明权利要求及其等同技术的范围之内，则本发明也意图包含这些改动和变型在内。

Claims (15)

  1. 一种业务调度装置，其特征在于，包括：
    获取单元，用于获取第一业务的第一调度优先级；
    确定单元，用于根据所述第一业务在发送缓冲区中的数据量、建立所述第一业务的用户设备的空口传输能力以及所述第一业务的第一调度优先级确定所述第一业务的第二调度优先级；
    调度单元，用于根据所述第二调度优先级调度所述第一业务。
  2. 如权利要求1所述的装置，其特征在于，所述第一业务的第二调度优先级与所述第一业务在发送缓冲区中的数据量成反比、与建立所述一业务的用户设备的空口传输能力成正比，且与所述业务的第一调度优先级成正比；
    或者，
    所述第一业务的第二调度优先级与所述第一业务在发送缓冲区中的数据量成反比、与建立所述第一业务的用户设备的空口传输能力成正比。
  3. 如权利要求2所述的装置，其特征在于，所述确定单元具体用于：
    根据所述第一业务在发送缓冲区中的数据量、建立所述第一业务的用户设备的空口传输能力，确定所述第一业务的权重因子，所述第一业务的权重因子与所述第一业务的发送缓冲区中的数据量成反比，且与建立所述第一业务的用户设备的空口传输能力成正比；
    根据所述第一业务的权重因子和所述第一业务的第一调度优先级，确定所述第一业务的第二调度优先级，所述第一业务的第二调度优先级与所述第一业务的权重因子成正比。
  4. 如权利要求1-3任一项所述的装置，其特征在于，所述获取单元具体用于：
    根据所述第一业务的瞬时信道信息、平均信道信息、服务质量QoS信息和首包时延信息中的任意一种或组合确定所述第一业务的第一调度优先级；或者，
    获取针对所述第一业务预设的所述第一调度优先级。
  5. 如权利要求1-4任一项所述的装置，其特征在于，所述调度单元具体用于：
    在调度周期内按所述第二调度优先级从高到低的顺序调度所述第一业务并分配系统资源。
  6. 如权利要求5所述的装置，其特征在于，所述确定单元还用于：
    在所述调度单元在所述调度周期内按所述第二调度优先级从高到低的顺序调度所述第一业务并分配系统资源之后，在下一个调度周期到来之前，重新确定所述第一业务的第二调度优先级。
  7. 如权利要求1-3任一项所述的装置，其特征在于，所述用户设备的空口传输能力为所述用户设备的瞬时信道信息和所述用户设备的平均信道信息中的任意一种或组合。
  8. 一种业务调度方法，其特征在于，包括：
    获取第一业务的第一调度优先级；
    根据所述第一业务在发送缓冲区中的数据量、建立所述第一业务的用户设备的空口传输能力以及所述第一业务的第一调度优先级确定所述第一业务的第二调度优先级；
    根据所述第二调度优先级调度所述第一业务。
  9. 如权利要求8所述的方法，其特征在于，所述第一业务的第二调度优先级与所述第一业务在发送缓冲区中的数据量成反比、与建立所述一业务的用户设备的空口传输能力成正比，且与所述业务的第一调度优先级成正比；
    或者，
    所述第一业务的第二调度优先级与所述第一业务在发送缓冲区中的数据量成反比、与建立所述第一业务的用户设备的空口传输能力成正比。
  10. 如权利要求9所述的方法，其特征在于，根据所述第一业务在发送缓冲区中的数据量、建立所述第一业务的用户设备的空口传输能力以及所述第一业务的第一调度优先级确定所述第一业务的第二调度优先级，包括：
    根据所述第一业务在发送缓冲区中的数据量、建立所述第一业务的用户设备的空口传输能力，确定所述第一业务的权重因子，所述第一业务的权重因子与所述第一业务的发送缓冲区中的数据量成反比，且与建立所述第一业务的用户设备的空口传输能力成正比；
    根据所述第一业务的权重因子和所述第一业务的第一调度优先级，确定所述第一业务的第二调度优先级，所述第一业务的第二调度优先级与所述第一业务的权重因子成正比。
  11. 如权利要求8-10任一项所述的方法，其特征在于，获取所述第一业务的第一调度优先级，包括：
    根据所述第一业务的瞬时信道信息、平均信道信息、服务质量QoS信息和首包时延信息中的任意一种或组合确定所述第一业务的第一调度优先级；或者，
    获取针对所述第一业务预设的所述第一调度优先级。
  12. 如权利要求8-11任一项所述的方法，其特征在于，根据所述第二调度优先级调度所述第一业务，包括：
    在调度周期内按所述第二调度优先级从高到低的顺序调度所述第一业务并分配系统资源。
  13. 如权利要求12所述的方法，其特征在于，在所述调度周期内按所述第二调度优先级从高到低的顺序调度所述第一业务并分配系统资源之后，在下一个调度周期到来之前，重新确定所述第一业务的第二调度优先级。
  14. 如权利要求8-10任一项所述的方法，其特征在于，所述用户设备的空口传输能力为所述用户设备的瞬时信道信息和所述用户设备的平均信道信息中的任意一种或组合。
  15. 一种设备，其特征在于，包括处理器和存储器；
    所述处理器用于读取所述存储器中预设的程序，按照所述程序执行以下过程：
    获取第一业务的第一调度优先级；
    根据所述第一业务在发送缓冲区中的数据量、建立所述第一业务的用户设备的空口传输能力以及所述第一业务的第一调度优先级确定所述第一业务的第二调度优先级；
    根据所述第二调度优先级调度所述第一业务。
PCT/CN2014/092240 2014-11-26 2014-11-26 一种业务调度方法及设备 WO2016082115A1 (zh)

Priority Applications (6)

Application Number Priority Date Filing Date Title
JP2017516300A JP2017532888A (ja) 2014-11-26 2014-11-26 サービススケジューリング方法およびデバイス
KR1020177007435A KR20170043611A (ko) 2014-11-26 2014-11-26 서비스 스케줄링 방법 및 장치
CN201480002667.3A CN105830517A (zh) 2014-11-26 2014-11-26 一种业务调度方法及设备
PCT/CN2014/092240 WO2016082115A1 (zh) 2014-11-26 2014-11-26 一种业务调度方法及设备
EP14903503.2A EP3171655A4 (en) 2014-11-26 2014-11-26 Service scheduling method and device
US15/166,100 US20160278111A1 (en) 2014-11-26 2016-05-26 Service scheduling method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2014/092240 WO2016082115A1 (zh) 2014-11-26 2014-11-26 一种业务调度方法及设备

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US15/166,100 Continuation US20160278111A1 (en) 2014-11-26 2016-05-26 Service scheduling method and device

Publications (1)

Publication Number Publication Date
WO2016082115A1 true WO2016082115A1 (zh) 2016-06-02

Family

ID=56073322

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2014/092240 WO2016082115A1 (zh) 2014-11-26 2014-11-26 一种业务调度方法及设备

Country Status (6)

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

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107770736A (zh) * 2016-08-18 2018-03-06 中国移动通信集团重庆有限公司 一种数据业务下发调度方法及装置
CN107800648A (zh) * 2017-10-17 2018-03-13 北京邮电大学 数据包调度方法及装置
CN111918328A (zh) * 2019-05-09 2020-11-10 大唐移动通信设备有限公司 一种用户设备资源调度方法及装置

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR102331114B1 (ko) 2017-05-25 2021-11-26 삼성전자 주식회사 무선 통신 시스템에서 서비스의 품질 보장 방법 및 장치
CN110582069B (zh) * 2018-06-08 2022-07-19 成都鼎桥通信技术有限公司 一种基于cbtc业务的资源分配方法和装置
US10567983B2 (en) * 2018-07-02 2020-02-18 Ford Global Technologies, Llc Method and apparatus for adaptive network slicing in vehicles

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102164417A (zh) * 2010-02-21 2011-08-24 株式会社Ntt都科摩 一种确定终端调度优先级的方法及装置
CN102186256A (zh) * 2011-05-27 2011-09-14 华南理工大学 一种lte调度中确定用户优先级排序的方法
CN102264143A (zh) * 2010-05-28 2011-11-30 鼎桥通信技术有限公司 一种td-scdma系统中用户接入自适应调度方法和装置
CN103974436A (zh) * 2014-04-18 2014-08-06 大唐移动通信设备有限公司 一种调度优先级的调整方法和装置

Family Cites Families (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP3737353B2 (ja) * 2000-09-28 2006-01-18 株式会社エヌ・ティ・ティ・ドコモ 通信装置及び通信回線割当方法
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 (ja) * 2002-12-06 2004-07-02 Matsushita Electric Ind Co Ltd 基地局装置およびパケット送信スケジューリング方法
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 (ko) * 2004-09-01 2006-12-20 한국전자통신연구원 서비스 지연 시간 및 채널 상태를 이용한 하향링크 패킷스케쥴링 방법
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
WO2008001481A1 (en) * 2006-06-29 2008-01-03 Mitsubishi Electric Corporation Communication system, base station, and mobile station
US8422435B2 (en) * 2006-06-30 2013-04-16 Telefonaktiebolaget L M Ericsson (Publ) Enhancing coverage for high speed downlink packet access (HSDPA) channel
TWI391911B (zh) * 2008-04-15 2013-04-01 Novatek Microelectronics Corp 記憶體存取裝置及使用該記憶體存取裝置的顯示器
EP2244516B1 (en) * 2009-04-23 2016-05-18 Alcatel Lucent Relaying data between a base station and user equipment
US8897237B2 (en) * 2011-04-29 2014-11-25 Motorola Solutions, Inc. Granting scheduling requests in a wireless communication system
JP5347039B2 (ja) * 2012-03-06 2013-11-20 株式会社エヌ・ティ・ティ・ドコモ 無線基地局
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 (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102164417A (zh) * 2010-02-21 2011-08-24 株式会社Ntt都科摩 一种确定终端调度优先级的方法及装置
CN102264143A (zh) * 2010-05-28 2011-11-30 鼎桥通信技术有限公司 一种td-scdma系统中用户接入自适应调度方法和装置
CN102186256A (zh) * 2011-05-27 2011-09-14 华南理工大学 一种lte调度中确定用户优先级排序的方法
CN103974436A (zh) * 2014-04-18 2014-08-06 大唐移动通信设备有限公司 一种调度优先级的调整方法和装置

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP3171655A4 *

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107770736A (zh) * 2016-08-18 2018-03-06 中国移动通信集团重庆有限公司 一种数据业务下发调度方法及装置
CN107800648A (zh) * 2017-10-17 2018-03-13 北京邮电大学 数据包调度方法及装置
CN107800648B (zh) * 2017-10-17 2020-12-08 北京邮电大学 数据包调度方法及装置
CN111918328A (zh) * 2019-05-09 2020-11-10 大唐移动通信设备有限公司 一种用户设备资源调度方法及装置

Also Published As

Publication number Publication date
US20160278111A1 (en) 2016-09-22
JP2017532888A (ja) 2017-11-02
KR20170043611A (ko) 2017-04-21
EP3171655A4 (en) 2017-10-18
CN105830517A (zh) 2016-08-03
EP3171655A1 (en) 2017-05-24

Similar Documents

Publication Publication Date Title
US11051322B2 (en) Data processing method, apparatus, and system
KR101480598B1 (ko) 무선 네트워크에서 통신을 개시하기 위한 기법
WO2016082115A1 (zh) 一种业务调度方法及设备
EP2830380B1 (en) Uplink transmission scheduling of non-Guaranteed Bit Rate bearers based on quality class indicator
WO2012079517A1 (zh) 一种资源调度的方法、装置和基站
WO2010135971A1 (zh) 无线通信系统中上行无线资源调度方法与装置
WO2012167563A1 (zh) 一种载波聚合调度装置、载波聚合调度方法和基站
CN107872892B (zh) 一种无线资源分配方法及装置
JP5523627B2 (ja) 移動通信システムにおける基地局及びリソース割当方法
KR20150097599A (ko) 셀룰러 네트워크에서 무선 자원을 스케줄링하는 방법 및 시스템
WO2014117347A1 (zh) 一种数据调度方法和设备
CN107113821A (zh) 上行数据传输的方法和装置
WO2012147499A1 (ja) 移動通信システムにおける基地局及びリソース割当方法
KR101145489B1 (ko) 무선통신 시스템에서의 하향 링크 패킷 스케쥴링 방법 및 그 장치
WO2013026403A1 (zh) 一种资源分配方法及装置
CN104066197A (zh) 一种td-lte中低丢包率的实时业务调度方法
Afrin et al. A delay sensitive LTE uplink packet scheduler for M2M traffic
WO2019000873A1 (zh) 一种调制编码方式的调整方法及基站
WO2014172892A1 (zh) 业务分流方法、装置及系统
EP3503616B1 (en) Multi-air interface communication method and device
CN107155220B (zh) 一种资源调度方法及装置
KR100523996B1 (ko) 이동통신 시스템의 패킷 스케줄링 시스템 및 방법
CN111385900B (zh) 上行调度方法和装置
Afrin et al. A packet age based LTE uplink packet scheduler for M2M traffic
Tsai et al. Downlink radio resource allocation with Carrier Aggregation in MIMO LTE-advanced systems

Legal Events

Date Code Title Description
REEP Request for entry into the european phase

Ref document number: 2014903503

Country of ref document: EP

WWE Wipo information: entry into national phase

Ref document number: 2014903503

Country of ref document: EP

121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 14903503

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 20177007435

Country of ref document: KR

Kind code of ref document: A

ENP Entry into the national phase

Ref document number: 2017516300

Country of ref document: JP

Kind code of ref document: A

NENP Non-entry into the national phase

Ref country code: DE