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: A method for communication between nodes, where the method includes: constructing, by a first Layer 3 node, a link local control frame; adding, by the first Layer 3 node, a destination group Media Access Control (MAC) address to the link local control frame, wherein the destination group MAC address is outside a block of destination group MAC addresses assigned for Ethernet bridging purposes; and transmitting, by the first Layer 3 node, the link local control frame to a second Layer 3 node.

Abstract: A method and network device for root selection, where the method includes: obtaining link costs of links connecting a plurality of nodes in the network; selecting a weighting parameter based at least partly on the link costs; calculating node costs corresponding to each of the plurality of the nodes based on the link costs and the weighting parameter; and selecting a node as the root node based on the node costs, wherein the root node is selected from the plurality of nodes.

Abstract: A method implemented by a network node for processing packets with header options. The network node receives a packet that includes an Internet Protocol (IP) header (e.g., IP version 4 (IPv4) or IP version 6 (IPv6) header). The network node determines that the IP header includes one or more options. The network node modifies an options indicator field in the IP header from a first options protocol value to a selected opaque protocol value. The network node transmits the packet toward the destination of the packet.

Abstract: A service function chain (SFC) merging method implemented by a service function (SF) node. The SFC merging method includes receiving a plurality of diverted SFC packets; determining a set of matching diverted SFC packets from the plurality of diverted SFC packets; merging the set of matching diverted SFC packets into a merged SFC packet; and transmitting the merged SFC packet.

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: A method performed by a Domain Name System (DNS) name server for providing Segment Routing (SR) Internet Protocol (IP) version 6 (SRv6) information. The method includes receiving a DNS query for an SRv6 resource record (RR) corresponding to a DNS name; determining whether data corresponding to the DNS name comprises the SRv6 RR in response to the DNS query; and transmitting a DNS response, wherein the DNS response comprises the SRv6 RR when the data comprises the SRv6 RR.

Abstract: A method and network device for selecting links of a network subgraph, where the method includes: obtaining link costs of links in a network; obtaining node costs of nodes connected by each of the links in the network, where the node costs comprise a first node cost of a first node and a second node cost of a second node selected from the nodes; selecting a weighting parameter based on the link costs, the node costs, or both; calculating link and node costs for each of the links, where the link and node costs are calculated based on the link costs, the node costs, the weighting parameter, or any combination thereof; and selecting a link having a lowest link and node cost among the links.

Abstract: A method and network device for root selection, where the method includes: obtaining link costs of links connecting a plurality of nodes in the network; selecting a weighting parameter based at least partly on the link costs; calculating node costs corresponding to each of the plurality of the nodes based on the link costs and the weighting parameter; and selecting a node as the root node based on the node costs, wherein the root node is selected from the plurality of nodes.

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: A method for communication between nodes, where the method includes: constructing, by a first Layer 3 node, a link local control frame; adding, by the first Layer 3 node, a destination group Media Access Control (MAC) address to the link local control frame, wherein the destination group MAC address is outside a block of destination group MAC addresses assigned for Ethernet bridging purposes; and transmitting, by the first Layer 3 node, the link local control frame to a second Layer 3 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: A computer-implemented method tracks congestion in a service function chain. The method includes receiving a packet at a service function forwarding node of the service function chain, the packet having an information packet, a transport header, and a network service header, forwarding the packet to a service function in accordance with the network service header, detecting congestion, and updating a congestion field in the network service header to indicate congestion was encountered in the service function chain.

Abstract: A computer-implemented method tracks congestion in a service function chain. The method includes receiving a packet at a service function forwarding node of the service function chain, the packet having an information packet, a transport header, and a network service header, forwarding the packet to a service function in accordance with the network service header, detecting congestion, and updating a congestion field in the network service header to indicate congestion was encountered in the service function chain.

Abstract: An apparatus configured to provide active-active access to a transparent interconnection of lots of links (TRILL) campus. The apparatus includes a first access port associated with a first customer equipment (CE) and a second access port associated with a second CE. The first access port is configured to receive a frame from the first CE. The apparatus includes a processor configured to replicate the frame to generate a replicated frame, determine that a pseudo-nickname associated with the first access port and the pseudo-nickname associated with the second access port are the same, and determine that the first access port and the second access port are associated with different multi-chassis link aggregations (MC-LAGs). The apparatus also includes a transmitter configured to forward the replicated frame to the second CE using the second access port.

Abstract: A computer-implemented method tracks congestion in a service function chain. The method includes receiving a packet at a service function forwarding node of the service function chain, the packet having an information packet, a transport header, and a network service header, forwarding the packet to a service function in accordance with the network service header, detecting congestion, and updating a congestion field in the network service header to indicate congestion was encountered in the service function chain.

Abstract: An apparatus configured to provide active-active access to a transparent interconnection of lots of links (TRILL) campus. The apparatus includes a first access port associated with a first customer equipment (CE) and a second access port associated with a second CE. The first access port is configured to receive a frame from the first CE. The apparatus includes a processor configured to replicate the frame to generate a replicated frame, determine that a pseudo-nickname associated with the first access port and the pseudo-nickname associated with the second access port are the same, and determine that the first access port and the second access port are associated with different multi-chassis link aggregations (MC-LAGs). The apparatus also includes a transmitter configured to forward the replicated frame to the second CE using the second access port.

Abstract: A routing bridge at an edge of a transparent interconnection of lots of links (TRILL) campus, comprises a first access port and a second access port each designated as one of a multi-chassis link aggregation (MC-LAG) designated forward (DF) port and an MC-LAG non-DF port, wherein the first access port is associated with a first pseudo-nickname, and a second access port is associated with a second pseudo-nickname, wherein a frame received via the first access port from a first customer equipment (CE) is replicated to generate a replicated frame, wherein the replicated frame is forwarded via the second access port to a second CE when the first pseudo-nickname and the second pseudo-nickname are the same, and when the first pseudo-nickname and the second pseudo-nickname are different and the second access port has been designated as the MC-LAG DF port.

Abstract: A method and an apparatus for changing an appointed forwarding device. A first routing bridge receives an appointment packet for appointing the first routing bridge as an appointed forwarding device of a virtual local area network (VLAN); and immediately enters a forwarding state and starts to forward a packet of the VLAN, if the first routing bridge is in a state of being inhibited from forwarding packets of the VLAN when the first routing bridge receives a first advertisement packet carrying an identifier of the VLAN sent by a second routing bridge; the first advertisement packet is a broadcast packet and used to notify a neighboring routing bridge that the second routing bridge sending the first advertisement packet is not the appointed forwarding device of the VLAN; and the second routing bridge is an original appointed forwarding device of the VLAN application.

Abstract: A routing bridge at an edge of a transparent interconnection of lots of links (TRILL) campus, comprises a first access port and a second access port each designated as one of a multi-chassis link aggregation (MC-LAG) designated forward (DF) port and an MC-LAG non-DF port, wherein the first access port is associated with a first pseudo-nickname, and a second access port is associated with a second pseudo-nickname, wherein a frame received via the first access port from a first customer equipment (CE) is replicated to generate a replicated frame, wherein the replicated frame is forwarded via the second access port to a second CE when the first pseudo-nickname and the second pseudo-nickname are the same, and when the first pseudo-nickname and the second pseudo-nickname are different and the second access port has been designated as the MC-LAG DF port.