WO2016206472A1 - 一种mac流量调度方法、装置、基站和计算机可读存储介质 - Google Patents

一种mac流量调度方法、装置、基站和计算机可读存储介质 Download PDF

Info

Publication number
WO2016206472A1
WO2016206472A1 PCT/CN2016/080523 CN2016080523W WO2016206472A1 WO 2016206472 A1 WO2016206472 A1 WO 2016206472A1 CN 2016080523 W CN2016080523 W CN 2016080523W WO 2016206472 A1 WO2016206472 A1 WO 2016206472A1
Authority
WO
WIPO (PCT)
Prior art keywords
mac traffic
user terminal
historical
mac
serving cell
Prior art date
Application number
PCT/CN2016/080523
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 WO2016206472A1 publication Critical patent/WO2016206472A1/zh

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/10—Flow control between communication endpoints
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/0231—Traffic management, e.g. flow control or congestion control based on communication conditions

Definitions

  • the present application relates to, but is not limited to, the field of communications, and in particular, to a MAC traffic scheduling method, apparatus, base station, and computer readable storage medium.
  • the MAC (Media Access Control Layer) traffic scheduling method is as follows:
  • the polling algorithm is like its name, and each user is rounded to avoid the situation where the maximum C/I algorithm cannot balance the weak users.
  • Each user in the sector allocates RB resources evenly. But at the expense of the maximum throughput and resource utilization of the sector.
  • the above two algorithms take a compromise approach, the proportional fair algorithm.
  • the original intention of the proportional fairness algorithm is to take into account the C/I in which the user is located, while at the same time balancing the fairness of the distribution.
  • the main technical problem to be solved by the embodiments of the present invention is to provide a MAC traffic scheduling method, apparatus, base station, and computer readable storage medium, which solves the problem that the existing user terminal uses MAC address scheduling only when considering the wireless situation. Inaccurate, resulting in inaccurate control of the scheduling weight, and low scheduling efficiency and poor user experience satisfaction.
  • a MAC traffic scheduling method includes:
  • determining, according to the historical MAC traffic information, the MAC traffic scheduling priority of the user terminal in the new serving cell includes: determining, according to the historical MAC traffic information, a user terminal with a larger historical MAC traffic, after the switching The higher the MAC traffic scheduling priority in the new serving cell.
  • obtaining historical MAC traffic information of the user terminal in the original serving cell before the handover includes:
  • n is greater than or equal to 1, and n is a positive integer.
  • obtaining historical MAC traffic information of the last n scheduling time windows of the original serving cell of the user terminal before the handover includes: obtaining an actual average throughput of the historical MAC traffic of the user terminal in the n scheduling time windows. Ri(t).
  • determining, according to the historical MAC traffic information, the MAC traffic scheduling priority of the user terminal in the switched new serving cell further includes:
  • MAC traffic scheduling priority P (actual average throughput Ri(t) * actual instantaneous throughput ri(t)) / (theoretical maximum average throughput Rmax * theoretical maximum instantaneous throughput rmax).
  • the method further includes: obtaining an actual average throughput Ri(t) of the historical MAC traffic from the user terminal, or acquiring an actual average throughput of historical MAC traffic of the user terminal from a core network. Ri(t).
  • a MAC traffic scheduling device includes:
  • the historical traffic obtaining module is configured to obtain historical MAC traffic information of the user terminal in the original serving cell before the handover;
  • the processing module is configured to determine, according to the historical MAC traffic information, a MAC traffic scheduling priority of the user terminal in the switched new serving cell.
  • the determining, by the processing module, the MAC traffic scheduling priority of the user terminal in the new serving cell according to the historical MAC traffic information including: determining, according to the historical MAC traffic information, a user terminal having a larger historical MAC traffic, The MAC traffic scheduling priority in the new serving cell after handover is higher.
  • the historical traffic obtaining module obtains historical MAC traffic information of the user terminal in the original serving cell before the handover includes:
  • n is greater than or equal to 1, and n is a positive integer.
  • the historical traffic obtaining module acquires the historical MAC traffic information of the last n scheduling time windows of the original serving cell of the user terminal before the handover, including: obtaining the history of the user terminal in the n scheduling time windows.
  • the determining, by the processing module, the MAC traffic scheduling priority of the user terminal in the switched new serving cell according to the historical MAC traffic information further includes:
  • MAC traffic scheduling priority P (actual average throughput Ri(t) * actual instantaneous throughput ri(t)) / (theoretical maximum average throughput Rmax * theoretical maximum instantaneous throughput rmax).
  • the acquiring user terminal is further configured to: obtain an actual average throughput Ri(t) of the historical MAC traffic from the user terminal, or obtain an actual historical MAC traffic of the user terminal from a core network. Average throughput Ri(t).
  • a base station comprising the MAC traffic scheduling device as described above.
  • a computer readable storage medium storing computer executable instructions that, when executed by a processor, implement the MAC traffic scheduling method.
  • the historical MAC traffic information of the user terminal in the original serving cell before the handover is obtained, and then, according to the historical MAC traffic information, the user terminal is determined to be after the handover.
  • MAC traffic scheduling priority in the new serving cell Since determining whether a user is a good user has a direct and close relationship with the historical MAC traffic of the user, it is more realistic to use historical MAC traffic as a priority for measuring user MAC traffic scheduling. Therefore, the distinction between the users is more accurate, and the priority control of the MAC traffic scheduling determined on the basis is more accurate.
  • the present invention can directly obtain the historical MAC traffic information of the user terminal in the original serving cell. Therefore, when switching to the new serving cell, the calculation can be performed based on the previous historical MAC traffic information, without re-zeroing, which can improve scheduling efficiency and improve user experience satisfaction.
  • FIG. 1 is a schematic flowchart of a MAC traffic scheduling process of a user terminal according to Embodiment 1 of the present invention
  • FIG. 2 is a schematic flowchart of obtaining an actual average throughput of historical MAC traffic from a user terminal according to Embodiment 1 of the present invention
  • FIG. 3 is a schematic structural diagram of a MAC traffic scheduling apparatus according to Embodiment 2 of the present invention.
  • Embodiment 1 is a diagrammatic representation of Embodiment 1:
  • the MAC traffic scheduling process for the user terminal includes steps S101 to S102:
  • S102 Determine, according to the obtained historical MAC traffic information, a MAC traffic scheduling priority of the user terminal in the new serving cell after the handover.
  • the rule for determining the priority is: the user terminal with the larger historical MAC traffic is determined according to the historical MAC traffic information, and the MAC traffic scheduling priority in the new serving cell after the handover is higher.
  • the higher the historical traffic the higher the consumption on behalf of the user terminal, and the more the operator will contribute. For such user terminals, the user terminal will be determined to be a good user, so a higher scheduling priority should be obtained.
  • Priority value rules can be flexibly set according to different applications and actual needs.
  • step S101 acquiring historical MAC traffic information of the user terminal in the original serving cell before the handover includes:
  • n can be any positive integer value greater than or equal to one.
  • the obtained historical MAC traffic information of the last n scheduling time windows in the original serving cell before the handover includes: obtaining the actual average throughput Ri(t) of the historical MAC traffic of the user terminal in the n scheduling time windows. .
  • Determining, according to the historical MAC traffic information of the user terminal, the MAC traffic scheduling priority of the user terminal in the switched new serving cell may be any of the following modes:
  • MAC traffic scheduling priority P actual average throughput Ri(t) / theoretical maximum average throughput Rmax.
  • MAC traffic scheduling priority P (actual average throughput Ri(t) * actual instantaneous throughput ri(t)) / (theoretical maximum average throughput Rmax * theoretical maximum instantaneous throughput rmax).
  • the MAC traffic scheduling priority P obtained in the above manner may be actually used as a priority weight value, and the corresponding actual priority may be obtained according to the weight value, or may be directly used as the priority value.
  • the actual average throughput Ri(t) of the historical MAC traffic of the user terminal is obtained. It can be obtained directly from the user terminal or from the core network.
  • the user terminal may send the actual average throughput Ri(t) of the historical MAC traffic to the target base station through the RRCComplete message;
  • the core network calculates the actual average throughput Ri of the historical MAC traffic ( After t), it can be sent to the target base station through RRCConnectionReconfiguration.
  • the actual average throughput Ri(t) of the historical MAC traffic may be characterized by the actual obtained throughput value, or may be characterized by using a pre-approved range value, as shown in Table 1 below.
  • the actual average throughput Ri(t) of the MAC traffic is the range value.
  • the following takes an example of obtaining the actual average throughput Ri(t) of the historical MAC traffic from the user terminal as an example. Referring to FIG. 2, the obtained process includes steps S201 to S201:
  • the target base station sends an RRCConnectionReconfiguration to the user terminal.
  • the user equipment feeds back, to the target base station, an RRCConnectionReconfigurationComplete carrying the actual average throughput Ri(t) of the historical MAC traffic.
  • Embodiment 2 is a diagrammatic representation of Embodiment 1:
  • the MAC traffic scheduling apparatus includes:
  • the historical traffic obtaining module 1 is configured to obtain historical MAC traffic information of the user terminal in the original serving cell before the handover.
  • the processing module 2 is configured to determine, according to the historical MAC traffic information, a MAC traffic scheduling priority of the user terminal in the new serving cell after the handover; the rule for determining the priority is: determining a user with a larger historical MAC traffic according to the historical MAC traffic information. Terminal, MAC in the new serving cell after handover The higher the traffic scheduling priority. In practice, the higher the historical traffic, the higher the consumption on behalf of the user terminal, and the more contributing to the operator. For such user terminals, this is determined to be a good user, and therefore a higher scheduling priority should be obtained. Priority value rules can be flexibly set according to different applications and actual needs.
  • the historical traffic acquisition module 1 obtains historical MAC traffic information of the user terminal in the original serving cell before the handover, including:
  • n can be any positive integer value greater than or equal to one.
  • the obtained historical MAC traffic information of the last n scheduling time windows in the original serving cell before the handover includes: obtaining the actual average throughput Ri(t) of the historical MAC traffic of the user terminal in the n scheduling time windows. .
  • the processing module 2 determines, according to the historical MAC traffic information of the user terminal, the MAC traffic scheduling priority of the user terminal in the switched new serving cell, which may be in any of the following manners:
  • MAC traffic scheduling priority P actual average throughput Ri(t) / theoretical maximum average throughput Rmax.
  • MAC traffic scheduling priority P (actual average throughput Ri(t) * actual instantaneous throughput ri(t)) / (theoretical maximum average throughput Rmax * theoretical maximum instantaneous throughput rmax).
  • the MAC traffic scheduling priority P obtained in the above manner may be actually used as a priority weight value, and the corresponding actual priority may be obtained according to the weight value, or may be directly used as the priority value.
  • the actual average throughput Ri(t) of the historical MAC traffic of the user terminal may be obtained directly from the user terminal, or may be obtained from the core network.
  • the user terminal may send the actual average throughput Ri(t) of the historical MAC traffic to the target base station through the RRCComplete message;
  • the core network calculates the actual average throughput Ri of the historical MAC traffic ( After t), it can be sent to the target base station through RRCConnectionReconfiguration.
  • the MAC traffic scheduling apparatus may be implemented by software, or implemented by hardware, or implemented by a combination of software and hardware, which may be integrated with a base station; or may be set independently of the base station.
  • a computer readable storage medium storing computer executable instructions that, when executed by a processor, implement the MAC traffic scheduling method.
  • all or part of the steps of the above embodiments may also be implemented by using an integrated circuit. These steps may be separately fabricated into individual integrated circuit modules, or multiple modules or steps may be fabricated into a single integrated circuit module. achieve.
  • the devices/function modules/functional units in the above embodiments may be implemented by a general-purpose computing device, which may be centralized on a single computing device or distributed over a network of multiple computing devices.
  • the device/function module/functional unit in the above embodiment When the device/function module/functional unit in the above embodiment is implemented in the form of a software function module and sold or used as a stand-alone product, it can be stored in a computer readable storage medium.
  • the above mentioned computer readable storage medium may be a read only memory, a magnetic disk or an optical disk or the like.
  • the historical MAC traffic information of the user terminal in the original serving cell before the handover is obtained, and then, according to the historical MAC traffic information, the user terminal is determined to be after the handover.
  • MAC traffic scheduling priority in the new serving cell Since determining whether a user is a good user has a direct and close relationship with the historical MAC traffic of the user, it is more practical to use historical MAC traffic as a priority for measuring user MAC traffic scheduling, and accordingly, the distinction between users is more accurate.
  • the present invention can directly obtain the historical MAC traffic information of the user terminal in the original serving cell, so when switching to the new serving cell, it can be based on the previous Historical MAC traffic information is calculated without re-zeroing calculations, which improves scheduling efficiency and improves user experience satisfaction.

Abstract

本发明公开了一种MAC流量调度方法、装置、基站和计算机可读存储介质，该方法包括：在用户终端进行小区切换过程中，获取该用户终端在切换前的原服务小区中的历史MAC流量信息，进而根据该历史MAC流量信息，确定该用户终端在切换后的新服务小区中的MAC流量调度优先级。

Description

一种MAC流量调度方法、装置、基站和计算机可读存储介质 技术领域
本申请涉及但不限于通信领域，尤其涉及一种MAC流量调度方法、装置、基站和计算机可读存储介质。
背景技术
目前，用户终端发生小区切换时，MAC(Media Access Control,媒体介入控制层)流量调度的方式有以下几种：
1、最大C/I算法
由于UE在空间中的是随机的，那么所处的无线环境也不同，从上面AMC的机制我们知道，无线环境好(C/I好)的UE会上报更大的CQI(Channel Quality Indicator，无线信道质量)，从而获得更高的速率。所以如果想获得最大的扇区吞吐量的话，最好的办法就是将RB(Resource Block)都给C/I最好的用户。这个算法最大的好处就是能获得最大的扇区吞吐量和资源利用率，但是也有个致命的缺点，就是不公平，那些处在覆盖中间和边缘的用户由于C/I不如在覆盖中心的用户，可能一点被分配RB的机会都没有，所以就产生了第二种算法，轮询算法。
2、轮询算法RR
轮询算法就像它的名字，每个用户轮着来，避免了最大C/I算法无法兼顾弱势用户的那种情况，扇区下每个用户平均分配RB资源。但是牺牲了扇区的最大吞吐量和资源利用率。
3、比例公平算法PF
上面两种算法采取了个折中的方法，比例公平算法。比例公平算法的初衷是既要考虑到用户所处的C/I，同时又要兼顾分配的公平。
以上三种方法都有一个明显的缺陷，那就是只是考虑到无线情况来区分是否优质用户，而实际情况是，是否优质用户的判断跟无线情况完全没有关 系。另外，上述方法用户终端到新小区后会丢掉原有的信息，因此需要完全从零开始重新计算，对用户终端会造成一些数据损失，导致调度效率等性能下降。
发明内容
以下是对本文详细描述的主题的概述。本概述并非是为了限制权利要求的保护范围。
本发明实施例要解决的主要技术问题是，提供一种MAC流量调度方法、装置、基站和计算机可读存储介质，解决现有用户终端在跨小区时MAC流量调度只考虑无线情况导致对用户区分不准确从而导致调度比重控制不准，且调度效率低、用户体验的满意度差的问题。
一种MAC流量调度方法，包括：
获取用户终端在切换前的原服务小区中的历史MAC流量信息；
根据所述历史MAC流量信息，确定所述用户终端在切换后的新服务小区中的MAC流量调度优先级。
可选地，根据所述历史MAC流量信息确定所述用户终端在新服务小区中的MAC流量调度优先级包括：根据所述历史MAC流量信息确定历史MAC流量越大的用户终端，在切换后的新服务小区中的MAC流量调度优先级越高。
可选地，获取用户终端在切换前的原服务小区中的历史MAC流量信息包括：
获取用户终端在切换前的原服务小区中最近n个调度时间窗口的历史MAC流量信息；所述n大于或等于1，n为正整数。
可选地，获取用户终端在切换前的原服务小区中最近n个调度时间窗口的历史MAC流量信息包括：获取所述用户终端在所述n个调度时间窗口中历史MAC流量的实际平均吞吐量Ri(t)。
可选地，根据所述历史MAC流量信息确定所述用户终端在切换后的新服务小区中的MAC流量调度优先级还包括：
获取所述调度时间窗口的理论最大平均吞吐量Rmax；
MAC流量调度优先级P＝实际平均吞吐量Ri(t)/理论最大平均吞吐量Rmax；
或，
获取所述调度时间窗口的理论最大平均吞吐量Rmax，并获取所述用户终端在所述新服务小区中当前分配的k个连续资源块的实际瞬时吞吐量ri(t)和理论最大瞬时吞吐量rmax；所述k大于或等于1，k为正整数；
MAC流量调度优先级P＝(实际平均吞吐量Ri(t)*实际瞬时吞吐量ri(t))/(理论最大平均吞吐量Rmax*理论最大瞬时吞吐量rmax)。
可选地，所述方法还包括：从所述用户终端处获取所述历史MAC流量的实际平均吞吐量Ri(t)，或从核心网获取所述用户终端的历史MAC流量的实际平均吞吐量Ri(t)。
一种MAC流量调度装置，包括：
历史流量获取模块，设置为获取用户终端在切换前的原服务小区中的历史MAC流量信息；
处理模块，设置为根据所述历史MAC流量信息，确定所述用户终端在切换后的新服务小区中的MAC流量调度优先级。
可选地，所述处理模块根据所述历史MAC流量信息确定所述用户终端在新服务小区中的MAC流量调度优先级包括：根据所述历史MAC流量信息确定历史MAC流量越大的用户终端，在切换后的新服务小区中的MAC流量调度优先级越高。
可选地，所述历史流量获取模块获取用户终端在切换前的原服务小区中的历史MAC流量信息包括：
获取用户终端在切换前的原服务小区中最近n个调度时间窗口的历史MAC流量信息；所述n大于或等于1，n为正整数。
可选地，所述历史流量获取模块获取用户终端在切换前的原服务小区中最近n个调度时间窗口的历史MAC流量信息为包括：获取所述用户终端在所述n个调度时间窗口中历史MAC流量的实际平均吞吐量Ri(t)。
可选地，所述处理模块根据所述历史MAC流量信息确定所述用户终端在切换后的新服务小区中的MAC流量调度优先级还包括：
获取所述调度时间窗口的理论最大平均吞吐量Rmax；
MAC流量调度优先级P＝实际平均吞吐量Ri(t)/理论最大平均吞吐量Rmax；
或，
获取所述调度时间窗口的理论最大平均吞吐量Rmax，并获取所述用户终端在所述新服务小区中当前分配的k个连续资源块的实际瞬时吞吐量ri(t)和理论最大瞬时吞吐量rmax；所述k大于或等于1，k为正整数；
MAC流量调度优先级P＝(实际平均吞吐量Ri(t)*实际瞬时吞吐量ri(t))/(理论最大平均吞吐量Rmax*理论最大瞬时吞吐量rmax)。
可选地，所述获取用户终端还设置为：从所述用户终端处获取所述历史MAC流量的实际平均吞吐量Ri(t)，或从核心网获取所述用户终端的历史MAC流量的实际平均吞吐量Ri(t)。
一种基站，包括如上所述的MAC流量调度装置。
一种计算机可读存储介质，存储有计算机可执行指令，所述计算机可执行指令被处理器执行时实现所述的MAC流量调度方法。
通过本发明实施例的方案，在用户终端进行小区切换过程中，获取该用户终端在切换前的原服务小区中的历史MAC流量信息，进而根据该历史MAC流量信息，确定该用户终端在切换后的新服务小区中的MAC流量调度优先级。由于判断一个用户是否是优质用户跟该用户的历史MAC流量有直接密切的关系，因此采用历史MAC流量作为衡量用户MAC流量调度的优先级更为切合实 际，据此对用户的区分更为准确，并在此基础上确定的MAC流量调度的优先级控制也更为准确；同时，本发明可以直接获取用户终端在原服务小区中的历史MAC流量信息，因此当切换到新服务小区后可以基于之前的历史MAC流量信息进行计算，而不用重新归零计算，可提升调度效率，提升用户体验的满意度。
附图概述
图1为本发明实施例一提供的用户终端的MAC流量调度流程示意图；
图2为本发明实施例一提供的从用户终端获取历史MAC流量的实际平均吞吐量流程示意图；
图3为本发明实施例二提供的MAC流量调度装置结构示意图。
本发明的实施方式
下面结合附图对本发明的实施方式进行描述。需要说明的是，在不冲突的情况下，本申请中的实施例及实施例中的特征可以相互任意组合。
实施例一：
请参见图1所示，本实施例针对用户终端跨小区(也即进行小区切换时)，对该用户终端的MAC流量调度过程包括步骤S101～S102：
S101、获取用户终端在切换前的原服务小区中的历史MAC流量信息。
S102、根据获取的历史MAC流量信息，确定用户终端在切换后的新服务小区中的MAC流量调度优先级。确定优先级的规则为：根据历史MAC流量信息确定历史MAC流量越大的用户终端，在切换后的新服务小区中的MAC流量调度优先级越高。因为实际中，历史流量越高，代表该用户终端的消费也就越高，对运营商也就越有贡献，对于这类用户终端将确定为优质用户，因此应该获得更高的调度优先级。优先级的取值规则可根据不同的应用和实际需求进行灵活设定。
在上述步骤S101中，获取用户终端在切换前的原服务小区中的历史MAC流量信息包括：
获取用户终端在切换前的原服务小区中最近的n调度时间窗口的历史MAC流量信息；因为最近的调度时间窗口的历史MAC流量信息比较能表征该用户终端最新的状态；当然，应当理解的是n的取值可为大于或等于1的任意正整数值。
本实施例中，获取的在切换前的原服务小区中最近n个调度时间窗口的历史MAC流量信息包括：获取用户终端在n个调度时间窗口中历史MAC流量的实际平均吞吐量Ri(t)。
根据用户终端的历史MAC流量信息确定用户终端在切换后的新服务小区中的MAC流量调度优先级可以采用以下方式中的任意一种：
方式一：
获取调度时间窗口的理论最大平均吞吐量Rmax。
MAC流量调度优先级P＝实际平均吞吐量Ri(t)/理论最大平均吞吐量Rmax。
方式二：
获取调度时间窗口的理论最大平均吞吐量Rmax，以及获取用户终端在新服务小区中当前分配的k个连续资源块的实际瞬时吞吐量ri(t)和理论最大瞬时吞吐量rmax。
MAC流量调度优先级P＝(实际平均吞吐量Ri(t)*实际瞬时吞吐量ri(t))/(理论最大平均吞吐量Rmax*理论最大瞬时吞吐量rmax)。
通过上述方式得到的MAC流量调度优先级P可以实际作为一个优先级的权重值，可以根据该权重值再通过相应的换算得到对应的实际优先级；也可以直接作为优先级值使用。
本实施例中，获取用户终端的历史MAC流量的实际平均吞吐量Ri(t)可 以直接从用户终端处获取，也可以从核心网获取。从用户终端获取时，用户终端可以通过RRCComplete消息将历史MAC流量的实际平均吞吐量Ri(t)发送给目标基站；从核心网获取时，核心网计算得到历史MAC流量的实际平均吞吐量Ri(t)后，可以通过RRCConnectionReconfiguration发给目标基站。
本实施例中，历史MAC流量的实际平均吞吐量Ri(t)可以采用实际得到的吞吐量值进行表征，也可以采用预先核定的范围值进行表征，请参见下表一，此时获取的历史MAC流量的实际平均吞吐量Ri(t)就为范围值。
表一
Figure PCTCN2016080523-appb-000001
下面以从用户终端直接获取历史MAC流量的实际平均吞吐量Ri(t)为例进行说明；请参见图2所示，获取的流程包括步骤S201～S201：
S201、目标基站向用户终端发送RRCConnectionReconfiguration。
S202、用户终端向目标基站反馈携带历史MAC流量的实际平均吞吐量Ri(t)的RRCConnectionReconfigurationComplete。
实施例二：
请参见图3所示，本实施例提供的MAC流量调度装置包括：
历史流量获取模块1，设置为获取用户终端在切换前的原服务小区中的历史MAC流量信息。
处理模块2，设置为根据历史MAC流量信息，确定用户终端在切换后的新服务小区中的MAC流量调度优先级；确定优先级的规则为：根据历史MAC流量信息确定历史MAC流量越大的用户终端，在切换后的新服务小区中的MAC 流量调度优先级越高。因为实际中，历史流量越高，代表该用户终端的消费也就越高，对运营商也就越有贡献，对于这类用户终端这确定为优质用户，因此应该获得更高的调度优先级。优先级的取值规则可根据不同的应用和实际需求进行灵活设定。
历史流量获取模块1获取用户终端在切换前的原服务小区中的历史MAC流量信息包括：
获取用户终端在切换前的原服务小区中最近的n调度时间窗口的历史MAC流量信息；因为最近的调度时间窗口的历史MAC流量信息比较能表征该用户终端最新的状态；当然，应当理解的是n的取值可为大于或等于1的任意正整数值。
本实施例中，获取的在切换前的原服务小区中最近n个调度时间窗口的历史MAC流量信息包括：获取用户终端在n个调度时间窗口中历史MAC流量的实际平均吞吐量Ri(t)。
处理模块2根据用户终端的历史MAC流量信息确定用户终端在切换后的新服务小区中的MAC流量调度优先级可以采用以下方式中的任意一种：
方式一：
获取调度时间窗口的理论最大平均吞吐量Rmax。
MAC流量调度优先级P＝实际平均吞吐量Ri(t)/理论最大平均吞吐量Rmax。
方式二：
获取调度时间窗口的理论最大平均吞吐量Rmax，以及获取用户终端在新服务小区中当前分配的k个连续资源块的实际瞬时吞吐量ri(t)和理论最大瞬时吞吐量rmax。
MAC流量调度优先级P＝(实际平均吞吐量Ri(t)*实际瞬时吞吐量ri(t))/(理论最大平均吞吐量Rmax*理论最大瞬时吞吐量rmax)。
通过上述方式得到的MAC流量调度优先级P可以实际作为一个优先级的权重值，可以根据该权重值再通过相应的换算得到对应的实际优先级；也可以直接作为优先级值使用。
本实施例中，获取用户终端的历史MAC流量的实际平均吞吐量Ri(t)可以直接从用户终端处获取，也可以从核心网获取。从用户终端获取时，用户终端可以通过RRCComplete消息将历史MAC流量的实际平均吞吐量Ri(t)发送给目标基站；从核心网获取时，核心网计算得到历史MAC流量的实际平均吞吐量Ri(t)后，可以通过RRCConnectionReconfiguration发给目标基站。
本实施例提供的MAC流量调度装置可通过软件实现，或者通过硬件实现，或者通过软硬件结合实现，其可集成与基站上；也可以独立于基站之外设置。
一种计算机可读存储介质，存储有计算机可执行指令，所述计算机可执行指令被处理器执行时实现所述的MAC流量调度方法。
本领域普通技术人员可以理解上述实施例的全部或部分步骤可以使用计算机程序流程来实现，所述计算机程序可以存储于一计算机可读存储介质中，所述计算机程序在相应的硬件平台上(如系统、设备、装置、器件等)执行，在执行时，包括方法实施例的步骤之一或其组合。
可选地，上述实施例的全部或部分步骤也可以使用集成电路来实现，这些步骤可以被分别制作成一个个集成电路模块，或者将它们中的多个模块或步骤制作成单个集成电路模块来实现。
上述实施例中的装置/功能模块/功能单元可以采用通用的计算装置来实现，它们可以集中在单个的计算装置上，也可以分布在多个计算装置所组成的网络上。
上述实施例中的装置/功能模块/功能单元以软件功能模块的形式实现并作为独立的产品销售或使用时，可以存储在一个计算机可读取存储介质中。上述提到的计算机可读取存储介质可以是只读存储器，磁盘或光盘等。
工业实用性
通过本发明实施例的方案，在用户终端进行小区切换过程中，获取该用户终端在切换前的原服务小区中的历史MAC流量信息，进而根据该历史MAC流量信息，确定该用户终端在切换后的新服务小区中的MAC流量调度优先级。由于判断一个用户是否是优质用户跟该用户的历史MAC流量有直接密切的关系，因此采用历史MAC流量作为衡量用户MAC流量调度的优先级更为切合实际，据此对用户的区分更为准确，并在此基础上确定的MAC流量调度的优先级控制也更为准确；同时，本发明可以直接获取用户终端在原服务小区中的历史MAC流量信息，因此当切换到新服务小区后可以基于之前的历史MAC流量信息进行计算，而不用重新归零计算，可提升调度效率，提升用户体验的满意度。

Claims (14)

  1. 一种MAC流量调度方法，包括：
    获取用户终端在切换前的原服务小区中的历史MAC流量信息；
    根据所述历史MAC流量信息，确定所述用户终端在切换后的新服务小区中的MAC流量调度优先级。
  2. 如权利要求1所述的MAC流量调度方法，其中，所述根据所述历史MAC流量信息确定所述用户终端在新服务小区中的MAC流量调度优先级包括：根据所述历史MAC流量信息确定历史MAC流量越大的用户终端，在切换后的新服务小区中的MAC流量调度优先级越高。
  3. 如权利要求2所述的MAC流量调度方法，其中，所述获取用户终端在切换前的原服务小区中的历史MAC流量信息包括：
    获取用户终端在切换前的原服务小区中最近n个调度时间窗口的历史MAC流量信息；所述n大于或等于1，n为正整数。
  4. 如权利要求3所述的MAC流量调度方法，其中，所述获取用户终端在切换前的原服务小区中最近n个调度时间窗口的历史MAC流量信息包括：获取所述用户终端在所述n个调度时间窗口中历史MAC流量的实际平均吞吐量Ri(t)。
  5. 如权利要求4所述的MAC流量调度方法，其中，根据所述历史MAC流量信息确定所述用户终端在切换后的新服务小区中的MAC流量调度优先级还包括：
    获取所述调度时间窗口的理论最大平均吞吐量Rmax；
    MAC流量调度优先级P＝实际平均吞吐量Ri(t)/理论最大平均吞吐量Rmax；
    或，
    获取所述调度时间窗口的理论最大平均吞吐量Rmax，并获取所述用户终 端在所述新服务小区中当前分配的k个连续资源块的实际瞬时吞吐量ri(t)和理论最大瞬时吞吐量rmax；所述k大于或等于1，k为正整数；
    MAC流量调度优先级P＝(实际平均吞吐量Ri(t)*实际瞬时吞吐量ri(t))/(理论最大平均吞吐量Rmax*理论最大瞬时吞吐量rmax)。
  6. 如权利要求3-5任一项所述的MAC流量调度方法，所述方法还包括：从所述用户终端处获取所述历史MAC流量的实际平均吞吐量Ri(t)，或从核心网获取所述用户终端的历史MAC流量的实际平均吞吐量Ri(t)。
  7. 一种MAC流量调度装置，包括：
    历史流量获取模块，设置为获取用户终端在切换前的原服务小区中的历史MAC流量信息；
    处理模块，设置为根据所述历史MAC流量信息，确定所述用户终端在切换后的新服务小区中的MAC流量调度优先级。
  8. 如权利要求7所述的MAC流量调度装置，其中，所述处理模块根据所述历史MAC流量信息确定所述用户终端在新服务小区中的MAC流量调度优先级包括：根据所述历史MAC流量信息确定历史MAC流量越大的用户终端，在切换后的新服务小区中的MAC流量调度优先级越高。
  9. 如权利要求8所述的MAC流量调度装置，其中，所述历史流量获取模块获取用户终端在切换前的原服务小区中的历史MAC流量信息包括：
    获取用户终端在切换前的原服务小区中最近n个调度时间窗口的历史MAC流量信息；所述n大于或等于1，n为正整数。
  10. 如权利要求9所述的MAC流量调度装置，其中，所述历史流量获取模块获取用户终端在切换前的原服务小区中最近n个调度时间窗口的历史MAC流量信息包括：获取所述用户终端在所述n个调度时间窗口中历史MAC流量的实际平均吞吐量Ri(t)。
  11. 如权利要求10所述的MAC流量调度装置，其中，所述处理模块根 据所述历史MAC流量信息确定所述用户终端在切换后的新服务小区中的MAC流量调度优先级还包括：
    获取所述调度时间窗口的理论最大平均吞吐量Rmax；
    MAC流量调度优先级P＝实际平均吞吐量Ri(t)/理论最大平均吞吐量Rmax；
    或，
    获取所述调度时间窗口的理论最大平均吞吐量Rmax，并获取所述用户终端在所述新服务小区中当前分配的k个连续资源块的实际瞬时吞吐量ri(t)和理论最大瞬时吞吐量rmax；所述k大于或等于1，k为正整数；
    MAC流量调度优先级P＝(实际平均吞吐量Ri(t)*实际瞬时吞吐量ri(t))/(理论最大平均吞吐量Rmax*理论最大瞬时吞吐量rmax)。
  12. 如权利要求9-11任一项所述的MAC流量调度装置，所述获取用户终端还设置为：从所述用户终端处获取所述历史MAC流量的实际平均吞吐量Ri(t)，或从核心网获取所述用户终端的历史MAC流量的实际平均吞吐量Ri(t)。
  13. 一种基站，其特征在于，包括如权利要求7-12任一项所述的MAC流量调度装置。
  14. 一种计算机可读存储介质，存储有计算机可执行指令，所述计算机可执行指令被处理器执行时实现权利要求1至6任一项所述的MAC流量调度方法。
PCT/CN2016/080523 2015-06-23 2016-04-28 一种mac流量调度方法、装置、基站和计算机可读存储介质 WO2016206472A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201510349444.0A CN106257955B (zh) 2015-06-23 2015-06-23 Mac流量调度方法、装置及基站
CN201510349444.0 2015-06-23

Publications (1)

Publication Number Publication Date
WO2016206472A1 true WO2016206472A1 (zh) 2016-12-29

Family

ID=57584719

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2016/080523 WO2016206472A1 (zh) 2015-06-23 2016-04-28 一种mac流量调度方法、装置、基站和计算机可读存储介质

Country Status (2)

Country Link
CN (1) CN106257955B (zh)
WO (1) WO2016206472A1 (zh)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11516780B2 (en) 2017-11-15 2022-11-29 Sony Corporation Terminal device, base station, methods, and recording mediums

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111901206A (zh) * 2020-08-28 2020-11-06 杭州安恒信息技术股份有限公司 一种网卡测试方法、装置及相关设备

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101232716A (zh) * 2007-11-09 2008-07-30 中兴通讯股份有限公司 业务优先级的确定方法与装置及调度方法与装置
CN101414954A (zh) * 2007-10-16 2009-04-22 中兴通讯股份有限公司 一种正交频分多址系统的业务集成调度方法
CN101415242A (zh) * 2007-10-16 2009-04-22 中兴通讯股份有限公司 一种宽带无线接入的非实时业务的调度系统及方法
CN102932852A (zh) * 2011-08-11 2013-02-13 中兴通讯股份有限公司 业务调度方法及装置

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101568154B (zh) * 2008-04-25 2011-01-26 中国移动通信集团公司 调度优先级的确定方法及其装置
US8861535B2 (en) * 2010-05-21 2014-10-14 Cisco Technology, Inc. Multi-tiered paging support using paging priority
CN102316540B (zh) * 2010-07-08 2016-08-03 中兴通讯股份有限公司 一种切换时的接入控制方法及系统
CN102790973B (zh) * 2011-05-17 2017-09-26 株式会社Ntt都科摩 无线网络中小区间干扰协调的方法、基站以及无线网络

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101414954A (zh) * 2007-10-16 2009-04-22 中兴通讯股份有限公司 一种正交频分多址系统的业务集成调度方法
CN101415242A (zh) * 2007-10-16 2009-04-22 中兴通讯股份有限公司 一种宽带无线接入的非实时业务的调度系统及方法
CN101232716A (zh) * 2007-11-09 2008-07-30 中兴通讯股份有限公司 业务优先级的确定方法与装置及调度方法与装置
CN102932852A (zh) * 2011-08-11 2013-02-13 中兴通讯股份有限公司 业务调度方法及装置

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11516780B2 (en) 2017-11-15 2022-11-29 Sony Corporation Terminal device, base station, methods, and recording mediums

Also Published As

Publication number Publication date
CN106257955B (zh) 2021-12-14
CN106257955A (zh) 2016-12-28

Similar Documents

Publication Publication Date Title
JP6456926B2 (ja) ユーザ装置、基地局、上りデータ分割比率算出方法、及び上りデータ分割比率提供方法
WO2017206001A1 (zh) 移动边缘系统中迁移应用方法、相关设备及系统
WO2015141337A1 (ja) 受信パケット分散方法、キュー選択器、パケット処理装置、および記録媒体
AU2021257965A1 (en) Method for allocating resource grant
TW201246991A (en) Network system, femtocell, femtocell management apparatus, resource allocation method and computer program product thereof
EP3310093B1 (en) Traffic control method and apparatus
WO2019061529A1 (zh) 网络切片中分配资源的方法、设备和计算机可读存储介质
JP2017504248A (ja) Ｐｕｃｃｈリソースの割当方法、ネットワーク側装置及び通信システム
CN108696929A (zh) 一种动态调整cca能量检测阈值的方法与装置
WO2016106507A1 (zh) 一种小区无线网络临时标识c-rnti的分配方法和设备
WO2016206472A1 (zh) 一种mac流量调度方法、装置、基站和计算机可读存储介质
WO2012088959A1 (zh) 一种测量方法和设备
WO2014101692A1 (zh) 带宽分配方法及系统
WO2019095705A1 (zh) 一种小区间干扰协调方法及网络设备
CN108243449B (zh) 一种用户终端分组调度方法及装置
CN105263156B (zh) 基于接入点的流量控制方法及装置
CN103442406B (zh) 一种接入控制方法及装置
WO2013000430A1 (zh) 调节数据量的方法及装置
WO2015089701A1 (en) Method and system for controlling quality of service of sharing network
EP3313115A1 (en) Voice quality evaluation method and device
WO2016150109A1 (zh) 一种用户设备调度方法、装置和系统
WO2020048339A1 (zh) 显示业务标识的方法、装置、电子设备及存储介质
WO2016161582A1 (zh) 一种服务质量度量方法、装置及一种基站
US20220399919A1 (en) Dynamic MU-MIMO Layer Limit Control
WO2014161502A1 (zh) 一种多制式资源管理方法及装置

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: 16813588

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: 16813588

Country of ref document: EP

Kind code of ref document: A1