Abstract: A method for establishing a temporal label switched path (T-LSP) implemented in a node in a network. The method includes receiving a path request including a time interval and a set of constraints; obtaining traffic engineering information from a first database; computing, by the node, a path satisfying the time interval and the set of constraints based on the traffic engineering information obtained; storing the time interval and the set of constraints in a second database; and instructing an ingress node of the temporal LSP to signal the temporal LSP in the network along the path computed at a start of the time interval identified in the path request and to tear down the temporal LSP at an end of the time interval identified in the path request.

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 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 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 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: Disclosed is a mechanism implemented by an ingress node in a network. The mechanism comprises receiving, at a receiver of the ingress node, a packet. A segment list describing a segment routing point-to-multipoint (SR P2MP) path is pushed onto the packet. The packet is transmitted on a downstream interface along the SR P2MP path.

Abstract: A method implemented by a network node in a Bit Index Explicit Replication (BIER) domain is used to provide fast reroute protection. The method includes copying a bit index routing table (BIRT) of the network node, changing a neighbor node in the copied BIRT to one of a plurality of backup neighbor nodes to generate a backup BIRT, deriving a backup bit index forwarding table (BIFT) from the backup BIRT, and forwarding a packet in accordance with the backup BIFT when the neighbor node has failed.

Abstract: A method implemented by a network node in a BIER domain includes obtaining, by a control plane of the network node, an IP LFA from a FIB or RIB through a first interface, using, by the control plane of the network node, the IP LFA to build a BIFTe when the IP LFA is an expected type, accessing, by the control plane of the network node, a BIER network topology in an LSDB through a second interface, computing an LFA of the expected type, and using the LFA to build the BIFTe when the IP LFA is not of the expected type, updating, by the control plane of the network node, the BIFTe in a data plane of the network node through a third interface; and forwarding, by the data plane of the network node, BIER packets using the BIFTe to avoid a failure.

Abstract: A method for providing segment routing (SR) binding protection. The method includes determining binding information of a binding node on an SR path and transmitting binding protection information to one or more nodes to support routing of a packet of the SR path when the binding node fails.

Abstract: Disclosed is a mechanism for implementing link state flooding reduction (LSFR) in an Interior Gateway Protocol (IGP) network. The mechanism includes receiving data indicating connectivity of a plurality of nodes in the network. A flooding topology is built based on the connectivity. This includes selecting one of the nodes as a root node, and building a tree of links connecting the root node to the nodes in the network. The flooding topology is stored in a memory. The flooding topology may not be to the remaining nodes in the network. Link state messages may then be flooded over the flooding topology.

Abstract: Various systems and methods for migrating a zone to a pseudo node are described herein including a method performed by a zone edge node. In an embodiment, the method includes receiving, by the zone edge node, an execution request to initiate migration from the zone to the pseudo node. The method also includes sending, by the zone edge node, at least one Hello packet to a zone external node adjacent to the zone edge node for requesting the zone external node to create an adjacency between the pseudo node and the zone external node on the zone external node. The method further includes creating, by the zone edge node, the adjacency between the pseudo node and the zone external node on the zone edge node.

Abstract: A method comprises receiving a packet, where the packet comprises a binding SID (BSID) of a node and a first list of segment identifiers (SIDs) of a Segment Routing Traffic Engineering (SR-TE) path that includes a first node SID of a non-neighbor upstream endpoint node of the node and a second node SID of the node, the BSID is associated with a second list of SIDs; determining that the second node SID is a failed node SID of the node; removing, in response to the determining, the first node SID and the second node SID from the packet; replacing the BSID in the packet with the second list; and sending the packet to a next hop node on an interior gateway protocol (IGP) shortest path to a destination node after the IGP has converged.

Abstract: A method implemented by a network node in a Bit Index Explicit Replication (BIER) domain is used to provide fast egress protection. The method includes receiving a type length value (TLV) structure that identifies a backup egress node for a destination network node and includes an entry that indicates whether a primary egress node and the backup egress node transmit a packet to a same customer edge (CE) or to different customer edges (CEs), generating an egress protection bit index forwarding table (EP-BIFT) including the backup egress node and the entry that indicates whether the primary egress node and the backup egress node transmit the packet to the same CE or to different CEs, and forwarding the 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 for establishing a temporal label switched path (T-LSP) implemented in a node in a network. The method includes receiving a path request including a time interval and a set of constraints; obtaining traffic engineering information from a first database; computing, by the node, a path satisfying the time interval and the set of constraints based on the traffic engineering information obtained; storing the time interval and the set of constraints in a second database; and instructing an ingress node of the temporal LSP to signal the temporal LSP in the network along the path computed at a start of the time interval identified in the path request and to tear down the temporal LSP at an end of the time interval identified in the path request.

Abstract: A method performed by a routing device. The method comprises determining that a size of a payload of a type-length-value (TLV) of a first type in a link state protocol data unit exceeds a maximum value, splitting the payload into n pieces, wherein n is an integer larger than 1, and encoding a first piece of the payload in a first TLV of the first type. The first TLV of the first type includes a first type field indicating the first type, a first value field including the first piece of the payload and a first length field indicating a length of the first value field. The method includes encoding one or more second pieces of the payload in one or more container TLVs of a second type.

Abstract: A method implemented by a first controller in a network comprising a cluster of controllers including the first controller and a second controller, the method comprises transmitting, to a network element (NE), a first BGP message comprising a first controllers network layer reachability information (NLRI), the first controllers NLRI carrying a position of the first controller relative to other controllers in the cluster of controllers, receiving, from the NE, a second BGP message comprising a second controllers NLRI, the second controllers NLRI carrying a position of the second controller relative to the other controllers in the cluster of controllers, and determining the primary controller from the cluster of controllers based on the position of the first controller and the position of the second controller, with the primary controller being responsible for controlling the network.

Abstract: A method used by an egress router is disclosed. The egress router obtains a capacity index of an application server attached to the egress router. The egress router further obtains a load index describing a load measurement between the egress router and the application server during a certain time period. The egress router encodes the capacity index and the load index into a packet. The egress router transmits the packet to one or more routers in an Internet protocol (IP) network.

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: A method implemented by an ingress node in a traffic engineering (TE) multicast domain along a point-to-multipoint (P2MP) path. The method includes receiving a packet from a traffic source; encapsulating the packet with a multicast routing header (MRH) for a sub-tree of the P2MP path through the TE multicast domain, wherein the MRH indicates the sub-tree by encoding link information of one or more links on the sub-tree, the link information of the one or more links comprising a link number of a link from the ingress node to a next hop node or a link bit indicating whether the link corresponding the link number is on the sub-tree; and sending the packet with the MRH toward the next hop node along the sub-tree.