中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

23 records (took 0.014 seconds)

    HARDWARE BASED PACKET REPLICATION AT TAIL END NODE
    11.
    发明申请
    HARDWARE BASED PACKET REPLICATION AT TAIL END NODE 审中-公开

    公开(公告)号：US20190097839A1

    公开(公告)日：2019-03-28

    申请号：US15714761

    申请日：2017-09-25

    Applicant: Cisco Technology, Inc.

    Inventor： Swami Narayanan ,  Ambrish Mehta ,  Venkatesh Srinivasan ,  Raghava Sivaramu ,  Ayan Banerjee

    IPC: H04L12/46 ,  H04L29/06 ,  H04L12/04

    Abstract: Aspects of the disclosed technology address limitations relating to packet replication for multi-destination traffic, by providing methods for performing hardware-based replication in network infrastructure devices, such as switches. In some aspects, application specific integrated circuits (ASICs) resident in physical devices can be used to perform packet replication. Depending on implementation, a hardware-based replication process can include steps for receiving a first packet that includes a first outer header containing first address information, receiving a second packet including a second outer header containing a hardware replication flag, forwarding the first packet to all virtual tunnel endpoints (VTEPs) connected with the TOR switch, and performing hardware replication for the second packet based on the hardware replication flag to generate one or more unicast packets. Systems and machine readable media are also provided.

    INCREASING MULTICAST SCALE VIA LOCALIZATION OF INDICIES
    12.
    发明申请
    INCREASING MULTICAST SCALE VIA LOCALIZATION OF INDICIES 有权
    通过指标的本地化增加多重尺度

    公开(公告)号：US20150124684A1

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

    申请号：US14477244

    申请日：2014-09-04

    Applicant: Cisco Technology, Inc.

    Inventor： Ayan Banerjee ,  Srinivasan Ramabadran ,  Mehak Mahajan ,  Raghava Sivaramu ,  Nataraj Bacthu ,  Raja Rao Tadimeti ,  Madhava Rao Cheethirala ,  Ramana Mellacheruvu

    IPC: H04W72/00 ,  H04L12/58 ,  H04W28/12

    CPC classification number: H04L45/745 ,  H04L45/16 ,  H04L45/72 ,  H04L45/748 ,  H04L47/33 ,  H04L51/10 ,  H04W28/12 ,  H04W72/005

    Abstract: A plurality of line cards with each line card having a respective network forwarding engine and a respective outgoing interface (OIF) list and at least one fabric module communicatively coupled with each line card with each fabric module can have a respective network forwarding engine. The local OIF list can be asymmetrically programmed. The network forwarding engine of a line card can be configured to receive a multicast packet, compare a multicast address associate with the received multicast packet with entries in the local OIF list of the line card and forward the received multicast packet to at least one interface associated with the multicast address in response to the comparison resulting in a match.

    Abstract translation: 具有每个线路卡的多个线路卡具有相应的网络转发引擎和相应的输出接口（OIF）列表以及与每个线路卡与每个结构模块通信地耦合的至少一个结构模块可以具有相应的网络转发引擎。 本地OIF列表可以非对称编程。 线路卡的网络转发引擎可以被配置为接收多播分组，将与所接收的多播分组关联的多播地址与线路卡的本地OIF列表中的条目进行比较，并将接收到的多播分组转发到至少一个相关联的接口 多播地址响应于比较导致匹配。

    Efficient Flooding of Link State Packets for Layer 2 Link State Protocols
    13.
    发明申请
    Efficient Flooding of Link State Packets for Layer 2 Link State Protocols 审中-公开
    链路状态报文的二次链路状态协议的有效洪泛

    公开(公告)号：US20140269410A1

    公开(公告)日：2014-09-18

    申请号：US13826572

    申请日：2013-03-14

    Applicant: CISCO TECHNOLOGY, INC.

    Inventor： Varun Shah ,  Ayan Banerjee ,  Dhananjaya Rao ,  Raghava Sivaramu ,  Abhay Roy

    IPC: H04L12/24 ,  H04L12/721

    CPC classification number: H04L45/12 ,  H04L45/32 ,  H04L45/48

    Abstract: Techniques are provided for generating and updating flooding tree paths in a network. At a particular node device in a network, a first flooding tree is generated by performing a first shortest path first (SPF) operation from a first selected node device in the network to a plurality of other node devices in the network. A second flooding tree is generated by performing a second SPF operation from a second selected node device in the network to the plurality of other node devices in the network. A network topology change event is detected in either the first or second flooding tree, and a packet sequence exchange is initiated between the particular node device and another node device in the network in response to the detected network topology change. The first and second flooding trees are then updated based on information obtained during the packet sequence exchange.

    Abstract translation: 提供了用于在网络中生成和更新泛洪树路径的技术。 在网络中的特定节点设备处，通过从网络中的第一选择的节点设备到网络中的多个其他节点设备执行第一最短路径优先（SPF）操作来生成第一洪泛树。 通过从网络中的第二所选节点设备向网络中的多个其他节点设备执行第二SPF操作来生成第二洪泛树。 在第一或第二洪泛树中检测到网络拓扑变化事件，并且响应于检测到的网络拓扑变化，在特定节点设备和网络中的另一个节点设备之间发起分组序列交换。 然后基于在分组序列交换期间获得的信息来更新第一和第二洪泛树。

    HARDWARE BASED PACKET REPLICATION AT TAIL END NODE
    14.
    发明申请
    HARDWARE BASED PACKET REPLICATION AT TAIL END NODE 审中-公开

    公开(公告)号：US20200235959A1

    公开(公告)日：2020-07-23

    申请号：US16842422

    申请日：2020-04-07

    Applicant: Cisco Technology, Inc.

    Inventor： Swami Narayanan ,  Ambrish Mehta ,  Venkatesh Srinivasan ,  Raghava Sivaramu ,  Ayan Banerjee

    IPC: H04L12/46 ,  H04L12/04 ,  H04L29/06

    Abstract: Aspects of the disclosed technology address limitations relating to packet replication for multi-destination traffic, by providing methods for performing hardware-based replication in network infrastructure devices, such as switches. In some aspects, application specific integrated circuits (ASICs) resident in physical devices can be used to perform packet replication. Depending on implementation, a hardware-based replication process can include steps for receiving a first packet that includes a first outer header containing first address information, receiving a second packet including a second outer header containing a hardware replication flag, forwarding the first packet to all virtual tunnel endpoints (VTEPs) connected with the TOR switch, and performing hardware replication for the second packet based on the hardware replication flag to generate one or more unicast packets. Systems and machine readable media are also provided.

    DYNAMIC AND COMPRESSED TRIE FOR USE IN ROUTE LOOKUP
    19.
    发明申请
    DYNAMIC AND COMPRESSED TRIE FOR USE IN ROUTE LOOKUP 审中-公开

    公开(公告)号：US20180212876A1

    公开(公告)日：2018-07-26

    申请号：US15414589

    申请日：2017-01-24

    Applicant: CISCO TECHNOLOGY, INC.

    Inventor： Nataraj Bacthu ,  Ayan Banerjee ,  Raghava Sivaramu ,  Ankan Ghosh

    IPC: H04L12/745 ,  H04L29/12 ,  H04L12/743

    CPC classification number: H04L45/748 ,  H04L45/7457

    Abstract: In one embodiment, a method includes receiving a request to add a prefix to memory for a route lookup at a forwarding device, the memory comprising a plurality of pivot tiles for storing pivot entries, each of the pivot entries comprising a plurality of prefixes and a pointer to a trie index, searching at the forwarding device, a dynamic pool of the pivot tiles based on a base-width associated with the prefix, allocating at least a portion of the pivot tile to the base-width and creating a pivot entry for the prefix and other prefixes with a corresponding base-width, and dynamically updating prefixes stored on the pivot tiles based on route changes to optimize storage of prefixes on the pivot tiles. An apparatus and logic are also disclosed herein.

Patent Agency Ranking