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:
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:
Various systems and methods for performing bit indexed explicit replication (BIER). For example, one method involves receiving a first bit string at a node, encapsulating a packet with the first bit string, and forwarding the packet. The method also involves receiving a second bit string at the node and selecting the second bit string. The method also involves encapsulating a second packet with the second bit string and forwarding the second packet.
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 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.
Abstract:
A receiving node receives a virtual LDP initialization (vInit) message from a first node, where the vInit message comprises a request to establish a vLDP session between a requesting node and a target node. If the receiving node does not own a destination address of the vInit message, the receiving node is determined to be a relay node. The relay node inserts a relay label into the vInit message, where the relay label is an outgoing label that the relay node uses to reach the first node, and forwards the vInit message toward the destination address. If the receiving node owns the destination address, the receiving node is determined to be the target node, which extracts a stack of relay labels from the vInit message. The relay labels are used to define a return path to the requesting node for messages transmitted over the vLDP session.
Abstract:
Various systems and methods for performing bit indexed explicit replication (BIER) using IPv6. For example, one method involves receiving, at a node, a packet that includes an IP header. The packet also includes a multicast forwarding entry. The method also involves comparing the multicast forwarding entry with forwarding information stored by the node and selecting a neighbor based on the comparing. The method further includes forwarding the packet to the neighbor.
Abstract:
In one embodiment, a node in a multicast label distribution protocol (mLDP) network determines a remote protecting node for a particular root node in the mLDP network. In addition, the node determines a protecting node address of the remote protecting node and a root node address of the particular root node, and establishes an mLDP label-switched path (LSP) via the remote protecting node by using the protecting node address as a root of an outer forwarding equivalent class (FEC) of a recursive FEC, and using the root node address as an inner FEC of the recursive FEC for the mLDP LSP. As such, when the remote protecting node is reached, the outer FEC is stripped and the remote protecting node continues establishing the mLDP LSP toward the particular root node.
Abstract:
An apparatus and method for emulating a shared or source distribution tree within an MPLS network. In one embodiment of the method, a router receives a multicast data packet. The router transmits the multicast data packet to a first router via a first point-to-point label switched path (LSP). The router replicates the multicast data packet to produce a replicated multicast data packet. Then the router transmits the replicated multicast data packet to a second router via a second point-to-point LSP. The first point-to-point LSP is distinct from the second point-to-point LSP.
Abstract:
In one embodiment, a router includes one or more processors and one or more computer-readable non-transitory storage media coupled to the one or more processors. The one or more computer-readable non-transitory storage media include instructions that, when executed by the one or more processors, cause the router to perform operations including receiving software-defined networking in a wide area network (SD-WAN) policies from a component of an SD-WAN network. The operations also include establishing a session with a mobile device and receiving information associated with the mobile device in response to establishing the session with the mobile device. The operations further include filtering the SD-WAN policies based on the information associated with the mobile device to generate SD-WAN device-specific policies and communicating the SD-WAN device-specific policies to the mobile device.
Abstract:
A method comprises, at a first router configured to perform Bit Index Explicit Replication (BIER) for forwarding of multicast packets in a network, storing configuration information that indicates that the first router belongs to multiple subdomains of a BIER domain, and is able to forward the multicast packets for a virtual private network on the multiple subdomains. The method further comprises, during an auto-discovery procedure, generating an auto-discovery message to include an auto-discovery route and route attributes that indicate the multiple subdomains, and sending the auto-discovery message to a second router of the virtual private network the network.