# US 2015/0146575 A1 · Dynamically optimized many tree multicast networks

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

- Number: US 2015/0146575 A1
- Document ID: US20150146575A1
- Status: Published application
- Kind: A1
- Application number: 14/092,682
- Filed: 2013-11-27
- Published: 2015-05-28
- Earliest claimed: 2013-11-27
- Assignees: Cisco Technology, Inc.
- Applicants: Cisco Technology, Inc.
- Inventors: Gagandeep Singh
- Web page: https://patentgrep.com/patent/US20150146575A1

## CPC

- H04L 12/185: {with management of multicast group membership}
- H04L 41/0659: by isolating or reconfiguring faulty entities
- H04L 45/16: Multipoint routing
- H04L 45/484: using multiple routing trees
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

In one embodiment, an example method is provided and includes sending link data from a node to a control entity; querying the control entity for a Many Tree assignment; receiving the Many Tree assignment from the control entity at the node; and joining a Many Tree based on the Many Tree assignment.

## Claims

### Claim 1

A method, comprising:
sending link data from a node to a control entity;
querying the control entity for a Many Tree assignment;
receiving the Many Tree assignment from the control entity at the node; and
joining a Many Tree based on the Many Tree assignment.

### Claim 2 (depends on 1)

The method of claim 1, wherein the Many Tree comprises a second tree, and the method further comprises creating a source group route with reverse path forwarding for a first tree on the node prior to the querying for the Many Tree assignment.

### Claim 3 (depends on 2)

The method of claim 2, wherein the receiving comprises receiving a reverse path forwarding assignment from the control entity and the joining comprises changing the reverse path forwarding of the first tree to the reverse path forwarding of the second tree on the node.

### Claim 4 (depends on 3)

The method of claim 3, wherein the node comprises a last hop router on the first tree.

### Claim 5 (depends on 3)

The method of claim 3, wherein the node comprises an intermediate node that is being queried by a downstream node to select a reverse path for source group entry.

### Claim 6 (depends on 3)

The method of claim 3, wherein the node comprises a node triggering a source group join towards a first hop router.

### Claim 7 (depends on 1)

The method of claim 1, wherein the tree joined in the joining comprises a Many Tree, and the method further comprises creating a source group route with reverse path forwarding for a shortest path tree on the node prior to the querying for the Many Tree assignment.

### Claim 8 (depends on 1)

The method of claim 1, wherein the tree joined in the joining comprises a Many Tree, and the method further comprises creating a source group route with reverse path forwarding of a shared path tree on the node prior to the querying for the Many Tree assignment.

### Claim 9 (depends on 1)

The method of claim 1, wherein the receiving comprises:
receiving a multicast tree assignment from the control entity, wherein the Many Tree assignment comprises a plurality of reverse path forwarding assignments each having a priority relative to one another.

### Claim 10 (depends on 1)

The method of claim 1, wherein the joining comprises:
determining that a join-prune timer has expired; and
joining a tree based on the multicast flow tree assignment.

### Claim 11

A method, comprising:
receiving link data from a plurality of nodes and generating a data analysis set from the link data;
receiving a query for a Many Tree assignment from a selected node of the plurality of nodes;
determining a Many Tree assignment for the selected node based on the data analysis set; and
sending the Many Tree assignment to the selected node.

### Claim 12 (depends on 11)

The method of claim 11, wherein the determining comprises running a map reduce algorithm on the data analysis set.

### Claim 13 (depends on 11)

The method of claim 11, wherein the selected node comprises a second node and the method further comprises:
determining a heartbeat failure with a first node of the plurality of nodes; and
removing data of the first node from the data analysis set.

### Claim 14 (depends on 11)

The method of claim 11, wherein the determining comprises determining a reverse path forwarding assignment for the selected node based on the data analysis set.

### Claim 15

A node, comprising:
one or more processors coupled to a memory, the apparatus being configured to:
send link data to a control entity;
query the control entity for a Many Tree assignment;
receive the Many Tree assignment from the control entity; and
join a tree based on the Many Tree assignment.

### Claim 16 (depends on 15)

The node of claim 15, wherein the node is further configured to join a shortest path tree by creating a source group route with reverse path forwarding for the shortest path tree on the node prior to the query for a Many Tree assignment.

### Claim 17 (depends on 15)

The node of claim 15, wherein the tree comprises a Many Tree, and the node is further configured to join a shared path tree by creating a source group route with reverse path forwarding for the shared path tree on the node. prior to the query for a Many Tree assignment

### Claim 18 (depends on 15)

The node of claim 15, wherein the node is a selected node of a plurality of nodes and the node further comprises:
a control entity coupled to the plurality of nodes, the control entity configured to:
receive link data from each of the plurality of nodes and generate a data analysis set;
receive a query for a Many Tree assignment from the selected node;
determine a Many Tree assignment for the selected node based on the data analysis set; and
send the Many Tree assignment to the selected node.

### Claim 19

Logic encoded in one or more non-transitory media that includes instructions for execution and when executed by a processor is operable to:
send link data from a node to a control entity;
query the control entity for a Many Tree assignment;
receive the Many Tree assignment from the control entity at the node; and
join a Many Tree based on the Many Tree assignment.

### Claim 20 (depends on 19)

The media of claim 19, wherein the Many Tree comprises a second tree, and the method further comprises creating a source group route with reverse path forwarding for a first tree on the node prior to the querying for the Many Tree assignment.
