DISTANCE-BASED ROUTING IN AN INFORMATION-CENTRIC NETWORK
First Claim
1. A computer-executable method, comprising:
- identifying, by a computer node in an information-centric network (ICN), an identifier of a first anchor node associated with a name in an update message received from a neighbor node, wherein the first anchor node stores a content object identifiable based on the name, and wherein the name is independent of the first anchor node;
determining whether the name is validly reachable via a neighboring node based on a comparison between a lexicographic order of the identifier of the neighboring node and the identifier of the node;
responsive to determining that the name is validly reachable via the neighboring node;
adding the neighboring node to a valid list for the name;
determining, for the name, a next-hop neighbor list from the valid list;
computing new routing information for one or more neighboring nodes in the next-hop neighbor list; and
updating a routing table to include the new routing information for the one or more neighboring nodes for the name;
determining whether the first anchor node is a designated anchor node based on the new routing information in the updated routing table and a routing metric for the first anchor node.
3 Assignments
0 Petitions
Accused Products
Abstract
One embodiment of the present invention provides a computing system. The computing system includes a processor and a computer-readable storage medium. The computer-readable storage medium stores instructions which when executed by the processor cause the processor to perform a method. The method comprises identifying an identifier of an anchor node associated with a name in an update message received from a neighbor node. The anchor node stores a content object identifiable based on the name independent of the anchor node. The method also comprises determining a valid next-hop neighbor in the ICN for the name based on a sequence number of the update message generated by the anchor node and lexicographic order of an identifier of the neighbor node; and determining whether the anchor node is a designated anchor node based on the validity of the next-hop neighbor and a routing metric for the anchor node.
-
Citations
24 Claims
-
1. A computer-executable method, comprising:
-
identifying, by a computer node in an information-centric network (ICN), an identifier of a first anchor node associated with a name in an update message received from a neighbor node, wherein the first anchor node stores a content object identifiable based on the name, and wherein the name is independent of the first anchor node; determining whether the name is validly reachable via a neighboring node based on a comparison between a lexicographic order of the identifier of the neighboring node and the identifier of the node; responsive to determining that the name is validly reachable via the neighboring node; adding the neighboring node to a valid list for the name; determining, for the name, a next-hop neighbor list from the valid list; computing new routing information for one or more neighboring nodes in the next-hop neighbor list; and updating a routing table to include the new routing information for the one or more neighboring nodes for the name; determining whether the first anchor node is a designated anchor node based on the new routing information in the updated routing table and a routing metric for the first anchor node. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. A non-transitory computer-readable storage medium storing instructions that when executed by a computer cause the computer to perform a method for performing distance-based routing in an information-centric network (ICN), the method comprising:
-
identifying an identifier of a first anchor node associated with a name in an update message received from a neighbor node, wherein the first anchor node stores a content object identifiable based on the name, and wherein the name is independent of the first anchor node; determining whether the name is validly reachable via a neighboring node based on a comparison between a lexicographic order of the identifier of the neighboring node and the identifier of the node; responsive to determining that the name is validly reachable via the neighboring node; adding the neighboring node to a valid list for the name; determining, for the name, a next-hop neighbor list from the valid list; computing new routing information for one or more neighboring nodes in the next-hop neighbor list; and updating a routing table to include the new routing information for the one or more neighboring nodes for the name; determining whether the first anchor node is a designated anchor node based on the new routing information in the updated routing table and a routing metric for the first anchor node. - View Dependent Claims (10, 11, 12, 13, 14, 15, 16)
-
-
17. An apparatus for performing distance-based routing in an information-centric network (ICN) comprising:
-
one or more processor; a memory; a message processing mechanism configured to identify an identifier of a first anchor node associated with a name in an update message received from a neighbor node and retrievably stored in the memory, wherein the first anchor node stores a content object identifiable based on the name, and wherein the name is independent of the first anchor node; and a forwarding mechanism configured to; determine whether the name is validly reachable via a neighboring node based on a comparison between a lexicographic order of the identifier of the neighboring node and the identifier of the node; responsive to determining that the name is validly reachable via the neighboring node; adding the neighboring node to a valid list for the name; determining, for the name, a next-hop neighbor list from the valid list; computing new routing information for one or more neighboring nodes in the next-hop neighbor list; and updating a routing table to include the new routing information for the one or more neighboring nodes for the name; determine whether the first anchor node is a designated anchor node based on the new routing information in the updated routing table and a routing metric for the first anchor node. - View Dependent Claims (18, 19, 20, 21, 22, 23, 24)
-
Specification