Abstract: Various systems and methods for performing fast fail-over. One method involves electing a first node as a designated forwarder node and electing a second node as a backup designated forwarder node. Prior to detecting a loss of connectivity between the designated forwarder node and the local network, the method elects both the designated forwarder node and the backup designated forwarder node, and the designated forwarder node forwards to a core network at least a first packet received from a local network. Subsequent to detecting a loss of connectivity, using the backup designated forwarder node to forward an instance of a second packet to the core network. In one embodiment, the backup designated forwarder node forwards an instance of the second packet, via a tunnel, to the designated forwarder node, which then forwards the instance of the second packet to the core network following the loss of connectivity.

Abstract: Various systems and methods for performing bit indexed explicit replication (BIER). For example, one method involves receiving a packet at a node. The packet includes a bit string. The node traverses the bit string and selects an entry in a bit indexed forwarding table (BIFT). The entry includes a forwarding bit mask. Based on the forwarding bit mask and the bit string, the node forwards the packet.

Abstract: Functionality for creating a bit routing table for use in a bit-indexed explicit replication (“BIER”) environment in disclosed herein. In one embodiment, this functionality includes receiving information from a host, and determining whether the information comprises a MAC address that is a bit-indexed explicit replication (“BIER”) MAC address. In response to determining that the information comprises a BIER MAC address, this functionality creates an entry corresponding to the MAC address in a bit routing table. This functionality also analyzes the information to determine a bit position that is associated with the host, and also determines a port via which the host is reachable. The functionality updates the bit routing table by storing information identifying the bit position and the port in the entry, such that the bit position and the port both correspond to the MAC address. This functionality can be used to route packets in a BIER environment.

Abstract: Methods and network devices are disclosed for traffic-engineered forwarding through a new form of bit indexed explicit replication. In one embodiment, a method includes receiving at a first node in a network a message comprising a message bit array, and comparing bit values at one or more bit positions in the message bit array to one or more entries in a forwarding table stored at the first node. The one or more bit positions correspond in this embodiment to links in the network. This embodiment of the method further includes forwarding the message over a link represented in the forwarding table if a result of the comparing indicates that the link is included in a path to be taken by the message. In a further embodiment of the method, the message is a multicast message and forwarding the message comprises forwarding a replica of the multicast message.

Abstract: Methods and network devices are disclosed for traffic-engineered forwarding through a new form of bit indexed explicit replication. In one embodiment, a method includes receiving at a first node in a network a message comprising a message bit array, and comparing bit values at one or more bit positions in the message bit array to one or more entries in a forwarding table stored at the first node. The one or more bit positions correspond in this embodiment to links in the network. This embodiment of the method further includes forwarding the message over a link represented in the forwarding table if a result of the comparing indicates that the link is included in a path to be taken by the message. In a further embodiment of the method, the message is a multicast message and forwarding the message comprises forwarding a replica of the multicast message.

Abstract: Various systems and methods for performing fast fail-over. For example, one method involves electing a first node as a designated forwarder node and electing a second node as a backup designated forwarder node, where the designated forwarder node is used to forward at least a first packet to a downstream node. The method further involves detecting a loss of connectivity between the designated forwarder node and a downstream receiver node, where the designated forwarder node and the backup designated forwarder node are both elected prior to the loss of connectivity occurring. Moreover, subsequent to detecting the loss of connectivity, the method uses the backup designated forwarder node to forward at least a second packet to the downstream receiver node.

Abstract: In one embodiment, a device in a network sends a first multicast message to a plurality of destinations in the network. The first multicast message includes a first bitmap that identifies the destinations. The device receives one or more acknowledgements from a subset of the destinations. The device determines a retransmission bitmap that identifies those of the plurality of destinations that did not acknowledge the first multicast message, based on the received one or more acknowledgements. The device sends a retransmission multicast message to those of the plurality of destinations that did not acknowledge the first multicast message. The retransmission multicast message includes the retransmission bitmap.

Abstract: Various systems and methods for bypassing one or more non-capable nodes. For example, one method involves a capable node determining that an adjacent node is non-capable, where capable nodes are configured to implement a data plane capability and non-capable nodes are not. The method then involves identifying a downstream node that is capable. The downstream node is on a shortest path. The method also involves generating information that identifies a tunnel to the downstream node.

Abstract: In one embodiment of a system, apparatus, and method the system, apparatus, and method including a table of neighboring network nodes stored in a ternary content-addressable memory (T-CAM), each one of the neighboring network nodes being indexed as a Bit Index Explicit Replication (BIER) bitmap, a plurality of selector lines in the T-CAM, each selector line associated with one neighboring network node, a bit set in the T-CAM for one single selector line among the plurality of selector lines such that the set bit is associated with a single match line, the single match line to be set high when an input on the selector line matches the set bit and otherwise to be set low, and a plurality of bits set to do not care for other selector lines, beside the one single selector line, associated with the single match line. Related systems, apparatuses, and methods are also described.

Abstract: Various systems and methods for performing bit indexed explicit replication (BIER) using multiprotocol label switching (MPLS). For example, one method involves receiving a packet that includes a MPLS label. The packet also includes a multicast forwarding entry. The method also involves determining, based on the value of the MPLS label, whether to use the multicast forwarding entry to forward the packet. The method further includes forwarding the packet.

Abstract: In one embodiment, a method includes receiving from a host node comprising a tenant multicast application with a single tenant deployment, an encapsulated multicast packet over unicast at a virtual replicator, the encapsulated multicast packet comprising receiver information for the virtual replicator, replicating the encapsulated multicast packet at the virtual replicator, and transmitting the encapsulated multicast packet over unicast to a plurality of receiving nodes based on the receiver information. The receiving nodes comprise the tenant multicast application and the virtual replicator operates in a cloud without multicast capability. An apparatus is also disclosed herein.

Abstract: Various systems and methods for performing bit indexed explicit replication (BIER). For example, one method involves receiving a link layer protocol frame at a network device. The link layer protocol frame includes a MAC address that identifies the link layer protocol frame as a being a multicast frame. The method then involves selecting a subset of ports included on the network device and forwarding the link layer protocol frame to only the selected subset of ports.

Abstract: Various systems and methods for performing bit indexed explicit replication (BIER) using multiprotocol label switching (MPLS). For example, one method involves receiving a packet that includes a MPLS label. The packet also includes a multicast forwarding entry. The method also involves determining, based on the value of the MPLS label, whether to use the multicast forwarding entry to forward the packet. The method further includes forwarding the packet.

Abstract: Methods and network devices are disclosed for failure protection in traffic-engineered bit indexed explicit replication networks. In one embodiment, a method includes receiving at a node in a network a message comprising a message bit array, where bit positions in the message bit array correspond to respective links in the network. The method further includes evaluating a bit value at a bit position in the message bit array, where the bit position corresponds to a network link represented in a forwarding table for the node, checking for a failure state of the link represented in the forwarding table, and, responsive to a determination of a failure state of the link, modifying one or more bit values in the message bit array. In one embodiment a network device includes a network interface, a memory configured to store a forwarding table, and a processor configured to carry out the methods.

Abstract: Methods and network devices are disclosed for traversal, within a network configured for bit indexed forwarding, of a subnetwork having nodes not configured for bit indexed forwarding. In one embodiment, a method includes receiving, from a first network node not configured for bit indexed forwarding, a data message comprising a local label and a message bit array. Bit values in the message bit array identify intended destination nodes for the message. The embodiment further includes modifying the message bit array to exclude as intended destination nodes for the message any nodes not represented by one or more relative bit positions associated with the local label and stored in an ingress filter data structure. In addition, the embodiment includes forwarding a copy of the data message to a second network node, which is configured for bit indexed forwarding, identified in an accessed entry of a bit indexed forwarding table.

Abstract: Various systems and methods for bypassing one or more non-capable nodes. For example, one method involves a capable node determining that an adjacent node is non-capable, where capable nodes are configured to implement a data plane capability and non-capable nodes are not. The method then involves identifying a downstream node that is capable. The downstream node is on a shortest path. The method also involves generating information that identifies a tunnel to the downstream node.

Abstract: Methods and network devices are disclosed for traversal, within a network configured for bit indexed forwarding, of a subnetwork having nodes not configured for bit indexed forwarding. In one embodiment, a method includes receiving, from a first network node not configured for bit indexed forwarding, a data message comprising a local label and a message bit array. Bit values in the message bit array identify intended destination nodes for the message. The embodiment further includes modifying the message bit array to exclude as intended destination nodes for the message any nodes not represented by one or more relative bit positions associated with the local label and stored in an ingress filter data structure. In addition, the embodiment includes forwarding a copy of the data message to a second network node, which is configured for bit indexed forwarding, identified in an accessed entry of a bit indexed forwarding table.

Abstract: In one embodiment, a method comprises creating, in a computing network, a loop-free routing topology comprising a plurality of routing arcs for reaching a destination network node; identifying, within the loop-free routing topology, non-congruent paths for a source network node to reach the destination node; and determining, from the non-congruent paths, a non-congruent path pair providing no more than a prescribed difference of latency from the source network node to the destination node, enabling the source network node to forward a data packet in a first direction of the one non-congruent path pair and a bicasted copy of the data packet in a second direction of the one non-congruent path pair, for reception of the data packet and the bicasted copy by the destination node within the prescribed difference of latency.

Abstract: A method is provided in one example embodiment and may include receiving a packet at a node, wherein the node comprises one or more first data structures comprising Bit Index Explicit Replication (BIER) BitMask information for one or more neighboring forwarders and a second data structure comprising multicast forwarding information; identifying a BIER BitString contained in the packet, wherein the BIER BitString is identified within an Internet Protocol (IP) header or a label included with the packet; determining multicast forwarding information for the packet based on the BIER BitString; and forwarding the packet toward a plurality of destination nodes based on the multicast forwarding information.

Abstract: In one embodiment, a method comprises receiving, by a network device in a deterministic data network comprising deterministic segments, a data packet comprising a packet header having a bit index, each bit in the bit index associated with a corresponding one of the deterministic segments; the network device identifying, from the bit index, a first bit for a corresponding first deterministic segment and a second bit for a corresponding second deterministic segment, wherein the network device is an endpoint for transmitting deterministic traffic into each of the first and second deterministic segments; the network device selectively executing a replication operation of the data packet for transmission of a replicated data packet into each of the first and second deterministic segments, based on the network device detecting the corresponding first and second bits set for replication.