公开(公告)号：US20220400048A1

公开(公告)日：2022-12-15

申请号：US17342899

申请日：2021-06-09

Applicant: Cisco Technology, Inc.

Inventor： Peter Psenak ,  Lester C. Ginsberg ,  Ketan Jivan Talaulikar ,  Clarence Filsfils ,  Francois Clad ,  Stephane Litkowski

IPC: H04L12/24

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.

公开(公告)号：US20220263747A1

公开(公告)日：2022-08-18

申请号：US17731610

申请日：2022-04-28

Applicant: Cisco Technology, Inc.

Inventor： Peter Psenak ,  Robert Hanzl ,  Clarence Filsfils ,  Ketan Jivan Talaulikar

IPC: H04L45/12 ,  H04L45/02

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.

公开(公告)号：US11323356B2

公开(公告)日：2022-05-03

申请号：US16943541

申请日：2020-07-30

Applicant: Cisco Technology, Inc.

Inventor： Peter Psenak ,  Robert Hanzl ,  Clarence Filsfils ,  Ketan Jivan Talaulikar

IPC: H04L1/00 ,  H04L45/12 ,  H04L45/02

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.

公开(公告)号：US20200322254A1

公开(公告)日：2020-10-08

申请号：US16598852

申请日：2019-10-10

Applicant: Cisco Technology, Inc.

Inventor： Peter Psenak ,  Paul William Wells ,  Ketan Jivan Talaulikar ,  Clarence Filsfils

IPC: H04L12/721 ,  H04L29/06

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.

公开(公告)号：US20200322150A1

公开(公告)日：2020-10-08

申请号：US16600856

申请日：2019-10-14

Applicant: Cisco Technology, Inc.

Inventor： Peter Psenak ,  Paul Wells ,  Ketan Jivan Talaulikar ,  Clarence Filsfils

IPC: H04L9/32 ,  H04L12/751

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.

公开(公告)号：US10469372B2

公开(公告)日：2019-11-05

申请号：US15865570

申请日：2018-01-09

Applicant: Cisco Technology, Inc.

Inventor： Clarence Filsfils ,  Stefano Benedetto Previdi ,  Peter Psenak ,  Ketan Jivan Talaulikar

IPC: H04L12/723 ,  H04L12/721 ,  H04L12/729 ,  H04L12/707 ,  H04L12/741 ,  H04L12/703

Abstract: A method is performed at a source node in a network of nodes configured with a link state protocol, and in which at least some of the nodes are enabled for multiprotocol label switching (MPLS). The node discovers and stores a link state topology representing the nodes of the network, links between the nodes, path-costs for the links, and whether each link is enabled or not enabled for MPLS. The node determines one or more shortest paths from the source node to a destination node among the nodes based on traversing the link state topology and, while the node traverses the link state topology, detects whether each shortest path supports or does not support MPLS end-to-end dataplane continuity. The node programs an IP dataplane with each shortest path, and programs an MPLS dataplane with ones of the one or more shortest paths that support the end-to-end MPLS continuity.

公开(公告)号：US20190215266A1

公开(公告)日：2019-07-11

申请号：US15865570

申请日：2018-01-09

Applicant: Cisco Technology, Inc.

Inventor： Clarence Filsfils ,  Stefano Benedetto Previdi ,  Peter Psenak ,  Ketan Jivan Talaulikar

IPC: H04L12/723 ,  H04L12/707 ,  H04L12/741 ,  H04L12/729 ,  H04L12/703

Abstract: A method is performed at a source node in a network of nodes configured with a link state protocol, and in which at least some of the nodes are enabled for multiprotocol label switching (MPLS). The node discovers and stores a link state topology representing the nodes of the network, links between the nodes, path-costs for the links, and whether each link is enabled or not enabled for MPLS. The node determines one or more shortest paths from the source node to a destination node among the nodes based on traversing the link state topology and, while the node traverses the link state topology, detects whether each shortest path supports or does not support MPLS end-to-end dataplane continuity. The node programs an IP dataplane with each shortest path, and programs an MPLS dataplane with ones of the one or more shortest paths that support the end-to-end MPLS continuity.

公开(公告)号：US10263881B2

公开(公告)日：2019-04-16

申请号：US15165794

申请日：2016-05-26

Applicant: Cisco Technology, Inc.

Inventor： Peter Psenak ,  Robert Hanzl ,  Clarence Filsfils ,  Ketan Jivan Talaulikar

IPC: H04L12/26 ,  H04L12/721 ,  H04L12/751

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.

公开(公告)号：US20190097841A1

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

申请号：US16202764

申请日：2018-11-28

Applicant: CISCO TECHNOLOGY, INC.

Inventor： Alfred C. Lindem, III ,  Peter Psenak ,  Ijsbrand Wijnands

IPC: H04L12/46 ,  H04L12/751 ,  H04L12/721

Abstract: Various systems and methods for bypassing one or more non-capable nodes. For example, one method involves a capable node determining that an adjacent node is non-capable, where capable nodes are configured to implement a data plane capability and non-capable nodes are not. The method then involves identifying a downstream node that is capable. The downstream node is on a shortest path. The method also involves generating information that identifies a tunnel to the downstream node.

公开(公告)号：US20190007305A1

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

申请号：US15986174

申请日：2018-05-22

Applicant: Cisco Technology, Inc.

Inventor： Clarence Filsfils ,  Peter Psenak ,  Francois Clad ,  Jose Antonio Liste

IPC: H04L12/725 ,  H04L12/24

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.