System and method for eliminating undetected interest looping in information-centric networks

• US 10,313,227 B2
• Filed: 09/24/2015
• Issued: 06/04/2019
• Est. Priority Date: 09/24/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): Mohebbi, Kouroush
• Application Number:
  US14/864,571
• Publication Number:
  US 20170093691A1
• Time in Patent Office: 1,349 Days
• Field of Search: None
• CPC Class Codes: H04L 12/1863 comprising mechanisms for improved reliability, e.g. status reports arrangements for detecting or preventing errors by carrying supervisory signal the return channel H04L1/16
• CPC Class Codes: H04L 45/021 Ensuring consistency of routing table updates, e.g. by using epoch numbers
• CPC Class Codes: H04L 45/12 Shortest path evaluation
• 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 45/18 Loop-free operations
• CPC Class Codes: H04L 45/245 Link aggregation, e.g. trunking
• CPC Class Codes: H04L 45/306 Route determination based on the nature of the carried application
• CPC Class Codes: H04L 45/38 Flow based routing

Abstract

One embodiment of the present invention provides a system for correctly processing interests in an information-centric network (ICN). During operation, the system receives, by a first node in the ICN, an interest for a piece of content from a second node. The interest specifies a name of the content piece. The system determines, based on forwarding information and information associated with pending interests stored on the first node, whether a forwarding condition or an interest aggregation condition is satisfied. In response to the forwarding condition being satisfied, the system forwards the interest. In response to the interest aggregation condition being satisfied, the system aggregates the interest.

Claims

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

receiving, by a first node in the ICN, an interest for a piece of content from a second node, wherein the interest specifies a name of the content piece;

determining, based on forwarding information, whether a forwarding condition is satisfied;

determining, based on information associated with pending interests stored on the first node, whether an interest aggregation condition is satisfied, wherein the interest aggregation condition is satisfied when a distance from the first node to a destination node is less than a distance from the second node to the destination node and wherein the information associated with pending interests comprises a number of allowed retransmissions and a remaining lifetime of the interest for a piece of content;

in response to the forwarding condition being satisfied, forwarding the interest;

in response to the interest aggregation condition being satisfied, aggregating the interest, wherein aggregating the interest comprises not forwarding the interest; and

in response to neither the forwarding condition nor the interest aggregation condition being satisfied, dropping the interest and sending to the second node a control message indicating that the interest is traversing a loop.

2. The method of claim 1, wherein the forwarding information includes one or more entries associated with the name of the content piece, wherein a respective entry specifies a next hop neighbor through which the first node can forward the interest to a destination node storing the content piece, and wherein the entry further specifies a distance from the next hop neighbor to the destination node.

3. The method of claim 2, wherein the forwarding condition is satisfied if a distance specified by at least one entry of the forwarding information is less than a distance from the second node to the destination node.

4. The method of claim 2, wherein the entry further specifies a ranking of the next hop neighbor, and wherein the interest is forwarded to a next hop neighbor that is highest ranked among neighbors that satisfy the forwarding condition.

5. The method of claim 1, wherein the information associated with the pending interests further comprises an entry associated with the name of the content piece, and wherein the entry specifies a distance from the first node to the destination node storing the content piece.

6. The method of claim 5, wherein the entry further specifies a set of incoming neighbors from which interests for the content piece are received, and wherein the interest is aggregated by adding the second node to the set of incoming neighbors.

7. The method of claim 1, wherein the control message is a negative acknowledgement (NACK).

8. The method of claim 1, wherein the information associated with the pending interests further comprises a set of next hop neighbors.

9. 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 correctly processing interests in an information-centric network (ICN), the method comprising:

receiving, by a first node in the ICN, an interest for a piece of content from a second node, wherein the interest specifies a name of the content piece;

determining, based on forwarding information, whether a forwarding condition is satisfied;

determining, based on information associated with pending interests stored on the first node, whether an interest aggregation condition is satisfied, wherein the interest aggregation condition is satisfied when a distance from the first node to a destination node is less than a distance form the second node to the destination node, and wherein the information associated with pending interests comprises a number of allowed retransmissions and a remaining lifetime of the interest for a piece of content;

in response to the forwarding condition being satisfied, forwarding the interest;

in response to the interest aggregation condition being satisfied, aggregating the interest, wherein aggregating the interest comprises not forwarding the interest; and

in response to neither the forwarding condition nor the interest aggregation condition being satisfied, dropping the interest and sending to the second node a control message indicating that the interest is traversing a loop.

10. The computer-readable storage medium of claim 9, wherein the forwarding information includes one or more entries associated with the name of the content piece, wherein a respective entry specifies a next hop neighbor through which the first node can forward the interest to a destination node storing the content piece, and wherein the entry further specifies a distance from the next hop neighbor to the destination node.

11. The computer-readable storage medium of claim 10, wherein the forwarding condition is satisfied if a distance specified by at least one entry of the forwarding information is less than a distance from the second node to the destination node.

12. The computer-readable storage medium of claim 10, wherein the entry further specifies a ranking of the next hop neighbor, and wherein the interest is forwarded to a next hop neighbor that is highest ranked among neighbors that satisfy the forwarding condition.

13. The computer-readable storage medium of claim 9, wherein the information associated with the pending interests further comprises an entry associated with the name of the content piece, and wherein the entry specifies a distance from the first node to the destination node storing the content piece.

14. The computer-readable storage medium of claim 13, wherein the entry further specifies a set of incoming neighbors from which interests for the content piece are received, and wherein the interest is aggregated by adding the second node to the set of incoming neighbors.

15. The computer-readable storage medium of claim 9, wherein the control message is a negative acknowledgement (NACK).

16. The computer-readable storage medium of claim 9, wherein the information associated with the pending interests further comprises a set of next hop neighbors.

17. A computer system for correctly processing interests in an information-centric network (ICN), the system comprising:

a memory for storing instructions associated with an interest-receiving module, an interest-processing module, a forwarding module, an interest aggregation module, and a control-message generation 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 a piece of content from a second node, wherein the interest specifies a name of the content piece;

the interest-processing module is configured to determine, based on forwarding information, whether a forwarding condition is satisfied, wherein the interest-processing module is further configured to determine, based on information associated with pending interests stored on the first node, whether an interest aggregation condition is satisfied, wherein the interest aggregation condition is satisfied when a distance from the first node to a destination node is less than a distance from the second node to the destination node, wherein the interest-processing module is further configured to drop the interest when neither the forwarding condition nor the interest aggregation condition is satisfied, and wherein the information associated with pending interests comprises a number of allowed retransmissions and a remaining lifetime of the interest for a piece of content;

the forwarding module is configured to forward the interest in response to the forwarding condition being satisfied;

the interest aggregation module is configured to aggregate the interest in response to the interest aggregation condition being satisfied, wherein aggregating the interest comprises not forwarding the interest; and

the control-message generation module is configured, in response to neither the forwarding condition nor the interest aggregation condition being satisfied, to generate a control message indicating that the interest is traversing a loop and to send the control message to the second node.

18. The system of claim 17, wherein the forwarding information includes one or more entries associated with the name of the content piece, wherein a respective entry specifies a next hop neighbor through which the first node can forward the interest to a destination node storing the content piece, and wherein the entry further specifies a distance from the next hop neighbor to the destination node.

19. The system of claim 18, wherein the forwarding condition is satisfied if a distance specified by at least one entry of the forwarding information is less than a distance from the second node to the destination node.

20. The system of claim 18, wherein the entry further specifies a ranking of the next hop neighbor, and wherein the forwarding module is configured to forward the interest to a next hop neighbor that is highest ranked among neighbors that satisfy the forwarding condition.

21. The system of claim 17, wherein the information associated with the pending interests further comprises an entry associated with the name of the content piece, and wherein the entry specifies a distance from the first node to the destination node storing the content piece.

22. The system of claim 21, wherein the entry further specifies a set of incoming neighbors from which interests for the content piece are received, and wherein the interest aggregation module is configured to aggregate the interest by adding the second node to the set of incoming neighbors.

23. The system of claim 17, wherein the control message is a negative acknowledgement (NACK).

24. The system of claim 17, wherein the information associated with the pending interests further comprises a set of next hop neighbors.