-
公开(公告)号：US10826831B2
公开(公告)日：2020-11-03
申请号：US15992413
申请日：2018-05-30
Applicant: Cisco Technology, Inc.
Inventor： Mankamana Mishra , Jayashree Subramanian , Stig Venaas , Nitin Kumar
IPC: H04L12/803 , H04L12/761
Abstract: A method including receiving, at a first router of a plurality of routers, a first message from the plurality of routers. The first message includes a designated router priority and a weight for each respective router. Based on the designated router priorities, a designated router is elected and a one or more eligible group designated routers are determined. The method determines whether the first router is the designated router or the at least one eligible group designated router. If the first router is the designated router, the first router provides a second message to the remaining routers indicating the eligible group designated routers and their weights.
-
公开(公告)号：US12149440B2
公开(公告)日：2024-11-19
申请号：US18183730
申请日：2023-03-14
Applicant: Cisco Technology, Inc.
Inventor： Mankamana Prasad Mishra , Ali Sajassi , Nitin Kumar
Abstract: A system and associated methods provide a scalable solution for managing multiple multicast flows within a multicast group of a multicast network. The system groups redundant sources of the multicast group according to their associated multicast flows, assigns flow identifiers to each redundant source indicative of their associated multicast flows, and facilitates Single Forwarder election to select a Single Forwarder that belongs to the appropriate multicast flow. The system provides control plane extensions that enable signaling of which redundant source belongs to which multicast flow.
-
公开(公告)号：US12074757B2
公开(公告)日：2024-08-27
申请号：US17820050
申请日：2022-08-16
Applicant: Cisco Technology, Inc.
Inventor： Mankamana P. Mishra , Karthik Babu Harichandra Babu , Nitin Kumar , Manoj K. Pandey
IPC: H04L41/0659 , H04L41/0677 , H04L41/12 , H04L43/0811 , H04L43/10
CPC classification number: H04L41/0677 , H04L41/0659 , H04L41/12 , H04L43/0811 , H04L43/10
Abstract: Techniques for connectivity issue remediation are provided. A first link trace message is transmitted from a source end point to a destination end point. A first topology graph for a network is generated based on the first link trace message, and a presence of a connectivity issue in the network is detected. A second link trace message is transmitted from the source end point to the destination end point. A second topology graph for the network is automatically generated based on second link trace message, and a component in the network that caused the connectivity issue is identified based on comparing the first and second topology graphs.
-
14.发明公开公开(公告)号：US20240195678A1
公开(公告)日：2024-06-13
申请号：US18065221
申请日：2022-12-13
Applicant: Cisco Technology, Inc.
Inventor： Mankamana Prasad Mishra , Nitin Kumar , Frank Brockners , Carlos M. Pignataro , Rakesh Gandhi
IPC: H04L41/0631 , H04L43/12 , H04L45/16
CPC classification number: H04L41/0645 , H04L43/12 , H04L45/16
Abstract: A method is performed by a network controller that is configured to control routers configured to forward a multicast flow downstream from a first hop router that is a root of a multicast tree formed by the routers to last hop routers that terminate branches of the multicast tree, respectively. The method includes collecting operational configuration information from the routers and constructing a topological view of the multicast tree based on the operational configuration information; causing the routers to forward multicast probes downstream from the first hop router along all of the branches toward the last hop routers to trace the multicast tree; receiving, from particular ones of the last hop routers that received the multicast probes, indications that the multicast probes were received; and detecting failures in the multicast tree based on the indications and the topological view.
-
公开(公告)号：US20220239588A1
公开(公告)日：2022-07-28
申请号：US17160102
申请日：2021-01-27
Applicant: Cisco Technology, Inc.
Inventor： Neeraj Malhotra , Satya Ranjan Mohanty , Dongling Duan , Nitin Kumar , Narasimha Prasad Salagame Nagaraj
IPC: H04L12/707 , H04L12/741 , H04L12/801
Abstract: Techniques and mechanisms for a control plane approach for dense topologies that focusses on discovering shared ECMP groups in the control plane independent of per-prefix learning and then learning prefixes via these shared ECMP groups instead of learning prefixes via one next-hop at a time. In dense topologies, this approach helps minimize BGP path scale, corresponding signaling and enables control plane scaling that is an order of magnitude higher than a traditional eBGP control plane. During link and node topology changes, the described control plane approach enables control plane signaling that is prefix independent and an order of magnitude lower. A control plane approach to path-list sharing and prefix independent signaling on link and node topology changes enables prefix independent convergence (PIC) in scenarios that would not be possible otherwise with traditional FIB driven path-list sharing and PIC.
-
Patent Agency Ranking
公开(公告)号：US08908676B2
公开(公告)日：2014-12-09
申请号：US14051860
申请日：2013-10-11
Applicant: Cisco Technology, Inc.
Inventor： Selma Yilmaz , Keyur Patel , Nitin Kumar , Robert Raszuk , Satish Mynam
IPC: H04L12/28 , H04L12/781 , H04L12/715 , H04L12/751 , H04L12/721
Abstract: In an embodiment, a method comprises receiving a path advertisement comprising information about an available path and a well-known community value associated with the available path. A modified best path calculation is performed in response to receiving the available path either from a higher-ranked device or from a device that is not participating in diverse path calculation, resulting in creating a particular best path. The particular best path is advertised to other routers with or without a restriction indicator based on whether it is a client learned path or non-client iBGP peer learned path and based on whether the advertisement is directed to a client or a non-client iBGP peer.
Abstract translation: 在一个实施例中，一种方法包括接收包括关于可用路径的信息和与可用路径相关联的公知社区值的路径通告。 响应于从更高排名的设备或不参与不同路径计算的设备接收可用路径而执行修改的最佳路径计算，导致创建特定的最佳路径。 根据客户端学习路径还是非客户端iBGP对等体学习路径，并根据广告是指向客户端还是非客户端iBGP对等体，将特定最佳路径通告给具有或不具有限制指示符的其他路由器 。
-
公开(公告)号：US20250016092A1
公开(公告)日：2025-01-09
申请号：US18372443
申请日：2023-09-25
Applicant: Cisco Technology, Inc.
Inventor： Mankamana Prasad Mishra , Lukas Krattiger , Frank Brockners , Nitin Kumar
IPC: H04L45/64 , H04L43/0817 , H04L43/10
Abstract: Techniques for generating and utilizing overlay-based Border Gateway Protocol (BGP) Operations, Administration, and Maintenance (OAM) packets to detect issues with an underlay network. The techniques may include receiving, from a BGP peer device via a control plane path, an OAM probe indicating a forwarding path to be used for sending the traffic to a destination associated with a prefix. The techniques may also include determining, based at least in part on the OAM probe, that a next-hop device is incapable of being utilized to forward the traffic to the destination, the next-hop device determined based on an origination of the prefix. The techniques may further include performing a policy-based action based at least in part on determining that the next-hop device is incapable of being utilized to forward the traffic to the destination.
-
公开(公告)号：US20240348553A1
公开(公告)日：2024-10-17
申请号：US18298552
申请日：2023-04-11
Applicant: Cisco Technology, Inc.
Inventor： Mankamana Prasad Mishra , Nitin Kumar , Ali Sajassi , Swadesh Agrawal
CPC classification number: H04L47/32 , H04L12/185 , H04L12/1863 , H04L45/026 , H04L45/34 , H04L45/50
Abstract: A system and associated methods provide solutions for reducing a volume of traffic through a multicast network attributed to repeated maintenance messages, which are required in order to maintain a multicast connection. The system configures provider edge devices to generate and send maintenance messages on behalf of members of a multicast group to establish and maintain the multicast connection and provides options for determining unknown locations of sources and/or subscribers, thereby reducing the overall volume of traffic transmitted over the multicast network.
-
公开(公告)号：US12003409B2
公开(公告)日：2024-06-04
申请号：US17897890
申请日：2022-08-29
Applicant: Cisco Technology, Inc.
Inventor： Neeraj Malhotra , Satya Ranjan Mohanty , Dongling Duan , Nitin Kumar , Narasimha Prasad Salagame Nagaraj
Abstract: Techniques and mechanisms for a control plane approach for dense topologies that focusses on discovering shared ECMP groups in the control plane independent of per-prefix learning and then learning prefixes via these shared ECMP groups instead of learning prefixes via one next-hop at a time. In dense topologies, this approach helps minimize BGP path scale, corresponding signaling and enables control plane scaling that is an order of magnitude higher than a traditional eBGP control plane. During link and node topology changes, the described control plane approach enables control plane signaling that is prefix independent and an order of magnitude lower. A control plane approach to path-list sharing and prefix independent signaling on link and node topology changes enables prefix independent convergence (PIC) in scenarios that would not be possible otherwise with traditional FIB driven path-list sharing and PIC.
-
公开(公告)号：US20240143470A1
公开(公告)日：2024-05-02
申请号：US17973850
申请日：2022-10-26
Applicant: Cisco Technology, Inc.
Inventor： Mankamana Prasad Mishra , Rajiv Asati , Nitin Kumar
CPC classification number: G06F11/3051 , G06F9/5044 , G06F11/0766 , G06F2209/508
Abstract: In one embodiment, a method herein comprises: determining a set of flows to be monitored within a computer network; determining, by the device, a set of nodes within the computer network through which the set of flows traverse; determining monitoring capabilities for the set of nodes; generating an assignment for each particular node of the set of nodes to monitor a subset of one or more flows of the set of flows based on the monitoring capabilities of each particular node, wherein the assignment for each particular node of the set of nodes ensures that each flow of the set of flows is monitored by at least one or more nodes of the set of nodes; and instructing the set of nodes to monitor the set of flows according to the assignment for each particular node of the set of nodes.
-
-
-
-
-
-
-
-
-
Search Results
32
records
(took 0.02 seconds)
