SYSTEM AND METHOD FOR EFFICIENT NAME-BASED CONTENT ROUTING USING LINK-STATE INFORMATION IN INFORMATION-CENTRIC NETWORKS

• US 20160182353A1
• Filed: 12/22/2014
• Published: 06/23/2016
• Est. Priority Date: 12/22/2014
• Status: Active Grant

• Current Assignee: Cisco Technology, Inc. (Cisco Systems, Inc.)
• Original Assignee: Palo Alto Research Center, Inc. (Xerox Holdings Corp.)
• Inventors: Garcia-Luna-Aceves, Jose J.
• Granted Patent: US 10,003,520 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: H04L 45/12 Shortest path evaluation
• 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 updating link-status information associated with a prefix in an information-centric network (ICN). During operation, a first node in the ICN receives a link-state advertisement (LSA) message from a neighbor node with the LSA message specifying a prefix and an anchor node advertising the specified prefix. The system determines, based on topology information stored on the first node, whether a shortest-path condition is met, and forwards the received LSA message to other neighbors of the first node in response to the shortest-path condition being met.

Claims

1. A computer-executable method for updating link-status information associated with a prefix in an information-centric network (ICN), the method comprising:

receiving, by a first node in the ICN, a link-state advertisement (LSA) message from a neighbor node, wherein the LSA message specifies a prefix and an anchor node advertising the specified prefix;

determining, based on topology information stored on the first node, whether a shortest-path condition is met; and

in response to the shortest-path condition being met, forwarding the received LSA message to other neighbors of the first node.

2. The method of claim 1, wherein determining whether the shortest-path condition is met involves computing, using a shortest-path first (SPF) algorithm, a shortest distance from the first node to the specified prefix.

3. The method of claim 1, further comprising:

generating, by the first node, an LSA message reflecting a status change to a local prefix; and

forwarding the generated LSA message to neighbors of the first node.

4. The method of claim 1, further comprising:

updating, by the first node, a routing table based on the received LSA message.

5. The method of claim 4, wherein updating the routing table involves identifying a set of valid next-hop neighbors to the prefix, and wherein identifying a respective valid next-hop neighbor involves determining whether the valid next-hop neighbor is closer to the anchor node than the first node, thereby preventing formation of a loop in the updated routing table.

6. The method of claim 5, further comprising:

in response to the valid next-hop neighbor having a same distance to the anchor node as that of the first node, determining whether the valid next-hop neighbor has a smaller lexicographic value compared with the first node.

7. The method of claim 1, wherein the LSA message further includes a sequence number created by the anchor node, and wherein the sequence number increments each time the anchor node updates the LSA message for the specified 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 link-status information associated with a prefix in an information-centric network (ICN), the method comprising:

receiving, by a first node in the ICN, a link-state advertisement (LSA) message from a neighbor node, wherein the LSA message specifies a prefix and an anchor node advertising the specified prefix;

determining, based on topology information stored on the first node, whether a shortest-path condition is met; and

in response to the shortest-path condition being met, forwarding the received LSA message to other neighbors of the first node.

9. The computer-readable storage medium of claim 8, wherein determining whether the shortest-path condition is met involves computing, using a shortest-path first (SPF) algorithm, a shortest distance from the first node to the specified prefix.

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

generating, by the first node, an LSA message reflecting a status change to a local prefix; and

forwarding the generated LSA message to neighbors of the first node.

11. The computer-readable storage medium of claim 8, wherein the method further comprises updating, by the first node, a routing table based on the received LSA message.

12. The computer-readable storage medium of claim 11, wherein updating the routing table involves identifying a set of valid next-hop neighbors to the prefix, and wherein identifying a respective valid next-hop neighbor involves determining whether the valid next-hop neighbor is closer to the anchor node than the first node, thereby preventing formation of a loop in the updated routing table.

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

in response to the valid next-hop neighbor having a same distance to the anchor node as that of the first node, determining whether the valid next-hop neighbor has a smaller lexicographic value compared with the first node.

14. The computer-readable storage medium of claim 8, wherein the LSA message further includes a sequence number created by the anchor node, and wherein the sequence number increments each time the anchor node updates the LSA message for the specified prefix.

15. A computer system for updating link-status information associated with a prefix in an information-centric network (ICN), the system comprising:

a processor; and

a storage device coupled to the processor and storing instructions which when executed by the processor cause the processor to perform a method, the method comprising;

receiving, by a first node in the ICN, a link-state advertisement (LSA) message from a neighbor node, wherein the LSA message specifies a prefix and an anchor node advertising the specified prefix;

determining, based on topology information stored on the first node, whether a shortest-path condition is met; and

in response to the shortest-path condition being met, forwarding the received LSA message to other neighbors of the first node.

16. The system of claim 15, wherein determining whether the shortest-path condition is met involves computing, using a shortest-path first (SPF) algorithm, a shortest distance from the first node to the specified prefix.

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

generating, by the first node, an LSA message reflecting a status change to a local prefix; and

forwarding the generated LSA message to neighbors of the first node.

18. The system of claim 15, wherein the method further comprises updating, by the first node, a routing table based on the received LSA message.

19. The system of claim 18, wherein updating the routing table involves identifying a set of valid next-hop neighbors to the prefix, and wherein identifying a respective valid next-hop neighbor involves determining whether the valid next-hop neighbor is closer to the anchor node than the first node, thereby preventing formation of a loop in the updated routing table.

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

in response to the valid next-hop neighbor having a same distance to the anchor node as that of the first node, determining whether the valid next-hop neighbor has a smaller lexicographic value compared with the first node.

21. The system of claim 15, wherein the LSA message further includes a sequence number created by the anchor node, and wherein the sequence number increments each time the anchor node updates the LSA message for the specified prefix.