利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

4 条记录 (耗时 0.016 秒)

    Methods and devices for providing ingress routing in selective randomized load balancing
    2.
    发明申请
    Methods and devices for providing ingress routing in selective randomized load balancing 有权
    在选择性随机负载平衡中提供入口路由的方法和设备

    公开(公告)号：US20080159138A1

    公开(公告)日：2008-07-03

    申请号：US11647273

    申请日：2006-12-29

    申请人： Frederick Bruce Shepherd ,  Marina K. Thottan ,  Peter J. Winzer

    发明人： Frederick Bruce Shepherd ,  Marina K. Thottan ,  Peter J. Winzer

    IPC分类号： G08C15/00

    CPC分类号： H04L45/00 ,  H04L45/24 ,  H04L45/302 ,  H04L47/10 ,  H04L47/125 ,  H04L47/24 ,  H04L47/283

    摘要： The performance of randomized load balanced or selective, randomized load balanced networks is enhanced by using ingress traffic engineering in addition to randomized traffic splitting. By first using the capacity of all links leading to the final destination of traffic, the remaining capacity is freed up for best effort traffic. Traffic splitting rules that enhance the performance of randomized load balanced networks in terms of packet missequencing and other quality of service criteria are also described.

    摘要翻译： 随机负载平衡或选择性随机负载平衡网络的性能通过使用入口流量工程以及随机流量分割来增强。 通过首先使用导致流量最终目的地的所有链路的容量，剩余容量被释放以获得尽力而为的流量。 还描述了在分组测序和其他服务质量标准方面增强随机负载平衡网络的性能的业务分割规则。

    Optimized Judge Assignment under Constraints
    3.
    发明申请
    Optimized Judge Assignment under Constraints 审中-公开
    在限制下优化判决分配

    公开(公告)号：US20130152091A1

    公开(公告)日：2013-06-13

    申请号：US13314676

    申请日：2011-12-08

    申请人： Chao Liu ,  Frederick Bruce Shepherd

    发明人： Chao Liu ,  Frederick Bruce Shepherd

    IPC分类号： G06F9/46

    CPC分类号： G06Q10/06

    摘要： Described is a technology by which an assignment model is computed to distribute labeling tasks among judging entities (judges). The assignment model is optimized by obtaining accuracy-related data of the judges, e.g., by probing the judges with labeling tasks having a gold standard label and evaluating the judges' labels against the gold standard labels, and optimizing for accuracy. Optimization may be based upon on or more other constraints, such as per-judge cost and/or quota.

    摘要翻译： 描述了一种计算分配模型以在评估实体（法官）之间分发标签任务的技术。 通过获得评判的准确度相关数据，例如通过探测具有黄金标准标签的标签任务的评委和针对黄金标准标签评估评估者的标签，并优化精度来优化分配模型。 优化可以基于或多于其他约束，例如每个法官的成本和/或配额。

    Fast and scalable approximation methods for finding minimum cost flows with shared recovery strategies, and system using same
    4.
    发明授权
    Fast and scalable approximation methods for finding minimum cost flows with shared recovery strategies, and system using same 失效
    快速和可扩展的近似方法，用于通过共享恢复策略找到最低成本流量，并使用系统

    公开(公告)号：US07280526B2

    公开(公告)日：2007-10-09

    申请号：US10053079

    申请日：2002-01-17

    申请人： Lisa Karen Fleischer ,  Iraj Saniee ,  Frederick Bruce Shepherd ,  Aravind Srinivasan

    发明人： Lisa Karen Fleischer ,  Iraj Saniee ,  Frederick Bruce Shepherd ,  Aravind Srinivasan

    IPC分类号： H04L12/28 ,  H04J3/16 ,  G01R31/08

    CPC分类号： H04L45/50 ,  H04L45/00 ,  H04L45/123 ,  H04L45/28 ,  H04Q11/0062 ,  H04Q2011/0073 ,  H04Q2011/0077 ,  H04Q2011/0081 ,  H04Q2011/0086

    摘要： Broadly, techniques for solving network routing within a predetermined error are disclosed. These techniques may be applied to networks supporting dedicated reserve capacity, where reserved capacity on links in the network is dedicated for a particular commodity (generally, a source and sink pair of computers), and shared recovery, where reserved capacity on links is shared amongst two or more commodities. These techniques use an iterative process to determine flows on each of the links in a network. Costs are set for each commodity, and primary and secondary (i.e., backup) flows are initialized. A commodity is selected and demand for the commodity is routed through the shortest path. Costs are updated for each potential failure mode. For each commodity, the flows and costs are updated. Once all flows and costs are updated, then it is determined if a function is less than a predetermined value. If the function is less than a predetermined value, then the commodity selection, and flow and cost adjustments are again performed. If the function is greater than the predetermined amount, then the network routing problem is solved to within a predetermined amount from an optimal network routing.

    摘要翻译： 广泛地，公开了在预定误差内解决网络路由的技术。 这些技术可以应用于支持专用储备容量的网络，其中网络上的链路上的保留容量专用于特定商品（通常是源和计算机对），以及共享恢复，其中共享链路上的预留容量 两种以上的商品。 这些技术使用迭代过程来确定网络中每个链路上的流量。 为每个商品设置成本，并初始化主要和次要（即备份）流。 选择商品，并通过最短路径路由商品的需求。 每个潜在的故障模式都会更新成本。 对于每种商品，流量和成本都会更新。 一旦所有流量和成本被更新，则确定功能是否小于预定值。 如果功能小于预定值，则再次执行商品选择，流量和成本调整。 如果该功能大于预定量，则将网络路由问题从最佳网络路由解决到预定量内。