SYSTEMS AND METHODS FOR APPLICATION-STATE, DISTRIBUTED REPLICATION TABLE CACHE POISONING
    1.
    发明申请
    SYSTEMS AND METHODS FOR APPLICATION-STATE, DISTRIBUTED REPLICATION TABLE CACHE POISONING 有权
    应用状态的系统和方法,分布式复制表缓存解决方案

    公开(公告)号:US20140304355A1

    公开(公告)日:2014-10-09

    申请号:US14245299

    申请日:2014-04-04

    Abstract: The present application is directed towards invalidating (also referred to as poisoning) ASDR table entries that are determined to be inaccurate because of changes to a multi-node system. For example, when a node leaves or enters a multi-node system, the ownership of the entries in the ASDR table can change thus invalidating cached and replica entries. More specifically, the system and methods disclosed herein include searching an ASDR table for cached entries responsive to the system determining the multi-node system has changed. After finding a cached entry, the system may determine if the entry should be poisoned. The decision to poison the entry may be responsive to the creation time of the entry, the time when the change to the multi-node system occurred, and in the case of a replica, the owner of the replica's position in a replication chain relative to source of the replica.

    Abstract translation: 本申请涉及由于对多节点系统的改变而被确定为不准确的无效(也称为中毒)ASDR表条目。 例如,当节点离开或进入多节点系统时,ASDR表中的条目的所有权可以改变,从而使高速缓存和副本条目无效。 更具体地,本文公开的系统和方法包括:响应于系统确定多节点系统已经改变,搜索ASDR表以获得缓存条目。 找到缓存条目后,系统可能会确定条目是否应该被中毒。 毒品入场的决定可以响应入场的创建时间,发生多节点系统的更改的时间,而在副本的情况下,副本在复制链中的位置相对于相对于 复制品的来源。

    SYSTEMS AND METHODS FOR LEAST CONNECTION LOAD BALANCING BY MULTI-CORE DEVICE
    3.
    发明申请
    SYSTEMS AND METHODS FOR LEAST CONNECTION LOAD BALANCING BY MULTI-CORE DEVICE 有权
    用于通过多核设备进行最小连接负载均衡的系统和方法

    公开(公告)号:US20150039763A1

    公开(公告)日:2015-02-05

    申请号:US13955807

    申请日:2013-07-31

    CPC classification number: H04L47/125 G06F9/45533 H04L67/1008 H04L67/1023

    Abstract: The present invention is directed towards systems and methods for load balancing by a multi-core device intermediary between clients and services. The device may establish sub-slots in each slot of the device's packet engines. The number of sub-slots may correspond to the packet engine count. Each slot may track a different number of active connections allocated to a service. The device may assign a first and second service to each packet engine in a first slot corresponding to no active connections. These services may be assigned to different sub-slots in adjacent packet engines. The device may update, responsive to allocation of a first active connection to the first service, the first service from a sub-slot in the first slot of a first packet engine, to a corresponding sub-slot in a second slot. The second slot may correspond to one active connection allocated to the first service.

    Abstract translation: 本发明涉及用于通过客户端和服务之间的多核设备中介的负载平衡的系统和方法。 设备可以在设备的分组引擎的每个时隙中建立子时隙。 子时隙的数量可以对应于分组引擎计数。 每个时隙可以跟踪分配给服务的不同数量的活动连接。 设备可以在与没有活动连接相对应的第一时隙中为每个分组引擎分配第一和第二服务。 这些服务可以分配给相邻分组引擎中的不同子时隙。 响应于将第一服务的第一活动连接分配到第一分组引擎的第一时隙中的子时隙到第二时隙中的相应子时隙,所述设备可以更新。 第二时隙可以对应于分配给第一服务的一个活动连接。

    Systems and methods for application-state distributed replication table hunting

    公开(公告)号:US09619542B2

    公开(公告)日:2017-04-11

    申请号:US14245296

    申请日:2014-04-04

    CPC classification number: G06F17/30575

    Abstract: The present application is directed towards systems and methods of hunting for a hash table entry in a hash table distributed over a multi-node system. More specifically, when entries are created in an ASDR table, the owner node of the entry may replicate the entry onto a non-owner node. The replica can act as a backup of the ASDR table entry in the event the node leaves the multi-mode system. When the node returns to the multi-node system, the node may no longer have the most up to date ASDR table entries, and may hunt to find the existence of the value associated with the entry. Responsive to receiving a request for an entry that may be outdated on the node, the node sends a request down a replication chain for an updated copy of the ASDR table entry from one of the replicas. Responsive to receiving the replica copy of the entry, the node responds to the client's request for the entry.

    Systems and methods for least connection load balancing by multi-core device
    5.
    发明授权
    Systems and methods for least connection load balancing by multi-core device 有权
    通过多核设备实现最小连接负载平衡的系统和方法

    公开(公告)号:US09088501B2

    公开(公告)日:2015-07-21

    申请号:US13955807

    申请日:2013-07-31

    CPC classification number: H04L47/125 G06F9/45533 H04L67/1008 H04L67/1023

    Abstract: The present invention is directed towards systems and methods for load balancing by a multi-core device intermediary between clients and services. The device may establish sub-slots in each slot of the device's packet engines. The number of sub-slots may correspond to the packet engine count. Each slot may track a different number of active connections allocated to a service. The device may assign a first and second service to each packet engine in a first slot corresponding to no active connections. These services may be assigned to different sub-slots in adjacent packet engines. The device may update, responsive to allocation of a first active connection to the first service, the first service from a sub-slot in the first slot of a first packet engine, to a corresponding sub-slot in a second slot. The second slot may correspond to one active connection allocated to the first service.

    Abstract translation: 本发明涉及用于通过客户端和服务之间的多核设备中介的负载平衡的系统和方法。 设备可以在设备的分组引擎的每个时隙中建立子时隙。 子时隙的数量可以对应于分组引擎计数。 每个时隙可以跟踪分配给服务的不同数量的活动连接。 设备可以在与没有活动连接相对应的第一时隙中为每个分组引擎分配第一和第二服务。 这些服务可以分配给相邻分组引擎中的不同子时隙。 响应于将第一服务的第一活动连接分配到第一分组引擎的第一时隙中的子时隙到第二时隙中的相应子时隙,所述设备可以更新。 第二时隙可以对应于分配给第一服务的一个活动连接。

    SYSTEMS AND METHODS FOR APPLICATION-STATE DISTRIBUTED REPLICATION TABLE HUNTING
    6.
    发明申请
    SYSTEMS AND METHODS FOR APPLICATION-STATE DISTRIBUTED REPLICATION TABLE HUNTING 有权
    应用状态分布式复制表的系统和方法

    公开(公告)号:US20140304231A1

    公开(公告)日:2014-10-09

    申请号:US14245296

    申请日:2014-04-04

    CPC classification number: G06F17/30575

    Abstract: The present application is directed towards systems and methods of hunting for a hash table entry in a hash table distributed over a multi-node system. More specifically, when entries are created in an ASDR table, the owner node of the entry may replicate the entry onto a non-owner node. The replica can act as a backup of the ASDR table entry in the event the node leaves the multi-mode system. When the node returns to the multi-node system, the node may no longer have the most up to date ASDR table entries, and may hunt to find the existence of the value associated with the entry. Responsive to receiving a request for an entry that may be outdated on the node, the node sends a request down a replication chain for an updated copy of the ASDR table entry from one of the replicas. Responsive to receiving the replica copy of the entry, the node responds to the client's request for the entry.

    Abstract translation: 本申请涉及在分布在多节点系统上的哈希表中搜索散列表条目的系统和方法。 更具体地说,当在ASDR表中创建条目时,条目的所有者节点可以将条目复制到非所有者节点。 在节点离开多模式系统的情况下,副本可以作为ASDR表条目的备份。 当节点返回到多节点系统时,节点可能不再具有最新的ASDR表条目,并且可以寻找找到与条目相关联的值的存在。 响应于接收到可能在节点上过时的条目的请求,节点从复制链路之一向ASDR表条目的更新副本发送针对复制链的请求。 响应于接收该条目的复制副本,节点响应客户端对该条目的请求。

Patent Agency Ranking