System and method for stateless information-centric networking

• US 10,454,820 B2
• Filed: 09/29/2015
• Issued: 10/22/2019
• Est. Priority Date: 09/29/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): Ferris, Derrick W
• Assistant Examiner(s): Ali, Farhad
• Application Number:
  US14/869,740
• Publication Number:
  US 20170093710A1
• Time in Patent Office: 1,484 Days
• CPC Class Codes: H04L 45/18 Loop-free operations
• CPC Class Codes: H04L 45/74 Address processing for routing
• 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 router in an information-centric network (ICN). The router includes a receiving module configured to receive an interest for a piece of content. The interest indicates a name associated with the piece of content. The router also includes an interest-processing module configured to: determine whether the interest can be forwarded; in response to determining that the interest can be forwarded to a second router, select an identifier from a set of identifiers assigned to the router by the second router; and process the interest by inserting the identifier into the interest. The router further includes a forwarding module configured to forward the processed interest to the second router.

Claims

1. A router in an information-centric network (ICN), comprising:

a receiving module configured to receive an interest from a previous router for a piece of content, wherein the interest indicates a name associated with the piece of content and a previous identifier, wherein the previous identifier is selected from a set of identifiers assigned to the previous router by the router for a local interval between the router and the previous router in which the router does not assign a same set of identifiers to more than one router;

an interest-processing module configured to;

determine whether the interest can be forwarded;

in response to determining that the interest can be forwarded to a second router, select an identifier from a set of identifiers assigned to the router by the second router for a local interval between the router and the second router in which the second router does not assign a same set of identifiers to more than one router, wherein the set of identifiers is received by the router in one of a hello message, a link-state advertisement, or a distance update and stored in a local interval set table of the router, wherein the identifier selected from the set of identifiers anonymizes an originator of the interest, and wherein to select the identifier, the interest-processing module is further configured to;

perform a lookup in a local routing table based on the previous identifier;

in response to a matching entry being found, using the matching entry as the selected identifier; and

in response to no matching entry being found, apply a bijection function to the previous identifier to obtain the selected identifier from the set of identifiers assigned by the second router and stored in the local interval set table to generate an entry in the local routing table, wherein the generated entry specifies the selected identifier and the previous router;

process the interest by inserting the selected identifier into the interest; and

a forwarding module configured to forward the processed interest to the second router.

2. The router of claim 1, wherein the forwarding module is further configured to:

in response to the interest-processing module determining that the interest cannot be forwarded, send a response to the interest.

3. The router of claim 2,

wherein the interest-processing module is configured to determine that the interest cannot be forwarded based on one of:

the piece of content cannot be found;

no route can be found to a destination router advertising the piece of content; and

the interest is traversing a loop; and

wherein the response sent by the forwarding module includes a negative acknowledgment.

4. The router of claim 1, wherein the interest-processing module is configured to:

in response to determining that the interest is received from a local user of the router, determine, based on a local interest table, whether a previous interest for the same piece of content exists;

if so,

aggregate the received interest by adding the local user to the local interest table; and

if not,

create a new entry in the local interest table for the piece of content.

5. The router of claim 1, wherein the interest-process module is further configured to:

generate the processed interest by replacing the previous identifier carried in the received interest with the selected identifier.

6. The router of claim 1, wherein the set of identifiers comprises a set of continuously incrementing or decrementing numeric values.

7. The router of claim 1, further comprising:

a response-receiving module configured to receive a response to the interest;

a response-processing module configured to process the received response; and

a response-forwarding module configured to forward the processed response;

wherein while processing the received response, the response-processing module is configured to;

identify a matching entry in the local routing table based on a response identifier carried by the response, wherein the matching entry specifies the previous router;

map the response identifier to a response-forwarding identifier using a function specific to the previous router; and

generate the processed response by replacing the response identifier with the response-forwarding identifier.

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, at a first node in the ICN, an interest from a previous node for a piece of content, wherein the interest indicates a name associated with the piece of content and a previous identifier, wherein the previous identifier is selected from a set of identifiers assigned to the previous node by the first node for a local interval between the first node and the previous node in which the first node does not assign a same set of identifiers to more than one node;

in response to determining that the interest can be forwarded to a second node, selecting, an identifier from a set of identifiers assigned to the first node by the second node for a local interval between the first node and the second node in which the second node does not assign a same set of identifiers to more than one node, wherein the set of identifiers is received by the first node in one of a hello message, a link-state advertisement, or a distance update and stored in a local interval set table of the first node, wherein the identifier selected from the set of identifiers anonymizes an originator of the interest, and wherein selecting the identifier further comprises;

performing a lookup in a local routing table based on the previous identifier;

in response to a matching entry being found, using the matching entry as the selected identifier; and

in response to no matching entry being found, applying a bijection function to the previous identifier to obtain the selected identifier from the set of identifiers assigned by the second node and stored in the local interval set table to generate an entry in the local routing table, wherein the generated entry specifies the selected identifier and the previous node;

processing the interest by inserting the selected identifier into the interest; and

forwarding the processed interest to the second node.

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

sending a response to the interest, in response to determining that the interest cannot be forwarded.

10. The computer-readable storage medium of claim 9, wherein determining that the interest cannot be forwarded involves determining one of:

the piece of content cannot be found;

no route can be found to a destination router advertising the piece of content; and

the interest is traversing a loop; and

wherein the response includes a negative acknowledgment.

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

in response to determining that the interest is received from a local user of the first node, determining, based on a local interest table, whether a previous interest for the same piece of content exists;

if so,

aggregating the received interest by adding the local user to the local interest table; and

if not,

creating a new entry in the local interest table for the piece of content.

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

generating the processed interest by replacing the previous identifier carried in the received interest with the selected identifier.

13. The computer-readable storage medium of claim 8, wherein the set of identifiers comprises a set of continuously incrementing or decrementing numeric values.

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

receiving a response to the interest;

identifying a matching entry in the local routing table based on a response identifier carried by the response, wherein the matching entry specifies the previous node;

mapping the response identifier to a response-forwarding identifier using a function specific to the previous node;

generating a processed response by replacing the response identifier with the response-forwarding identifier; and

forwarding the processed response to the previous node.

15. A computer-executable method, comprising:

receiving, at a first node in an information-centric network (ICN), an interest from a previous node for a piece of content, wherein the interest indicates a name associated with the piece of content and a previous identifier, wherein the previous identifier is selected from a set of identifiers assigned to the previous node by the first node for a local interval between the first node and the previous node in which the first node does not assign a same set of identifiers to more than one node;

in response to determining that the interest can be forwarded to a second node, selecting an identifier from a set of identifiers assigned to the first node by the second node for a local interval between the first node and the second node in which the second node does not assign a same set of identifiers to more than one node, wherein the set of identifiers is received by the first node in one of a hello message, a link-state advertisement, or a distance update and stored in a local interval set table of the first node, wherein the identifier selected from the set of identifiers anonymizes an address of an originator of the interest, and wherein selecting the identifier further comprises;

performing a lookup in a local routing table based on the previous identifier;

in response to a matching entry being found, using the matching entry as the selected identifier; and

in response to no matching entry being found, applying a bijection function to the previous identifier to obtain the selected identifier from the set of identifiers assigned by the second node and stored in the local interval set table to generate an entry in the local routing table, wherein the generated entry specifies the selected identifier and the previous node;

processing the interest by inserting the selected identifier into the interest; and

forwarding the processed interest to the second node.

16. The method of claim 15, further comprising sending a response to the interest, in response to determining that the interest cannot be forwarded.

17. The method of claim 16, wherein determining that the interest cannot be forwarded involves determining one of:

the piece of content cannot be found;

no route can be found to a destination router advertising the piece of content; and

the interest is traversing a loop; and

wherein the response includes a negative acknowledgment.

18. The method of claim 15, further comprising:

in response to determining that the interest is received from a local user of the first node, determining, based on a local interest table, whether a previous interest for the same piece of content exists;

if so,

aggregating the received interest by adding the local user to the local interest table; and

if not,

creating a new entry in the local interest table for the piece of content.

19. The method of claim 15, wherein the method further comprises:

generating the processed interest by replacing the previous identifier carried in the received interest with the selected identifier.

20. The method of claim 15, wherein the set of identifiers comprises a set of continuously incrementing or decrementing numeric values.

21. The method of claim 15, further comprising:

receiving a response to the interest;

identifying a matching entry in local routing table based on a response identifier carried by the response, wherein the matching entry specifies the previous node;

mapping the response identifier to a response-forwarding identifier using a function specific to the previous node;

generating a processed response by replacing the response identifier with the response-forwarding identifier; and

forwarding the processed response to the previous node.