会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • 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.
    • 提供了用于确定多层计算系统中的容量分配的技术。 在本发明的一个方面,一种用于设计多层计算系统的容量分配的技术,具有一个或多个计算设备(例如,服务器)的计算系统的每个层包括以下步骤/操作。 获得与容量分配有关的输入参数。 基于输入参数的至少一部分来计算容量分配,所述容量分配是可计算的,使得对于多个服务类基本上满足一个或多个端到端性能测量。 容量分配计算可以最小化成本函数。 容量分配计算还可以满足多个服务类别的一个或多个平均延迟保证,多个服务类别的一个或多个尾部分配保证,或一个或多个平均延迟保证以及用于多个服务的一个或多个尾部分配保证 课程
    • 4. 发明申请
    • Method and apparatus for on-demand resource allocation and job management
    • 按需资源分配和作业管理的方法和装置
    • US20050114860A1
    • 2005-05-26
    • US10723230
    • 2003-11-26
    • Wuqin LinZhen LiuCharalambos StavropoulosCathy Honghui Xia
    • Wuqin LinZhen LiuCharalambos StavropoulosCathy Honghui Xia
    • G06F9/46G06F9/48G06F9/50
    • G06F9/5038G06F9/4887G06F2209/5021G06F2209/503
    • The invention is a method and apparatus for on-demand resource planning for unified messaging services. In one embodiment, multiple clients are served by a single system, and existing system resources are allocated among all clients in a manner that optimizes system output and service provider profit without the need to increase system resources. In one embodiment, resource allocation and job scheduling are guided by individual service level agreements between the service provider and the clients that dictate minimum service levels that must be achieved by the system. Jobs are processed in a manner that at least meets the specified service levels, and the benefit or profit derived by the service provider is maximized by prioritizing incoming job requests within the parameters of the specified service levels while meeting the specified service levels. Thus, operation and hardware costs remain substantially unchanged, while system output and profit are maximized.
    • 本发明是用于统一消息业务的按需资源规划的方法和装置。 在一个实施例中,多个客户端由单个系统服务,并且现有的系统资源以优化系统输出和服务提供者利润而不需要增加系统资源的方式在所有客户端之间分配。 在一个实施例中,资源分配和作业调度由服务提供商和客户端之间的各个服务级别协议指导,该协议规定了系统必须实现的最低服务水平。 以至少满足指定服务级别的方式对作业进行处理,并且通过在符合指定的服务级别的指定服务级别的参数内优先处理传入的作业请求来最大化服务提供商导出的利益或利润。 因此,运营和硬件成本基本保持不变,系统产出和利润最大化。
    • 7. 发明授权
    • Method and apparatus for on-demand resource allocation and job management
    • 按需资源分配和作业管理的方法和装置
    • US07526765B2
    • 2009-04-28
    • US10723230
    • 2003-11-26
    • Wuqin LinZhen LiuCharalambos StavropoulosCathy Honghui Xia
    • Wuqin LinZhen LiuCharalambos StavropoulosCathy Honghui Xia
    • G06F9/46
    • G06F9/5038G06F9/4887G06F2209/5021G06F2209/503
    • The invention is a method and apparatus for on-demand resource planning for unified messaging services. In one embodiment, multiple clients are served by a single system, and existing system resources are allocated among all clients in a manner that optimizes system output and service provider profit without the need to increase system resources. In one embodiment, resource allocation and job scheduling are guided by individual service level agreements between the service provider and the clients that dictate minimum service levels that must be achieved by the system. Jobs are processed in a manner that at least meets the specified service levels, and the benefit or profit derived by the service provider is maximized by prioritizing incoming job requests within the parameters of the specified service levels while meeting the specified service levels. Thus, operation and hardware costs remain substantially unchanged, while system output and profit are maximized.
    • 本发明是用于统一消息业务的按需资源规划的方法和装置。 在一个实施例中,多个客户端由单个系统服务,并且现有的系统资源以优化系统输出和服务提供者利润而不需要增加系统资源的方式在所有客户端之间分配。 在一个实施例中,资源分配和作业调度由服务提供商和客户端之间的各个服务级别协议指导,该协议规定了系统必须实现的最低服务水平。 以至少满足指定服务级别的方式对作业进行处理,并且通过在符合指定的服务级别的指定服务级别的参数内优先处理传入的作业请求来最大化服务提供商导出的利益或利润。 因此,运营和硬件成本基本保持不变,系统产出和利润最大化。
    • 9. 发明授权
    • Clock synchronization for network measurements with clock resets
    • 具有时钟复位的网络测量的时钟同步
    • US07194649B2
    • 2007-03-20
    • US10157610
    • 2002-05-29
    • Zhen LiuCathy Honghui XiaLi Zhang
    • Zhen LiuCathy Honghui XiaLi Zhang
    • G06F1/12
    • G06F1/10
    • Several algorithms are provided to estimate and remove relative clock skews from delay measurements based on the computation of convex hulls. The algorithms are linear in the number of measurement points for the case with no clock resets. For the more challenging case with clock resets, i.e., the clocks are reset to some reference times during the measurement period, linear algorithms are provided to identify the clock resets and derive the best clock skew lines. The algorithms are also extended to environments in which at least one of the clocks is controlled by Network Time Protocol. These algorithms can also be extended for active clock synchronization to replace or further improve Network Time Protocol.
    • 提供了几种算法来估计和消除基于凸包计算的延迟测量的相对时钟偏差。 对于没有时钟复位的情况,算法在测量点的数量上是线性的。 对于具有时钟复位的更具挑战性的情况,即在测量周期期间将时钟重置为某些参考时间,提供线性算法以识别时钟复位并导出最佳时钟偏斜线。 这些算法还扩展到其中至少一个时钟由网络时间协议控制的环境。 这些算法也可以被扩展以用于主动时钟同步来替代或进一步改进网络时间协议。
    • 10. 发明授权
    • System and apparatus for optimally trading off the replication overhead and consistency level in distributed applications
    • 用于最佳地折中分布式应用程序中的复制开销和一致性级别的系统和设备
    • US08037023B2
    • 2011-10-11
    • US12135489
    • 2008-06-09
    • Zhen LiuHonghui XiaHao YangFan Ye
    • Zhen LiuHonghui XiaHao YangFan Ye
    • G06F17/30
    • G06F17/30578Y10S707/99932Y10S707/99953Y10S707/99955
    • Methods and systems are provided for optimally trading off replication overhead and consistency levels in distributed data replication where nodes are organized in a hierarchy. The root node has the original data that need to be replicated at all other nodes, and the replicated copies have a freshness threshold that must be satisfied. The data are propagated through periodic updates in the hierarchy. Each node periodically sends data to its child nodes. Given the freshness threshold, an algorithm and its distributed protocol can determine the optimal update period for each link of the hierarchy such that the freshness threshold is satisfied for every node and the overall replication overhead is minimized. The systems and methods can be used in any scenario where replicated data have consistency requirements, such as in a replicate overlay assisted resource discovery system.
    • 提供了方法和系统,用于最佳地折中分布式数据复制中的复制开销和一致性级别,其中节点被组织在层次结构中。 根节点具有需要在所有其他节点进行复制的原始数据,并且复制副本具有必须满足的新鲜度阈值。 数据通过层次结构中的定期更新进行传播。 每个节点周期性地向其子节点发送数据。 给定新鲜度阈值,算法及其分布式协议可以确定层次结构的每个链路的最佳更新周期,使得每个节点满足新鲜度阈值,并将整体复制开销最小化。 系统和方法可以在复制数据具有一致性要求的任何情况下使用,例如在复制覆盖辅助资源发现系统中。