# US 2026/0019356 A1 · Optimized multicast transport migration procedures

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

- Number: US 2026/0019356 A1
- Document ID: US20260019356A1
- Status: Published application
- Kind: A1
- Application number: 19/335,539
- Filed: 2025-09-22
- Published: 2026-01-15
- Earliest claimed: 2024-02-13
- Assignees: Cisco Technology, Inc.
- Applicants: Cisco Technology, Inc.
- Inventors: Anuj Budhiraja; Mankamana Prasad Mishra; Rishabh Parekh
- Web page: https://patentgrep.com/patent/US20260019356A1

## CPC

- H04L 45/04: {Interdomain routing, e.g. hierarchical routing}
- H04L 45/06: {Deflection routing, e.g. hot-potato routing}
- H04L 45/16: Multipoint routing
- H04L 45/52: Multiprotocol routers
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

The present technology provides solutions for optimizing communications between nodes and can include receiving, by a first node from a second node, an advertisement indicating an advertisement transport protocol supported by the second node, where the first node supports a plurality of transport protocols, and the advertisement transport protocol is one of the plurality of transport protocols, where the first node and the second node are nodes of a border gateway protocol (BGP) community, receiving, by the first node, from a requesting node a request to join the BGP community, where the request includes an attribute indicating a request transport protocol supported by the requesting node, allocating, by the first node and based on the attribute, a resource for the request transport protocol supported by the requesting node, and providing, by the first node, a notification to the second node indicating allocation of the resource for the request transport protocol.

## Claims

### Claim 1

A method comprising:
receiving, from one or more edge nodes, advertisements of transport protocols supported by the respective one or more edge nodes;
receiving, at a first edge node, a request to access a resource, wherein access to the resource is through a second edge node, wherein the first edge node cannot build a tree towards to the second edge node due to an incompatibility of transport protocols between the first edge node and the second edge node;
sending, by the first edge node, a join request to a third edge node, wherein the third edge node has a first compatible transport protocol with the second edge node;
in response to the join request and when a tree from the third edge node to the second edge node does not already exits, the third edge node is configured to build a first tree to the second edge node utilizing the first compatible transport protocol; and
accessing, from the first edge node and via the third edge node, the resource.

### Claim 2 (depends on 1)

The method of claim 1, further comprising:
providing notification to the first edge node that the resource is available.

### Claim 3 (depends on 2)

The method of claim 2, wherein providing the notification includes sending the notification to a route reflector or a rendezvous point.

### Claim 4 (depends on 1)

The method of claim 1, wherein the resource is a website configured to be multicasted.

### Claim 5 (depends on 1)

The method of claim 1, wherein the third edge node adds its respective tree as a forwarding interface.

### Claim 6 (depends on 1)

The method of claim 1, wherein the respective trees are Multicast Distribution Trees.

### Claim 7 (depends on 1)

The method of claim 1, wherein the second edge node and the third edge node communicate through a tunnel configured using the first compatible transport protocol.

### Claim 8 (depends on 1)

The method of claim 1, wherein the first edge node and the third edge node have a second compatible transport protocol, different from the first compatible transport protocol.

### Claim 9 (depends on 1)

The method of claim 1, further comprising:
building, by the first edge node, a second tree to the third edge node using the second compatible transport protocol.

### Claim 10

An edge node comprising:
at least one processor; and
at least one memory configured to store instructions, which when executed by the at least one processor, cause the edge node to:
receive, from one or more other edge nodes, advertisements of transport protocols supported by the respective one or more edge nodes;
receive a request to access a resource, wherein access to the resource is through a second edge node, wherein the edge node cannot build a tree towards to the second edge node due to an incompatibility of transport protocols between the edge node and the second edge node;
send a join request to a third edge node, wherein the third edge node has a first compatible transport protocol with the second edge node;
in response to the join request and when a tree from the third edge node to the second edge node does not already exits, the third edge node is configured to build a first tree to the second edge node utilizing the first compatible transport protocol;
access via the third edge node, the resource.

### Claim 11 (depends on 10)

The edge node of claim 10, further comprising instructions, which when executed cause the edge node to:
receiving notification that the resource is available.

### Claim 12 (depends on 11)

The edge node of claim 11, wherein providing the notification includes sending the notification to a route reflector or a rendezvous point.

### Claim 13 (depends on 10)

The edge node of claim 10, wherein the resource is a website configured to be multicasted.

### Claim 14 (depends on 10)

The edge node of claim 10, wherein the third edge node adds its respective tree as a forwarding interface.

### Claim 15 (depends on 10)

The edge node of claim 10, wherein the respective trees are Multicast Distribution Trees.

### Claim 16 (depends on 10)

The edge node of claim 10, wherein the second edge node and the third edge node communicate through a tunnel configured using the first compatible transport protocol.

### Claim 17 (depends on 10)

The edge node of claim 10, wherein the edge node and the third edge node have a second compatible transport protocol, different from the first compatible transport protocol.

### Claim 18 (depends on 10)

The edge node of claim 10, further comprising instructions, which when executed cause the edge node to:
build a second tree to the third edge node using the second compatible transport protocol.

### Claim 19

A non-transitory computer-readable medium storing instructions, which when executed by at least one processor of an edge node, causes the edge node to:
receive, from one or more other edge nodes, advertisements of transport protocols supported by the respective one or more edge nodes;
receive a request to access a resource, wherein access to the resource is through a second edge node, wherein the edge node cannot build a tree towards to the second edge node due to an incompatibility of transport protocols between the edge node and the second edge node;
send a join request to a third edge node, wherein the third edge node has a first compatible transport protocol with the second edge node;
in response to the join request and when a tree from the third edge node to the second edge node does not already exits, the third edge node is configured to build a first tree to the second edge node utilizing the first compatible transport protocol;
access via the third edge node the resource.

### Claim 20 (depends on 19)

The non-transitory computer-readable medium of claim 19, further comprising instructions, which when executed cause the at least one processor, cause the at least one processor to:
build a second tree to the third edge node using the second compatible transport protocol.
