Forwarding to clusters of service nodes
    321.
    发明授权
    Forwarding to clusters of service nodes 有权
    转发到服务节点的集群

    公开(公告)号:US09397946B1

    公开(公告)日:2016-07-19

    申请号:US14452975

    申请日:2014-08-06

    Inventor: Navindra Yadav

    Abstract: Systems, methods, and computer-readable storage media for forwarding traffic to clusters of nodes. A system can group nodes in a network fabric into a cluster of nodes, and generate respective hash buckets in the network fabric for the nodes, each respective hash bucket being generated based on a hash function applied to a subset of packet header fields. Next, the system receives a packet associated with a service provided by a node in the cluster, and assigns the packet to a hash bucket from the respective hash buckets based on a comparison of a hash value associated with the packet and hash values associated with the respective hash buckets. The system then selects a node in the cluster to service the packet, the node being selected based on the hash bucket assigned to the packet, the hash bucket being associated with the node.

    Abstract translation: 用于将流量转发到节点簇的系统,方法和计算机可读存储介质。 系统可以将网络结构中的节点分组成节点簇,并在节点的网络结构中生成各自的哈希桶,每个相应的哈希桶是基于应用于分组报头字段子集的散列函数生成的。 接下来,系统接收与由群集中的节点提供的服务相关联的分组,并且基于与分组相关联的哈希值和与该分组相关联的哈希值的比较将分组分配给来自相应哈希桶的哈希桶 各个哈希桶。 然后,系统选择集群中的节点来服务分组,基于分配给分组的哈希桶来选择节点,该哈希桶与该节点相关联。

    Data plane learning of bi-directional service chains
    322.
    发明授权
    Data plane learning of bi-directional service chains 有权
    双向服务链的数据平面学习

    公开(公告)号:US09246799B2

    公开(公告)日:2016-01-26

    申请号:US13891245

    申请日:2013-05-10

    CPC classification number: H04L45/306 H04L41/0893 H04L47/2441 H04L69/22

    Abstract: Techniques are provided to decouple service chain structure from the underlying network forwarding state and allow for data plane learning of service chain forwarding requirements and any association between services function state requirements and the forward and reverse forwarding paths for a service chain. In a network comprising a plurality of network nodes each configured to apply a service function to traffic that passes through the respective network node, a packet is received at a network node. When the network node determines that the service function it applies is stateful, it updates context information in a network service header of the packet to indicate that the service function applied at the network node is stateful and that traffic for a reverse path matching the classification criteria is to be returned to the network node.

    Abstract translation: 提供了技术来将服务链结构与底层网络转发状态分离,并允许服务链转发要求的数据平面学习和服务功能状态要求与服务链的前向和后向转发路径之间的任何关联。 在包括多个网络节点的网络中,每个网络节点被配置为对通过相应网络节点的业务应用服务功能,在网络节点处接收分组。 当网络节点确定其应用的服务功能是有状态时,它更新分组的网络服务报头中的上下文信息,以指示在网络节点处应用的服务功能是有状态的,并且用于与分类标准匹配的反向路径的业务 将被返回到网络节点。

    POLICY ENFORCEMENT PROXY
    324.
    发明申请
    POLICY ENFORCEMENT PROXY 有权
    政策执行情况

    公开(公告)号:US20150124809A1

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

    申请号:US14532787

    申请日:2014-11-04

    Abstract: Systems, methods, and non-transitory computer-readable storage media for implementing a policy enforcement proxy are disclosed. A data packet associated with a source endpoint group and a destination endpoint group is received at a network device. The network device performs a policy lookup based on the source endpoint group and the destination endpoint group. The network device determines that the policy is not available and in response, modifies the data packet and forwards it to a policy enforcement proxy.

    Abstract translation: 公开了用于实施策略执行代理的系统,方法和非暂时的计算机可读存储介质。 在网络设备处接收与源端点组和目的端点组相关联的数据分组。 网络设备根据源端点组和目标端点组执行策略查找。 网络设备确定策略不可用,作为响应,修改数据包并将其转发到策略执行代理。

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

    公开(公告)号:US20150124805A1

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

    申请号:US14475349

    申请日:2014-09-02

    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
    326.
    发明申请
    WEIGHTED EQUAL COST MULTIPATH ROUTING 有权
    加权平均成本多路径路由

    公开(公告)号:US20150124652A1

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

    申请号:US14450106

    申请日:2014-08-01

    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之间的值等)。 密钥可以用于选择转发数据包的上行链路或路径。 可以为分组流或小流生成密钥。 每个流可以与相同的密钥相关联,使得流中的每个分组将沿着相同的路径被转发。 每条流都可以沿不同的上行链路转发。

    HOST ROUTE CONVERGENCE BASED ON SEQUENCE VALUES
    327.
    发明申请
    HOST ROUTE CONVERGENCE BASED ON SEQUENCE VALUES 审中-公开
    基于序列值的主机路由收敛

    公开(公告)号:US20140229598A1

    公开(公告)日:2014-08-14

    申请号:US14255182

    申请日:2014-04-17

    CPC classification number: H04L45/70 H04W40/36

    Abstract: In an example embodiment, a method is provided that assigns a sequence value to a host. The host is identified by a host network layer address. After the assignment, the host network layer address and the sequence value are included in an advertisement for transmission. In another example embodiment, another method is provided. Here, a first sequence value associated with the host network layer address is received from a network device. In addition, a second sequence value associated with the same host network layer address is received from a different network device. The first sequence value is ranked relative to the second sequence value and data is transmitted to the network device based on the ranking.

    Abstract translation: 在示例实施例中,提供了向主机分配序列值的方法。 主机由主机网络层地址标识。 在分配之后,主机网络层地址和序列值被包括在用于传输的广告中。 在另一示例实施例中,提供了另一种方法。 这里,从网络设备接收与主机网络层地址相关联的第一序列值。 此外,从不同的网络设备接收与相同主机网络层地址相关联的第二序列值。 第一序列值相对于第二序列值排序,并且基于排名将数据发送到网络设备。

Patent Agency Ranking