SIMPLE HIERARCHICAL LABEL-SWITCHED PATHS
    61.
    发明申请

    公开(公告)号:US20180083870A1

    公开(公告)日:2018-03-22

    申请号:US15827060

    申请日:2017-11-30

    Abstract: A device may identify a portion of a label-switched path (LSP) on which a simple hierarchical LSP (sH-LSP) is to be used for transferring traffic via a network. The device may determine attribute information associated with the sH-LSP. The attribute information may include information associated with one or more characteristics of the sH-LSP. The device may provide an indication associated with identifying an available sH-LSP or creating a sH-LSP. The indication may include, the attribute information associated with the sH-LSP, and may be being provided to cause the sH-LSP to be created on the portion of the LSP or an available sH-LSP, associated with the portion of the LSP, to be identified. The device may receive, based on providing the indication, an identifier associated with the sH-LSP. The device may cause the LSP to be set up based on the identifier associated with the sH-LSP.

    RSVP make-before-break label reuse
    62.
    发明授权

    公开(公告)号:US09843508B2

    公开(公告)日:2017-12-12

    申请号:US14682799

    申请日:2015-04-09

    CPC classification number: H04L45/507 H04L45/128 H04L45/50

    Abstract: Techniques are described for reusing downstream-assigned labels when establishing a new instance of a label switched path (LSP) prior to tearing down an existing instance of the LSP using make-before-break (MBB) procedures for RSVP. The techniques enable a routing engine of any non-ingress router along a path of the new LSP instance to reuse a previously allocated label for the existing LSP instance as the downstream assigned label for the new LSP instance when the paths of the existing LSP instance and the new LSP instance overlap. In this way, the non-ingress router does not need to update a label route in its forwarding plane for the reused label. When the new LSP instance completely overlaps the existing LSP instance, an ingress router of the LSP may avoid updating an ingress route in its forwarding plane for applications that use the LSP.

    Distributed tactical traffic engineering (TE) using loop free alternative (LFA), remote-LFA (R-LFA) and/or topology independent-LFA (TI-LFA) secondary paths

    公开(公告)号:US11451478B1

    公开(公告)日:2022-09-20

    申请号:US16692842

    申请日:2019-11-22

    Abstract: A tactical solution to network congestion is provided by a data forwarding device having (1) a first interface with a first link to a downstream data forwarding device and (2) second interface with a second link to a downstream data forwarding device, and executing a method comprising: (a) configuring the second interface as part of a loop-free alternate (LFA) path to a destination device, wherein the first interface is part of a shortest/preferred path to the destination device; (b) monitoring congestion at the first interface to determine whether or not the congestion exceeds a first threshold; and (c) responsive to a determination that the congestion exceeds the first threshold, forwarding at least some data addressed to the destination device, over the LFA path via the second interface instead of over the shortest/preferred path via the first interface, thereby alleviating congestion at the first interface, and otherwise, responsive to a determination that the congestion does not exceed the first threshold, not forwarding at least some data addressed to the destination device, over the LFA path via the second interface instead of over the shortest/preferred path via the first interface.

    FILTERING TOPOLOGIES FOR PATH COMPUTATION IN MASSIVELY SCALED NETWORKS

    公开(公告)号:US20220158931A1

    公开(公告)日:2022-05-19

    申请号:US17645225

    申请日:2021-12-20

    Abstract: An example network element includes one or more interfaces and a control unit, the control unit includes one or more processors configured to determine an egress network domain identifier (ID) and determine an abstracted interdomain network topology. The one or more processors are also configured to determine one or more interdomain paths from an abstracted ingress domain node to an abstracted egress domain node and determine whether an abstracted domain node is on the one or more interdomain paths. The one or more processors are configured to, based on the abstracted domain node being on the one or more interdomain paths, include one or more resources within a network domain in a filtered traffic engineering database (TED) and compute a path from an ingress node within the ingress network domain to an egress node within the egress network domain based on the filtered TED.

    Class-based traffic engineering in an IP network

    公开(公告)号:US11240142B2

    公开(公告)日:2022-02-01

    申请号:US16587547

    申请日:2019-09-30

    Abstract: Techniques are described for class-based traffic engineering in an IP network. For example, routers of an IP network may establish one or more constrained traffic engineered paths using a link-state protocol (e.g., IGP) without using signaling protocols, such as RSVP or SPRING, or encapsulating packets over MPLS. For example, an egress router of the IP network may receive a capability message specifying the capability of routers to compute a constrained path to the egress router, wherein the capability message comprises path computation information including an identifier of a path computation algorithm to be used by the one or more of the plurality of network devices to reach the egress network device. The egress router may advertise a reachability message including a destination IP prefix and the identifier of the path computation algorithm to cause routers in the IP network to compute the constrained path to reach the egress router.

Patent Agency Ranking