公开(公告)号：US20210306249A1

公开(公告)日：2021-09-30

申请号：US16835970

申请日：2020-03-31

Applicant: Juniper Networks, Inc.

Inventor： Vasudevan Navaneetha Krishnan ,  Raveendra Torvi ,  Srikanth Venakta Gandiboyina ,  Ashish Kumar ,  Srihari Ramachandra Sangli ,  Jimmy Jose ,  Amit Arora ,  Harmeet Singh

IPC: H04L12/755

Abstract: In general, this disclosure describes a network device that checks consistency between routing objects in a routing information base (RIB), a forwarding information base (FIB), and packet forwarding engine (PFE) forwarding tables. A method includes generating a marker that causes a routing protocol daemon, a control plane kernel, and PFEs of a network device to calculate zonal checksums for a plurality of zones using consistency values for each routing object within a RIB, a FIB, and corresponding forwarding tables respectively. The method includes performing a consistency check on the RIB, the FIB, and the forwarding tables to determine whether the routing objects in each of the RIB, the FIB, and the forwarding tables are consistent with each other. The method includes, when the RIB, the FIB, and the forwarding tables are not consistent, performing an action related to at least one of RIB, the FIB, or the forwarding tables.

公开(公告)号：US20210258249A1

公开(公告)日：2021-08-19

申请号：US16794190

申请日：2020-02-18

Applicant: Juniper Networks, Inc.

Inventor： Raveendra Torvi ,  Tarek Saad ,  Jonathan C Barth ,  John E. Drake ,  Vishnu Pavan Beeram

IPC: H04L12/721 ,  H04L12/715

Abstract: Support is provided for flexible algorithms, used by the border gateway protocol (BGP) route selection process, in the context of segment routing (SR) Prefix segment identifiers (SIDS) advertised using BGP.

公开(公告)号：US20210029021A1

公开(公告)日：2021-01-28

申请号：US16589115

申请日：2019-09-30

Applicant: Juniper Networks, Inc.

Inventor： Raveendra Torvi ,  Sudharsana Venkataraman ,  Tarek Saad ,  Vishnu Pavan Beeram

IPC: H04L12/729 ,  H04L12/707 ,  H04L12/751 ,  G06F16/23

Abstract: At least one bandwidth-guaranteed segment routing (SR) path through a network is determined by: (a) receiving, as input, a bandwidth demand value; (b) obtaining network information; (c) determining a constrained shortest multipath (CSGi); (d) determining a set of SR segment-list(s) (Si=[sl1i, sl2i . . . slni]) a that are needed to steer traffic over CSGi; and (e) tuning the loadshares in Li, using Si and the per segment-list loadshare (Li=[l1i, l2i . . . lni]), the per segment equal cost multipath (“ECMP”), and the per link residual capacity, such that the bandwidth capacity that can be carried over CSGi is maximized.

公开(公告)号：US10680941B2

公开(公告)日：2020-06-09

申请号：US16007847

申请日：2018-06-13

Applicant: Juniper Networks, Inc.

Inventor： Vishnu Pavan Beeram ,  Raveendra Torvi ,  Harish Sitaraman ,  Chandrasekar Ramachandran

IPC: H04L12/723

Abstract: In general, techniques described are for providing graceful restart procedures for network devices of label switched paths (LSPs) implemented with label stacks. For example, a restarting network device may include a processor coupled to a memory that executes software configured to: receive a path signaling message including a recovery object that defines a reverse path of the LSP from an egress network device of the LSP to the restarting network device, including at least an upstream label and a downstream label associated with the restarting network device; determine, based on the recovery object, the upstream label and the downstream label associated with the restarting network device; and instantiate a control plane state of the restarting network device based on the recovery object.

公开(公告)号：US10476811B2

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

申请号：US15688813

申请日：2017-08-28

Applicant: Juniper Networks, Inc.

Inventor： Harish Sitaraman ,  Raveendra Torvi ,  Vishnu Pavan Beeram ,  Chandrasekar Ramachandran

IPC: H04L12/911 ,  H04L12/703 ,  H04L12/707 ,  H04L12/723 ,  H04L12/913

Abstract: The disclosed computer-implemented method may include (1) receiving, at a network node within a network, a packet from another network node within the network, (2) identifying, within the packet, a label stack that includes a plurality of labels that collectively represent at least a portion of a label-switched path within the network, (3) popping, from the label stack, a label that corresponds to a next hop of the network node, (4) determining, based at least in part on the label, that the next hop has experienced a failure that prevents the packet from reaching a destination via the next hop, (5) identifying a backup path that merges with the label-switched path at a next-to-next hop included in the label-switched path, and then (6) forwarding the packet to the next-to-next hop via the backup path. Various other methods, systems, and apparatuses are also disclosed.

公开(公告)号：US10382341B2

公开(公告)日：2019-08-13

申请号：US14713068

申请日：2015-05-15

Applicant: Juniper Networks, Inc.

Inventor： Sudharsana Venkataraman ,  Raveendra Torvi ,  Chandrasekar Ramachandran ,  Yakov Rekhter

IPC: H04W28/02 ,  H04L12/755 ,  H04W24/08 ,  H04L12/851 ,  H04L12/729 ,  H04L12/911 ,  H04L12/927 ,  H04L12/723

Abstract: Techniques are described for establishing lower priority LSPs on paths determined to be less likely to include bandwidth constrained links. In one example, a router includes a plurality of physical interfaces each having at least one link interconnecting the router as one of a plurality of routers in a network and a processor. The processor is configured to determine whether a link of one of the plurality of physical interfaces is congested based at least in part on an amount of available bandwidth on the link, and, responsive to determining that the link is congested, set a bandwidth subscription for the link, wherein the bandwidth subscription specifies that the amount of available bandwidth on the link for label switched paths having a lower priority is less than the amount of available bandwidth on the link for label switched paths having a higher priority.

公开(公告)号：US10291531B2

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

申请号：US15199159

申请日：2016-06-30

Applicant: Juniper Networks, Inc.

Inventor： Raveendra Torvi ,  Harish Sitaraman ,  Vishnu Pavan Beeram ,  Shraddha Hegde ,  Chandrasekar Ramachandran ,  Sudharsana Venkataraman

IPC: H04L12/803 ,  H04L12/24 ,  H04L12/26 ,  H04L12/723 ,  H04L12/801 ,  H04L12/911

Abstract: In general, techniques described are for bandwidth sharing between resource reservation protocol label switched paths (LSPs) and non-resource reservation protocol LSPs. For example, in networks where resource reservation protocol LSPs and non-resource reservation protocol LSPs co-exist within the same domain, resource reservation protocol LSPs and non-resource reservation protocol LSPs may share link bandwidth. However, when non-resource reservation protocol LSPs are provisioned, resource reservation protocol path computation elements computing resource reservation protocol paths may not account for non-resource reservation protocol LSP bandwidth utilization. The techniques described herein provide a mechanism for automatically updating traffic engineering database (TED) information about resource reservation protocol LSPs in a way that accounts for non-resource reservation protocol LSP traffic flow statistics, such as bandwidth utilization. Path computation elements may thus rely on an accurate TED for LSP path computation.

公开(公告)号：US10110479B1

公开(公告)日：2018-10-23

申请号：US14868703

申请日：2015-09-29

Applicant: Juniper Networks, Inc.

Inventor： Chandrasekar Ramachandran ,  Raveendra Torvi ,  Vishnu Pavan Beeram ,  Sudharsana Venkataraman

IPC: H04L12/723 ,  H04L12/24 ,  H04L12/733 ,  H04L12/775

Abstract: A network device receives configuration information defining one or more abstract hops for which membership is defined as those network devices that satisfy a logical combination of one or more constituent attributes. The network device determines based on network topology information, for each of the defined abstract hops, a set of network devices that qualify for membership in the abstract hop. The network device receives a request to establish a label switched path (LSP) from an ingress network device to an egress network device, wherein the request specifies, as a constraint for the LSP, a plurality of hops in a defined order, including the one or more abstract hops. The network device selects a path from the ingress network device to the specified egress network device based on the ordered abstract hop constraint, and establishes the LSP along the selected path according to the defined order of the request.

公开(公告)号：US10097446B2

公开(公告)日：2018-10-09

申请号：US15018550

申请日：2016-02-08

Applicant: Juniper Networks, Inc.

Inventor： Raveendra Torvi

IPC: H04L12/28 ,  H04L12/715 ,  H04L12/751 ,  H04L12/24 ,  H04L12/721

Abstract: In general, techniques are described for dynamically filtering, at area border routers (ABRs) of a multi-area autonomous system, routes to destinations external to an area by advertising to routers of the area only those routes associated with a destination address requested by at least one router of the area. In one example, a method includes receiving, by an ABR that borders a backbone area and a non-backbone area of a multi-area autonomous system that employs a hierarchical link state routing protocol to administratively group routers of the autonomous system into areas, a request message from the non-backbone area that requests the ABR to provide routing information associated with a service endpoint identifier (SEI) to the non-backbone area. The request message specifies the SEI. The method also includes sending, in response to receiving the request and by the ABR, the routing information associated with the SEI to the non-backbone area.

公开(公告)号：US10069724B1

公开(公告)日：2018-09-04

申请号：US15151493

申请日：2016-05-11

Applicant: Juniper Networks, Inc.

Inventor： Raveendra Torvi ,  Ravi I Singh ,  Harish Sitaraman ,  Yakov Rekhter

IPC: G01R31/00 ,  H04L12/723 ,  H04L12/26 ,  H04L29/12

Abstract: The disclosed computer-implemented method for verifying the functionality of network paths may include (1) constructing, at a source node within a network, a test packet that uniquely identifies a network path whose functionality is unverified, (2) sending the test packet to a target node within the network via the network path in an attempt to verify the functionality of the network path, (3) receiving, back from the target node, the test packet sent to the target node via the network path, and then (4) verifying, at the source node, the functionality of the network path based at least in part on the test packet received back from the target node. Various other methods, systems, and computer-readable media are also disclosed.