Cisco Technology, Inc.

Juniper Networks, Inc.

Tech 5

Other

Gregory J Shepherd

Ijsbrand Wijnands

Neale D R Ranns

Christian J Martin

Arturo A Rodriguez

Nagendra Kumar Nainar

Benjamin M Cook

Rajiv Asati

Toerless Eckert

Dino Farinacci

John H W Bettink

Jesper Skriver

Pascal Thubert

Pierre Pfister

W Mark Townsley

Thomas Kernen

Thomas J Pusateri

David Delano Ward

Clarence Filsfils

Kyle Andrew Donald Mestery

Stewart Frederick Bryant

Ian James Wells

Mohamed Khalid

Ali C Begen

Michael Francis O'Gorman

Neale David Raymond Ranns

John M Zwiebel

Apoorva Karan

Mike Barnes

Neale Ranns

Jeff Byzek

Ljsbrand Wijnands

Methods, network devices and computer readable media are disclosed relating to a communication network. In one embodiment, a method includes receiving a message comprising a message bit array. The message bit array identifies egress nodes for the message within a bit indexed explicit replication (BIER) domain of a communications network. A first bit position in the message bit array represents a first one or more of the egress nodes, and a bit value at the first bit position indicates that the message is to be forwarded to one of the first one or more of the egress nodes. The method further includes accessing a first forwarding table entry corresponding to the first bit position, determining whether the first bit position is an anycast bit position having multiple corresponding forwarding table entries, and forwarding the message to one of the first one or more of the egress nodes.

Area-specific broadcasting using bit indexed explicit replication

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.

Bit indexed explicit replication using multiprotocol label switching

Disclosed is the generation of a bit-indexed forwarding table (BIFT) that can include a plurality of entries, each such entry corresponding to a bit position of a plurality of bit positions, where each such bit position represents an egress network node of a plurality of egress network nodes, and the generating configures the BIFT to be used in forwarding a packet to one or more of the plurality of egress network nodes, based at least in part on a bit string in the packet. The generating includes selecting a bit position of the plurality of bit positions as a selected bit position, creating an entry of the plurality of entries (where the entry corresponds to the selected bit position), identifying a neighbor node associated with the selected bit position, and updating one or more fields of the entry with neighbor information regarding the neighbor node.

Bit indexed explicit forwarding optimization

Various systems and methods for performing fast fail-over. One method involves receiving a packet at a primary forwarder node of a core network, determining whether the packet was received from a secondary forwarder node of the core network, via a tunnel, and, in response to a determination that the packet was received via the tunnel, forwarding the packet to another node in the core network. The tunnel communicatively couples the primary forwarder node and the secondary forwarder node. The primary forwarder node and the secondary forwarder node communicatively couple a local network and the core network. The packet was transmitted from the local network.

Fast fail-over using tunnels

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.

Bit indexed explicit replication for layer 2 networking

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 selects forwarding information based on a flow value associated with the packet. The forwarding information includes a forwarding bit mask. The node then forwards the packet based on the bit string and the forwarding information.

Equal cost multi-path with bit indexed explicit replication

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 next-hop upstream node configured for bit indexed forwarding, an incoming tree descriptor message comprising a tree identifier and a descriptor bit array. Bit values in the descriptor bit array identify intended destination nodes to be reached via a network tree identified by the tree identifier. The embodiment further includes replicating and modifying the incoming tree descriptor message to generate an outgoing tree descriptor message for a next-hop downstream node within the network tree. In addition, the embodiment includes sending the outgoing tree descriptor message to the next-hop downstream node and sending to the next-hop upstream node a local label allocated to the tree identifier.

Bridging of non-capable subnetworks in bit indexed explicit replication

Methods, network devices and computer readable media are disclosed for replication and switching of Internet Protocol (IP) packets in professional media networks. In one embodiment, a method includes receiving, at a first node in a network configured for bit indexed explicit replication (BIER), and via a replication fabric within the network, a packet comprising a packet bit array. Each receiver of a plurality of non-BIER-enabled receivers reachable via the replication fabric is represented by a relative bit position in the packet bit array, and a respective IP address is assigned to each receiver. The method further includes determining that an intended non-BIER-enabled receiver of the packet is a local receiver of the first node, obtaining the IP address assigned to the local receiver, removing the packet bit array from the packet and forwarding the packet, without the packet bit array, to the local receiver via unicast IP forwarding.

Unicast media replication fabric using bit indexed explicit replication

Various systems and methods for performing bit indexed explicit replication (BIER). For example, one method involves receiving a membership message that was generated by an egress router, where the membership message comprises information identifying a multicast group, and information identifying a plurality of egress routers. The method identifies at least one bit position in the membership message that is associated with the first egress router, where at least one bit position of the plurality of bit positions is associated with the first egress router. The method also records membership of the first egress router in the multicast group, where the membership is recorded in a bit of a group membership table, and the bit corresponds to the bit position identified in the membership message.

Overlay signaling for bit indexed explicit replication

Methods, devices and computer readable storage media for performing bit indexed explicit replication (BIER) are disclosed. One embodiment of a method includes obtaining, at an egress node of a network, a bit position assigned to the egress node. This embodiment also includes sending an outgoing advertisement to other nodes in the network, where the outgoing advertisement identifies the egress node and the assigned bit position. The bit position is within a bit mask comprising bits in a plurality of bit positions, and each bit position corresponds to a respective egress node of the network.

Bit indexed explicit replication

Disclosed are systems and methods for generating a bit-indexed forwarding table (BIFT) that includes a plurality of entries, each of which corresponds to a bit position of a number of bit positions. Each such bit position represents an egress network node of a plurality of egress network nodes. The BIFT is generated from an existing BIFT that includes a number of existing BIFT entries. Further, the generating configures the BIFT to be used in forwarding a packet to one or more of the egress nodes, based at least in part on a bit string in the packet. In one embodiment, the generating includes selecting a bit position of the plurality of bit positions as a selected bit position, creating an entry of the plurality of entries, and converting an existing BIFT entry of the plurality of existing BIFT entries to the entry of the plurality of entries.

Methods, network devices and computer readable media are disclosed for traffic-engineered forwarding through a new form of bit indexed explicit replication. In one embodiment, a method includes receiving, at an ingress node of a network, a message associated with a message flow, obtaining a message bit array corresponding to the message flow, encapsulating the message with the message bit array to form an encapsulated message, and forwarding the encapsulated message into the network. Bit positions in the message bit array are assigned to separate segments of a path or tree in the network, and an explicit path or tree for the message flow is defined as an end to end connection of multiple segments assigned bit positions having a first bit value in the message bit array.

Traffic engineering for bit indexed explicit replication

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.

Growing community of inventors

Eugene, OR, United States of America

Gregory J Shepherd