利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

12 条记录 (耗时 0.022 秒)

    Hierarchical fair scheduling algorithm in a distributed measurement system
    2.
    发明授权
    Hierarchical fair scheduling algorithm in a distributed measurement system 失效
    分布式测量系统中的分层公平调度算法

    公开(公告)号：US07860918B1

    公开(公告)日：2010-12-28

    申请号：US11459834

    申请日：2006-07-25

    申请人： Omar Castillo Baldonado ,  Mansour Karam ,  Michael Alan Lloyd ,  Jose-Miguel Pulido

    发明人： Omar Castillo Baldonado ,  Mansour Karam ,  Michael Alan Lloyd ,  Jose-Miguel Pulido

    IPC分类号： G06F15/16

    CPC分类号： H04L43/50

    摘要： The present invention provides embodiments of a network monitoring system that includes a scheduling agent for generating groupings of test agents and scheduling network measurements to be performed by each test agent grouping. The system may provide identifiers to members of first and second sets of objects. Then, the system can generate first and second sequences of the identifiers for each of the first and second sets, respectively and associate the identifiers to provide a plurality of groupings of identifiers. Finally the system may schedule a corresponding event for each of the grouping of identifiers. The systems and methods present can require very little state memory, ensure fair coverage of the object groupings; and can avoid the problems associated with round robin scheduling.

    摘要翻译： 本发明提供了一种网络监视系统的实施例，其包括用于生成测试代理的分组的调度代理和由每个测试代理分组执行的调度网络测量。 系统可以向第一和第二组对象的成员提供标识符。 然后，系统可以分别为第一组和第二组中的每一个生成标识符的第一和第二序列，并且关联标识符以提供多个标识符分组。 最后，系统可以为每个标识符分组调度相应的事件。 存在的系统和方法可能需要很少的状态记忆，确保对象分组的公平覆盖; 并可以避免与循环调度相关的问题。

    Distributed measurement system configurator tool
    4.
    发明授权
    Distributed measurement system configurator tool 失效
    分布式测量系统配置工具

    公开(公告)号：US07876690B1

    公开(公告)日：2011-01-25

    申请号：US11861879

    申请日：2007-09-26

    申请人： Stephen H. Ellis ,  Sean Finn ,  Kanzhe Jiang ,  Jose-Miguel Pulido ,  Faisal Siddiqi

    发明人： Stephen H. Ellis ,  Sean Finn ,  Kanzhe Jiang ,  Jose-Miguel Pulido ,  Faisal Siddiqi

    IPC分类号： H04L12/26

    CPC分类号： H04L43/50 ,  H04L43/0829 ,  H04L43/0864 ,  H04L43/087 ,  H04L43/12

    摘要： A monitoring system gathers both site-to-site measurements, and agent-to-agent measurements, wherein one or more agents are distributed in one or more sites in a distributed network environment. Site-to-site measurements between two sites, such as site one and site two, are obtained by testing between any agent at site one and any agent at site two. A measurement rate between sites and between agents is determined that allows for the detection of events, such as user perceivable events, without overwhelming the set of agents that form the distributed measurement system. With, for example, a scheduling mechanism used to schedule measurement tests of finite duration, as opposed to continuous streams of measurement packets, for each pair of agents, the test can be used as an indication as to whether the measurement system is overwhelmed.

    摘要翻译： 监控系统收集站点到站点测量和代理到代理测量，其中一个或多个代理分布在分布式网络环境中的一个或多个站点中。 通过在站点1的任何代理和站点二的任何代理之间的测试来获得两个站点之间的站点到站点的测量，例如站点1和站点2。 确定站点之间和代理之间的测量速率，其允许检测诸如用户可感知事件之类的事件，而不会使形成分布式测量系统的代理集合成为压倒性的。 例如，对于每对代理，例如，用于调度有限持续时间的测量测试的调度机制（与连续的测量分组流相反），该测试可以用作关于测量系统是否被压倒的指示。

    METHOD OF CONSTRUCTING A LOYALTY GRAPH
    9.
    发明申请
    METHOD OF CONSTRUCTING A LOYALTY GRAPH 审中-公开
    建立一个LOYALTY图的方法

    公开(公告)号：US20130030865A1

    公开(公告)日：2013-01-31

    申请号：US13553001

    申请日：2012-07-19

    申请人： Jose-Miguel Pulido Villaverde ,  Miquel Sonsona Villalobos ,  Diego Campo Millan ,  Jens Grivolla ,  Toni Badia ,  David Maso Mas ,  Adria Carulla Ruiz

    发明人： Jose-Miguel Pulido Villaverde ,  Miquel Sonsona Villalobos ,  Diego Campo Millan ,  Jens Grivolla ,  Toni Badia ,  David Maso Mas ,  Adria Carulla Ruiz

    IPC分类号： G06Q30/02

    CPC分类号： G06Q30/0201

    摘要： Offers for goods or services are targeted more efficiently to potential consumers by using a loyalty graph having nodes that correspond to users and edges that correspond to relationships between the users. The offers are transmitted to only superusers, corresponding to supernodes in the loyalty graph. By targeting only the superusers, the number of invitations transmitted as part of the promotion is reduced. The superusers are determined by calculating a weighted score for each node. Each weighted score corresponds to a number of directed connections between a node and its leaf nodes, with the supernodes determined as the subset of nodes having a weighted sum above a pre-determined threshold. After identifying superusers, subgraphs can be generated corresponding to each superuser. The subgraphs can be selected according to different criteria. In this way, promotions can be targeted to superusers in only selected subgraphs or to all the users in selected subgraphs.

    摘要翻译： 商品或服务的优惠通过使用具有对应于与用户之间的关系的用户和边缘的节点的忠诚度图表来更有效地针对潜在消费者。 优惠仅传送给超级用户，对应于忠诚度图中的超节点。 通过仅针对超级用户，作为促销活动的一部分传送的邀请数量减少了。 超级用户通过计算每个节点的加权得分来确定。 每个加权分数对应于节点与其叶节点之间的定向连接的数量，其中超节点被确定为具有高于预定阈值的加权和的节点子集。 在识别超级用户之后，可以对应于每个超级用户生成子图。 子图可以根据不同的标准进行选择。 这样，促销活动只能在选定的子图中或所选择的子图中的所有用户对象到超级用户。