# US 2017/0257224 A1 · System and method for multi-source multicasting in content-centric networks

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

- Number: US 2017/0257224 A1
- Document ID: US20170257224A1
- Status: Published application
- Kind: A1
- Application number: 15/600,557
- Filed: 2017-05-19
- Published: 2017-09-07
- Earliest claimed: 2014-12-24
- Assignees: Cisco Technology, Inc.
- Applicants: Cisco Technology, Inc.
- Inventors: Jose J. Garcia-Luna-Aceves
- Web page: https://patentgrep.com/patent/US20170257224A1

## CPC

- H04L 12/185: {with management of multicast group membership}
- H04L 12/1854: {with non-centralised forwarding system, e.g. chaincast}
- H04L 45/122: by minimising distances, e.g. by selecting a route with minimum of number of hops
- H04L 67/63: Routing a service request depending on the request content or context
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

One embodiment of the present invention provides a system for updating routing information associated with a multicast group in an information-centric network (ICN). During operation, a first node in the ICN receives an update message for the multicast group from a neighbor node. The multicast group includes a root anchor node and a number of anchor nodes with the root anchor node having a smaller name than the anchor nodes. The update message specifies a prefix associated with the multicast group and the root anchor node of the multicast group. The system selects, based on topology information stored on the first node, from neighbors of the first node one or more next-hop neighbors that meet a notification condition, and forwards the update message to the one or more next-hop neighbors.

## Claims

### Claim 1

A computer-executable method for updating routing information associated with a multicast group in an information-centric network (ICN), the method comprising:
receiving, by a first node in the ICN, an update message for the multicast group from a neighbor node, wherein the multicast group includes a number of anchor nodes including a root anchor node having a smaller name than names of the other anchor nodes, and the update message specifies a prefix;
determining one or more next-hop neighbors of the first node that have not reported the same root anchor viewed by the first node as an anchor or root anchor of the one or more next-hop neighbors; and
forwarding the update message to the one or more next-hop neighbors.

### Claim 2 (depends on 1)

The method of claim 1, wherein the one or more next-hop neighbors report the first node as a preferred anchor node.

### Claim 3 (depends on 1)

The method of claim 1, wherein the one or more next-hop neighbors provide a shortest path to at least one of the anchor nodes.

### Claim 4 (depends on 1)

The method of claim 1, further comprising:
receiving a join request from a second node, wherein the first node is a next-hop neighbor of the second node to the root anchor node, and the first node provides a shortest path from the second node to the root anchor node.

### Claim 5 (depends on 4)

The method of claim 4, further comprising:
storing an entry for the join request in a data structure that indicates the second node; and
receiving a response to the join request from the root anchor node or an anchor node of the multicast group.

### Claim 6 (depends on 1)

The method of claim 1, wherein the first node reports the root anchor node to the second node.

### Claim 7 (depends on 1)

The method of claim 1, wherein the first node advertises for content corresponding to the prefix.

### Claim 8

A non-transitory, computer-readable storage medium storing instructions that, when executed by a computing device, cause the computing device to perform a method for updating routing information associated with a multicast group in an information-centric network (ICN), the method comprising:
receiving, by a first node in the ICN, an update message for the multicast group from a neighbor node, wherein the multicast group includes a number of anchor nodes including a root anchor node having a smaller name than names of the other anchor nodes, and the update message specifies a prefix;
determining one or more next-hop neighbors of the first node that have not reported the same root anchor viewed by the first node as an anchor or root anchor of the one or more next-hop neighbors; and
forwarding the update message to the one or more next-hop neighbors.

### Claim 9 (depends on 8)

The medium of claim 8, wherein the one or more next-hop neighbors report the first node as a preferred anchor node.

### Claim 10 (depends on 8)

The medium of claim 8, wherein the one or more next-hop neighbors provide a shortest path to at least one of the anchor nodes.

### Claim 11 (depends on 8)

The medium of claim 8, the method further comprising:
receiving a join request from a second node, wherein the first node is a next-hop neighbor of the second node to the root anchor node, and the first node provides a shortest path from the second node to the root anchor node.

### Claim 12 (depends on 11)

The medium of claim 11, the method further comprising:
storing an entry for the join request in a data structure that indicates the second node; and
receiving a response to the join request from the root anchor node or an anchor node of the multicast group.

### Claim 13 (depends on 8)

The medium of claim 8, wherein the first node reports the root anchor node to the second node.

### Claim 14 (depends on 8)

The medium of claim 8, wherein the first node advertises for content corresponding to the prefix.

### Claim 15

A computer system for updating routing information associated with a multicast group in an information-centric network (ICN), the system comprising:
a processor configured to receive an update message for the multicast group from a neighbor node, wherein the multicast group includes a number of anchor nodes including a root anchor node having a smaller name than names of the other anchor nodes, and the update message specifies a prefix,
the processor further configured to determine one or more next-hop neighbors of the system that have not reported the same root anchor viewed by the system as an anchor or root anchor of the one or more next-hop neighbors,
the processor further configured to forward the update message to the one or more next-hop neighbors.

### Claim 16 (depends on 15)

The system of claim 15, wherein the one or more next-hop neighbors report the system as a preferred anchor node.

### Claim 17 (depends on 15)

The system of claim 15, wherein the one or more next-hop neighbors provide a shortest path to at least one of the anchor nodes.

### Claim 18 (depends on 15)

The system of claim 15, wherein the processor is further configured to receive a join request from a second node, wherein the system is a next-hop neighbor of the second node to the root anchor node, and the system provides a shortest path from the second node to the root anchor node.

### Claim 19 (depends on 18)

The system of claim 18, wherein the processor is further configured to store an entry for the join request in a data structure that indicates the second node and to receive a response to the join request from the root anchor node or an anchor node of the multicast group.

### Claim 20 (depends on 15)

The system of claim 15, wherein the processor is further configured to report the root anchor node to the second node.
