会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Distributed joint admission control and dynamic resource allocation in stream processing networks
    • 流处理网络中的分布式联合准入控制和动态资源分配
    • US07924718B2
    • 2011-04-12
    • US12535805
    • 2009-08-05
    • Hanhua FengZhen LiuHonghui XiaLi Zhang
    • Hanhua FengZhen LiuHonghui XiaLi Zhang
    • G01R31/08
    • G06F9/5066G06F9/5038
    • Methods and apparatus operating in a stream processing network perform load shedding and dynamic resource allocation so as to meet a pre-determined utility criterion. Load shedding is envisioned as an admission control problem encompassing source nodes admitting workflows into the stream processing network. A primal-dual approach is used to decompose the admission control and resource allocation problems. The admission control operates as a push-and-pull process with sources pushing workflows into the stream processing network and sinks pulling processed workflows from the network. A virtual queue is maintained at each node to account for both queue backlogs and credits from sinks. Nodes of the stream processing network maintain shadow prices for each of the workflows and share congestion information with neighbor nodes. At each node, resources are devoted to the workflow with the maximum product of downstream pressure and processing rate, where the downstream pressure is defined as the backlog difference between neighbor nodes. The primal-dual controller iteratively adjusts the admission rates and resource allocation using local congestion feedback. The iterative controlling procedure further uses an interior-point method to improve the speed of convergence towards optimal admission and allocation decisions.
    • 在流处理网络中操作的方法和装置执行卸载和动态资源分配,以满足预定的效用标准。 负载脱落被设想为包括允许流程处理网络中的工作流的源节点的准入控制问题。 使用原始双重方法来分解入学控制和资源分配问题。 准入控制作为推拉过程进行操作,其中源将工作流推送到流处理网络并且从网络中吸收经处理的工作流。 每个节点都维护一个虚拟队列,以解决队列积压和来自宿的积分。 流处理网络的节点维护每个工作流的影子价格,并与邻居节点共享拥塞信息。 在每个节点,资源用于工作流程,具有下游压力和处理速率的最大乘积,其中下游压力被定义为相邻节点之间的积压差异。 原始双控制器使用局部拥塞反馈迭代地调整入局速率和资源分配。 迭代控制程序进一步使用内点方法来提高收敛速度以达到最佳准入和分配决策。
    • 3. 发明申请
    • Distributed Joint Admission Control and Dynamic Resource Allocation in Stream Processing Networks
    • 流处理网络中的分布式联合接纳控制和动态资源分配
    • US20090300183A1
    • 2009-12-03
    • US12535805
    • 2009-08-05
    • Hanhua FengZhen LiuHonghui XiaLi Zhang
    • Hanhua FengZhen LiuHonghui XiaLi Zhang
    • G06F15/173G06F15/16
    • G06F9/5066G06F9/5038
    • Methods and apparatus operating in a stream processing network perform load shedding and dynamic resource allocation so as to meet a pre-determined utility criterion. Load shedding is envisioned as an admission control problem encompassing source nodes admitting workflows into the stream processing network. A primal-dual approach is used to decompose the admission control and resource allocation problems. The admission control operates as a push-and-pull process with sources pushing workflows into the stream processing network and sinks pulling processed workflows from the network. A virtual queue is maintained at each node to account for both queue backlogs and credits from sinks. Nodes of the stream processing network maintain shadow prices for each of the workflows and share congestion information with neighbor nodes. At each node, resources are devoted to the workflow with the maximum product of downstream pressure and processing rate, where the downstream pressure is defined as the backlog difference between neighbor nodes. The primal-dual controller iteratively adjusts the admission rates and resource allocation using local congestion feedback. The iterative controlling procedure further uses an interior-point method to improve the speed of convergence towards optimal admission and allocation decisions.
    • 在流处理网络中操作的方法和装置执行卸载和动态资源分配,以满足预定的效用标准。 负载脱落被设想为包括允许流程处理网络中的工作流的源节点的准入控制问题。 使用原始双重方法来分解入学控制和资源分配问题。 准入控制作为推拉过程进行操作,其中源将工作流推送到流处理网络并且从网络中吸收经处理的工作流。 每个节点都维护一个虚拟队列,以解决队列积压和来自宿的积分。 流处理网络的节点维护每个工作流的影子价格,并与邻居节点共享拥塞信息。 在每个节点,资源用于工作流程,具有下游压力和处理速率的最大乘积,其中下游压力被定义为相邻节点之间的积压差异。 原始双控制器使用局部拥塞反馈迭代地调整入局速率和资源分配。 迭代控制程序进一步使用内点方法来提高收敛速度以达到最佳准入和分配决策。
    • 4. 发明申请
    • Distributed Joint Admission Control And Dynamic Resource Allocation In Stream Processing Networks
    • 流处理网络中的分布式联合接入控制和动态资源分配
    • US20080304516A1
    • 2008-12-11
    • US11758706
    • 2007-06-06
    • Hanhua FengZhen LiuHonghui XiaLi Zhang
    • Hanhua FengZhen LiuHonghui XiaLi Zhang
    • H04J3/16
    • G06F9/5066G06F9/5038
    • Methods and apparatus operating in a stream processing network perform load shedding and dynamic resource allocation so as to meet a pre-determined utility criterion. Load shedding is envisioned as an admission control problem encompassing source nodes admitting workflows into the stream processing network. A primal-dual approach is used to decompose the admission control and resource allocation problems. The admission control operates as a push-and-pull process with sources pushing workflows into the stream processing network and sinks pulling processed workflows from the network. A virtual queue is maintained at each node to account for both queue backlogs and credits from sinks. Nodes of the stream processing network maintain shadow prices for each of the workflows and share congestion information with neighbor nodes. At each node, resources are devoted to the workflow with the maximum product of downstream pressure and processing rate, where the downstream pressure is defined as the backlog difference between neighbor nodes. The primal-dual controller iteratively adjusts the admission rates and resource allocation using local congestion feedback. The iterative controlling procedure further uses an interior-point method to improve the speed of convergence towards optimal admission and allocation decisions.
    • 在流处理网络中操作的方法和装置执行卸载和动态资源分配,以满足预定的效用标准。 负载脱落被设想为包括允许流程处理网络中的工作流的源节点的准入控制问题。 使用原始双重方法来分解入学控制和资源分配问题。 准入控制作为推拉过程进行操作,其中源将工作流推送到流处理网络并且从网络中吸收经处理的工作流。 每个节点都维护一个虚拟队列,以解决队列积压和来自宿的积分。 流处理网络的节点维护每个工作流的影子价格,并与邻居节点共享拥塞信息。 在每个节点,资源用于工作流程,具有下游压力和处理速率的最大乘积,其中下游压力被定义为相邻节点之间的积压差异。 原始双控制器使用局部拥塞反馈迭代地调整入局速率和资源分配。 迭代控制程序进一步使用内点方法来提高收敛速度以达到最佳准入和分配决策。
    • 5. 发明授权
    • Methods and apparatus for cost minimization of multi-tiered infrastructure with end-to-end delay guarantees
    • 使用端到端延迟保证的多层基础设施成本最小化的方法和设备
    • US07626917B2
    • 2009-12-01
    • US10865064
    • 2004-06-10
    • Wuqin LinZhen LiuCathy Honghui XiaLi Zhang
    • Wuqin LinZhen LiuCathy Honghui XiaLi Zhang
    • H04J11/00G06F9/44G06F9/45
    • G06F9/50G06F9/5061
    • Techniques are provided for determining a capacity allocation in a multi-tiered computing system. In one aspect of the invention, a technique for designing capacity allocation for a multi-tiered computing system, each tier of the computing system having one or more computing devices (e.g., servers), comprises the following steps/operations. Input parameters relating to capacity allocation are obtained. A capacity allocation is computed based on at least a portion of the input parameters, the capacity allocation being computable such that one or more end-to-end performance measures are substantially satisfied for multiple service classes. The capacity allocation computation may minimize a cost function. The capacity allocation computation may also satisfy one or more mean delay guarantees for the multiple service classes, one or more tail distribution guarantees for the multiple service classes, or both one or more mean delay guarantees and one or more tail distribution guarantees for the multiple service classes.
    • 提供了用于确定多层计算系统中的容量分配的技术。 在本发明的一个方面,一种用于设计多层计算系统的容量分配的技术,具有一个或多个计算设备(例如,服务器)的计算系统的每个层包括以下步骤/操作。 获得与容量分配有关的输入参数。 基于输入参数的至少一部分来计算容量分配,所述容量分配是可计算的,使得对于多个服务类基本上满足一个或多个端到端性能测量。 容量分配计算可以最小化成本函数。 容量分配计算还可以满足多个服务类别的一个或多个平均延迟保证,多个服务类别的一个或多个尾部分配保证,或一个或多个平均延迟保证以及用于多个服务的一个或多个尾部分配保证 课程
    • 10. 发明授权
    • Apparatus and methods for classification of web sites
    • 网站分类的设备和方法
    • US07792951B2
    • 2010-09-07
    • US10315705
    • 2002-12-10
    • Nagui HalimZhen LiuMark Steven SquillanteHonghui XiaShun-Zheng YuLi Zhang
    • Nagui HalimZhen LiuMark Steven SquillanteHonghui XiaShun-Zheng YuLi Zhang
    • G06F15/173
    • G06F17/3071
    • Apparatus and methods for classifying web sites are provided. With the apparatus and methods, traffic data is obtained for a plurality of web sites. This patterns, or templates, for each web site are generated based on this traffic data and the patterns are clustered into classes of web sites using a clustering algorithm. The clusters, or classes, are then profiled to generate a template for each class. The template for each class is generated by first shifting the patterns for each web site that is part of the class to compensate for effects like time zone differences, if any, and then identifying a pattern that is most similar to all of the patterns in the class. Once the template for each class is generated, this template is then used with traffic data from a new web site to classify the new web site into one of the existing classes. In other words, when traffic data for a new web site is received, a pattern for the traffic data of the new web site is generated and compared to the templates for the various classes. If a matching class template is identified, the new web site is classified into the corresponding class. If the pattern for the new web site does not match any of the existing templates, a new template and class may be generated based on the pattern for the new web site.
    • 提供了分类网站的装置和方法。 利用该装置和方法,获得多个网站的交通数据。 基于该流量数据生成每个网站的这种模式或模板,并且使用聚类算法将模式聚类成网站类。 然后,对集群或类进行概要分析以为每个类生成一个模板。 每个类的模板是通过首先移动作为类的一部分的每个网站的模式来生成的,以补偿诸如时​​区差异的效果(如果有的话),然后识别最相似于所有模式中的模式 类。 一旦生成了每个类的模板,该模板随后与来自新网站的流量数据一起使用,将新网站分类到现有的一个类中。 换句话说,当接收到新的网站的交通数据时,生成用于新网站的交通数据的模式,并与各种类别的模板进行比较。 如果识别出匹配的类模板,则将新的网站分类到相应的类中。 如果新网站的模式与任何现有模板不匹配,则可能会根据新网站的模式生成新的模板和类。