System and method for multi-source multicasting in content-centric networks

• US 10,091,012 B2
• Filed: 05/19/2017
• Issued: 10/02/2018
• Est. Priority Date: 12/24/2014
• Status: Active Grant

• Current Assignee: Cisco Technology, Inc. (Cisco Systems, Inc.)
• Original Assignee: Cisco Technology, Inc. (Cisco Systems, Inc.)
• Inventors: Garcia-Luna-Aceves, Jose J.
• Primary Examiner(s): Patel, Parth
• Application Number:
  US15/600,557
• Publication Number:
  US 20170257224A1
• Time in Patent Office: 501 Days
• CPC Class Codes: H04L 12/185 with management of multicast group membership
• CPC Class Codes: H04L 12/1854 with non-centralised forwarding system, e.g. chaincast
• CPC Class Codes: H04L 45/122 by minimising distances, e.g. by selecting a route with minimum of number of hops
• CPC Class Codes: H04L 67/63 Routing a service request depending on the request content or context

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

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 from a neighbor node that specifies a prefix associated with the multicast group and specifies a particular node as a root anchor node of the multicast group, wherein the multicast group includes a plurality of anchor nodes and the root anchor node has a name with a lexicographical value that is smaller than lexicographical values of names of other anchor nodes of the plurality of anchor nodes;

determining one or more next-hop neighbors of the first node that;

(a) are reporting nodes different from the particular node as the root anchor node; and

(b) provide a shortest path to one of the other anchor nodes; and

forwarding the update message to the one or more next-hop neighbors.

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

3. The method of claim 1, wherein the determining further comprises:

determining the one or more next-hop neighbors provide the shortest-path and a lexicographically smallest path to the one of the other anchor nodes.

4. 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.

5. 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.

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

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

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 from a neighbor node that specifies a prefix associated with the multicast group and specifies a particular node as a root anchor node of the multicast group, wherein the multicast group includes a plurality of anchor nodes and the root anchor node has a name with a lexicographical value that is smaller than lexicographical values of names of other anchor nodes of the plurality of anchor nodes;

determining one or more next-hop neighbors of the first node that;

(a) are reporting nodes different from the particular node as the root anchor node; and

(b) provide a shortest path to one of the other anchor nodes; and

forwarding the update message to the one or more next-hop neighbors.

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

10. The computer-readable storage medium of claim 8, wherein the determining further comprises:

determining the one or more next-hop neighbors provide the shortest-path and a lexicographically smallest path to the one of the other anchor nodes.

11. The computer-readable storage 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.

12. The computer-readable storage 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.

13. The computer-readable storage medium of claim 11, wherein the first node reports the root anchor node to the second node.

14. The computer-readable storage medium of claim 8, wherein the first node advertises for content corresponding to the prefix.

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 that specifies a prefix associated with the multicast group and specifies a particular node as a root anchor node of the multicast group, wherein the multicast group includes a plurality of anchor nodes and the root anchor node has a name with a lexicographical value that is smaller than lexicographical values of names of other anchor nodes of the plurality of anchor nodes;

determine one or more next-hop neighbors of the system that ;

(a) are reporting nodes different from the particular node as the root anchor node and (b) provide a shortest path to one of the other anchor nodes; and

forward the update message to the one or more next-hop neighbors.

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

17. The system of claim 15, wherein in determining, the processor is further configured to:

determine the one or more next-hop neighbors provide the shortest path and a lexicographically smallest path to the one of the other anchor nodes.

18. 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.

19. 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.

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