SYSTEM AND METHOD FOR FORWARDER CONNECTION INFORMATION IN A CONTENT CENTRIC NETWORK

• US 20180145908A1
• Filed: 11/21/2016
• Published: 05/24/2018
• Est. Priority Date: 11/21/2016
• Status: Active Grant

• Current Assignee: Cisco Technology, Inc. (Cisco Systems, Inc.)
• Original Assignee: Cisco Technology, Inc. (Cisco Systems, Inc.)
• Inventors: Fox, Kevin C.
• Granted Patent: US 10,243,851 B2
• Time in Patent Office: Days
• CPC Class Codes: H04L 45/02 Topology update or discovery
• CPC Class Codes: H04L 45/021 Ensuring consistency of routing table updates, e.g. by using epoch numbers
• 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
• CPC Class Codes: H04L 45/745 Address table lookup; Address filtering
• CPC Class Codes: H04L 45/7453 using hashing
• CPC Class Codes: H04L 45/748 using longest matching prefix
• CPC Class Codes: H04L 61/4552 Lookup mechanisms between a plurality of directories; Synchronisation of directories, e.g. metadirectories
• CPC Class Codes: H04L 63/126 the source of the received data
• CPC Class Codes: H04L 67/1097 for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
• CPC Class Codes: H04L 67/141 Setup of application sessions admission control or resource allocation in data switching networks H04L47/70
• CPC Class Codes: H04L 67/51 Discovery or management thereof, e.g. service location protocol [SLP] or web services
• CPC Class Codes: H04L 67/561 Adding application-functional data or data for application control, e.g. adding metadata
• CPC Class Codes: H04L 67/568 Storing data temporarily at an intermediate stage, e.g. caching
• CPC Class Codes: H04L 67/63 Routing a service request depending on the request content or context

Abstract

One embodiment provides a system which facilitates exchanging identifying information between connected nodes. During operation, the system generates, by an intermediate node for an adjacent node, an interest which includes an identifier for the intermediate node and a name for a link between the intermediate node and the adjacent node. In response to the interest, the system receives from the adjacent node a content object which includes an identifier for the adjacent node. The system creates an entry in a first data structure mapping the adjacent node'"'"'s identifier to a first outgoing interface associated with the link. In response to receiving a first routing update for a first name prefix based on the adjacent node'"'"'s identifier, the system updates a first forwarding information base based on the adjacent node'"'"'s identifier, thereby facilitating the exchange of the identifying information between the connected nodes without requiring an external agent.

Claims

1. A computer system for facilitating an exchange of identifying information between connected nodes, the system comprising:

a processor; and

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

generating, by an intermediate node for an adjacent node, an interest which includes an identifier for the intermediate node and a name for a link between the intermediate node and the adjacent node;

in response to the interest, receiving from the adjacent node a content object which includes an identifier for the adjacent node;

creating an entry in a first data structure mapping the adjacent node'"'"'s identifier to a first outgoing interface associated with the link; and

in response to receiving a first routing update for a first name prefix based on the adjacent node'"'"'s identifier, updating a first forwarding information base based on the adjacent node'"'"'s identifier,

thereby facilitating the exchange of the identifying information between the connected nodes without requiring an external agent.

2. The computer system of claim 1, wherein the content object further includes the intermediate node'"'"'s identifier and the link name.

3. The computer system of claim 1, wherein updating the forwarding information base further comprises:

performing a lookup in the first data structure based on the adjacent node'"'"'s identifier to obtain the corresponding first outgoing interface; and

creating an entry in the first forwarding information base mapping the first name prefix to the obtained first outgoing interface.

4. The computer system of claim 1, wherein the interest further includes a signature of the intermediate node, and wherein the content object further includes a signature of the adjacent node.

5. The computer system of claim 1, wherein the method further comprises:

receiving, by the adjacent node, the interest;

verifying, by the adjacent node, the interest based on a signature of the intermediate node included in the interest;

in response to verifying the interest;

generating, by the adjacent node, the content object;

creating, by the adjacent node, an entry in a second data structure mapping the intermediate node'"'"'s identifier to a second outgoing interface associated with the link; and

in response to receiving a second routing update for a second name prefix based on the intermediate node'"'"'s identifier, updating, by the adjacent node, a second forwarding information base based on the intermediate node'"'"'s identifier; and

in response to not verifying the interest, discarding, by the adjacent node, the interest.

6. The computer system of claim 1, wherein the method further comprises:

in response to verifying the content object, enabling a connection between the intermediate node and the adjacent node, wherein the connection is based on the link between the intermediate node and the adjacent node, wherein verifying the content object is based on a signature of the adjacent node included in the content object; and

in response to not verifying the content object, refraining from enabling the connection between the intermediate node and the adjacent node.

7. The computer system of claim 1, wherein a name is a hierarchically structured variable length identifier that includes contiguous name components ordered from a most general level to a most specific level, wherein a name for the interest is the same as a name for the content object.

8. A computer-implemented method for facilitating ephemeral entries in a forwarding information base, the method comprising:

generating, by an intermediate node for an adjacent node, an interest which includes an identifier for the intermediate node and a name for a link between the intermediate node and the adjacent node;

in response to the interest, receiving from the adjacent node a content object which includes an identifier for the adjacent node;

creating an entry in a first data structure mapping the adjacent node'"'"'s identifier to a first outgoing interface associated with the link; and

in response to receiving a first routing update for a first name prefix based on the adjacent node'"'"'s identifier, updating a first forwarding information base based on the adjacent node'"'"'s identifier,

thereby facilitating the exchange of the identifying information between the connected nodes without requiring an external agent.

9. The method of claim 8, wherein the content object further includes the intermediate node'"'"'s identifier and the link name.

10. The method of claim 8, wherein updating the forwarding information base further comprises:

performing a lookup in the first data structure based on the adjacent node'"'"'s identifier to obtain the corresponding first outgoing interface; and

creating an entry in the first forwarding information base mapping the first name prefix to the obtained first outgoing interface.

11. The method of claim 8, wherein the interest further includes a signature of the intermediate node, and wherein the content object further includes a signature of the adjacent node.

12. The method of claim 8, further comprising:

receiving, by the adjacent node, the interest;

verifying, by the adjacent node, the interest based on a signature of the intermediate node included in the interest;

in response to verifying the interest;

generating, by the adjacent node, the content object;

creating, by the adjacent node, an entry in a second data structure mapping the intermediate node'"'"'s identifier to a second outgoing interface associated with the link; and

in response to receiving a second routing update for a second name prefix based on the intermediate node'"'"'s identifier, updating, by the adjacent node, a second forwarding information base based on the intermediate node'"'"'s identifier; and

in response to not verifying the interest, discarding, by the adjacent node, the interest.

13. The method of claim 8, further comprising:

in response to verifying the content object, enabling a connection between the intermediate node and the adjacent node, wherein the connection is based on the link between the intermediate node and the adjacent node, wherein verifying the content object is based on a signature of the adjacent node included in the content object; and

in response to not verifying the content object, refraining from enabling the connection between the intermediate node and the adjacent node.

14. The method of claim 8, wherein a name is a hierarchically structured variable length identifier that includes contiguous name components ordered from a most general level to a most specific level, wherein a name for the interest is the same as a name for the content object.

15. A non-transitory computer-readable storage medium storing instructions that when executed by a computer cause the computer to perform a method, the method comprising:

generating, by an intermediate node for an adjacent node, an interest which includes an identifier for the intermediate node and a name for a link between the intermediate node and the adjacent node;

in response to the interest, receiving from the adjacent node a content object which includes an identifier for the adjacent node;

creating an entry in a first data structure mapping the adjacent node'"'"'s identifier to a first outgoing interface associated with the link; and

in response to receiving a first routing update for a first name prefix based on the adjacent node'"'"'s identifier, updating a first forwarding information base based on the adjacent node'"'"'s identifier,

thereby facilitating the exchange of the identifying information between the connected nodes without requiring an external agent.

16. The storage medium of claim 15, wherein the content object further includes the intermediate node'"'"'s identifier and the link name.

17. The storage medium of claim 15, wherein updating the forwarding information base further comprises:

performing a lookup in the first data structure based on the adjacent node'"'"'s identifier to obtain the corresponding first outgoing interface; and

creating an entry in the first forwarding information base mapping the first name prefix to the obtained first outgoing interface.

18. The storage medium of claim 15, wherein the interest further includes a signature of the intermediate node, and wherein the content object further includes a signature of the adjacent node.

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

receiving, by the adjacent node, the interest;

verifying, by the adjacent node, the interest based on a signature of the intermediate node included in the interest;

in response to verifying the interest;

generating, by the adjacent node, the content object;

creating, by the adjacent node, an entry in a second data structure mapping the intermediate node'"'"'s identifier to a second outgoing interface associated with the link; and

in response to receiving a second routing update for a second name prefix based on the intermediate node'"'"'s identifier, updating, by the adjacent node, a second forwarding information base based on the intermediate node'"'"'s identifier; and

in response to not verifying the interest, discarding, by the adjacent node, the interest.

20. The storage medium of claim 15, wherein the method further comprises:

in response to verifying the content object, enabling a connection between the intermediate node and the adjacent node, wherein the connection is based on the link between the intermediate node and the adjacent node, wherein verifying the content object is based on a signature of the adjacent node included in the content object; and

in response to not verifying the content object, refraining from enabling the connection between the intermediate node and the adjacent node.