Routing method for inter/intra-domain in content centric network

• US 9,326,042 B2
• Filed: 06/11/2013
• Issued: 04/26/2016
• Est. Priority Date: 06/11/2012
• Status: Active Grant

• Current Assignee: Samsung Electronics Co. Ltd.
• Original Assignee: Samsung Electronics Co. Ltd.
• Inventors: Hong, Seong Ik, Lee, Byoung Joon, Jang, Myeong Wuk, Kim, Jae Hoon
• Primary Examiner(s): SHEPARD, JUSTIN E
• Application Number:
  US13/914,845
• Publication Number:
  US 20130332955A1
• Time in Patent Office: 1,050 Days
• Field of Search: None
• US Class Current: 1/1
• CPC Class Codes: H04L 45/025 Updating only a limited number of routers, e.g. fish-eye update
• CPC Class Codes: H04L 45/04 Interdomain routing, e.g. hierarchical routing
• CPC Class Codes: H04L 45/308 Route determination based on user's profile, e.g. premium users
• CPC Class Codes: H04L 67/306 User profiles
• CPC Class Codes: H04N 21/20 Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
• CPC Class Codes: H04N 21/21 Server components or server architectures
• CPC Class Codes: H04N 21/2183 Cache memory caches in web servers or browsers G06F16/9574; intermediate storage and caching in data networks H04L67/568
• CPC Class Codes: H04N 21/23113 involving housekeeping operations for stored content, e.g. prioritizing content for deletion because of storage space restrictions storage management, e.g. defragmentation G06F3/0604; snloading stored programs G06F9/445; housekeeping operations in file systems, e.g. deletion policies G06F16/10; buffering arrangements in a network node or in an end terminal in packet networks H04L49/90
• CPC Class Codes: H04N 21/23116 involving data replication, e.g. over plural servers synchronization of replicated data G06F11/1658; error detection or correction by means of data replication G06F11/2053; replication in distributed file systems G06F16/10; replication in distributed file systems G06F16/27; replication or mirroring of data in data networks H04L67/1095
• CPC Class Codes: H04N 21/64784 Data processing by the network data processing in packet switching systems H04L12/56; flow control in packet networks H04L47/10; intermediate storage or scheduling H04L49/90; provisioning of proxy services in data packet switching networks H04L67/56

Abstract

An intra-domain routing method in a content centric network (CCN), includes generating a packet requesting information requested by a node, the packet including an area to which the information is to be advertised, and transmitting the packet within the area.

Claims

1. A routing method executed by a node in a content centric network (CCN), the method comprising:

receiving an interest packet;

determining whether a content corresponding to the interest packet is advertised based on a forwarding information base (FIB) of the node;

in response to the content corresponding to the interest packet being advertised, transmitting the interest packet via a face, the face being determined based on the FIB;

in response to the content corresponding to the interest packet not being advertised, broadcasting the interest packet within a constrained area and sequentially testing routing paths of successively higher address with respect to a hierarchy of names of the content; and

in response to a reply packet corresponding to the broadcasting not being received, transmitting the interest packet toward a publisher of the content.

2. The method of claim 1, wherein the transmitting of the interest packet toward the publisher of the content comprises:

generating a new packet requesting the content to the publisher; and

transmitting the new packet to the publisher.

3. The method of claim 2, wherein the transmitting of the new packet comprises transmitting the new packet to the publisher, using longest prefix matching.

4. The method of claim 1, wherein the constrained area has a range from another node to a router connected to an Internet core on a hierarchical basis.

5. The method of claim 1, wherein the FIB is generated based on information broadcasting the content within a predetermined area.

6. The method of claim 5, wherein whether the content is to be broadcasted is determined based on a popularity of the content.

7. The method of claim 6, wherein the popularity of the content is determined based on an access count of the content.

8. The method of claim 1, wherein the interest packet comprises a name of the content and an operation identification (OID) designating a control operation to be performed by another node in the constrained area, in response to the interest packet being received.

9. A non-transitory computer-readable storage medium storing a program comprising instructions to cause a computer to perform the method of claim 1.

10. The method of claim 1, wherein the transmitting of the interest packet toward the publisher of the content comprising:

determining whether a domain transmitting the interest packet requesting the content is associated with a policy;

finding the content within the node based on a result of the determination;

if a content stored in the node matches the content requested by the domain, transmitting the stored content; and

if a content stored in the node does not match the content requested by the domain, transmitting the interest packet toward the publisher of the content.

11. The method of claim 10, wherein the interest packet comprises a field indicating a domain by which the interest packet is generated.

12. The method of claim 10, wherein the policy identifies a domain of the node and the transmitting domain that are agreed to in a cache look-up contract, a contract for a cache hit ratio, a contract for a cache size to be allocated, or any combination thereof.

13. The method of claim 12, wherein the determining comprises determining whether the transmitting domain is associated with the policy based on a field indicating a domain in the interest packet.

14. The method of claim 10, further comprising exchanging, with the transmitting domain, routing information based on the policy and using a sync tree comprising connectivity information between the domain of the node and the transmitting domain.

15. A node in a content centric network (CCN), the node comprising:

a receiver configured to receive an interest packet;

a determiner configured to determine whether a content corresponding to the interest packet is advertised based on a forwarding information base (FIB) of the node; and

a transmitter configured to transmit the interest packet via a face, the face being determined based on the FIB in response to the content corresponding to the interest packet being advertised, and broadcast the interest packet within a constrained area in response to the content corresponding to the interest packet not being advertised,

wherein the determiner is further configured to determine whether a reply packet corresponding to the broadcasting is received, and the node is configured to sequentially test routing paths of successively higher addresses with respect to a hierarchy of names of the content and the transmitter is further configured to transmit the interest packet toward a publisher of the content in response to the reply packet corresponding to the broadcasting not being received.

16. The node of claim 15, further comprising:

a packet generator configured to generate a new packet requesting the content to the publisher,

wherein the transmitter is further configured to transmit the new packet to the publisher.

17. The node of claim 16, wherein the transmitting unit is further configured to transmit the new packet to the publisher, using longest prefix matching.

18. The node of claim 15, wherein the FIB is generated based on information broadcasting the content within a predetermined area.

19. The node of claim 18, wherein whether the content is to be broadcasted is determined based on a popularity of the content.

20. The node of claim 19, wherein the popularity of the advertised information is determined based on an access count of the advertised information.

21. The node of claim 15, wherein the constrained area has a range from another node to a router connected to an Internet core on a hierarchical basis.

22. The node of claim 15, wherein the interest packet comprises a name of the content and an operation identification (OID) designating a control operation to be performed by another node in the constrained area, in response to the interest packet being received.

23. The node of claim 15, wherein:

the determiner is further configured to determine whether a domain transmitting the interest packet requesting the content is associated with a policy, and find the content within the node based on a result of the determination; and

the transmitter is further configured to transmit the stored content in response to a content stored in the node matching the content requested by the domain, and transmit the interest packet toward the publisher of the content in response to a content stored in the node not matching the content requested by the domain.

24. The node of claim 23, wherein the interest packet comprises a field indicating a domain by which the interest packet is generated.

25. The node of claim 23, wherein the policy identifies a domain of the node and the transmitting domain that are agreed to in a cache look-up contract, a contract for a cache hit ratio, a contract for a cache size to be allocated, or any combination thereof.

26. The node of claim 25, wherein the determiner is further configured to determine whether the transmitting domain is associated with the policy based on a field indicating a domain in the interest packet.

27. The node of claim 23, wherein the transmitter is further configured to exchange, with the transmitting domain, routing information based on the policy and using a sync tree comprising connectivity information between the domain of the node and the transmitting domain.