利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

25 条记录 (耗时 0.024 秒)

    Efficient urgency-aware rate control scheme for multiple bounded flows
    1.
    发明授权
    Efficient urgency-aware rate control scheme for multiple bounded flows 有权
    针对多重有界流的高效紧急感知速率控制方案

    公开(公告)号：US08913501B2

    公开(公告)日：2014-12-16

    申请号：US13587466

    申请日：2012-08-16

    申请人： Joel W. Branch ,  Han Chen ,  Hui Lei ,  Konstantin Shagin

    发明人： Joel W. Branch ,  Han Chen ,  Hui Lei ,  Konstantin Shagin

    IPC分类号： H04L12/24 ,  H04L12/801

    CPC分类号： H04L41/5019 ,  H04L47/10 ,  H04L47/215

    摘要： A method for controlling a flow rate of multiple data flows at a network node on a path of the data flows includes the following steps. A private restriction token bucket (RTB) and a private guarantee token bucket (GTB) for each of the data flows and a shared token bucket (STB) common to all of the data flows are provided. n tokens are obtained from the RTBi for the data flow i when a message belonging to the data flow i arrives at the node and needs n tokens. An attempt is made to obtain n tokens from the GTBi for the data flow i and/or the STB. The message is transmitted if n tokens are obtained from the GTBi and/or from the STB, otherwise transmission of the message is delayed until n tokens are available in the GTBi and/or in the STB.

    摘要翻译： 用于控制数据流的路径上的网络节点处的多个数据流的流量的方法包括以下步骤。 提供了用于每个数据流的私有限制令牌桶（RTB）和专用保证令牌桶（GTB）以及所有数据流公用的共享令牌桶（STB）。 当属于数据流i的消息到达节点并需要n个令牌时，从数据流i的RTBi获得n个令牌。 尝试从数据流i和/或STB获得来自GTBi的n个令牌。 如果从GTBi和/或从STB获得n个令牌，则传送消息，否则消息的传输被延迟，直到在GTBi和/或STB中有n个令牌可用。

    Efficient Urgency-Aware Rate Control Scheme for Mulitple Bounded Flows
    2.
    发明申请
    Efficient Urgency-Aware Rate Control Scheme for Mulitple Bounded Flows 有权
    有效紧迫程度的多边界流量控制方案

    公开(公告)号：US20140050094A1

    公开(公告)日：2014-02-20

    申请号：US13587466

    申请日：2012-08-16

    申请人： Joel W. Branch ,  Han Chen ,  Hui Lei ,  Konstantin Shagin

    发明人： Joel W. Branch ,  Han Chen ,  Hui Lei ,  Konstantin Shagin

    IPC分类号： H04L12/24

    CPC分类号： H04L41/5019 ,  H04L47/10 ,  H04L47/215

    摘要： A method for controlling a flow rate of multiple data flows at a network node on a path of the data flows includes the following steps. A private restriction token bucket (RTB) and a private guarantee token bucket (GTB) for each of the data flows and a shared token bucket (STB) common to all of the data flows are provided. n tokens are obtained from the RTBi for the data flow i when a message belonging to the data flow i arrives at the node and needs n tokens. An attempt is made to obtain n tokens from the GTBi for the data flow i and/or the STB. The message is transmitted if n tokens are obtained from the GTBi and/or from the STB, otherwise transmission of the message is delayed until n tokens are available in the GTBi and/or in the STB.

    摘要翻译： 用于控制数据流的路径上的网络节点处的多个数据流的流量的方法包括以下步骤。 提供了用于每个数据流的私有限制令牌桶（RTB）和专用保证令牌桶（GTB）以及所有数据流公用的共享令牌桶（STB）。 当属于数据流i的消息到达节点并需要n个令牌时，从数据流i的RTBi获得n个令牌。 尝试从数据流i和/或STB获得来自GTBi的n个令牌。 如果从GTBi和/或从STB获得n个令牌，则传送消息，否则消息的传输被延迟，直到在GTBi和/或STB中有n个令牌可用。

    Adaptive differential propagation of soap messages
    5.
    发明授权
    Adaptive differential propagation of soap messages 有权
    肥皂消息的自适应差分传播

    公开(公告)号：US08621016B2

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

    申请号：US12942042

    申请日：2010-11-09

    申请人： Danny Bickson ,  Han Chen ,  Gidon Gershinsky ,  Konstantin Shagin

    发明人： Danny Bickson ,  Han Chen ,  Gidon Gershinsky ,  Konstantin Shagin

    IPC分类号： G06F15/16

    CPC分类号： H04L67/02

    摘要： A method of adaptive differential propagation of Simple Object Access Protocol (SOAP) messages is provided herein. The method includes the following stages: classifying incoming SOAP messages according to at least one of: structure, content, and context thereof; selecting a corresponding template out of a plurality of templates for each classified SOAP message such that the selected template minimized a specified diff function applied to the classified SOAP message and the selected template; applying the specified diff function to the SOAP message and the selected template to yield a respective delta; and encapsulating a template identifier with the respective delta, wherein the template identifier is uniquely associated with the selected template, to yield an outgoing SOAP message.

    摘要翻译： 本文提供了简单对象访问协议（SOAP）消息的自适应差分传播的方法。 该方法包括以下阶段：根据以下至少一个对传入的SOAP消息进行分类：结构，内容和上下文; 为每个分类的SOAP消息从多个模板中选择相应的模板，使得所选择的模板最小化应用于分类的SOAP消息和所选模板的指定的差异功能; 将指定的差分函数应用于SOAP消息和所选择的模板以产生相应的增量; 以及用相应的增量来封装模板标识符，其中所述模板标识符与所选择的模板唯一地相关联，以产生传出的SOAP消息。

    ADAPTIVE DIFFERENTIAL PROPAGATION OF SOAP MESSAGES
    6.
    发明申请
    ADAPTIVE DIFFERENTIAL PROPAGATION OF SOAP MESSAGES 有权
    SOAP消息的自适应差分传播

    公开(公告)号：US20120117160A1

    公开(公告)日：2012-05-10

    申请号：US12942042

    申请日：2010-11-09

    申请人： Danny Bickson ,  Han Chen ,  Gidon Gershinsky ,  Konstantin Shagin

    发明人： Danny Bickson ,  Han Chen ,  Gidon Gershinsky ,  Konstantin Shagin

    IPC分类号： G06F15/16

    CPC分类号： H04L67/02

    摘要： A method of adaptive differential propagation of Simple Object Access Protocol (SOAP) messages is provided herein. The method includes the following stages: classifying incoming SOAP messages according to at least one of: structure, content, and context thereof; selecting a corresponding template out of a plurality of templates for each classified SOAP message such that the selected template minimized a specified diff function applied to the classified SOAP message and the selected template; applying the specified diff function to the SOAP message and the selected template to yield a respective delta; and encapsulating a template identifier with the respective delta, wherein the template identifier is uniquely associated with the selected template, to yield an outgoing SOAP message.

    摘要翻译： 本文提供了简单对象访问协议（SOAP）消息的自适应差分传播的方法。 该方法包括以下阶段：根据以下至少一个对传入的SOAP消息进行分类：结构，内容和上下文; 为每个分类的SOAP消息从多个模板中选择相应的模板，使得所选择的模板最小化应用于分类的SOAP消息和所选模板的指定的差异功能; 将指定的差分函数应用于SOAP消息和所选择的模板以产生相应的增量; 以及用相应的增量来封装模板标识符，其中所述模板标识符与所选择的模板唯一地相关联，以产生传出的SOAP消息。

    Adaptive traffic management via analytics based volume reduction
    7.
    发明授权
    Adaptive traffic management via analytics based volume reduction 有权
    通过基于分析的量减少的自适应流量管理

    公开(公告)号：US08797864B2

    公开(公告)日：2014-08-05

    申请号：US13008918

    申请日：2011-01-19

    申请人： Gidon Gershinsky ,  Liane Lewin-Eytan ,  Konstantin Shagin

    发明人： Gidon Gershinsky ,  Liane Lewin-Eytan ,  Konstantin Shagin

    IPC分类号： H04L12/56

    CPC分类号： H04L47/22 ,  H04L47/12 ,  H04L47/32

    摘要： A method of managing traffic over a communication link between a transmitting node and a receiving node is provided herein. The method includes: determining momentary traffic shaping constraints; accumulating incoming messages at the transmitting node into a data queue, based on the momentary traffic shaping constraints; transmitting the messages from the data queue to the receiving node over the communication link based on the momentary traffic shaping constraints; estimating a desired amount of data that needs to be discarded from messages in the data queue, based on: (a) the size of the data queue and (b) the momentary traffic shaping constraints; sorting data in the data queue by an order of importance, based on analytic objects; discarding, based on the analytic objects, the desired amount of data from the messages in the queued data, such that the discarded data is ranked lowest by the order of importance.

    摘要翻译： 本文提供了一种在发送节点和接收节点之间的通信链路上管理业务的方法。 该方法包括：确定瞬时流量整形约束; 基于瞬时流量整形约束将发送节点处的进入消息累加到数据队列中; 基于瞬时流量整形约束，通过通信链路将消息从数据队列发送到接收节点; 基于：（a）数据队列的大小和（b）瞬时流量整形约束，从数据队列中的消息估计需要丢弃的数据量; 基于分析对象，按照重要性顺序对数据队列中的数据进行排序; 基于分析对象，从排队数据中的消息中丢弃期望的数据量，使得丢弃的数据按重要程度排列最低。

    DISTRIBUTED PERFORMANCE MONITORING IN SOFT REAL-TIME DISTRIBUTED SYSTEMS
    8.
    发明申请
    DISTRIBUTED PERFORMANCE MONITORING IN SOFT REAL-TIME DISTRIBUTED SYSTEMS 审中-公开
    在软实时分布式系统中进行分布式性能监控

    公开(公告)号：US20110078291A1

    公开(公告)日：2011-03-31

    申请号：US12569954

    申请日：2009-09-30

    申请人： Danny Bickson ,  Gidon Gershinsky ,  Konstantin Shagin

    发明人： Danny Bickson ,  Gidon Gershinsky ,  Konstantin Shagin

    IPC分类号： G06F15/173 ,  G06F15/177

    CPC分类号： G06F11/3409 ,  G06F11/3452 ,  G06F2201/805 ,  G06F2201/875

    摘要： A novel and useful framework, system and method of monitoring one or more performance parameters (e.g., distributed system performance), filtering the performance parameters data collected and identifying one or more performance parameters that affect one or more target performance measures. This can be achieved in the case of a delay parameter, for example, by determining the root-cause of the increased delay and taking corrective actions in order to avoid violation of the timeliness constraints. The present invention is a statistical based performance monitoring mechanism that uses statistical signal processing techniques and is applicable, for example, in soft real-time distributed systems. The monitoring framework efficiently and distributively characterizes the behavior of the varying network conditions as a stochastic process and performs root-cause analysis to detecting the parameters which affect one or more target performance measures, e.g., latency. Once the affecting parameters are determined, corrective action is optionally taken.

    摘要翻译： 监测一个或多个性能参数（例如，分布式系统性能）的新颖有用的框架，系统和方法，过滤所收集的性能参数数据并识别影响一个或多个目标性能测量的一个或多个性能参数。 这可以在延迟参数的情况下实现，例如通过确定增加的延迟的根本原因并采取校正动作，以避免违反时效性约束。 本发明是基于统计的性能监视机制，其使用统计信号处理技术，并且可应用于例如软实时分布式系统。 监控框架有效地并且分布地将不同网络条件的行为特征化为随机过程，并执行根本原因分析以检测影响一个或多个目标性能测量（例如等待时间）的参数。 一旦确定了影响的参数，则可以采取校正动作。

    Data reduction in a multi-node system
    9.
    发明授权
    Data reduction in a multi-node system 有权
    多节点系统中的数据减少

    公开(公告)号：US08781768B2

    公开(公告)日：2014-07-15

    申请号：US12836605

    申请日：2010-07-15

    申请人： Gidon Gershinsky ,  Liane Lewin-Eytan ,  Yossi Richter ,  Konstantin Shagin ,  Elad Yom-Tov

    发明人： Gidon Gershinsky ,  Liane Lewin-Eytan ,  Yossi Richter ,  Konstantin Shagin ,  Elad Yom-Tov

    IPC分类号： G01R21/00

    CPC分类号： H04Q9/00 ,  H04Q2209/30 ,  H04Q2209/40 ,  H04Q2209/60 ,  H04Q2209/84

    摘要： An advanced metering infrastructure comprises intermediate nodes. The intermediate nodes receive data from child nodes and aggregate the data according to groups of child nodes. The aggregation provides for a reduced version of the data. The reduction is performed based on groups determined by clustering. The reduced version of the data comprises data describing a group of measurements over time, such as a centroid in an n-dimension space, number of customers in the group, radius of the group and the like. The centroid may shift over time based on a consumption profile, such as low consumption at noon, and high consumption at evening. The consumption profiles may be determined in a learning phase, as well as shifting of centroids of each group over time.

    摘要翻译： 先进的计量基础设施包括中间节点。 中间节点从子节点接收数据，并根据子节点组聚合数据。 聚合提供数据的缩减版本。 基于通过聚类确定的组来执行缩减。 数据的缩减版本包括描述一段时间内的一组测量的数据，例如n维空间中的质心，组中的客户数量，组的半径等。 中心可能会根据消费情况随时间而变化，例如中午消费低，晚上消费高。 消费概况可以在学习阶段确定，并且可以随着时间推移各组的质心。

    Efficient buffer utilization in a computer network-based messaging system
    10.
    发明授权
    Efficient buffer utilization in a computer network-based messaging system 失效
    在基于计算机网络的消息传递系统中高效的缓冲区利用率

    公开(公告)号：US08145786B2

    公开(公告)日：2012-03-27

    申请号：US12245779

    申请日：2008-10-06

    申请人： Gidon Gershinsky ,  Konstantin Shagin

    发明人： Gidon Gershinsky ,  Konstantin Shagin

    IPC分类号： G06F15/16 ,  G06F13/12 ,  G06F13/00

    CPC分类号： G06F5/14 ,  G06F2205/063 ,  G06F2205/108

    摘要： Buffering messages by receiving a message from a messaging client, writing the message to a logically-contiguous write-available region of a message buffer starting at a logically next write-available location within the write-available region, updating a head index to indicate a head boundary between a logically last message in the message buffer and a logically next write-available location in the message buffer, defining a packet including the message within the message buffer, transmitting a packet that includes a logically first message in the message buffer, and updating a tail index to indicate a tail boundary between a new logically last write-available location in the message buffer and a new logically first message in the message buffer.

    摘要翻译： 通过从消息传递客户端接收消息来缓冲消息，将消息写入消息缓冲器的逻辑上连续的写可用区域，从写可用区域内的逻辑下一个写可用位置开始，更新头索引以指示 在消息缓冲器中的逻辑上一个消息与消息缓冲器中的逻辑下一个写可用位置之间的头部边界，定义包含消息缓冲器内的消息的分组，在消息缓冲器中发送包括逻辑上第一消息的分组，以及 更新尾部索引以指示消息缓冲器中新的逻辑上一个可写入可用位置与消息缓冲器中新的逻辑上第一个消息之间的尾部边界。