Abstract:
In some implementations, a head Level 2 (L2) node of an intermediate system-intermediate system (IS-IS) flood reflection (FR) network may determine an end-to-end path from the head L2 node to a tail L2 node of the IS-IS FR network. The IS-IS FR network includes a plurality of L2 nodes and a plurality of FR clusters that each comprise a plurality of Level 1 (L1) nodes and a plurality of L1 and L2 (L1/L2) nodes connected by a plurality of L1 links. The head L2 node may send information associated with the end-to-end path to another node identified in the end-to-end path to cause a label switched path (LSP) to be established from the head L2 node to the tail L2 node, wherein the LSP traverses one or more L1 links within an FR cluster of the IS-IS FR network.
Abstract:
A network device may receive a border gateway protocol (BGP) flow specification route associated with creation of an overlay network slice in a network, and may create a new routing instance based on the BGP flow specification route. The network device may associate interfaces defined by the BGP flow specification route with virtual private network (VPN) members, and may determine VPN parameters based on the BGP flow specification route. The network device may advertise the VPN parameters within the network to cause the network to generate the overlay network slice.
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.
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 an LSP within the network, (3) popping, from the label stack, a label that corresponds to a specific link to a further network node, and then upon popping the label from the label stack, (4) forwarding the packet to the further network node by way of the specific link. Various other methods, systems, and apparatuses are also disclosed.
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 an LSP within the network, (3) popping, from the label stack, a label that corresponds to a specific link to a further network node, and then upon popping the label from the label stack, (4) forwarding the packet to the further network node by way of the specific link. Various other methods, systems, and apparatuses are also disclosed.
Abstract:
An apparatus may include a processor and a control plane that directs the processor to (1) detect that at least a portion of an initial branch path of a point-to-multipoint label-switched path has failed over to a failover route that rejoins the initial branch path at a network node and (2) establish an alternate branch path that merges with the initial branch path at the network node. The apparatus may also include a network interface and a data plane that uses the network interface to transmit data via the alternate branch path, where after the data plane begins transmitting data via the alternate branch path, the control plane instructs the network node to forward data from the alternate branch path rather than from the failover route. Various other apparatuses, systems, and methods are also disclosed.
Abstract:
An apparatus may include a processor and a control plane that directs the processor to (1) detect that at least a portion of an initial branch path of a point-to-multipoint label-switched path has failed over to a failover route that rejoins the initial branch path at a merge-point device and (2) establish an alternate branch path that merges with the initial branch path at the merge-point device. The apparatus may also include a network interface and a data plane that uses the network interface to transmit data via the alternate branch path while data is still being transmitted via the initial branch path, where after the data plane begins transmitting data via the alternate branch path, the control plane instructs the merge-point device to forward data from the alternate branch path rather than from the failover route. Various other apparatuses, systems, and methods are also disclosed.
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.
Abstract:
A ring node N belonging to a resilient MPLS ring (RMR) provisions and/or configures clockwise (CW) and anti-clockwise (AC) paths on the RMR by: (a) configuring two ring node segment identifiers (Ring-SIDs) on the ring node, wherein a first of the two Ring-SIDs (CW-Ring-SID) is to reach N in a clockwise direction on the ring and a second of the two Ring-SIDs (AC-Ring-SID) is to reach N in an anti-clockwise direction on the ring, and wherein the CW-Ring-SID and AC-Ring-SID are unique within a source packet routing in networking (SPRING) domain including the ring; (b) generating a message including the ring node's CW-Ring-SID and AC-Ring-SID; and (c) advertising the message, via an interior gateway protocol, for receipt by other ring nodes belonging to the ring such that (1) a clockwise multipoint-to-point path (CWP) is defined such that every other one of the ring nodes belonging to the ring can be an ingress for the CWP and such that only the node is an egress for the CWP, and (2) an anti-clockwise multipoint-to-point path (ACP) is defined such that every other one of the ring nodes belonging to the ring can be an ingress for the ACP and such that only the node is an egress for the ACP.
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.