公开(公告)号：US09426075B2

公开(公告)日：2016-08-23

申请号：US14203276

申请日：2014-03-10

Applicant: Huawei Technologies Co., Ltd.

Inventor： Nimal Gamini Senarath ,  Aaron James Callard ,  Ho Ting Cheng

IPC: G01R31/08 ,  H04L12/803 ,  H04L12/729 ,  H04L12/707 ,  H04W40/14

CPC classification number: H04L45/125 ,  H04L43/0888 ,  H04L43/16 ,  H04L45/24 ,  H04L45/38 ,  H04L47/125 ,  H04W40/14 ,  H04W40/16 ,  Y02D70/00 ,  Y02D70/142 ,  Y02D70/144 ,  Y02D70/34

Abstract: Increased resource utilization efficiency can be improved by modeling path costs during admission and path-selection. Specifically, path costs for candidate paths are modeled based on load characteristics (e.g., current load, load variation, etc.) of links in the candidate paths. Path costs can represent any quantifiable cost or liability associated with transporting a service flow over the corresponding path. For example, path costs can correspond to a probability that at least one link in the path will experience an outage when transporting the service flow, a price charged by a network operator (NTO) for transporting the traffic flow over the candidate path, or a total network cost for transporting the flow over a candidate path. The candidate path having the lowest path cost is selected to transport a service flow.

Abstract translation: 通过在入场和路径选择过程中路径成本建模可以提高资源利用效率。 具体地，候选路径的路径成本基于候选路径中的链路的负载特性（例如，当前负载，负载变化等）来建模。 路径成本可以代表与通过相应路径传输服务流程相关的任何可量化的成本或责任。 例如，路径成本可以对应于在传输服务流时路径中的至少一个链路将经历中断的概率，用于在候选路径上传输业务流的网络运营商（NTO）收取的价格，或 用于在候选路径上传输流的总网络成本。 选择具有最低路径开销的候选路径来传送服务流。

公开(公告)号：US10028233B2

公开(公告)日：2018-07-17

申请号：US15176697

申请日：2016-06-08

Applicant: Huawei Technologies Co., Ltd.

Inventor： Nimal Gamini Senarath ,  Hang Zhang ,  Ho Ting Cheng ,  Vahid Tarokh

IPC: H04B7/00 ,  H04W52/22 ,  H04W72/12 ,  H04W52/38 ,  H04W72/04

Abstract: Methods and systems for providing joint power control (PC) and scheduling in a wireless network are provided. In one example, a method includes generating a near-optimal power pattern for PC and scheduling in accordance with long term channel statistics. The near-optimal PC solution may be generated by first generating a set of possible power patterns in accordance with likely scheduling scenarios, then statistically narrowing the set of possible power patterns to identify the most commonly used power patterns, and finally selecting one of the most commonly used power patterns as the near-optimal power pattern. In another example, a table of optimal PC solutions are provided for performing distributed PC and scheduling in an adaptive and/or dynamic manner.

公开(公告)号：US09565061B2

公开(公告)日：2017-02-07

申请号：US14511708

申请日：2014-10-10

Applicant: Huawei Technologies Co., Ltd.

Inventor： Aaron James Callard ,  Ngoc Dung Dao ,  Hang Zhang ,  Ho Ting Cheng ,  Nimal Gamini Senarath

IPC: H04L12/24 ,  H04W24/02 ,  H04W88/08 ,  H04L1/00 ,  H04L1/20

CPC classification number: H04L41/0823 ,  H04L1/0003 ,  H04L1/0009 ,  H04L1/0026 ,  H04L1/0077 ,  H04L1/20 ,  H04W24/02 ,  H04W88/08

Abstract: A method for configuring a first base station within a cluster in a communications system having a plurality of cluster includes optimizing an operating parameter of the first base station in accordance with first utility function results from a first utility function associated with the first base station and second utility function results from a second utility function associated with a second base station within the cluster, the first utility function results and the second utility function results according to multiple settings for the operating parameter of the first base station, a first initialized setting of the operating parameter for the second base station, and a second initialized setting of the operating parameter for an external base station outside the cluster. The method also includes sharing the optimized operating parameter with the external base station.

Abstract translation: 一种用于在具有多个群集的通信系统中配置群集内的第一基站的方法包括根据与第一基站相关联的第一效用函数的第一效用函数结果优化第一基站的操作参数，以及第二基站 效用函数来自与集群内的第二基站相关联的第二效用函数，第一效用函数结果和第二效用函数根据第一基站的操作参数的多个设置，第一初始化的操作设置 第二基站的参数，以及群外的外部基站的操作参数的第二初始化设定。 该方法还包括与外部基站共享优化的操作参数。

公开(公告)号：US20160359725A1

公开(公告)日：2016-12-08

申请号：US15243734

申请日：2016-08-22

Applicant: Huawei Technologies Co., Ltd.

Inventor： Nimal Gamini Senarath ,  Aaron James Callard ,  Ho Ting Cheng

IPC: H04L12/729 ,  H04L12/26 ,  H04L12/721 ,  H04L12/707 ,  H04W40/16

CPC classification number: H04L45/125 ,  H04L43/0888 ,  H04L43/16 ,  H04L45/24 ,  H04L45/38 ,  H04L47/125 ,  H04W40/14 ,  H04W40/16 ,  Y02D70/00 ,  Y02D70/142 ,  Y02D70/144 ,  Y02D70/34

Abstract: Increased resource utilization efficiency can be improved by modeling path costs during admission and path-selection. Specifically, path costs for candidate paths are modeled based on load characteristics (e.g., current load, load variation, etc.) of links in the candidate paths. Path costs can represent any quantifiable cost or liability associated with transporting a service flow over the corresponding path. For example, path costs can correspond to a probability that at least one link in the path will experience an outage when transporting the service flow, a price charged by a network operator (NTO) for transporting the traffic flow over the candidate path, or a total network cost for transporting the flow over a candidate path. The candidate path having the lowest path cost is selected to transport a service flow.

Abstract translation: 通过在入场和路径选择过程中路径成本建模可以提高资源利用效率。 具体地，候选路径的路径成本基于候选路径中的链路的负载特性（例如，当前负载，负载变化等）来建模。 路径成本可以代表与通过相应路径传输服务流程相关的任何可量化的成本或责任。 例如，路径成本可以对应于在传输服务流时路径中的至少一个链路将经历中断的概率，用于在候选路径上传输业务流的网络运营商（NTO）收取的价格，或 用于在候选路径上传输流的总网络成本。 选择具有最低路径开销的候选路径来传送服务流。

公开(公告)号：US20160286498A1

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

申请号：US15176697

申请日：2016-06-08

Applicant: Huawei Technologies Co., Ltd.

Inventor： Nimal Gamini Senarath ,  Hang Zhang ,  Ho Ting Cheng ,  Vahid Tarokh

IPC: H04W52/22 ,  H04W52/38 ,  H04W72/12 ,  H04W72/04

CPC classification number: H04W52/226 ,  H04W52/386 ,  H04W72/042 ,  H04W72/0446 ,  H04W72/12

Abstract: Methods and systems for providing joint power control (PC) and scheduling in a wireless network are provided. In one example, a method includes generating a near-optimal power pattern for PC and scheduling in accordance with long term channel statistics. The near-optimal PC solution may be generated by first generating a set of possible power patterns in accordance with likely scheduling scenarios, then statistically narrowing the set of possible power patterns to identify the most commonly used power patterns, and finally selecting one of the most commonly used power patterns as the near-optimal power pattern. In another example, a table of optimal PC solutions are provided for performing distributed PC and scheduling in an adaptive and/or dynamic manner.

公开(公告)号：US09455919B2

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

申请号：US14107946

申请日：2013-12-16

Applicant: Huawei Technologies Co., Ltd.

Inventor： Nimal Gamini Senarath ,  Ho Ting Cheng ,  Hang Zhang ,  Alex Stephenne

IPC: H04W72/00 ,  H04L12/801 ,  H04L12/911 ,  H04L12/24

CPC classification number: H04W28/26 ,  H04L41/0896 ,  H04L47/127 ,  H04L47/823 ,  H04W16/22 ,  H04W28/0268 ,  H04W28/20

Abstract: Interference costs on virtual radio interfaces can be modeled as a function of loading in a wireless network to estimate changes in spectral efficiency and/or resource availability that would result from a provisioning decision. In one example, this modeling is achieved through cost functions that are developed from historical and/or simulated resource cost data corresponding to the wireless network. The cost data may include interference data, spectral efficiency data, and/or loading data for various links over a common period of time (e.g., a month, a year, etc.), and may be analyzed and/or consolidated to obtain correlations between interference costs and loading on the various links in the network. As an example, a cost function may specify an interference cost on one virtual link as a function of loading on one or more neighboring virtual links.

Abstract translation: 虚拟无线电接口上的干扰成本可以被建模为在无线网络中加载的功能，以估计由供应决定导致的频谱效率和/或资源可用性的变化。 在一个示例中，通过从对应于无线网络的历史和/或模拟资源成本数据开发的成本函数来实现该建模。 成本数据可以包括干扰数据，频谱效率数据和/或在公共时间段（例如，一个月，一年等）上的各种链路的加载数据），并且可以分析和/或合并以获得相关性 干扰成本和网络上各种链路的负载之间。 作为示例，成本函数可以将一个虚拟链路上的干扰成本指定为在一个或多个相邻虚拟链路上加载的功能。