-
公开(公告)号：US12278754B2
公开(公告)日：2025-04-15
申请号：US18516571
申请日：2023-11-21
Applicant: Cisco Technology, Inc.
Inventor： Manish Gupta , Peter Psenak
IPC: H04L45/12
Abstract: A method includes generating a first shortest path tree for traffic routing in a network, the first shortest path tree identifying a corresponding shortest path from the network node to other nodes in the network and generating a second shortest path tree for traffic routing after removing an element from the network. The second shortest path tree identifies a corresponding shortest path from the network node to the other nodes in the network with the element removed. A third shortest path tree is generated, which is a weighted version of the second shortest path tree with a weight value added to any node or link in the network sharing a SRLG value with the element removed from the network. Network traffic is enforced based on a comparison of the third shortest path tree with at least one of the first shortest path tree and the second shortest path tree.
-
32.发明授权公开(公告)号：US12095651B2
公开(公告)日：2024-09-17
申请号：US17399937
申请日：2021-08-11
Applicant: Cisco Technology, Inc.
Inventor： Peter Psenak , Paul William Wells , Ketan Jivan Talaulikar , Clarence Filsfils
CPC classification number: H04L45/127 , H04L63/205
Abstract: In one embodiment, an apparatus includes one or more processors and one or more computer-readable non-transitory storage media coupled to the one or more processors. The one or more computer-readable non-transitory storage media include instructions that, when executed by the one or more processors, cause the apparatus to perform operations including receiving a first type-length-value (TLV) associated with a winning flexible algorithm definition (FAD) from a first element of a network. The operations also include determining a security level for the winning FAD based on the TLV. The operations further include determining a data transmission route through a plurality of elements of the network based on the security level for the winning FAD.
-
公开(公告)号：US20230396486A1
公开(公告)日：2023-12-07
申请号：US18345246
申请日：2023-06-30
Applicant: Cisco Technology, Inc.
Inventor： Peter Psenak , Lester C. Ginsberg , Ketan Jivan Talaulikar , Clarence Filsfils , Francois Clad , Stephane Litkowski
IPC: H04L41/0654 , H04L41/0631 , H04L41/0686
CPC classification number: H04L41/0654 , H04L41/0631 , H04L41/0686
Abstract: The present technology is directed to signaling unreachability of a network device, more specifically, a prefix of the network device in network that utilizes route summarization. A pulse trigger agent can detect an unreachability of at least one Provider Edge (PE) device in a network domain of a network and determine that a route summarization is being used within the network where the unreachability of the at least one PE device is hidden by the route summarization. A pulse distribution agent can transmit a failure message informing other PE devices of the unreachability of the at least one PE device.
-
公开(公告)号：US11838201B1
公开(公告)日：2023-12-05
申请号：US17384130
申请日：2021-07-23
Applicant: Cisco Technology, Inc.
Inventor： Manish Gupta , Peter Psenak
IPC: H04L45/12
CPC classification number: H04L45/12
Abstract: A method includes generating a first shortest path tree for traffic routing in a network, the first shortest path tree identifying a corresponding shortest path from the network node to other nodes in the network and generating a second shortest path tree for traffic routing after removing an element from the network. The second shortest path tree identifies a corresponding shortest path from the network node to the other nodes in the network with the element removed. A third shortest path tree is generated, which is a weighted version of the second shortest path tree with a weight value added to any node or link in the network sharing a SRLG value with the element removed from the network. Network traffic is enforced based on a comparison of the third shortest path tree with at least one of the first shortest path tree and the second shortest path tree.
-
公开(公告)号：US20230043743A1
公开(公告)日：2023-02-09
申请号：US17969890
申请日：2022-10-20
Applicant: Cisco Technology, Inc.
Inventor： Peter Psenak , Robert Hanzl , Clarence Filsfils , Ketan Jivan Talaulikar
Abstract: Various systems and methods for using strict path forwarding. For example, one method involves receiving an advertisement at a node. The advertisement includes a segment identifier (SID). In response to receiving the advertisement, the node determines whether the SID is a strict SID or not. If the SID is a strict SID, the node generates information, such as forwarding information that indicates how to forward packets along a strict shortest path corresponding to the strict SID.
-
Patent Agency Ranking
公开(公告)号：US20220191134A1
公开(公告)日：2022-06-16
申请号：US17685986
申请日：2022-03-03
Applicant: Cisco Technology, Inc.
Inventor： Clarence Filsfils , Peter Psenak , Francois Clad , Jose Antonio Liste
Abstract: Various implementations disclosed herein enable malleable routing for data packets. For example, in various implementations, a method of routing a type of data packets is performed by a device. In some implementations, the device includes a non-transitory memory and one or more processors coupled with the non-transitory memory. In some implementations, the method includes determining a routing criterion to transmit a set of data packets across a network. In some implementations, the method includes identifying network nodes and communication links in the network that satisfy the routing criterion. In some implementations, the method includes determining a route for the set of data packets through the network nodes and the communication links that satisfy the routing criterion. In some implementations, the method includes configuring the network nodes that are on the route with configuration information that allows the set of data packets to propagate along the route.
-
公开(公告)号：US20220191133A1
公开(公告)日：2022-06-16
申请号：US17685857
申请日：2022-03-03
Applicant: Cisco Technology, Inc.
Inventor： Clarence Filsfils , Peter Psenak , Francois Clad , Jose Antonio Liste
Abstract: Various implementations disclosed herein enable malleable routing for data packets. For example, in various implementations, a method of routing a type of data packets is performed by a device. In some implementations, the device includes a non-transitory memory and one or more processors coupled with the non-transitory memory. In some implementations, the method includes determining a routing criterion to transmit a set of data packets across a network. In some implementations, the method includes identifying network nodes and communication links in the network that satisfy the routing criterion. In some implementations, the method includes determining a route for the set of data packets through the network nodes and the communication links that satisfy the routing criterion. In some implementations, the method includes configuring the network nodes that are on the route with configuration information that allows the set of data packets to propagate along the route.
-
公开(公告)号：US11323416B2
公开(公告)日：2022-05-03
申请号：US16674419
申请日：2019-11-05
Applicant: Cisco Technology, Inc.
Inventor： Peter Psenak , Paul Wells , Ketan Jivan Talaulikar , Clarence Filsfils
Abstract: In one embodiment, a method includes receiving an OSPF hello message including an attestation token from a second network apparatus, determining that the attestation token is valid for the second network apparatus at a current time, establishing an adjacency to the second network apparatus in response to the determination, computing, based at least on the attestation token, a trust level for a first link from the first network apparatus to the second network apparatus and a trust level for first prefixes associated with the first link, and sending an LSA comprising the trust level for the first link and the trust level for the first prefixes to neighboring network apparatuses, where the trust level for the first link and the trust level for the prefixes are used by the network apparatuses in the network to compute a routing table of the network.
-
39.发明授权公开(公告)号：US11277264B2
公开(公告)日：2022-03-15
申请号：US16600856
申请日：2019-10-14
Applicant: Cisco Technology, Inc.
Inventor： Peter Psenak , Paul Wells , Ketan Jivan Talaulikar , Clarence Filsfils
IPC: H04L9/32 , H04L12/751 , H04L45/02
Abstract: In one embodiment, a method includes receiving an ISIS hello message including an attestation token from a second network apparatus, determining that the attestation token is valid for the second network apparatus at a current time, establishing an adjacency to the second network apparatus in response to the determination, computing, based at least on the attestation token, a trust level for a first link from the first network apparatus to the second network apparatus and a trust level for first prefixes associated with the first link, and sending an LSP comprising the trust level for the first link and the trust level for the first prefixes to neighboring network apparatuses, where the trust level for the first link and the trust level for the prefixes are used by the network apparatuses in the network to compute a routing table of the network.
-
公开(公告)号：US20210377162A1
公开(公告)日：2021-12-02
申请号：US17360283
申请日：2021-06-28
Applicant: Cisco Technology, Inc.
Inventor： Clarence Filsfils , Peter Psenak , Francois Clad , Jose Antonio Liste
IPC: H04L12/725 , H04L12/723 , H04L12/24 , H04L12/721 , H04L12/717
Abstract: Various implementations disclosed herein enable malleable routing for data packets. For example, in various implementations, a method of routing a type of data packets is performed by a device. In some implementations, the device includes a non-transitory memory and one or more processors coupled with the non-transitory memory. In some implementations, the method includes determining a routing criterion to transmit a set of data packets across a network. In some implementations, the method includes identifying network nodes and communication links in the network that satisfy the routing criterion. In some implementations, the method includes determining a route for the set of data packets through the network nodes and the communication links that satisfy the routing criterion. In some implementations, the method includes configuring the network nodes that are on the route with configuration information that allows the set of data packets to propagate along the route.
-
-
-
-
-
-
-
-
-
Search Results
62
records
(took 0.039 seconds)
