System and method for efficient name-based content routing using link-state information in information-centric networks
First Claim
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;
identifying one or more valid next-hop neighbors to the prefix;
determining whether each of the one or more valid next-hop neighbors is closer to the anchor node than the first node, by using a shortest-path first (SPF) algorithm to compute a distance between the anchor node and each of the one or more valid next-hop neighbors, to generate topology information;
determining, based on the topology information stored on the first node, whether a shortest-path condition is met, wherein determining whether the shortest-path condition is met includes computing, using the SPF algorithm, a shortest distance from the first node to the specified prefix;
in response to determining that a valid next-hop neighbor has 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 that of the first node;
in response to the shortest-path condition being met, forwarding the received LSA message to other neighbors of the first node; and
in response to the shortest-path condition not being met, dropping the LSA message.
3 Assignments
0 Petitions
Accused Products
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.
-
Citations
20 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; identifying one or more valid next-hop neighbors to the prefix; determining whether each of the one or more valid next-hop neighbors is closer to the anchor node than the first node, by using a shortest-path first (SPF) algorithm to compute a distance between the anchor node and each of the one or more valid next-hop neighbors, to generate topology information; determining, based on the topology information stored on the first node, whether a shortest-path condition is met, wherein determining whether the shortest-path condition is met includes computing, using the SPF algorithm, a shortest distance from the first node to the specified prefix; in response to determining that a valid next-hop neighbor has 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 that of the first node; in response to the shortest-path condition being met, forwarding the received LSA message to other neighbors of the first node; and in response to the shortest-path condition not being met, dropping the LSA message. - View Dependent Claims (2, 3, 4, 5, 6, 7)
-
-
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; identifying one or more valid next-hop neighbors to the prefix; determining whether each of the one or more valid next-hop neighbors is closer to the anchor node than the first node, by using a shortest-path first (SPF) algorithm to compute a distance between the anchor node and each of the one or more valid next-hop neighbors, to generate topology information; determining, based on the topology information stored on the first node, whether a shortest-path condition is met, wherein determining whether the shortest-path condition is met includes computing, using the SPF algorithm, a shortest distance from the first node to the specified prefix; in response to determining that a valid next-hop neighbor has 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 that of the first node; in response to the shortest-path condition being met, forwarding the received LSA message to other neighbors of the first node; and in response to the shortest-path condition not being met, dropping the LSA message. - View Dependent Claims (9, 10, 11, 12, 13, 14)
-
-
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; identifying one or more valid next-hop neighbors to the prefix; determining whether each of the one or more valid next-hop neighbors is closer to the anchor node than the first node, by using a shortest-path first (SPF) algorithm to compute a distance between the anchor node and each of the one or more valid next-hop neighbors, to generate topology information; determining, based on the topology information stored on the first node, whether a shortest-path condition is met, wherein determining whether the shortest-path condition is met includes computing, using the SPF algorithm, a shortest distance from the first node to the specified prefix; in response to determining that a valid next-hop neighbor has 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 that of the first node; in response to the shortest-path condition being met, forwarding the received LSA message to other neighbors of the first node, and in response to the shortest-path condition not being met, dropping the LSA message. - View Dependent Claims (16, 17, 18, 19, 20)
-
Specification