System and method for on-demand content exchange with adaptive naming in information-centric networks

• US 10,333,840 B2
• Filed: 02/06/2015
• Issued: 06/25/2019
• Est. Priority Date: 02/06/2015
• 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): Srivastava, Vivek
• Assistant Examiner(s): Raza, Muhammad
• Application Number:
  US14/616,371
• Publication Number:
  US 20160234110A1
• Time in Patent Office: 1,600 Days
• CPC Class Codes: H04L 45/20 Hop count for routing purposes, e.g. TTL
• CPC Class Codes: H04L 45/306 Route determination based on the nature of the carried application
• CPC Class Codes: H04L 45/60 Router architectures
• CPC Class Codes: H04L 45/74 Address processing for routing
• CPC Class Codes: H04L 67/568 Storing data temporarily at an intermediate stage, e.g. caching
• 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 content exchange in an information-centric network (ICN). During operation, a first node in the ICN receives an interest for a piece of content from a second node. The interest indicates a name of the piece of content and an incoming identifier assigned to the interest by the second node. The system identifies a matching entry in an identifier table stored on the first node that corresponds to the incoming identifier. The matching entry indicates a next-hop neighbor and an outgoing identifier. The system then updates the interest by replacing the incoming identifier with the outgoing identifier, and forwards the updated interest to the next-hop neighbor.

Claims

1. A computer-executable method for content exchange in an information-centric network (ICN), the method comprising:

receiving, by a first node in the ICN, an interest for content from a second node, wherein the interest indicates a name of the content and an incoming identifier assigned to the interest by the second node, wherein the incoming identifier is a concatenation of a predecessor token that indicates a previous-hop neighbor to the second node, a forwarding token, and an anchor token that indicates a destination node that advertises the content, and the forwarding token is assigned by the second node and is unique to a combination of the previous-hop neighbor to the second node, the first node, and the destination node, and wherein the received interest further indicates a hop count from the second node to the destination node that advertises the content;

determining, based on routing information stored on the first node and the hop count, whether a distance-based forwarding condition is met to determine whether the first node is closer to the destination node than the second node from which the interest was received, wherein in response to the distance-based forwarding condition not being met, dropping the interest and sending a control message back to the second node indicating that an interest loop is detected, and in response to the distance-based forwarding condition being met;

determining whether a matching entry is found in an identifier table stored on the first node that corresponds to the incoming identifier, wherein in response to the matching entry being found in the identifier table, the matching entry indicates a next-hop neighbor and an outgoing identifier, and in response to no matching entry corresponding to the incoming identifier being found in the identifier table;

identifying a next-hop neighbor based on the routing information stored on the first node; and

creating an entry in the identifier table for the received interest, wherein creating the entry comprises generating an outgoing identifier, and the generated outgoing identifier indicates an outgoing forwarding token that is assigned by the first node and is unique to a combination of the second node, the next-hop neighbor, and the destination node that advertises the content;

updating the interest by replacing the incoming identifier with the outgoing identifier, wherein the outgoing identifier includes an outgoing predecessor token, an outgoing forwarding token, and an outgoing anchor token, the outgoing predecessor token is a same as the forwarding token assigned by the second node, and the outgoing forwarding token is assigned by the first node and is unique to a combination of the second node, the next-hop neighbor, and the destination node indicated by the outgoing anchor token;

forwarding the updated interest to the next-hop neighbor;

receiving, by the first node, a content object in response to the interest, wherein the content object includes a content identifier, wherein the content identifier includes, at least in part, the outgoing forwarding token assigned by the first node;

identifying a second matching entry in the identifier table stored on the first node that corresponds to the content identifier wherein the second matching entry indicates the second node and an identifier associated with the second node, wherein the identifier associated with the second node that is stored on the first node includes, at least in part, the forwarding token assigned by the second node;

updating the content object by replacing the content identifier with the previously received incoming identifier associated with the second node; and

forwarding the updated content object to the second node.

2. The method of claim 1, wherein the entry in the identifier table has a lifetime that is decremented while the entry is stored in the identifier table.

3. The method of claim 2, wherein the entry is deleted when the lifetime reaches zero.

4. The method of claim 1, wherein the identifier table includes a mapping between the outgoing identifier and the content identifier.

5. The method of claim 1, wherein the outgoing identifier is a concatenation of the outgoing predecessor token, the outgoing forwarding token, and the anchor token.

6. The method of claim 1, wherein prior to creating the entry in the identifier table, determining a hop count from the first node to the destination node that advertises the content based on the routing information stored on the first node.

7. The method of claim 6, further comprising:

determining whether the distance-based forwarding condition is met based on the hop count from the first node to the destination node that advertises the content, wherein in response to the distance-based forwarding condition not being met, dropping the interest and sending a control message back to the second node indicating that an interest loop is detected, and in response to the distance-based forwarding condition being met, creating the entry in the identifier table.

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 content exchange in an information-centric network (ICN), the method comprising:

receiving, by the computing device in the ICN, an interest for content from a node, wherein the interest indicates a name of the content and an incoming identifier assigned to the interest by the node, wherein the incoming identifier is a concatenation of a predecessor token that indicates a previous-hop neighbor to the node, a forwarding token, and an anchor token that indicates a destination node that advertises the content, and the forwarding token is assigned by the node and is unique to a combination of the previous-hop neighbor to the node, the computing device, and the destination node, and wherein the received interest further indicates a hop count from the node to the destination node that advertises the content;

determining, based on routing information stored on the computing device and the hop count, whether a distance-based forwarding condition is met to determine whether the computing device is closer to the destination node than the node from which the interest was received, wherein in response to the distance-based forwarding condition not being met, dropping the interest and sending a control message back to the node indicating that an interest loop is detected, and in response to the distance-based forwarding condition being met;

determining whether a matching entry is found in an identifier table stored on the computing device that corresponds to the incoming identifier, wherein in response to the matching entry being found in the identifier table, the matching entry indicates a next-hop neighbor and an outgoing identifier, and the outgoing identifier includes an outgoing predecessor token, an outgoing forwarding token, and an outgoing anchor token, the outgoing predecessor token is a same as the forwarding token assigned by the node, and the outgoing forwarding token is assigned by the computing device and is unique to a combination of the node, the next-hop neighbor, and the destination node indicated by the outgoing anchor token, and in response to no matching entry corresponding to the incoming identifier being found in the identifier table;

identifying a next-hop neighbor based on routing information stored on the computing device; and

creating an entry in the identifier table for the received interest, wherein creating the entry comprises generating an outgoing identifier, and the generated outgoing identifier indicates an outgoing forwarding token that is assigned by the computing device and is unique to a combination of the node, the next-hop neighbor, and the destination node that advertises the content;

updating the interest by replacing the incoming identifier with the outgoing identifier;

forwarding the updated interest to the next-hop neighbor;

receiving, by the computing device, a content object in response to the interest, wherein the content object includes a content identifier, wherein the content identifier includes, at least in part, the outgoing forwarding token assigned by the computing device;

identifying a second matching entry in the identifier table stored on the computing device that corresponds to the content identifier, wherein the second matching entry indicates the node and an identifier associated with the node, wherein the identifier associated with the node that is stored on the computing device includes, at least in part, the forwarding token assigned by the node;

updating the content object by replacing the content identifier with the previously received incoming identifier associated with the node; and

forwarding the updated content object to the node.

9. The computer-readable storage medium of claim 8, wherein the entry in the identifier table has a lifetime that is decremented while the entry is stored in the identifier table.

10. The computer-readable storage medium of claim 9, wherein the entry is deleted when the lifetime reaches zero.

11. The computer-readable storage medium of claim 8, wherein the identifier table includes a mapping between the outgoing identifier and the content identifier.

12. The computer-readable storage medium of claim 8, wherein the outgoing identifier is a concatenation of the outgoing predecessor token, the outgoing forwarding token, and the anchor token.

13. The computer-readable storage medium of claim 8, wherein prior to creating the entry in the identifier table, the method further comprises determining a hop count from the computing device to the destination node that advertises the content based on the routing information stored on the computing device.

14. The computer-readable storage medium of claim 8, the method further comprising:

determining whether the distance-based forwarding condition is met based on the hop count from the computing device to the destination node that advertises the content, wherein in response to the distance-based forwarding condition not being met, dropping the interest and sending a control message back to the node indicating that an interest loop is detected, and in response to the distance-based forwarding condition being met, creating the entry in the identifier table.

15. A computer system for content exchange in an information-centric network (ICN), the system comprising:

a memory for storing instructions for an interest-receiving module, an interest-processing module, a forwarding module, and a content-object processing module;

a processor for executing the instructions, wherein executing the instructions causes the system to perform operations, comprising;

the interest-receiving module is configured to receive, by a first node in the ICN, an interest for content from a second node, wherein the interest indicates a name of the content and an incoming identifier assigned to the interest by the second node, wherein the incoming identifier is a concatenation of a predecessor token that indicates a previous-hop neighbor to the second node, a forwarding token, and an anchor token that indicates a destination node that advertises the content, and the forwarding token is assigned by the second node and is unique to a combination of the previous-hop neighbor to the second node, the first node, and the destination node, and wherein the received interest further indicates a hop count from the second node to the destination node that advertises the content;

the interest-processing module is configured to

determine, based on routing information stored on the first node and the hop count, whether a distance-based forwarding condition is met to determine whether the first node is closer to the destination node than the second node from which the interest was received, wherein in response to the distance-based forwarding condition not being met, drop the interest and send a control message back to the second node indicating that an interest loop is detected, and in response to the distance-based forwarding condition being met;

determine whether a matching entry is found in an identifier table stored on the first node that corresponds to the incoming identifier, wherein in response to the matching entry being found, the matching entry indicates a next-hop neighbor and an outgoing identifier, and in response to no matching entry corresponding to the incoming identifier being found in the identifier table;

identify a next-hop neighbor based on the routing information stored on the first node; and

create an entry in the identifier table for the received interest, wherein creating the entry comprises generating an outgoing identifier, and the generated outgoing identifier indicates an outgoing forwarding token that is assigned by the first node and is unique to a combination of the second node, the next-hop neighbor, and the destination node that advertises the content; and

update the interest by replacing the incoming identifier with the outgoing identifier, wherein the outgoing identifier includes an outgoing predecessor token, an outgoing forwarding token, and an outgoing anchor token, the outgoing predecessor token is a same as the forwarding token assigned by the second node, and the outgoing forwarding token assigned by the first node and is unique to a combination of the second node, the next-hop neighbor, and a destination node indicated by the outgoing anchor token;

the forwarding module is configured to forward the updated interest to the next-hop neighbor; and

the content-object processing module is configured to

receive, by the first node, a content object in response to the interest, wherein the content object includes a content identifier, wherein the content identifier includes, at least in part, the outgoing forwarding token assigned by the first node;

identify a second matching entry in the identifier table stored on the first node that corresponds to the content identifier, wherein the second matching entry indicates the second node and an identifier associated with the second node, wherein the identifier associated with the second node that is stored on the first node includes, at least in part, the forwarding token assigned by the second node; and

update the content object by replacing the content identifier with the previously received incoming identifier associated with the second node, wherein the forwarding module is configured to forward the updated content object to the second node.

16. The system of claim 15, wherein the entry in the identifier table has a lifetime that is decremented while the entry is stored in the identifier table.

17. The system of claim 16, wherein the entry is deleted when the lifetime reaches zero.

18. The system of claim 15, wherein the identifier table includes a mapping between the outgoing identifier and the content identifier.

19. They system of claim 15, wherein the outgoing identifier is a concatenation of the outgoing predecessor token, the outgoing forwarding token, and the anchor token.

20. The system of claim 15, wherein the interest-processing module is further configured to:

determine a hop count from the first node to the destination node that advertises the content based on the routing information stored on the first node prior to creating the entry in the identifier table; and

determine whether the distance-based forwarding condition is met based on the hop count from the first node to the destination node that advertises the content, wherein in response to the distance-based forwarding condition not being met, drop the interest and send a control message back to the second node indicating that an interest loop is detected, and in response to the distance-based forwarding condition being met, create the entry in the identifier table.