中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

69 records (took 0.022 seconds)

    SYSTEM AND METHOD FOR IDENTIFICATION OF LARGE-DATA FLOWS
    34.
    发明申请
    SYSTEM AND METHOD FOR IDENTIFICATION OF LARGE-DATA FLOWS 有权
    用于识别大数据流的系统和方法

    公开(公告)号：US20150124825A1

    公开(公告)日：2015-05-07

    申请号：US14490596

    申请日：2014-09-18

    Applicant: Cisco Technology, Inc.

    Inventor： Sarang M. Dharmapurikar ,  Mohammadreza Alizadeh Attar ,  Kit Chiu Chu ,  Francisco M. Matus ,  Adam Hutchin ,  Janakiramanan Vaidyanathan

    IPC: H04L12/743

    CPC classification number: H04L45/7453

    Abstract: Apparatus, systems and methods may be used to monitor data flows and to select and track particularly large data flows. A method of tracking data flows and identifying large-data (“elephant”) flows comprises extracting fields from a packet of data to construct a flow key, computing a hash value on the flow key to provide a hashed flow signature, entering and/or comparing the hashed flow signature with entries in a flow hash table. Each hash table entry includes a byte count for a respective flow. When the byte count for a flow exceeds a threshold value, the flow is added to a large-data flow (“elephant”) table and the flow is then tracked in the large-data flow table.

    Abstract translation: 装置，系统和方法可用于监视数据流并选择和跟踪特别大的数据流。 跟踪数据流和识别大数据（“大象”）流的方法包括从数据包中提取字段以构建流密钥，在流密钥上计算散列值以提供散列流签名，输入和/或 将散列流签名与流哈希表中的条目进行比较。 每个散列表条目包括相应流的字节计数。 当流量的字节数超过阈值时，将流量添加到大数据流（“大象”）表，然后在大数据流表中跟踪流。

    METHOD FOR SCALING ADDRESS LOOKUPS USING SYNTHETIC ADDRESSES
    35.
    发明申请
    METHOD FOR SCALING ADDRESS LOOKUPS USING SYNTHETIC ADDRESSES 有权
    使用合成地址缩放地址查询的方法

    公开(公告)号：US20150124805A1

    公开(公告)日：2015-05-07

    申请号：US14475349

    申请日：2014-09-02

    Applicant: Cisco Technology, Inc.

    Inventor： Navindra Yadav ,  Satyam Sinha ,  Thomas J. Edsall ,  Mohammadreza Alizadeh Attar ,  Kit Chiu Chu

    IPC: H04L29/12 ,  H04L29/06 ,  H04L12/741

    CPC classification number: H04L47/50 ,  H04L45/74 ,  H04L45/7453 ,  H04L47/125 ,  H04L47/56 ,  H04L49/25 ,  H04L49/254 ,  H04L61/103 ,  H04L61/2084 ,  H04L61/6004 ,  H04L61/6095 ,  H04L67/22 ,  H04L67/322 ,  H04L69/167 ,  H04L69/22

    Abstract: Various examples of the present disclosure provide methods for unifying various types of end-point identifiers, such as IPv4 (e.g., Internet protocol version 4 represented by a VRF and an IPv4 address), IPv6 (e.g., Internet protocol version 6 represented by a VRF and an IPv6 address) and L2 (e.g., Layer-2 represented by a bridge domain (BD) and a media access control (MAC) address), by mapping end-point identifiers to a uniform space (e.g., a synthetic IPv4 address and a synthetic VRF) and allowing different forms of lookups to be uniformly handled. In some examples, a lookup database residing on a switch device can be sharded into a plurality of lookup table subsets, each of which resides on a different one of multiple switch chipsets (e.g., Tridents) in the switch device.

    Abstract translation: 本公开的各种示例提供了用于统一各种端点标识符（例如，由VRF和IPv4地址表示的因特网协议版本4），IPv6（例如，由VRF表示的因特网协议版本6）的各种端点标识符的方法 和IPv6地址）和L2（例如，由桥接域（BD）和媒体访问控制（MAC）地址表示的层2），通过将端点标识符映射到统一的空间（例如，合成IPv4地址和 合成VRF），并允许不同形式的查找被统一处理。 在一些示例中，驻留在交换机设备上的查找数据库可以划分成多个查找表子集，每个查找表子集驻留在交换设备中的多个交换芯片组（例如Trident）中的不同的一个。

    WEIGHTED EQUAL COST MULTIPATH ROUTING
    36.
    发明申请
    WEIGHTED EQUAL COST MULTIPATH ROUTING 有权
    加权平均成本多路径路由

    公开(公告)号：US20150124652A1

    公开(公告)日：2015-05-07

    申请号：US14450106

    申请日：2014-08-01

    Applicant: Cisco Technology, Inc.

    Inventor： Sarang Dharmapurikar ,  Mohammadreza Alizadeh Attar ,  Navindra Yadav ,  Ramanan Vaidyanathan ,  Kit Chiu Chu

    IPC: H04L12/733 ,  H04L12/751 ,  H04L12/801

    CPC classification number: H04L45/7453 ,  G06F9/30018 ,  G06K15/107 ,  G11C11/4096 ,  G11C15/00 ,  G11C15/04 ,  G11C2207/002 ,  H04L45/24 ,  H04L47/125

    Abstract: In some implementations, network traffic can be routed along equal cost paths based on weights assigned to each path. For example, weighted equal cost multipath routing can be implemented by assigning weights to each equal cost path (e.g., uplink, next hop node) to a destination device. When the network device receives a packet, the network device can generate a key (e.g., a random value, a hash value based on packet data, a value between 0 and n, etc.). The key can be used to select an uplink or path upon which to forward the packet. A key can be generated for a packet flow or flowlet. Each flow can be associated with the same key so that each packet in a flow will be forwarded along the same path. Each flowlet can be forwarded along a different uplink.

    Abstract translation: 在一些实现中，基于分配给每个路径的权重，网络流量可以沿着相等的成本路径路由。 例如，可以通过向目标设备分配权重给每个相等成本路径（例如，上行链路，下一跳节点）来实现加权等成本多径路由。 当网络设备接收到分组时，网络设备可以生成密钥（例如，随机值，基于分组数据的哈希值，0和n之间的值等）。 密钥可以用于选择转发数据包的上行链路或路径。 可以为分组流或小流生成密钥。 每个流可以与相同的密钥相关联，使得流中的每个分组将沿着相同的路径被转发。 每条流都可以沿不同的上行链路转发。

Patent Agency Ranking