# US 2026/0261509 A1 · Unique Identifier for Reverse Path Forwarding with Multicast VPNs

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2026/0261509 A1
- Document ID: US20260261509A1
- Status: Published application
- Kind: A1
- Application number: 19/068,123
- Filed: 2025-03-03
- Published: 2026-09-03
- Earliest claimed: 2025-03-03
- Assignees: Ciena Corporation
- Applicants: Ciena Corporation
- Inventors: Nikhil Sanjeev Kulkarni; Ramkumar Parameswaran; Sami Boutros; Mourad Atassi
- Web page: https://patentgrep.com/patent/US20260261509A1

## CPC

- H04L 45/48: Routing tree calculation
- H04L 45/02: Topology update or discovery
- H04L 45/16: Multipoint routing
- H04L 45/50: using label swapping, e.g. multi-protocol label switch [MPLS]
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

In a multicast VPN, Reverse Path Forwarding (RPF) checks are critical for preventing loops and duplicate traffic. Traditional RPF solutions rely on specific interfaces or IP next‐hops, which can fail in complex or dynamic environments. This disclosure introduces a universally unique identifier (UUID) that binds incoming multicast traffic to a logical distribution tree, regardless of physical or label‐based routes. A transport identifier, such as an MPLS label, is mapped to the UUID, and upon arrival, the receiving node consults the UUID for RPF validation within a VRF table. If the packet’s UUID matches that of the multicast route entry, it is forwarded; otherwise, it is dropped. This method decouples RPF checks from physical interfaces or label assignments, simplifying configuration, adapting to diverse underlay technologies, and improving reliability in large‐scale or frequently changing multicast VPN networks.

## Claims

### Claim 1

A method of performing a reverse path forwarding (RPF) check for a multicast packet in a network device, the method comprising steps of:
receiving a multicast packet that includes a transport identifier associated with a multicast distribution tree;
retrieving a universally unique identifier (UUID) corresponding to the transport identifier;
comparing the retrieved UUID to a second UUID in a multicast routing entry of a virtual routing and forwarding (VRF) table; and
forwarding the multicast packet if the retrieved UUID matches the second UUID, or discarding the multicast packet otherwise, wherein the UUID provides an abstract handle for the multicast distribution tree independent of a physical interface or an Internet Protocol (IP) next‐hop.

### Claim 2 (depends on 1)

The method of claim 1, wherein the steps further include
prior to the receiving, assigning the UUID to the multicast distribution tree in a control plane, wherein the UUID uniquely identifies the multicast distribution tree irrespective of transport‐layer label assignments.

### Claim 3 (depends on 2)

The method of claim 2, wherein the steps further include
linking the UUID to a multicast group and source address for RPF checking, wherein the control plane creates a multicast route entry that includes the UUID for validating incoming packets.

### Claim 4 (depends on 2)

The method of claim 2, wherein the steps further include
mapping the transport identifier to the assigned UUID in the control plane, wherein the network device stores the mapping in a hardware or software table accessible to a data plane.

### Claim 5 (depends on 1)

The method of claim 1, wherein the steps further include
programming a label forwarding table or incoming label map (ILM) with the mapping of the transport identifier to the UUID, wherein a data plane references the ILM to retrieve the second UUID for incoming packets.

### Claim 6 (depends on 1)

The method of claim 1, wherein the receiving the multicast packet includes detecting an MPLS label as the transport identifier, and the steps further include removing the MPLS label before performing UUID comparison in the VRF table.

### Claim 7 (depends on 1)

The method of claim 1, wherein the steps further include
updating a UUID‐to‐transport‐identifier mapping in response to route convergence or other network changes, thereby maintaining consistent RPF checks across varying paths.

### Claim 8 (depends on 1)

The method of claim 1, wherein the network device is an egress provider edge (PE) router in a multicast virtual private network (VPN), and the VRF table is associated with a particular VPN instance, such that the UUID also differentiates multiple multicast trees in a same underlay.

### Claim 9 (depends on 1)

The method of claim 1, wherein the forwarding the multicast packet further includes replicating the multicast packet to one or more downstream nodes, and discarding the multicast packet includes performing a drop action upon detecting a UUID mismatch to prevent routing loops or duplicate traffic.

### Claim 10 (depends on 1)

The method of claim 1, wherein the steps further include
generating in a control plane a programmable instruction linking the transport identifier, an assigned UUID, and a hardware identifier for line‐rate lookups; and
installing the programmable instruction into a data plane via a hardware abstraction layer (HAL) or software development kit (SDK), wherein the data plane enforces UUID‐based RPF checks at forwarding time.

### Claim 11 (depends on 10)

The method of claim 10, wherein the steps further include
storing the assigned UUID in a software layer of the network device, wherein upon receiving the multicast packet, the data plane consults a hardware table that references the UUID to execute the RPF check at line rate.

### Claim 12

A network device configured to perform a reverse path forwarding (RPF) check for a multicast packet, the network device comprising circuitry configured to:
receive a multicast packet that includes a transport identifier associated with a multicast distribution tree,
retrieve a universally unique identifier (UUID) corresponding to the transport identifier,
compare the retrieved UUID to a second UUID in a multicast routing entry of a virtual routing and forwarding (VRF) table, and
forward the multicast packet if the retrieved UUID matches the second UUID, or discard the multicast packet otherwise, wherein the UUID provides an abstract handle for the multicast distribution tree independent of a physical interface or an Internet Protocol (IP) next‐hop.

### Claim 13 (depends on 12)

The network device of claim 12, wherein the circuitry is further configured to
prior to the packet being received, assign the UUID to the multicast distribution tree in a control plane, wherein the UUID uniquely identifies the multicast distribution tree irrespective of transport‐layer label assignments.

### Claim 14 (depends on 12)

The network device of claim 12, wherein the circuitry is further configured to
program a label forwarding table or incoming label map (ILM) with the mapping of the transport identifier to the UUID, wherein a data plane references the ILM to retrieve the second UUID for incoming packets.

### Claim 15 (depends on 12)

The network device of claim 12, wherein the multicast packet is received by detecting an MPLS label as the transport identifier, and the MPLS label is removed before UUID comparison in the VRF table.

### Claim 16 (depends on 12)

The network device of claim 12, wherein the circuitry is further configured to
update a UUID‐to‐transport‐identifier mapping in response to route convergence or other network changes, thereby maintaining consistent RPF checks across varying paths.

### Claim 17 (depends on 12)

The network device of claim 12, wherein the network device is an egress provider edge (PE) router in a multicast virtual private network (VPN), and the VRF table is associated with a particular VPN instance, such that the UUID also differentiates multiple multicast trees in a same underlay.

### Claim 18 (depends on 12)

The network device of claim 12, wherein the multicast packet is forwarded by replicating the multicast packet to one or more downstream nodes, and the multicast packet is discarded by a drop action upon detecting a UUID mismatch to prevent routing loops or duplicate traffic.

### Claim 19 (depends on 12)

The network device of claim 12, wherein the circuitry is further configured to
generate in a control plane a programmable instruction linking the transport identifier, an assigned UUID, and a hardware identifier for line‐rate lookups, and
install the programmable instruction into a data plane via a hardware abstraction layer (HAL) or software development kit (SDK), wherein the data plane enforces UUID‐based RPF checks at forwarding time.

### Claim 20

A non-transitory computer-readable medium storing instructions for performing a reverse path forwarding (RPF) check for a multicast packet, the instructions, when executed, cause a network device to perform steps of:
receiving a multicast packet that includes a transport identifier associated with a multicast distribution tree;
retrieving a universally unique identifier (UUID) corresponding to the transport identifier;
comparing the retrieved UUID to a second UUID in a multicast routing entry of a virtual routing and forwarding (VRF) table; and
forwarding the multicast packet if the retrieved UUID matches the second UUID, or discarding the multicast packet otherwise, wherein the UUID provides an abstract handle for the multicast distribution tree independent of a physical interface or an Internet Protocol (IP) next‐hop.
