WO2016061976A1 - 上行业务的调度方法、基站和计算机存储介质 - Google Patents

上行业务的调度方法、基站和计算机存储介质 Download PDF

Info

Publication number
WO2016061976A1
WO2016061976A1 PCT/CN2015/074108 CN2015074108W WO2016061976A1 WO 2016061976 A1 WO2016061976 A1 WO 2016061976A1 CN 2015074108 W CN2015074108 W CN 2015074108W WO 2016061976 A1 WO2016061976 A1 WO 2016061976A1
Authority
WO
WIPO (PCT)
Prior art keywords
bsr
base station
scheduling
size
bsrs
Prior art date
Application number
PCT/CN2015/074108
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 中兴通讯股份有限公司
Publication of WO2016061976A1 publication Critical patent/WO2016061976A1/zh

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/04—Wireless resource allocation

Definitions

  • the present invention relates to mobile communication technologies, and in particular, to a scheduling method for an uplink service, a base station, and a computer storage medium.
  • 3GPP 3rd Generation Partnership Project
  • PDB Packet Delay
  • Budget used to indicate the maximum delay of packet data transmission between the user equipment (UE, User Equipment) and the core network.
  • the 3GPP protocol clearly stipulates that 98% of any service packet should meet the PDB requirements.
  • the base station may add a time identifier, so that the base station can obtain the waiting delay of the base station when scheduling the service packet data packet, and then combine the PDB requirements of the service. Select the appropriate scheduling policy to meet the PDB requirements of the service packet data as much as possible;
  • the UE only reports to the base station the data size of the uplink service packet data packet waiting to be scheduled in the user plane, so that the base station does not know when the uplink service packet data packet arrives at the user plane of the UE. It is also unclear whether the uplink service packet data packet has a waiting delay in the UE user plane. Therefore, the opportunity may cause the base station to fail to obtain the waiting delay information of the uplink packet data packet, thereby failing to combine the PDB of the uplink packet data packet in the scheduling. It is required to select an appropriate scheduling policy, which makes it impossible to guarantee the PDB requirements of the uplink service packet.
  • the prior art does not have a technical solution for obtaining the waiting delay of the uplink service packet data packet.
  • the embodiment of the present invention is to provide a scheduling method and a base station for uplink services, which can estimate the waiting delay of the uplink service packet data packet, thereby ensuring the PDB requirement of the uplink service packet data packet.
  • an embodiment of the present invention provides a scheduling method for an uplink service, where the method includes:
  • the base station receives the buffer status report BSR reported by the terminal;
  • the BSR After determining that the BSR is valid, the BSR performs time stamping on the BSR, and performs the first update on the BSR size currently maintained by the BSR according to the BSR;
  • the waiting time delay of the BSR is obtained according to the scheduling time and the time stamp of the BSR;
  • the base station performs scheduling according to a preset scheduling algorithm and a waiting delay of the BSR, and performs a second update on the BSR size currently maintained by the first update according to the scheduling.
  • the determining, by the base station, the validity of the BSR according to the size of the BSR that is currently maintained by the BSR, and the size of the BSR including:
  • the base station determines that the BSR is valid
  • the base station determines that the BSR is invalid.
  • the base station performs the first update of the BSR size that is currently maintained by the BSR according to the BSR, including:
  • the base station subtracts the BSR size from the total amount of the BSR currently maintained by the base station. The difference is obtained by the update size of the BSR.
  • the base station further records the number of BSRs that are currently maintained by the base station and the upper limit of the number of BSRs that are maintained by itself;
  • the base station further includes:
  • the base station sets the time stamp of the BSR to the time stamp of the BSR that is last maintained by the base station, when the number of the BSRs that are currently maintained by the number of the BSRs is greater than the upper limit of the number of the maintenance BSRs. And incorporating the BSR into the BSR that is itself last maintained;
  • the base station time stamps the BSRs, and pairs the BSRs according to the BSRs.
  • the currently maintained BSR size is updated for the first time.
  • the waiting delay of the BSR is the time stamp of the BSR minus the scheduling time
  • the waiting delay of the BSR is the time stamp of the BSR minus the non-continuous scheduling random value, and the non-continuous scheduling random value is one at [ 1.
  • an embodiment of the present invention provides a base station, where the base station includes: a receiving unit, a determining unit, a first updating unit, an obtaining unit, a scheduling unit, and a second updating unit, where
  • the receiving unit is configured to receive a buffer status report BSR reported by the terminal;
  • the determining unit is configured to determine the validity of the BSR according to the total size of the BSR currently maintained by the base station and the size of the BSR;
  • the first update unit is configured to: when the determining unit determines that the BSR is valid, perform time stamping on the BSR, and perform a first update on the BSR size currently maintained by the base station according to the BSR;
  • the acquiring unit is configured to: when the base station performs service scheduling, according to a scheduling moment The time stamp of the BSR acquires a waiting delay of the BSR;
  • the scheduling unit is configured to perform scheduling according to a preset scheduling algorithm and a waiting delay of the BSR;
  • the second update unit is configured to perform a second update on the BSR size currently maintained by the first update according to the scheduling of the scheduling unit.
  • the determining unit is configured to:
  • the BSR size is less than or equal to the total size of the BSR currently maintained by the base station, the BSR is determined to be invalid.
  • the first update unit is configured to subtract the difference between the BSR size and the total BSR size currently maintained by the base station to obtain an update size of the BSR.
  • the base station further includes a recording unit configured to record the number of BSRs currently maintained by the base station and the upper limit of the number of BSRs maintained by the base station itself;
  • the first update unit is configured to:
  • the determining unit determines that the BSR is valid
  • the time stamp of the BSR is set to the time stamp of the BSR that is last maintained by the base station itself. And incorporating the BSR into the BSR that is itself last maintained;
  • the BSR is time-stamped and the current BSR is currently maintained according to the BSR, when the number of the BSRs that are currently maintained by the BSR is less than or equal to the upper limit of the number of the maintenance BSRs.
  • the BSR size is updated for the first time.
  • the waiting delay of the BSR is the time stamp of the BSR minus the scheduling time
  • the waiting delay of the BSR is reduced by the scheduling time.
  • the time stamp of the BSR is added to the non-continuous scheduling random value, and the non-continuous scheduling random value is a value at [1, scheduling request SR period], where [*] represents a closed interval, and the scheduling request SR period The scheduling period for scheduling requests.
  • an embodiment of the present invention further provides a computer storage medium, where the computer storage medium stores computer executable instructions, where the computer executable instructions are used in at least one of the methods in the first aspect.
  • the computer storage medium stores computer executable instructions, where the computer executable instructions are used in at least one of the methods in the first aspect.
  • the embodiment of the present invention provides a scheduling method for an uplink service, a base station, and a computer storage medium.
  • the base station performs scheduling on the uplink service according to the uplink delay estimation obtained by the BSR reported by the terminal, and implements waiting for the uplink service packet data packet.
  • the delay is estimated to ensure the PDB requirements of the uplink service packet.
  • FIG. 1 is a schematic flowchart of a scheduling method of an uplink service according to an embodiment of the present disclosure
  • FIG. 2 is a schematic flowchart of a specific scheduling method for an uplink service according to an embodiment of the present disclosure
  • FIG. 3 is a schematic flowchart of another specific uplink scheduling method according to an embodiment of the present invention.
  • FIG. 4 is a schematic flowchart of still another specific scheduling method for an uplink service according to an embodiment of the present disclosure
  • FIG. 5 is a schematic structural diagram of a base station according to an embodiment of the present disclosure.
  • FIG. 6 is a schematic structural diagram of another base station according to an embodiment of the present invention.
  • the technical solution of the embodiment of the present invention is to perform uplink delay estimation on the service reporting of the UE according to the BSR (Buffer State Report) reported by the terminal and the scheduling continuity of the UE, and perform uplink scheduling according to the estimated value, thereby Meet the PDB requirements for uplink service scheduling.
  • BSR Buffer State Report
  • FIG. 1 a flow of a method for scheduling an uplink service according to an embodiment of the present invention is shown.
  • the method may be applied to a base station side, and the method may include:
  • S101 The base station receives a buffer status report BSR reported by the terminal.
  • the base station determines the validity of the BSR according to the total amount of the BSR size that is currently maintained by the base station and the size of the BSR.
  • the total amount of the BSR size herein can be understood as the total data of the BSR.
  • the determining, by the base station, the validity of the BSR according to the total amount of the BSR that is currently maintained by the eNB and the size of the BSR may include:
  • the base station determines that the BSR is valid; the BSR size herein can be understood as the data volume of the BSR.
  • the base station determines that the BSR is invalid.
  • the BSR size currently maintained by the base station itself is zero. Therefore, the BSR must be valid at this time.
  • the base station can also maintain the number of BSRs that it has maintained and the upper limit of the number of BSRs that it maintains.
  • the base station further includes:
  • the base station sets the time stamp of the BSR to the time stamp of the BSR that is last maintained by itself, and The BSR is incorporated into the BSR that is itself last maintained;
  • the base station When the number of BSRs that are currently maintained by the self and the number of the BSRs are less than or equal to the upper limit of the number of maintenance BSRs, the base station performs time stamping on the BSRs, and according to the BSRs. The first update is performed on the BSR size currently maintained by the self.
  • the base station determines that the BSR is time-stamped, and performs the first update of the BSR size that is currently maintained by the BSR according to the BSR.
  • the base station performs the first update of the BSR size that is currently maintained by the BSR according to the BSR, and may include:
  • the base station subtracts the difference between the BSR size and the total amount of the BSR currently maintained by the base station to obtain the updated size of the BSR.
  • S104 When the base station performs the service scheduling, obtain the waiting delay of the BSR according to the scheduling time and the time stamp of the BSR.
  • the waiting delay of the BSR is the time stamp of the BSR minus the scheduling time
  • the waiting delay of the BSR is the time stamp of the BSR minus the non-continuous scheduling random value, and the non-continuous scheduling random value. It is a value in [1, Scheduling Request (SR), where [*] represents a closed interval, and the SR period is a scheduling period of the scheduling request.
  • SR Scheduling Request
  • the base station performs scheduling according to a preset scheduling algorithm and a waiting delay of the BSR, and performs a second update on the BSR size that is currently maintained by the first update according to the scheduling.
  • the base station may start scheduling according to a preset scheduling algorithm, and the base station performs the second update according to the scheduled BSR size that is currently maintained by the first update.
  • the base station sequentially updates the BSR size currently maintained by the first updated base station according to the scheduling size according to the length of the waiting delay and the size of the scheduling.
  • the embodiment provides a scheduling method for the uplink service, and the base station performs scheduling on the uplink service according to the uplink delay estimation obtained by the BSR reported by the terminal, so as to estimate the waiting delay of the uplink service packet data packet, thereby ensuring PDB requirements for upstream service packet data packets.
  • a specific scheduling method for an uplink service may be used in a base station.
  • a base station is set.
  • the upper limit of the number of BSRs to be maintained is infinity, and the base station is in a continuous scheduling manner, that is, the delay between the service arriving at the terminal side buffer and the BSR reported by the terminal is 0.
  • the method may include:
  • the size of the BSR1 is 1000 bits.
  • the current BSR1 is the BSR1 and the size of the BSR1 is 1000 bits.
  • S202 The base station adds a time identifier T1 to the BSR1.
  • S203 The base station schedules the terminal at time T2, and calculates a waiting delay of the BSR1.
  • the waiting delay of the BSR1 is T2-T1.
  • S204 The base station performs scheduling according to a scheduling algorithm and a waiting delay of the BSR.
  • the base station schedules the terminal 500 bits bytes
  • S205 The base station updates the currently maintained BSR size.
  • T1 time identifier
  • S206 The terminal newly reports the BSR to be 500 bits at the time of the T3;
  • the total number of BSRs currently maintained by the base station is 500 bits, and the newly reported BSR is less than or equal to the BSR size currently maintained by the base station, so that no new data is generated on the terminal side, and the base station ignores the BSR.
  • S210 The terminal newly reports the BSR to 2000 bits at the time of the T5.
  • the total size of the BSR currently maintained by the base station is 1000 bits, and the newly reported BSR is greater than The total number of BSRs currently maintained by the base station, which indicates that new data is generated on the terminal side.
  • S212 The base station schedules the terminal at time T6. At this time, the waiting delay of the BSR1 is T6-T1, and is calculated according to the maximum time.
  • S213 The base station performs scheduling according to the scheduling algorithm and the waiting delay of the BSR.
  • the base station schedules the terminal 800 bits bytes.
  • S215 The base station updates the number of BSRs that it has currently maintained.
  • BSR1 when BSR1 is scheduled, BSR2 is updated to BSR1; BSR3 is updated to BSR2, and so on.
  • another uplink service specific scheduling method provided by an embodiment of the present invention may be used in a base station.
  • the base station maintains a maximum number of BSRs, and the base station is in a continuous manner, that is, the delay between the service-side terminal buffer and the BSR reported by the terminal is 0.
  • the method may include:
  • the size of the BSR1 is 1000 bits.
  • the current BSR1 is the BSR1 and the size of the BSR1 is 1000 bits.
  • S302 The base station adds a time identifier T1 to the BSR1.
  • the current base station has only one BSR, which is smaller than the upper limit of the number of BSRs maintained by the base station.
  • the total size of the BSR currently maintained by the update base station is 1500 bits.
  • S306 The terminal newly reports the BSR to 2000 bits at time T3.
  • the total amount of BSRs currently maintained by the base station is 2000 bits.
  • the base station schedules the terminal at time T4, and the waiting delay of the BSR1 is T4-T1, which is calculated according to the maximum time.
  • S310 The base station performs scheduling according to the scheduling algorithm and the waiting delay of the BSR.
  • the base station schedules the terminal 1500 bits.
  • S311 The base station updates the currently maintained BSR size.
  • S312 The base station updates the number of BSRs that it has currently maintained.
  • the BSR2 is updated to BSR1, and the BSR2 is vacant.
  • FIG. 4 another uplink service specific scheduling method provided by an embodiment of the present invention may be used in a base station.
  • the base station maintains the upper limit of the number of BSRs to be infinite, and the base station is non-contiguous, that is, the delay between the service arrival terminal buffer and the terminal reporting BSR is [1, 5] ms, and 5 indicates the SR period.
  • the size of the BSR1 is 1000 bits.
  • the current BSR1 is the BSR1 and the size of the BSR1 is 1000 bits.
  • the base station adds a time identifier T1 to the BSR1.
  • S403 The base station schedules the terminal at time T2, and calculates a waiting delay of the BSR1.
  • the delay between the BSR1 and the BSR1 is 2, and the waiting delay of the BSR1 is T2-T1+2.
  • S404 The base station performs scheduling according to a scheduling algorithm and a waiting delay of the BSR.
  • the base station schedules the terminal 500 bits.
  • S405 The base station updates the currently maintained BSR size.
  • S406 The terminal newly reports the BSR to be 500 bits at time T3.
  • the total number of BSRs currently maintained by the base station is 500 bits, and the newly reported BSR is less than or equal to the total amount of BSRs currently maintained by the base station, thereby indicating that no new data is generated on the terminal side.
  • the base station ignores the BSR;
  • S410 The base station scheduling terminal at time T5, the base station randomly generates a random number 3 of [1, 5] ms as a delay between the service arrival terminal side buffer and the terminal reporting BSR, and the waiting time of the BSR1 is performed.
  • the delay is T5-T1+3, calculated according to the maximum time.
  • S411 The base station performs scheduling according to the scheduling algorithm and the waiting delay of the BSR.
  • the base station schedules the terminal 800 bits.
  • S412 The base station updates the currently maintained BSR size.
  • S413 The base station updates the number of BSRs that it has currently maintained.
  • the BSR2 is updated to BSR1, and the BSR2 is vacant, and so on.
  • the embodiment shown in FIG. 2 to FIG. 4 is a specific application of the embodiment shown in FIG. 1. It can be seen that, in the embodiment of the present invention, the uplink service is performed by the base station according to the uplink delay estimation obtained by the BSR reported by the terminal. The scheduling implements the estimation of the waiting delay of the uplink service packet data packet, thereby ensuring the PDB requirement of the uplink service packet data packet.
  • the structure of the base station 50 may include: a receiving unit 501, a determining unit 502, a first updating unit 503, an obtaining unit 504, a scheduling unit 505, and a second updating unit 506, where
  • the receiving unit 501 is configured to receive a buffer status report BSR reported by the terminal;
  • the determining unit 502 is configured to determine, according to the total amount of BSRs currently maintained by the base station 50 and the size of the BSR, the validity of the BSR;
  • the first update unit 503 is configured to: when the determining unit 502 determines that the BSR is valid, time stamp the BSR, and perform the first BSR size that is currently maintained by the base station 50 according to the BSR. Secondary update
  • the acquiring unit 504 is configured to acquire the waiting delay of the BSR according to the scheduling time and the time stamp of the BSR;
  • the scheduling unit 505 is configured to perform scheduling according to a preset scheduling algorithm and a waiting delay of the BSR;
  • the second update unit 506 is configured to perform a second update on the BSR size currently maintained by the first update according to the scheduling of the scheduling unit 505.
  • the specific structure of the receiving unit 501 may include an air interface that is connected to the user equipment by the base station, and the specific interface corresponds to a receiving antenna or a receiving antenna array.
  • the specific structure of the determining unit 502, the first updating unit 503, the obtaining unit 504, the scheduling unit 505, and the second updating unit 506 may correspond to a processor or a processing having an information processing function in the base station. chip.
  • the processor may be a processor having an information processing function such as an application processor AP, a central processing unit CPU, a microprocessor MCU, a digital signal processor DSP, or a programmable array PLC.
  • the base station further includes a storage medium connected to the processor or the processing chip; the storage medium is configured to store data of the BSR, and is further configured to store information such as the time stamp.
  • the obtaining unit 504 may specifically include a processor or a processing chip or the like capable of reading the time stamp from a storage medium.
  • the above is only an example of the base station, and the specific structure of the base station is not limited to the above structure.
  • the determining unit 502 is configured to: when the BSR size is greater than a total amount of BSR sizes currently maintained by the base station 50, determine that the BSR is valid; when the BSR size is less than or equal to the base station 50 When the total size of the BSR currently maintained by itself is determined, the BSR is determined to be invalid.
  • the first update unit 503 is configured to subtract the difference between the BSR size and the total BSR size currently maintained by the base station 50 to obtain an update size of the BSR.
  • the base station 50 further includes a recording unit 507 configured to record the number of BSRs that the base station 50 itself has currently maintained and the upper limit of the number of BSRs that the base station 50 itself maintains.
  • the specific structure of the recording unit 507 may include a storage medium that records the number of maintained BSRs in a stored manner and the upper limit of the number of BSRs maintained by the base station 50 itself.
  • the first updating unit 503 is configured to: after the determining unit 502 determines that the BSR is valid, when the number of the BSRs that are currently maintained by the number of the BSRs is greater than the number of the maintenance BSRs Limiting the time stamp of the BSR to a time stamp of the BSR that is last maintained by the base station 50 itself, and incorporating the BSR into the BSR that is itself last maintained;
  • the BSR is time-stamped, and the base station 50 itself is currently configured according to the BSR.
  • the maintenance of the BSR size is the first update.
  • the waiting delay of the BSR is the time stamp of the BSR minus the scheduled time
  • the waiting delay of the BSR is the time stamp of the BSR minus the non-continuous scheduling random value, and the discontinuous scheduling random
  • the value is a value at [1, scheduling request SR period], where [*] represents a closed interval, and the scheduling request SR period is a scheduling period of the scheduling request.
  • the embodiment provides a base station 50.
  • the scheduling unit is configured to perform scheduling on the uplink service according to the uplink delay estimation obtained by the BSR reported by the terminal, and implement a waiting delay for the uplink service packet data packet. Estimate to ensure PDB requirements for upstream service packet data.
  • the embodiment of the present invention further provides a computer storage medium, where the computer storage medium stores computer executable instructions, and the computer executable instructions are used to execute at least one of the methods of the embodiments of the present invention, specifically 1 to the method shown in at least one of FIG.
  • the computer storage medium may be a U disk, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk, and the like, which can store program code.
  • the computer storage medium is a non-transitory storage medium.
  • embodiments of the present invention can be provided as a method, system, or computer program product. Accordingly, the present invention can take the form of a hardware embodiment, a 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)
  • Mobile Radio Communication Systems (AREA)

Abstract

一种上行业务的调度方法、基站计算机存储介质被公开，该方法包括：基站接收终端上报的缓存状态报告BSR；基站根据自身当前维护的BSR大小以及所述BSR的大小确定所述BSR的有效性；基站确定BSR有效之后，将BSR进行时间标记，并按照BSR对自身当前维护的BSR大小进行第一次更新；当基站进行业务调度时，按照调度时刻与BSR的时间标记获取BSR的等待时延；基站根据预设的调度算法和BSR的等待时延进行调度，并按照调度对第一次更新后的自身当前维护的BSR大小进行第二次更新。

Description

上行业务的调度方法、基站和计算机存储介质 技术领域
本发明涉及移动通信技术，尤其涉及一种上行业务的调度方法、基站和计算机存储介质。
背景技术
当前，第三代合作伙伴计划(3GPP，3rd Generation Partnership Project)协议中将业务按照不同的属性划分为不同的种类，每种类型的业务都明确规定了业务数据包的时延(PDB：Packet Delay Budget)，用来表示分组数据包在用户终端(UE，User Equipment)与核心网间传输的最大时延。3GPP协议明确规定任何业务98％的数据包都应该满足PDB要求。
目前，下行业务分组数据包到达基站用户面的时候，基站可以添加时间标识，以使得基站在调度该业务分组数据包时就可以获得其在基站的等待时延，再结合该业务的PDB要求，选择合适的调度策略，尽最大可能满足业务分组数据包的PDB要求；
但是对于上行业务分组数据包，由于UE只会向基站上报该上行业务分组数据包在用户面中等待调度的数据大小，使得基站并不清楚该上行业务分组数据包何时到达UE的用户面，也不清楚该上行业务分组数据包在UE用户面中的等待时延，这样机会导致基站无法获取到该上行分组数据包的等待时延信息，从而也无法在调度中结合上行分组数据包的PDB要求选择合适的调度策略，导致无法保证上行业务分组数据包的PDB要求。
综上所述，现有技术中并没有获取上行业务分组数据包的等待时延的技术方案。
发明内容
有鉴于此，本发明实施例期望提供一种上行业务的调度方法和基站，能够对上行业务分组数据包的等待时延进行估算，从而保证上行业务分组数据包的PDB要求。
本发明的技术方案如下：
第一方面，本发明实施例提供了一种上行业务的调度方法，所述方法包括：
基站接收终端上报的缓存状态报告BSR；
所述基站根据自身当前维护的BSR大小总量以及所述BSR的大小确定所述BSR的有效性；
所述基站确定所述BSR有效之后，将所述BSR进行时间标记，并按照所述BSR对所述自身当前维护的BSR大小进行第一次更新；
当所述基站进行业务调度时，按照调度时刻与所述BSR的时间标记获取所述BSR的等待时延；
所述基站根据预设的调度算法和BSR的等待时延进行调度，并按照调度对所述第一次更新后的自身当前维护的BSR大小进行第二次更新。
可选地，所述基站根据自身当前维护的BSR大小以及所述BSR大小确定所述BSR的有效性，包括：
当所述BSR大小大于所述基站自身当前维护的BSR大小总量时，所述基站确定所述BSR有效；
当所述BSR大小小于等于所述基站自身当前维护的BSR大小总量时，所述基站确定所述BSR无效。
可选地，所述基站按照所述BSR对所述自身当前维护的BSR大小进行第一次更新，包括：
所述基站将所述BSR大小减去所述自身当前维护的BSR大小总量得到 的差值，得到所述BSR的更新大小。
可选地，所述基站还记录自身当前已维护的BSR个数以及自身维护BSR个数上限；
相应地，所述基站确定所述BSR有效之后，还包括：
当所述自身当前已维护的BSR个数加上所述BSR的个数大于所述维护BSR个数上限时，所述基站将所述BSR的时间标记设置为自身最后维护的BSR的时间标记，并且将所述BSR并入所述自身最后维护的BSR；
当所述自身当前已维护的BSR个数加上所述BSR的个数小于等于所述维护BSR个数上限时，所述基站将所述BSR进行时间标记，并按照所述BSR对所述自身当前维护的BSR大小进行第一次更新。
可选地，当所述基站是连续调度时，所述BSR的等待时延为所述调度时刻减去所述BSR的时间标记；
当所述基站为非连续调度时，所述BSR的等待时延为所述调度时刻减去所述BSR的时间标记再加上非连续调度随机值，所述非连续调度随机值为一个处于[1，调度请求SR周期]的数值，其中，[*]表示闭区间，调度请求SR周期为调度请求的调度周期。
第二方面，本发明实施例提供了一种基站，所述基站包括：接收单元、确定单元、第一更新单元、获取单元、调度单元和第二更新单元，其中，
所述接收单元，配置为接收终端上报的缓存状态报告BSR；
所述确定单元，配置为根据所述基站自身当前维护的BSR大小总量以及所述BSR的大小确定所述BSR的有效性；
所述第一更新单元，配置为当所述确定单元确定所述BSR有效之后，将所述BSR进行时间标记，并按照所述BSR对所述基站自身当前维护的BSR大小进行第一次更新；
所述获取单元，配置为当所述基站进行业务调度时，按照调度时刻与 所述BSR的时间标记获取所述BSR的等待时延；
所述调度单元，配置为根据预设的调度算法和BSR的等待时延进行调度；
所述第二更新单元，配置为按照所述调度单元的调度对所述第一次更新后的自身当前维护的BSR大小进行第二次更新。
可选地，所述确定单元，配置为：
当所述BSR大小大于所述基站自身当前维护的BSR大小总量时，确定所述BSR有效；
当所述BSR大小小于等于所述基站自身当前维护的BSR大小总量时，确定所述BSR无效。
可选地，所述第一更新单元，配置为将所述BSR大小减去所述基站自身当前维护的BSR大小总量得到的差值，得到所述BSR的更新大小。
可选地，所述基站还包括记录单元，配置为记录所述基站自身当前已维护的BSR个数以及所述基站自身维护BSR个数上限；
相应地，所述第一更新单元，配置为：
所述确定单元确定所述BSR有效之后，
当所述自身当前已维护的BSR个数加上所述BSR的个数大于所述维护BSR个数上限时，将所述BSR的时间标记设置为所述基站自身最后维护的BSR的时间标记，并且将所述BSR并入所述自身最后维护的BSR；
当所述自身当前已维护的BSR个数加上所述BSR的个数小于等于所述维护BSR个数上限时，将所述BSR进行时间标记，并按照所述BSR对所述基站自身当前维护的BSR大小进行第一次更新。
可选地，当所述基站是连续调度时，所述BSR的等待时延为所述调度时刻减去所述BSR的时间标记；
当所述基站为非连续调度时，所述BSR的等待时延为所述调度时刻减 去所述BSR的时间标记再加上非连续调度随机值，所述非连续调度随机值为一个处于[1，调度请求SR周期]的数值，其中，[*]表示闭区间，调度请求SR周期为调度请求的调度周期。
第三方面，本发明实施例还提供一种计算机存储介质，所述计算机存储介质中存储有计算机可执行指令，所述计算机可执行指令用于所述第一方面中所述方法的至少其中之一。
本发明实施例提供了一种上行业务的调度方法、基站和计算机存储介质，通过基站根据终端上报的BSR所获取的上行时延估计对上行业务进行调度，实现了对上行业务分组数据包的等待时延进行估算，从而保证上行业务分组数据包的PDB要求。
附图说明
图1为本发明实施例提供的一种上行业务的调度方法流程示意图；
图2为本发明实施例提供的一种上行业务具体的调度方法流程示意图；
图3为本发明实施例提供的另一种上行业务具体的调度方法流程示意图；
图4为本发明实施例提供的又一种上行业务具体的调度方法流程示意图；
图5为本发明实施例提供的一种基站的结构示意图；
图6为本发明实施例提供的另一种基站的结构示意图。
具体实施方式
下面将结合本发明实施例中的附图，对本发明实施例中的技术方案进行清楚、完整地描述；应当理解，以下所说明的优选实施例仅用于说明和解释本发明，并不用于限定本发明。
本发明实施例技术方案：将根据终端上报的缓存状态报告(BSR，Buffer State Report)以及UE的调度连续性对UE的业务上报进行上行时延的估计，并根据该估计值进行上行调度，从而满足上行业务调度的PDB要求。
参见图1，其示出了本发明实施例提供的一种上行业务的调度方法流程，该方法可以应用于基站侧，该方法可以包括：
S101：基站接收终端上报的缓存状态报告BSR；
S102：基站根据自身当前维护的BSR大小总量以及所述BSR的大小确定所述BSR的有效性；此处的BSR大小总量可以理解为所述BSR的数据总量。
示例性地，基站根据自身当前维护的BSR大小总量以及所述BSR大小确定所述BSR的有效性，可以包括：
当所述BSR大小大于基站自身当前维护的BSR大小总量时，基站确定所述BSR有效；此处的BSR大小可以理解为所述BSR的数据量。
当所述BSR大小小于等于基站自身当前维护的BSR大小总量时，基站确定所述BSR无效。
可以理解的，当终端初次上报BSR时，基站自身当前维护的BSR大小为零，因此，此时BSR一定是有效的。
还需要说明的是，基站还可以维护自身当前已维护的BSR个数以及自身维护BSR个数上限；
相应地，基站确定所述BSR有效之后，还包括：
当所述自身当前已维护的BSR个数加上所述BSR的个数大于所述维护BSR个数上限时，基站将所述BSR的时间标记设置为自身最后维护的BSR的时间标记，并且将所述BSR并入所述自身最后维护的BSR；
当所述自身当前已维护的BSR个数加上所述BSR的个数小于等于所述维护BSR个数上限时，基站将所述BSR进行时间标记，并按照所述BSR 对所述自身当前维护的BSR大小进行第一次更新。
S103：基站确定所述BSR有效之后，将所述BSR进行时间标记，并按照所述BSR对自身当前维护的BSR大小进行第一次更新；
示例性地，基站按照所述BSR对所述自身当前维护的BSR大小进行第一次更新，可以包括：
基站将所述BSR大小减去所述自身当前维护的BSR大小总量得到的差值，得到所述BSR的更新大小。
S104：当基站进行业务调度时，按照调度时刻与所述BSR的时间标记获取所述BSR的等待时延；
可选地，当所述基站是连续调度时，所述BSR的等待时延为所述调度时刻减去所述BSR的时间标记；
可选地，当所述基站为非连续调度时，所述BSR的等待时延为所述调度时刻减去所述BSR的时间标记再加上非连续调度随机值，所述非连续调度随机值为一个处于[1，调度请求(SR，Scheduling Request)周期]的数值，其中，[*]表示闭区间，SR周期为调度请求的调度周期。
S105：基站根据预设的调度算法和BSR的等待时延进行调度，并按照调度对所述第一次更新后的自身当前维护的BSR大小进行第二次更新。
具体地，基站可以根据预设的调度算法从等待时延最长的BSR开始进行调度，相应地，基站按照调度对所述第一次更新后的自身当前维护的BSR大小进行第二次更新，可以包括：
基站根据调度大小按照等待时延的长短顺序和调度的大小依次对第一次更新后的基站当前维护的BSR大小进行更新。
本实施例提供了一种上行业务的调度方法，通过基站根据终端上报的BSR所获取的上行时延估计对上行业务进行调度，实现了对上行业务分组数据包的等待时延进行估算，从而保证上行业务分组数据包的PDB要求。
在图1所示实施例的基础上，如图2所示，为本发明实施例提供的一种上行业务具体的调度方法，该方法可以用于一基站，在本实施例中，设定基站自身维护BSR个数上限为无穷大，基站为连续调度，即业务到达终端侧buffer和终端上报BSR之间的时延为0，该方法可以包括：
S201：UE Index＝10的终端初始接入，T1时刻上报BSR1；
其中，BSR1的大小为1000bits；由于是终端初始接入后的上报，因此，基站当前维护BSR就是BSR1，大小为1000bits。
S202：基站对BSR1添加时间标识T1；
S203：T2时刻基站调度终端，计算BSR1的等待时延；
具体地，BSR1的等待时延为T2-T1。
S204：基站根据调度算法和BSR的等待时延进行调度；
具体地，基站调度终端500bits字节；
S205：基站对当前维护的BSR大小进行更新；
具体地，BSR1’＝BSR1-500＝500bits，时间标识为T1。
S206：T3时刻终端新上报BSR为500bits；
S207：基站当前维护的BSR大小总量为500bits，新上报的BSR小于等于基站当前维护的BSR大小，由此可以说明终端侧没有新数据产生，基站忽略该BSR；
S208：T4时刻终端新上报BSR为1000bits；
S209：基站当前维护的BSR大小总量为500bits，新上报的BSR大于基站当前维护的BSR大小总量，由此可以说明终端侧有新数据产生，基站维护T4时刻新上报的BSR2＝1000-500＝500bits，时间标识为T4，更新基站当前维护的BSR大小总量为1000bits。
S210：T5时刻终端新上报BSR为2000bits。
S211：基站当前维护的BSR大小总量为1000bits，新上报的BSR大于 基站当前维护的BSR大小总量，由此可以说明终端侧有新数据产生，基站维护T5时刻新上报的BSR3＝2000-1000＝1000bits，时间标识为T5，更新基站当前维护的BSR大小总量为2000bits。
S212：T6时刻基站调度终端，此时BSR1的等待时延为T6-T1，按照最大时间计算。
S213：基站根据调度算法和BSR的等待时延进行调度；
具体地，基站调度终端800bits字节。
S214：基站对当前维护的BSR大小进行更新；
具体地，由于BSR1＝500bits，调度800bits>BSR1，因此BSR1调度完毕；
调度剩余300bits，因此BSR2剩余500-(800-500)＝200bits，时间标识为T4；
BSR3＝1000bits，时间标识为T5。
S215：基站对自身当前已维护的BSR个数更新；
具体地，BSR1调度完毕，则BSR2更新为BSR1；BSR3更新为BSR2，后续依次类推。
可以理解的，如果终端有新BSR上报，则重复S210和S211；如果基站调度终端，则重复S212至S215。
在图1所示实施例的基础上，如图3所示，为本发明实施例提供的另一种上行业务具体的调度方法，该方法可以用于一基站，在本实施例中，设定基站自身维护BSR个数上限为2个，基站为连续调度，即业务到达终端侧buffer和终端上报BSR之间的时延为0，该方法可以包括：
S301：UE Index＝10的终端初始接入，T1时刻上报BSR1；
其中，BSR1的大小为1000bits；由于是终端初始接入后的上报，因此，基站当前维护BSR就是BSR1，大小为1000bits。
S302：基站对BSR1添加时间标识T1；
S303：T2时刻终端新上报BSR为1500bits。
S304：基站当前维护的BSR大小总量为1000bits，新上报的BSR大于基站当前维护的BSR大小总量为，由此可以说明终端侧有新数据产生，基站维护T2时刻新上报的BSR2＝1500-1000＝500bits。
S305：判断BSR个数是否达标：
具体地，目前基站仅有一个BSR，小于基站自身维护BSR个数上限，则基站维护BSR2＝500bits，时间标识为T2，更新基站当前维护的BSR大小总量为1500bits。
S306：T3时刻终端新上报BSR为2000bits。
S307：基站当前维护的BSR大小总量为1500bits，新上报的BSR大于当前维护的BSR大小，由此可以说明终端侧有新数据产生，基站维护T3时刻新上报的BSR3＝2000-1500＝500bits。
S308：判断BSR个数是否达标；
具体地，目前基站已有2个BSR，已经达到基站自身维护BSR个数上限，则将BSR3并入BSR2，BSR3的时间标记设置为BSR2的时间标记，即更新BSR2＝500+500＝1000bits，时间标识为T2，忽略新上报BSR3的500bits的上报时间T3，更新基站当前维护的BSR大小总量为2000bits。
S309：T4时刻基站调度终端，此时BSR1的等待时延为T4-T1，按照最大时间计算。
S310：基站根据调度算法和BSR的等待时延进行调度；
具体地，基站调度终端1500bits。
S311：基站对当前维护的BSR大小进行更新；
具体地，由于BSR1＝1000bits，调度1500bits>BSR1，因此，BSR1调度完毕；
调度剩余500bits，因此，BSR2剩余1000-(1500-1000)＝500bits，时间标识为T2。
S312：基站对自身当前已维护的BSR个数更新；
具体地，BSR1调度完毕，则BSR2更新为BSR1，BSR2空缺。
可以理解的，如果有新BSR上报，则重复S306至S308；如果基站调度终端，则重复S309至S312。
在图1所示实施例的基础上，如图4所示，为本发明实施例提供的另一种上行业务具体的调度方法，该方法可以用于一基站，在本实施例中，设定基站自身维护BSR个数上限为无穷大，基站为非连续调度，即业务到达终端侧buffer和终端上报BSR之间的时延为[1，5]ms的随机数，5表示SR周期，该方法可以包括：
S401：UE Index＝10的UE初始接入，T1时刻上报BSR1；
其中，BSR1的大小为1000bits；由于是终端初始接入后的上报，因此，基站当前维护BSR就是BSR1，大小为1000bits。
S402：基站对BSR1添加时间标识T1。
S403：T2时刻基站调度终端，计算BSR1得等待时延；
具体地，由于是非连续调度，基站可以随机产生一个业务到达终端侧buffer和终端上报BSR之间的时延为2，BSR1的等待时延为T2-T1+2。
S404：基站根据调度算法和BSR的等待时延进行调度；
具体地，基站调度终端500bits。
S405：基站对当前维护的BSR大小进行更新；
具体地，BSR1’＝1000-500＝500bits，时间标识为T1。
S406：T3时刻终端新上报BSR为500bits。
S407：基站当前维护的BSR大小总量为500bits，新上报的BSR小于等于基站当前维护的BSR大小总量，由此可以说明终端侧没有新数据产生， 基站忽略该BSR；
S408：T4时刻终端新上报BSR为1000bits。
S409：基站当前维护的BSR大小总量为500bits，新上报的BSR大于基站当前维护的BSR大小总量，由此可以说明终端侧有新数据产生，基站维护T4时刻新上报的BSR2＝1000-500＝500bits，时间标识为T4，更新基站当前维护的BSR大小总量为1000bits。
S410：T5时刻基站调度终端，由于为非连续调度，基站随机产生一个[1，5]ms的随机数3作为业务到达终端侧buffer和终端上报BSR之间的时延，此时BSR1的等待时延为T5-T1+3，按照最大时间计算。
S411：基站根据调度算法和BSR的等待时延进行调度；
具体地，基站调度终端800bits。
S412：基站对当前维护的BSR大小进行更新；
具体地，由于BSR1＝500bits，调度800bits>BSR1，BSR1调度完毕；
调度剩余300bits，因此BSR2剩余500-(800-500)＝200bits，时间标识为T4。
S413：基站对自身当前已维护的BSR个数更新；
具体地，BSR1调度完毕，则BSR2更新为BSR1，BSR2空缺，后续依次类推。
可以理解的，如果终端有新BSR上报，则可以重复S408和S409；如果基站调度终端，则可以重复S410至S413。
以上图2至图4所示的实施例是对图1所示实施例的具体应用，从中可以得知，本发明实施例通过基站根据终端上报的BSR所获取的上行时延估计对上行业务进行调度，实现了对上行业务分组数据包的等待时延进行估算，从而保证上行业务分组数据包的PDB要求。
基于前述实施例，参见图5，其示出了本发明实施例提供的一种基站 50的结构，该基站50可以包括：接收单元501、确定单元502、第一更新单元503、获取单元504、调度单元505和第二更新单元506，其中，
所述接收单元501，配置为接收终端上报的缓存状态报告BSR；
所述确定单元502，配置为根据所述基站50自身当前维护的BSR大小总量以及所述BSR的大小确定所述BSR的有效性；
所述第一更新单元503，配置为当所述确定单元502确定所述BSR有效之后，将所述BSR进行时间标记，并按照所述BSR对所述基站50自身当前维护的BSR大小进行第一次更新；
当所述基站50进行业务调度时，所述获取单元504，配置为按照调度时刻与所述BSR的时间标记获取所述BSR的等待时延；
所述调度单元505，配置为根据预设的调度算法和BSR的等待时延进行调度；
所述第二更新单元506，配置为按照所述调度单元505的调度对所述第一次更新后的自身当前维护的BSR大小进行第二次更新
此处所述接收单元501的具体结构可包括所述基站与用户设备进行连接的空口，具体接口对应为接收天线或接收天线阵列。
所述确定单元502、所述第一更新单元503、所述获取单元504、所述调度单元505及所述第二更新单元506的具体结构可对应于基站内具有信息处理功能的处理器或处理芯片。所述处理器可为应用处理器AP、中央处理器CPU、微处理器MCU、数字信号处理器DSP或可编程阵列PLC等具有信息处理功能的处理器。
所述基站还包括与所述处理器或处理芯片连接的存储介质；所述存储介质用于存储所述BSR的数据，还可用于存储所述时间标记等信息。
所述获取单元504具体可包括能够从存储介质中读取所述时间标记的处理器或处理芯片等结构。
但是以上仅是一个所述基站的示例，基站的具体结构并不限于上述结构。
示例性地，所述确定单元502，配置为：当所述BSR大小大于所述基站50自身当前维护的BSR大小总量时，确定所述BSR有效；当所述BSR大小小于等于所述基站50自身当前维护的BSR大小总量时，确定所述BSR无效。
示例性地，所述第一更新单元503，配置为将所述BSR大小减去所述基站50自身当前维护的BSR大小总量得到的差值，得到所述BSR的更新大小。
示例性地，参见图6，所述基站50还包括记录单元507，配置为记录所述基站50自身当前已维护的BSR个数以及所述基站50自身维护BSR个数上限。所述记录单元507的具体结构可包括存储介质，所述存储介质通过存储的方式记录已维护的BSR个数以及所述基站50自身维护BSR个数上限。
所述第一更新单元503，配置为：所述确定单元502确定所述BSR有效之后，当所述自身当前已维护的BSR个数加上所述BSR的个数大于所述维护BSR个数上限时，将所述BSR的时间标记设置为所述基站50自身最后维护的BSR的时间标记，并且将所述BSR并入所述自身最后维护的BSR；
当所述自身当前已维护的BSR个数加上所述BSR的个数小于等于所述维护BSR个数上限时，将所述BSR进行时间标记，并按照所述BSR对所述基站50自身当前维护的BSR大小进行第一次更新。
示例性地，当所述基站50是连续调度时，所述BSR的等待时延为所述调度时刻减去所述BSR的时间标记；
当所述基站50为非连续调度时，所述BSR的等待时延为所述调度时刻减去所述BSR的时间标记再加上非连续调度随机值，所述非连续调度随机 值为一个处于[1，调度请求SR周期]的数值，其中，[*]表示闭区间，调度请求SR周期为调度请求的调度周期。
本实施例提供了一种基站50，调度单元配置为，用于通过获取单元根据终端上报的BSR所获取的上行时延估计对上行业务进行调度，实现了对上行业务分组数据包的等待时延进行估算，从而保证上行业务分组数据包的PDB要求。
本发明实施例还提供一种计算机存储介质，所述计算机存储介质中存储有计算机可执行指令，所述计算机可执行指令用于执行本发明实施例所述方法的至少其中之一，具体如图1至图4中的至少一个所示的方法。
所述计算机存储介质可为U盘、移动硬盘、只读存储器(ROM，Read-Only Memory)、随机存取存储器(RAM，Random Access Memory)、磁碟或者光盘等各种可以存储程序代码的介质；在一些实施例中，所述计算机存储介质为非瞬间存储介质。
本领域内的技术人员应明白，本发明的实施例可提供为方法、系统、或计算机程序产品。因此，本发明可采用硬件实施例、软件实施例、或结合软件和硬件方面的实施例的形式。而且，本发明可采用在一个或多个其中包含有计算机可用程序代码的计算机可用存储介质(包括但不限于磁盘存储器和光学存储器等)上实施的计算机程序产品的形式。
本发明是参照根据本发明实施例的方法、设备(系统)、和计算机程序产品的流程图和/或方框图来描述的。应理解可由计算机程序指令实现流程图和/或方框图中的每一流程和/或方框、以及流程图和/或方框图中的流程和/或方框的结合。可提供这些计算机程序指令到通用计算机、专用计算机、嵌入式处理机或其他可编程数据处理设备的处理器以产生一个机器，使得通过计算机或其他可编程数据处理设备的处理器执行的指令产生用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功 能的装置。
这些计算机程序指令也可存储在能引导计算机或其他可编程数据处理设备以特定方式工作的计算机可读存储器中，使得存储在该计算机可读存储器中的指令产生包括指令装置的制造品，该指令装置实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能。
这些计算机程序指令也可装载到计算机或其他可编程数据处理设备上，使得在计算机或其他可编程设备上执行一系列操作步骤以产生计算机实现的处理，从而在计算机或其他可编程设备上执行的指令提供用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的步骤。
以上所述，仅为本发明的较佳实施例而已，并非用于限定本发明的保护范围。凡按照本发明原理所作的修改，都应当理解为落入本发明的保护范围。

Claims (11)

  1. 一种上行业务的调度方法，所述方法包括：
    基站接收终端上报的缓存状态报告BSR；
    所述基站根据自身当前维护的BSR大小总量以及所述BSR的大小确定所述BSR的有效性；
    所述基站确定所述BSR有效之后，将所述BSR进行时间标记，并按照所述BSR对所述自身当前维护的BSR大小进行第一次更新；
    当所述基站进行业务调度时，按照调度时刻与所述BSR的时间标记获取所述BSR的等待时延；
    所述基站根据预设的调度算法和BSR的等待时延进行调度，并按照调度对所述第一次更新后的自身当前维护的BSR大小进行第二次更新。
  2. 根据权利要求1所述的方法，其中，所述基站根据自身当前维护的BSR大小以及所述BSR大小确定所述BSR的有效性，包括：
    当所述BSR大小大于所述基站自身当前维护的BSR大小总量时，所述基站确定所述BSR有效；
    当所述BSR大小小于等于所述基站自身当前维护的BSR大小总量时，所述基站确定所述BSR无效。
  3. 根据权利要求1所述的方法，其中，所述基站按照所述BSR对所述自身当前维护的BSR大小进行第一次更新，包括：
    所述基站将所述BSR大小减去所述自身当前维护的BSR大小总量得到的差值，得到所述BSR的更新大小。
  4. 根据权利要求1所述的方法，其中，所述基站还记录自身当前已维护的BSR个数以及自身维护BSR个数上限；
    所述基站确定所述BSR有效之后，还包括：
    当所述自身当前已维护的BSR个数加上所述BSR的个数大于所述维护BSR个数上限时，所述基站将所述BSR的时间标记设置为自身最后维护的BSR的时间标记，并且将所述BSR并入所述自身最后维护的BSR；
    当所述自身当前已维护的BSR个数加上所述BSR的个数小于等于所述维护BSR个数上限时，所述基站将所述BSR进行时间标记，并按照所述BSR对所述自身当前维护的BSR大小进行第一次更新。
  5. 根据权利要求1所述的方法，其中，当所述基站是连续调度时，所述BSR的等待时延为所述调度时刻减去所述BSR的时间标记；
    当所述基站为非连续调度时，所述BSR的等待时延为所述调度时刻减去所述BSR的时间标记再加上非连续调度随机值，所述非连续调度随机值为一个处于[1，调度请求SR周期]的数值，其中，[*]表示闭区间，调度请求SR周期为调度请求的调度周期。
  6. 一种基站，所述基站包括：接收单元、确定单元、第一更新单元、获取单元、调度单元和第二更新单元，其中，
    所述接收单元，配置为接收终端上报的缓存状态报告BSR；
    所述确定单元，配置为根据所述基站自身当前维护的BSR大小总量以及所述BSR的大小确定所述BSR的有效性；
    所述第一更新单元，配置为当所述确定单元确定所述BSR有效之后，将所述BSR进行时间标记，并按照所述BSR对所述基站自身当前维护的BSR大小进行第一次更新；
    所述获取单元，配置为当所述基站进行业务调度时，按照调度时刻与所述BSR的时间标记获取所述BSR的等待时延；
    所述调度单元，配置为根据预设的调度算法和BSR的等待时延进行调度；
    所述第二更新单元，配置为按照所述调度单元的调度对所述第一次更 新后的自身当前维护的BSR大小进行第二次更新。
  7. 根据权利要求6所述的基站，其中，
    所述确定单元，配置为：
    当所述BSR大小大于所述基站自身当前维护的BSR大小总量时，确定所述BSR有效；
    当所述BSR大小小于等于所述基站自身当前维护的BSR大小总量时，确定所述BSR无效。
  8. 根据权利要求6所述的基站，其中，所述第一更新单元，用于将所述BSR大小减去所述基站自身当前维护的BSR大小总量得到的差值，得到所述BSR的更新大小。
  9. 根据权利要求6所述的基站，其中，所述基站还包括记录单元，用于记录所述基站自身当前已维护的BSR个数以及所述基站自身维护BSR个数上限；
    所述第一更新单元，配置为：
    所述确定单元确定所述BSR有效之后，
    当所述自身当前已维护的BSR个数加上所述BSR的个数大于所述维护BSR个数上限时，将所述BSR的时间标记设置为所述基站自身最后维护的BSR的时间标记，并且将所述BSR并入所述自身最后维护的BSR；
    当所述自身当前已维护的BSR个数加上所述BSR的个数小于等于所述维护BSR个数上限时，将所述BSR进行时间标记，并按照所述BSR对所述基站自身当前维护的BSR大小进行第一次更新。
  10. 根据权利要求6所述的基站，其中，当所述基站是连续调度时，所述BSR的等待时延为所述调度时刻减去所述BSR的时间标记；
    当所述基站为非连续调度时，所述BSR的等待时延为所述调度时刻减去所述BSR的时间标记再加上非连续调度随机值，所述非连续调度随机值 为一个处于[1，调度请求SR周期]的数值，其中，[*]表示闭区间，调度请求SR周期为调度请求的调度周期。
  11. 一种计算机存储介质，所述计算机存储介质中存储有计算机可执行指令，所述计算机可执行指令用于执行权利要求1至5所述方法的至少其中之一。
PCT/CN2015/074108 2014-10-23 2015-03-12 上行业务的调度方法、基站和计算机存储介质 WO2016061976A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201410571021.9 2014-10-23
CN201410571021.9A CN105592554B (zh) 2014-10-23 2014-10-23 一种上行业务的调度方法和基站

Publications (1)

Publication Number Publication Date
WO2016061976A1 true WO2016061976A1 (zh) 2016-04-28

Family

ID=55760155

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2015/074108 WO2016061976A1 (zh) 2014-10-23 2015-03-12 上行业务的调度方法、基站和计算机存储介质

Country Status (2)

Country Link
CN (1) CN105592554B (zh)
WO (1) WO2016061976A1 (zh)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2017193675A1 (zh) * 2016-05-12 2017-11-16 中兴通讯股份有限公司 上行资源的调度方法和装置
WO2019213924A1 (zh) * 2018-05-10 2019-11-14 华为技术有限公司 通信方法、通信装置和系统
US11516839B2 (en) 2017-06-30 2022-11-29 Qualcomm Incorporated Discontinuous scheduling
WO2023234817A1 (en) * 2022-06-03 2023-12-07 Telefonaktiebolaget Lm Ericsson (Publ) Method for keeping track of data in an uplink buffer of a user equipment by using information in a buffer status report to maintain an age map of the buffered data

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107613524B (zh) * 2016-07-12 2022-08-19 中兴通讯股份有限公司 数据更新方法和装置及系统、基站
WO2024092633A1 (en) * 2022-11-03 2024-05-10 Zte Corporation Ue information reporting and packet delay management in wireless communication

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20130028127A1 (en) * 2010-04-06 2013-01-31 Alcatel Lucent Methods, apparatuses and nodes for determining and adjusting target packet delay of a link segment
CN102983955A (zh) * 2012-11-13 2013-03-20 电信科学技术研究院 一种小带宽业务的调度方法及装置
US8670340B2 (en) * 2010-04-05 2014-03-11 Samsung Electronics Co., Ltd. Method and apparatus for uplink scheduling in a communication system
WO2014051717A1 (en) * 2012-09-27 2014-04-03 Intel Corporation System and method for resource allocation priority in multiple-persona cellular devices

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8897252B2 (en) * 2009-06-17 2014-11-25 Htc Corporation Method for transmitting data in a wireless communication system and system thereof
CN102833857A (zh) * 2011-06-17 2012-12-19 中兴通讯股份有限公司 一种上行数据发送调度方法、系统及装置
CN102647718A (zh) * 2012-04-16 2012-08-22 北京大学 一种对VoIP业务进行混合资源分配的方法
WO2015035579A1 (zh) * 2013-09-11 2015-03-19 华为技术有限公司 一种数据传输方法及用户设备

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8670340B2 (en) * 2010-04-05 2014-03-11 Samsung Electronics Co., Ltd. Method and apparatus for uplink scheduling in a communication system
US20130028127A1 (en) * 2010-04-06 2013-01-31 Alcatel Lucent Methods, apparatuses and nodes for determining and adjusting target packet delay of a link segment
WO2014051717A1 (en) * 2012-09-27 2014-04-03 Intel Corporation System and method for resource allocation priority in multiple-persona cellular devices
CN102983955A (zh) * 2012-11-13 2013-03-20 电信科学技术研究院 一种小带宽业务的调度方法及装置

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2017193675A1 (zh) * 2016-05-12 2017-11-16 中兴通讯股份有限公司 上行资源的调度方法和装置
CN107371263A (zh) * 2016-05-12 2017-11-21 中兴通讯股份有限公司 上行资源的调度方法和装置
CN107371263B (zh) * 2016-05-12 2022-08-19 中兴通讯股份有限公司 上行资源的调度方法和装置
US11516839B2 (en) 2017-06-30 2022-11-29 Qualcomm Incorporated Discontinuous scheduling
WO2019213924A1 (zh) * 2018-05-10 2019-11-14 华为技术有限公司 通信方法、通信装置和系统
US11576068B2 (en) 2018-05-10 2023-02-07 Huawei Technologies Co., Ltd. Communication method, communications apparatus, and system
WO2023234817A1 (en) * 2022-06-03 2023-12-07 Telefonaktiebolaget Lm Ericsson (Publ) Method for keeping track of data in an uplink buffer of a user equipment by using information in a buffer status report to maintain an age map of the buffered data

Also Published As

Publication number Publication date
CN105592554A (zh) 2016-05-18
CN105592554B (zh) 2020-07-03

Similar Documents

Publication Publication Date Title
WO2016061976A1 (zh) 上行业务的调度方法、基站和计算机存储介质
CN105407524B (zh) Phr的发送方法和用户终端
US8787290B2 (en) Method for wireless resource scheduling, network element of access network and terminal thereof
CN103503550B (zh) 在基站中用于向用户设备分配通信资源的方法、基站和计算机可读介质
CN110326269B (zh) 一种数据报文传输方法及装置
CN104053239B (zh) 一种时域资源分配方法及装置
JP2017513370A (ja) デュアル接続システムにおけるフロー・コントロールのための方法および装置
EP3206426B1 (en) Inter-cell interference processing method, device and computer program product
CN105191458B (zh) 一种发送、接收系统信息的方法及装置
EP3200505B1 (en) Method and device for estimating uplink service waiting delay
CN108476108B (zh) 用于资源需求信令以及速率设置的无线通信方法和装置
TW201114298A (en) Resource allocation apparatus, subscriber station, resource allocation method, and computer readable medium
WO2016165439A1 (zh) 确定上行调度量的方法、装置及系统
WO2016161606A1 (zh) 消息发送/接收方法、覆盖增强等级确定/获取方法及相关设备
WO2020098575A1 (zh) 一种容量规划方法及装置
TW201417608A (zh) 無線通信裝置、無線通信系統、無線通信方法及程式
TWI823025B (zh) 具有多重排程請求組態之排程請求程序技術
WO2017147771A1 (zh) 业务优化处理方法、设备及系统
WO2016206220A1 (zh) 一种资源冲突处理方法、装置及存储介质
CN111373807B (zh) 一种数据传输方法及装置
CN108024279B (zh) 一种获取测量报告的方法及服务器
JPWO2016117043A1 (ja) 通信品質測定の方法及びシステム
WO2017193675A1 (zh) 上行资源的调度方法和装置
WO2018099039A1 (zh) Mcs信息指示方法、mcs信息指示装置、基站及终端
WO2016206472A1 (zh) 一种mac流量调度方法、装置、基站和计算机可读存储介质

Legal Events

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

Ref document number: 15853075

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 15853075

Country of ref document: EP

Kind code of ref document: A1