公开(公告)号：US09451611B2

公开(公告)日：2016-09-20

申请号：US14292483

申请日：2014-05-30

Applicant: Futurewei Technologies, Inc.

Inventor： Yegui Cai ,  Fei Richard Yu ,  Gamini Senarath ,  Halim Yanikomeroglu

IPC: H04W72/04 ,  H04B7/02 ,  H04W52/24 ,  H04W72/08

CPC classification number: H04W72/0433 ,  H04B7/024 ,  H04W52/244 ,  H04W72/082

Abstract: In one embodiment, method for controlling multiple wireless access nodes includes receiving, by a central controller from a base station (BS), a message indicating a channel state information (CSI) and determining a state transition function in accordance with the message. The method also includes determining a belief state in accordance with the state transition function and determining cooperation for a plurality of BSs including the BS in accordance with the belief state to produce a cooperation decision. Additionally, the method includes transmitting, by the central controller to the BS, the cooperation decision.

Abstract translation: 在一个实施例中，用于控制多个无线接入节点的方法包括由中央控制器从基站（BS）接收指示信道状态信息（CSI）的消息并根据该消息确定状态转换功能。 该方法还包括根据状态转换功能确定置信状态，并根据信念状态确定包括BS的多个BS的协作以产生合作决定。 另外，该方法包括由中央控制器向BS发送合作决定。

公开(公告)号：US20140355535A1

公开(公告)日：2014-12-04

申请号：US14292483

申请日：2014-05-30

Applicant: Futurewei Technologies, Inc.

Inventor： Yegui Cai ,  Fei Richard Yu ,  Gamini Senarath ,  Halim Yanikomeroglu

IPC: H04W72/04 ,  H04W64/00 ,  H04L5/00

CPC classification number: H04W72/0433 ,  H04B7/024 ,  H04W52/244 ,  H04W72/082

Abstract: In one embodiment, method for controlling multiple wireless access nodes includes receiving, by a central controller from a base station (BS), a message indicating a channel state information (CSI) and determining a state transition function in accordance with the message. The method also includes determining a belief state in accordance with the state transition function and determining cooperation for a plurality of BSs including the BS in accordance with the belief state to produce a cooperation decision. Additionally, the method includes transmitting, by the central controller to the BS, the cooperation decision.

Abstract translation: 在一个实施例中，用于控制多个无线接入节点的方法包括由中央控制器从基站（BS）接收指示信道状态信息（CSI）的消息并根据该消息确定状态转换功能。 该方法还包括根据状态转换功能确定置信状态，并根据信念状态确定包括BS的多个BS的协作以产生合作决定。 另外，该方法包括由中央控制器向BS发送合作决定。

公开(公告)号：US20140229210A1

公开(公告)日：2014-08-14

申请号：US14181160

申请日：2014-02-14

Applicant: FutureWei Technologies, Inc.

Inventor： Alireza Sharifian ,  Rainer Schoenen ,  Halim Yanikomeroglu ,  Gamini Senarath ,  Ho Ting Cheng ,  Petar Djukic

IPC: G06Q10/06 ,  G06Q30/02

Abstract: Embodiments are provided for network resource allocation considering user experience, satisfaction, and operator interest. An embodiment method by a network component for allocating network resources includes evaluating, for a user, a QoE for each flow of a plurality of flows in network traffic in according with a QoE model, and further evaluating, for an operator, a revenue associated with the flows in accordance with a revenue model. A plurality of priorities that correspond to the flows are calculated in accordance with the QoE for the user and the revenue for the operator. The method further includes identifying a flow of the flows with a highest value of the priorities, and allocating a network resource for the flow. In an embodiment, the QoE model is a satisfaction model that provides a measure of user satisfaction for each flow in accordance with a subscription or behavior class of the user.

Abstract translation: 考虑到用户体验，满意度和操作者的兴趣，提供了用于网络资源分配的实施例。 用于分配网络资源的网络组件的实施方式包括根据QoE模型为用户评估网络业务中的多个流的每个流的QoE，以及进一步评估运营商与 流量按照收入模式。 根据用户的QoE和运营商的收入来计算与流量对应的多个优先级。 该方法还包括识别具有最高优先级值的流的流，并为流分配网络资源。 在一个实施例中，QoE模型是根据用户的订阅或行为类别为每个流提供用户满意度的满意度模型。

公开(公告)号：US09288679B2

公开(公告)日：2016-03-15

申请号：US14340322

申请日：2014-07-24

Applicant: Futurewei Technologies, Inc.

Inventor： Yaser Fouad ,  Ramy Gohary ,  Halim Yanikomeroglu ,  Gamini Senarath

IPC: H04B7/15 ,  H04W16/10 ,  H04W88/02 ,  H04W84/04

CPC classification number: H04W16/10 ,  H04B7/15542 ,  H04W16/26 ,  H04W84/047 ,  H04W88/02

Abstract: Iterative sequential selection techniques can be used to efficiently compute RB assignment sequences in relay-assisted networks. Embodiment techniques construct a graphical representation of a cyclic group based on a selected pattern in a set of patterns and a selected cyclic-shift in a plurality of cyclic shifts. Remaining patterns are placed in a unitary group, and an iterative sequential selection technique is used to evaluate the remaining patterns in the unitary group for each of the cyclic shifts over a sequence of iterations, thereby complete the list of RB assignment sequences. At the end of each iteration, a new RB assignment sequence is added based on the pattern, cyclic shift tuple producing the fewest collisions with occupied resource blocks of the graphical representation.

Abstract translation: 迭代顺序选择技术可用于有效地计算中继辅助网络中的RB分配序列。 实施例技术基于一组模式中的所选择的模式和多个循环移位中选择的循环移位构建循环组的图形表示。 剩余模式被放置在单一组中，并且使用迭代顺序选择技术来评估在迭代序列中的每个循环移位的单位组中的剩余模式，从而完成RB分配序列的列表。 在每次迭代结束时，基于模式添加新的RB分配序列，循环移位元组产生与图形表示的占用资源块最少的冲突。

公开(公告)号：US20150031406A1

公开(公告)日：2015-01-29

申请号：US14340322

申请日：2014-07-24

Applicant: FUTUREWEI TECHNOLOGIES, INC.

Inventor： Yaser Fouad ,  Ramy Gohary ,  Halim Yanikomeroglu ,  Gamini Senarath

IPC: H04W16/10 ,  H04B7/14

CPC classification number: H04W16/10 ,  H04B7/15542 ,  H04W16/26 ,  H04W84/047 ,  H04W88/02

Abstract: Iterative sequential selection techniques can be used to efficiently compute RB assignment sequences in relay-assisted networks. Embodiment techniques construct a graphical representation of a cyclic group based on a selected pattern in a set of patterns and a selected cyclic-shift in a plurality of cyclic shifts. Remaining patterns are placed in a unitary group, and an iterative sequential selection technique is used to evaluate the remaining patterns in the unitary group for each of the cyclic shifts over a sequence of iterations, thereby complete the list of RB assignment sequences. At the end of each iteration, a new RB assignment sequence is added based on the pattern, cyclic shift tuple producing the fewest collisions with occupied resource blocks of the graphical representation.

Abstract translation: 迭代顺序选择技术可用于有效地计算中继辅助网络中的RB分配序列。 实施例技术基于一组模式中的所选择的模式和多个循环移位中选择的循环移位构建循环组的图形表示。 剩余模式被放置在单一组中，并且使用迭代顺序选择技术来评估在迭代序列中的每个循环移位的单位组中的剩余模式，从而完成RB分配序列的列表。 在每次迭代结束时，基于模式添加新的RB分配序列，循环移位元组产生与图形表示的占用资源块最少的冲突。

公开(公告)号：US09369925B2

公开(公告)日：2016-06-14

申请号：US14067542

申请日：2013-10-30

Applicant: FutureWei Technologies, Inc.

Inventor： Akram Bin Sediq ,  Ramy Gohary ,  Halim Yanikomeroglu ,  Gamini Senarath ,  Ho Ting Cheng

IPC: H04W52/00 ,  H04W28/24 ,  H04W52/14

CPC classification number: H04W28/24 ,  H04W52/143

Abstract: Embodiments are provided for scheduling resources considering data rate-efficiency and fairness trade-off. A value of Jain's fairness index (JFI) is determined for transmitting a service to a plurality of users, and accordingly a sum of throughputs is maximized for transmitting the service to the users. Alternatively, a sum of throughputs is determined first and accordingly the JFI is maximized. Maximizing the sum of throughputs or JFI includes selecting a suitable value for a tuning parameter in an efficiency and fairness trade-off relation model. In accordance with the values of sum of throughputs and JFI, a plurality of resources are allocated for transmitting the service to the users. For static or quasi-static channels, the relation model is a convex function with a monotonic trade-off property. For ergodic time varying channels, the tuning parameter is selected by solving the relation model using a gradient-based approach.

Abstract translation: 提供了考虑数据速率效率和公平权衡的调度资源的实施例。 为了将服务发送给多个用户，确定了Jain的公平性指数（JFI）的值，因此将服务的发送量最大化为用户的总和。 或者，首先确定吞吐量的总和，从而使JFI最大化。 最大化吞吐量或JFI的总和包括在效率和公平权衡关系模型中选择适合的调整参数值。 根据吞吐量和JFI的总和的值，分配多个资源用于向用户发送服务。 对于静态或准静态通道，关系模型是具有单调权衡属性的凸函数。 对于遍历时变通道，通过使用基于梯度的方法求解关系模型来选择调谐参数。

公开(公告)号：US20140195394A1

公开(公告)日：2014-07-10

申请号：US14141143

申请日：2013-12-26

Applicant: FutureWei Technologies, Inc.

Inventor： Rainer Schoenen ,  Halim Yanikomeroglu

IPC: G06Q20/14

CPC classification number: G06Q20/145 ,  G06Q20/085 ,  G06Q20/127 ,  H04L12/1432 ,  H04L12/1435 ,  H04L12/1485 ,  H04M15/43 ,  H04M15/58 ,  H04M15/61 ,  H04M15/80 ,  H04M15/81

Abstract: Embodiments are provided for enabling dynamic pricing of services to users. The amount of usage all or different services are quantized into quanta of minimum usage units, such as to an amount of effective bits (eBits) in communications services. The amount of usage of the different services is weighted differently, such as according to service cost or demand, to obtain corresponding amount of quanta of usage or eBits for each service. The amount of quanta of usage or eBits for the different services is summed up to provide a total amount of quanta of usage or eBits. The total amount of quanta of usage or eBits is converted into a total charge, as a product of the total amount of quanta of usage or eBits, or a monotonic function of the total amount, and a fixed charge rate per quanta of usage or eBit.

Abstract translation: 提供实现以使得能够为用户提供服务的动态定价。 使用量的全部或不同服务被量化为最小使用单位的量化，例如到通信服务中的有效位数（eBits）。 不同服务的使用量被加权不同，例如根据服务成本或需求，以获得每个服务的相应量的使用量或eBits。 总结了不同服务的使用量或eBits的量，以提供总量的使用量或eBits。 将使用量或eBits的总量转换为总费用，作为使用量或eBits的总量或乘积的单调函数的乘积，以及每使用量或eBit的固定费率 。

公开(公告)号：US20140120974A1

公开(公告)日：2014-05-01

申请号：US14067542

申请日：2013-10-30

Applicant: FutureWei Technologies, Inc.

Inventor： Akram Bin Sediq ,  Ramy Gohary ,  Halim Yanikomeroglu ,  Gamini Senarath ,  Ho Ting Cheng

IPC: H04W72/04

CPC classification number: H04W28/24 ,  H04W52/143

Abstract: Embodiments are provided for scheduling resources considering data rate-efficiency and fairness trade-off. A value of Jain's fairness index (JFI) is determined for transmitting a service to a plurality of users, and accordingly a sum of throughputs is maximized for transmitting the service to the users. Alternatively, a sum of throughputs is determined first and accordingly the JFI is maximized. Maximizing the sum of throughputs or JFI includes selecting a suitable value for a tuning parameter in an efficiency and fairness trade-off relation model. In accordance with the values of sum of throughputs and JFI, a plurality of resources are allocated for transmitting the service to the users. For static or quasi-static channels, the relation model is a convex function with a monotonic trade-off property. For ergodic time varying channels, the tuning parameter is selected by solving the relation model using a gradient-based approach.

Abstract translation: 提供了考虑数据速率效率和公平权衡的调度资源的实施例。 为了将服务发送给多个用户，确定了Jain的公平性指数（JFI）的值，因此将服务的发送量最大化为用户的总和。 或者，首先确定吞吐量的总和，从而使JFI最大化。 最大化吞吐量或JFI的总和包括在效率和公平权衡关系模型中选择适合的调整参数值。 根据吞吐量和JFI的总和的值，分配多个资源用于向用户发送服务。 对于静态或准静态通道，关系模型是具有单调权衡属性的凸函数。 对于遍历时变通道，通过使用基于梯度的方法求解关系模型来选择调谐参数。