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.

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 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: A network node that provides egress fault protection for a primary egress node. The network node may receive a service label associated with an application from a primary egress node of a primary label switched path (LSP). The network node may use the service label to add a forwarding entry into a forwarding table associated with the primary egress node. Following a fault in the primary egress node, the network node may receive a data packet comprising an LSP label and the service label from a partial backup LSP. The network node may use the LSP label to locate the forwarding table associated with the primary egress node. The service label may be used to deliver the data packet to a destination node according to the forwarding table associated with the primary egress node.

Abstract: A first router in a first AS, the first router comprises: a processor configured to: obtain information about a broadcast link connecting the first router to a second router in a second AS, and generate a link state message comprising the information; and a transmitter coupled to the processor and configured to transmit the link state message to a third router, wherein the third router is in the first AS and is adjacent to the first router. A method comprises: receiving a first link state message from a first router; receiving a second link state message from a second router; receiving a third link state message from a third router; determining which of the first router, the second router, and the third router are ASBRs connected to a broadcast link based on information in the first link state message, the second link state message, and the third link state message.

Abstract: Disclosed is a mechanism implemented by an ingress node in a network. The mechanism comprises receiving a packet in Multiprotocol Label Switching (MPLS) format. A first segment list is pushed onto the packet. The first segment list describes a segment routing point to multipoint (SR P2MP) path as a list of multicast segment identifiers (SIDs) each comprising a multicast adjacency label. The packet is transmitted from a downstream interface along the SR P2MP path.

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 Proxy Forwarding node configured to advertise Segment Routing (SR) proxy forwarding capability of the Proxy Forwarding node for neighboring nodes of the Proxy Forwarding node using extensions to interior gateway protocol (IGP) for Proxy Forwarding for enabling an ingress node to the SR Traffic Engineering (SR-TE) path to continue to forward the traffic without modifying a segment list of the SR-TE path that includes a node segment identifier (SID) of a failed neighboring node of the Proxy Forwarding node. When the Proxy Forwarding node receives traffic targeting the failed neighboring node, the Proxy Forwarding node performs SR proxy forwarding for the failed neighboring node by forwarding the traffic towards a destination of the traffic in a direction that avoids the failed neighboring node for a period of time after the IGP has converged.

Abstract: A method implemented by a first node in a segment routing (SR) network domain includes receiving, from a second node of another network domain, a packet configured to pass through the SR network domain in accordance with segment identifiers (SIDs). The method also includes obtaining compressed SIDs corresponding to some of the SIDs. The method includes generating a segment routing header (SRH) having a list of segments. The method further includes adding the SRH to the packet and forwarding the packet with the SRH to a third node in the SR network domain.

Abstract: A method implemented by a first node in a segment routing (SR) network domain includes receiving, from a second node of another network domain, a packet that is to pass through the SR network domain in accordance with segment identifiers (SIDs). The method also includes obtaining compressed SIDs corresponding to some of the SIDs. The method includes generating a segment routing header (SRH) having a flag field with a first sub-field, a tag field with a second sub-field and a third sub-field, and a segment list. The method finally includes adding the SRH to the packet, and forwarding the packet with the SRH to a third node in the SR network domain.

Abstract: A method implemented by a first node in a segment routing (SR) network domain includes receiving, from a second node of another network domain, a packet that is to pass through the SR network domain in accordance with segment identifiers (SIDs). The method also includes obtaining compressed SIDs corresponding to some of the SIDs. The method includes generating, by the first node, a segment routing header (SRH) having a list of segments and a segment left (SL) field. The method finally includes adding the SRH to the packet, and forwarding the packet with the SRH to a third node in the SR network domain.

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: A method, performed by a network node, for enabling Interior Gateway Protocol (IGP) fast convergence, the method includes determining that there is a significant change in link state information, the significant change is at least one of a link down, a link up, and a link metric change. The method further includes originating a link state packet comprising a flag that is set to indicate the significant change in the link state information; and distributing the link state packet.