Abstract: A method implemented by a BFR in a BIER-TE domain. The method includes receiving a packet with a BIER-TE header, where the BIER-TE header includes an indicator indicating a number of the bitstrings in the BIER-TE header, and a set identifier for each of the bitstrings; checking whether a bitstring identified by the set identifier in the BIER-TE header and a bitstring identified by the set identifier in a top level BIFT each contain an adjacency bit position of the BFR with a same value; and processing the packet using a second level BIFT that a pointer for the set identifier in the top level BIFT points to when the two bitstrings each contain the adjacency bit position of the BFR with the same value.

Abstract: A network node including a processor coupled to a memory. The processor is configured to receive instructions from the memory which, when executed by the processor, cause the network node to receive a path computation request, calculate a first path from a first ingress node to an egress node, calculate a second path from a second ingress node to a destination node, transmit a first message comprising the first path to the first ingress node, and transmit a second message comprising the second path to the second ingress node.

Abstract: A method implemented by a network node in a Bit Index Explicit Replication Traffic/Tree Engineering (BIER-TE) domain is used to avoid duplicate packets. The method includes generating an improved bit index forwarding table (BIFT) containing a forwarding entry for a local area network (LAN)-connected adjacency from the network node to a pseudo node; and a secondary BIFT including a forwarding entry for a forward connected adjacency from the pseudo node to each of the pseudo node's next hop nodes except the network node; sending a packet containing a point to multipoint (P2MP) path with a bit position for the LAN-connected adjacency to the pseudo node according to the forwarding entry for the LAN-connected adjacency in the improved BIFT; and sending the packet to each of the pseudo node's next hop nodes on the P2MP path based on the secondary BIFT.

Abstract: The disclosure relates to path computation and setup of one or more nodes in a network. Connectivity information is received at a local node of the nodes in the network, and a processor of the local node computes a flooding topology based on the received connectivity information, where the flooding topology is represented by links between nodes in the network. The links are encoded between the local node and remote nodes and between remote nodes on the flooding topology, and a link state message is flooded to the remote nodes from the local node in the network, where the link state message includes each of the encoded links in the flooding topology.

Abstract: Disclosed herein are various embodiments for constructing an abstract domain topology. In one embodiment, a Path Computation Element (PCE) is configured as a parent PCE to at least one child PCE. Each of the child PCEs is responsible for providing path computational services for a domain. Communication is established between the parent PCE and the at least one child PCE. The parent PCE receives from each of its child PCEs domain connection information corresponding to the domain of each child PCE. The parent PCE builds and maintains an abstract domain topology based on the domain connection information that it receives from its child PCEs. In one embodiment, the domain connection information is communicated from the child PCE to the parent PCE by adding a new notification-type (NT) and notification-value (NV) to a notification object in a Path Computation Element Communication Protocol (PCEP) notification message.

Abstract: A method implemented by a path computation element (PCE) configured to control a Bit Index Explicit Replication Traffic/Tree Engineering (BIER-TE) domain. The method includes sending a first path computation element protocol (PCEP) message to a network node in the BIER-TE domain. The first PCEP message includes a first path setup type capability type length value (TLV). The method further includes receiving a second PCEP message from the network node. The second PCEP message includes a second path setup type capability TLV comprising an ingress protection capability sub-TLV. The ingress protection capability sub-TLV contains a first flag. The first flag is set to a first binary value to indicate that the network node is able to detect a failure of an adjacent network node.

Abstract: A network node including a memory and a processor coupled to the memory. The processor configured to receive instructions from the memory which, when executed by the processor, cause the network node to receive a path computation request; calculate a first path from a first ingress node to an egress node; calculate a second path from a second ingress node to the egress node; transmit a first message using border gateway protocol (BGP), the first message comprising the first path to the first ingress node; and transmit a second message using BGP, the second message comprising the second path and an ingress protection indicator to the second ingress node.

Abstract: A method performed by a network controller for providing network reliability. The method includes employing an Interior Gateway Protocol (IGP) proxy configured to communicate controller information about the network controller to the one or more network elements using IGP (Link-State Advertisement (LSA) or Link State Protocol Data Unit (LSP)) with a Controllers TLV. The method uses the controller information for proper election of a primary controller in the event of a network failure.

Abstract: According to one aspect of the present disclosure, a system includes an active network element having circuitry for executing a primary application and a transmission control protocol (TCP) module, multiple standby network elements having circuitry for executing a secondary copy of the primary application and a secondary TCP module, and a network connection coupled to one or more of the active and standby network elements, wherein the active network element and standby network elements are coupled to transfer data and acknowledgments via their respective TCP modules, and wherein the standby network elements are reconfigurable to communicate via the network connection to a peer regardless of the failure of one or two of the network elements.

Abstract: Methods of computing a flooding topology (FT) for a network are presented. The methods include a process for computing a FT that includes all nodes in the network and a process for ensuring that all nodes in the FT have at least two links in the FT. Some of the methods minimize a number of links of the nodes in the FT. Some of the methods also constrain some of the nodes in the FT to a maximum number of links. Some of the methods compute a first FT for nodes whose maximum number of links in the FT equal their number of links in the network, then compute a second FT for remaining nodes in the network, then combines the two FTs to compute a complete FT for the network.

Abstract: The disclosure relates to recovering from a failure in a network. A flooding topology, represented by links between nodes in the network, is computed. Alternative connections for the links and the nodes on the flooding topology are also computed. A change in the flooding topology is detected, where the change indicates the failure in the network and results in a split of the flooding topology. A link state message is flooded to each of the nodes in a remaining part of the flooding topology and to the alternative connections, such that the link state message identifies the failure in the network. The failure in the network is resolved by connecting the split flooding topology using the remaining part of the flooding topology and the alternative connections as identified in the link state message.

Abstract: A network node (N1) for handling IGP flooding topology (FT) inconsistency by obtaining a new FT and setting a FT flag field (FT field) in a data packet (DP) to indicate whether a link between N1 and a second node (N2) is on the new FT. N1 transmits the DP to N2. N1 receives a second DP from N2 that includes the FT field set by N2 to indicate whether the link between the network node and N2 is on the new FT as determined by N2. N1 sets a FT inconsistency field in a link state packet to indicate an inconsistency in the new FT when the FT field set by N2 and the FT field set by N1 are different for a given time. N1 distributes the LS to at least one node in the network.

Abstract: A method implemented by a network node in a Bit Index Explicit Replication Traffic Engineering (BIER-TE) domain. The method includes encoding a bit position configured on a link in a bit position field of a BIER-TE sub-type length value (sub-TLV), and distributing the BIER-TE sub-TLV in the BIER-TE domain. The BIER-TE sub-TLV is compatible with OSPFv2, OSPFv3, and IS-IS protocols.

Abstract: A method for encoding messages of a flooding topology and backup paths of the flooding topology. The method includes monitoring a status of a network, and detecting at least one network failure. The network failure is one of a link failure, a node failure, or both. A backup path for each of the links and nodes on a flooding topology is computed. The backup paths for a link are encoded in a link backup path (LBP) data structure. The LBP data structure for the link is encoded in a LBP type-length-value (TLV). The encoded LBP-TLV comprising the encoded LBP data structure for the link is encoded in a backup paths opaque link state advertisement (LSA). The flooding topology is flooded with the backup paths opaque LSA.

Abstract: A method is implemented by a first PCE controlling a BIER-TE domain. The method comprises receiving a first path computation element protocol (PCEP) message from a path computation component (PCC) running on each egress network node, where the first PCEP message contains a multicast group and a multicast source; obtaining an ingress node based on the multicast group and the multicast source; computing a BIER-TE path from the ingress node to each egress network node; sending a second PCEP message to the ingress node for the ingress node to create the BIER-TE path to transport packets for the multicast group and the multicast source; and receiving a third PCEP message from a PCC running on the ingress node, where the third PCEP message includes a status of the BIER-TE path.

Abstract: A method for extending Border Gateway Protocol (BGP) to change multiple route attributes at a time. The method includes receiving a BGP wide community container that includes an indication that multiple route attributes can be changed at a time, a one or more route conditions, and actions to perform on the multiple route attributes when the one or more route conditions are met. The method determines whether the route conditions are satisfied. The method performs the actions specified in the BGP wide community container on the multiple route attributes when the one or more route conditions are satisfied.

Abstract: A method implemented by a network node in a Bit Index Explicit Replication Traffic/Tree Engineering (BIER-TE) domain is used to avoid duplicate packets. The method includes generating an improved bit index forwarding table (BIFT) containing a forwarding entry for a local area network (LAN)-connected adjacency from the network node to a pseudo node; and a secondary BIFT including a forwarding entry for a forward connected adjacency from the pseudo node to each of the pseudo node's next hop nodes except the network node; sending a packet containing a point to multipoint (P2MP) path with a bit position for the LAN-connected adjacency to the pseudo node according to the forwarding entry for the LAN-connected adjacency in the improved BIFT; and sending the packet to each of the pseudo node's next hop nodes on the P2MP path based on the secondary BIFT.

Abstract: A method implemented by a network node in a Bit Index Explicit Replication Traffic Engineering (BIER-TE) domain is used to provide fast egress protection. The method includes receiving a type length value (TLV) structure that includes a bit position of a backup egress node for a primary egress node, generating an egress protection bit index forwarding table (EP-BIFT) including the backup path to the backup egress node based on the bit position of the backup egress node when the network node neighbors the primary egress node, and forwarding a packet in accordance with the EP-BIFT when the primary egress node has failed.

Abstract: A method and apparatus for optimizing network delivery of fifth generation (5G) edge application services by weighting network latency along with a load, capacity, and preference of an application server to determine where to transmit a new flow of packets. By using the weighted approach, network traffic can be equalized among multiple instances (e.g., applications) with the same address.

Abstract: A method implemented by a network node in a Bit Index Explicit Replication Traffic Engineering (BIER-TE) domain is disclosed. The method includes generating a fast reroute bit index forwarding table (FRR-BIFT) containing a backup path having one or more bit positions from the network node to each next hop of a neighbor node of the network node, and sending a packet to the next hop of the neighbor node in accordance with the one or more bit positions in the backup path of the FRR-BIFT when the neighbor node has failed.