Abstract:
In one embodiment, a first node in a network receives one or more bitmaps from one or more child nodes of the first node according to a directed acyclic graph (DAG). Each of the one or more child nodes is associated with a corresponding unique bit position in the one or more bitmaps. The first node stores, in a forwarding table, the one or more bitmaps received from the one or more child nodes of the first node. The first node receives a message that includes a destination bitmap that identifies one or more destinations of the message via one or more set bits at bit positions associated with the one or more child nodes. The first node forwards the message towards the identified one or more destinations based on the destination bitmap and the one or more bitmaps stored in the forwarding table of the first node.
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:
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 includes information identifying a plurality of destinations. The node selects an entry in a bit indexed forwarding table (BIFT). The BIFT includes both a primary path entry and a backup path entry. The node forwards the packet based on information in the entry.
Abstract:
A method and network device are disclosed for multicast forwarding. In one embodiment, the method includes receiving at a node configured to use a bit-indexed forwarding table a multicast message comprising an incoming message bit array. The method further includes comparing the incoming message bit array to a first neighbor bit array within a first forwarding table entry, and determining that for at least one relative bit position in the bit arrays a corresponding destination node is both a destination for the message and a reachable destination from a first neighboring node. The method further includes forwarding toward the first neighboring node a copy of the message, where a first node on the path of the forwarded message is not configured to use a respective bit-indexed forwarding table. An embodiment of the device includes a network interface, a memory and a processor configured to perform steps of the method.
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:
An apparatus and method for detection of repair nodes in a network. In one embodiment of the method, a first node generates a first message and a second message, wherein each of the first and second messages includes a first node identification (ID) that uniquely identifies the first node within a network. The first message includes a first path ID, wherein the first path ID corresponds to a first path through which the first node receives data packets of a stream. The second message includes a second path ID, wherein the second path ID corresponds to a second path through which the first node receives copies of the data packets. The first and second path IDs are distinct from each other. The first node transmits the first message upstream towards a root node for the stream via a first interface of the first node, and the first node transmits the second message upstream towards the root node via a second interface of the first node. The first and second interfaces are distinct from each other.
Abstract:
In one embodiment, a node in a communication network receives a request for messages of a particular group, determines a rendezvous point, and transmits the request to the rendezvous point to cause the rendezvous point to return a source-message indicating a source-node of the particular group. The node further creates a path from itself to the source-node and receives messages of the particular group according to the path.
Abstract:
An apparatus or method for upstream label allocation on LANs for multipoint (MP) label switched paths (LSPs). In one embodiment of the method, a first router receives a first incoming labeled data packet, wherein the first incoming labeled data packet comprises a first data packet and one or more first labels. The first router creates a first outgoing labeled data packet, wherein creating the first outgoing labeled data packet includes the step of swapping the one or more first labels of the first incoming labeled data packet with a context label and a forwarding label, wherein the first outgoing labeled data packet comprises the first data packet, the context label, and the forwarding label. Ultimately, the first router transmits the first outgoing labeled data packet to second and third routers via a LAN.
Abstract:
A computer network efficiently provides a multicast network flow to a multicast recipient across a multihomed network element. The multihomed network element includes network devices that receive multicast data from a source of a multicast network flow. Each particular network device that received the multicast data publishes a notification indicating that the multicast network flow is available from the particular network device. The computer network receives a subscription to the multicast network flow from a multicast recipient, and determines whether to bridge the multicast data across the multihomed network element based on a multicast configuration of the computer network. The multihomed network element provides the multicast data to the multicast recipient from at least one of the particular network devices that received the multicast data from the source of the multicast network flow.
Abstract:
In one embodiment, an offload platform is an compute platform, adjunct to a router or other packet switching device, that performs packet processing operations including determining an egress forwarding value corresponding to the next-hop node of the packet switching device to which to send an offload-platform processed packet. The offload platform downloads forwarding information from the router, and augments it, such as, but not limited to, representing interfaces of the router as identifiable virtual interface(s) on the offload platform, and including each of one or more next-hop nodes of the router represented as an identifiable virtual adjacency and identifiable tunnel (e.g., identified by the egress forwarding value). In one embodiment, the egress forwarding value is an Multiprotocol Label Switching (MPLS) label or Segment Routing Identifier. The router identifies packets of certain packet flows to send to the adjunct offload platform, rather than processing per its routing information base.