JP2015162686A - Cache control device, method and program - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a method for optimizing a cache position without performing cache information exchange between neighboring routers that may increase a processing load of a router.SOLUTION: An identification number (ID) represented by a binary number of K bits is allocated to each of N pieces of routers on a CCN, and an OST is included in which a hash value H(A) of K bits obtained from a name A of contents and an ID of an original server providing the contents are correspondingly stored. When interest arrives from an input port (n), the OST is referenced regarding whether a request contents A are stored in a cache memory. If the original server is accommodated, the request contents A are sent to the input port. If not, PIT is retrieved on the basis of H(A). If the input port (n) is not registered, H(A) is registered in the PIT. When contents are received, on the basis of the hash value H(A), PIT is retrieved, and the contents are sent to an obtained port.

Description

  The present invention relates to a cache control apparatus, method, and program, and in particular, in a network centric networking (CCN) that caches content in a network device (router) and transfers data with the content name as a destination, the cache in the entire network The present invention relates to a cache control device, method, and program for optimizing the performance.

  In CCN, a user who wants to acquire content sends Interest to the original holding server, and the router transfers Interest using the name of the content as a locator. As with IP (Internet Protocol), FIB (Forwarding Information Base) is configured in the router to select the destination Interest forwarding link, but the entry is searched by Longest-prefix match using the name of the content. This is a feature. Therefore, the content provider needs to advertise the content name on the NW so that the content is distributed on the network (NW).

  The router has a cache memory (content store) to hold the transferred content, and the router on the Interest transfer path forwards the Interest to the next hop router when it caches the requested content. The request content is transmitted to the request source without doing so. When the Interest arrives at the router, the Interest arrival port is stored in a table called PIT (Pending Interest Table), so that the content is transferred in the reverse direction of the Interest transfer path. By using CCN, the following benefits are expected.

  -Avoidance of name resolution processing: Since routing is performed using an IP address in the conventional Internet, an overhead for resolving the IP address of a server serving as a distribution source from the name of the content occurs before distribution. On the other hand, since the distribution request packet is routed directly using the content name in CCN, the overhead of name resolution processing can be avoided.

  ・ Communication quality improvement: When content is cached in the router on the route, content can be delivered from a location closer to the user than when delivered from the original server or cache server, delay time and NW load Can be reduced.

  ・ Democratization of content distribution: Conventionally, CDN (Contents Delivery Network) has been widely used for content distribution, but content providers who can use CDN are limited to users with financial resources such as companies. In CCN, the content cache is operated by a network operator and provided as a platform service, enabling efficient distribution using the cache at the individual level.

  In CCN, each router caches content flowing on the NW in real time, so high speed is required for the cache, so high-speed memory such as TCAM (Ternary Content Addressable Memory) and SRAM (Static Random Access Memory) is used. Configured. Therefore, the cache capacity is limited compared to CDN, and efficient operation of limited cache resources becomes more important. The resource utilization efficiency of the cache is determined by two methods, that is, a method for determining which content is cached and a method for determining the content to be deleted when the cache capacity is insufficient. In this specification, the former is referred to as a “cache determination method” ( For example, refer to Non-Patent Document 1), and the latter is referred to as “cache replacement method” (for example, refer to Non-Patent Document 1).

  In CCN, it is assumed that all routers on the content transfer path are targeted for caching as a cache determination method, and LRU (Least Recently Used) is used as a cache replacement method (for example, see Non-Patent Document 2). ). However, in general, there is a bias in the access frequency of contents, and there is a tendency that access concentrates on a small number of highly popular contents. Therefore, a large number of routers are likely to cache a small number of highly popular contents in duplicate. However, from the viewpoint of reducing the hop length of the distribution flow, the effect of caching the same content repeatedly in neighboring routers is small. Therefore, it is important to realize a state in which a larger number of contents are cached while maintaining the effect of the cache by arranging the contents in spatially dispersed locations as much as possible.

J. M. Wang, J. Zhang, and B. Bensaou, Intra-AS Cooperative Caching for Content-Centric Networks, "ACM ICN 2013. A Survey of Information-Centric Networking, "IEEE Commun. Mag., Vol.50, no.7, pp.26-36, July 2012. Miki Yamamoto, Content Oriented Network, Theory of Science (B), J96-B, 6, pp.589-604

  The cache determination methods in CCN that have been studied so far are an approach in which only routers on the content transfer path (default path) are candidates for cache positions (for example, see Non-Patent Document 3) and routers other than the default path. Can be roughly divided into approaches for candidate cache positions (see, for example, Non-Patent Document 3). In the former method, the router on the distribution route makes a cache decision probabilistically, thereby allocating the cache position according to the popularity of the content. For example, the content is cached with high probability by the router close to the user. As described above, it has been studied to change the cache probability according to the relative position on the distribution path from the server (original server) that holds the original content to the distribution requesting user. However, in these systems, it is difficult to avoid cache duplication between routers existing in the vicinity.

  On the other hand, in the approach in which routers other than the default path are also cache location candidates, the cache locations of content are more actively divided by exchanging cached content information between neighboring routers. For example, the content of owned content is periodically exchanged between adjacent routers, and the central link uses a greedy calculation method to determine the content to be cached by each router, and the maximum link usage rate is minimized centrally. Therefore, it is considered to define an optimization problem that simultaneously determines a content distribution route and a cache position of each content. By using these methods, the cache location of each content can be divided, but it is necessary to exchange cache information between adjacent routers and solve the cache location as an optimization problem in a centralized control. Processing load increases.

  The present invention has been made in view of the above points. A cache control device, method, and program capable of optimizing a cache position without performing cache information exchange between adjacent routers that increase the processing load of the router The purpose is to provide.

According to one aspect, in a CCN that caches content and performs data transfer with the content name as the address, a cache control device provided on a router for distributing and distributing the content to each router,
An original server that provides content by assigning a unique number (node ID) represented by a binary number of K (where K is the smallest integer satisfying 2 ^K ≧ N) to N routers on the CCN Is connected,
A K-bit hash value H (A) obtained from the content name A and an original server table (OST) in which the ID of the original server providing the content is stored in association with each other;
When interest arrives from the input port n, the requested content A of the interest is stored in the cache memory, or if the original server is accommodated with reference to the OST, the requested content A is input to the input port n. If not, the hash value H (A) is searched based on the hash value H (A). If the input port n is not registered, the hash value is searched. Content existence inspection means for registering H (A) in the PIT;
When the content is received, a cache control apparatus is provided that includes content receiving means for searching for the PIT based on the hash value H (A) and transmitting the content to the obtained port.

  According to one aspect, in a CCN that caches content in a router and transfers data with the content name as the destination, the cache location is optimized without exchanging cache information between adjacent routers that increases the processing load on the router It becomes possible.

1 is a configuration example of a cache control device according to an embodiment of the present invention. 1 is a router architecture according to an embodiment of the present invention. An example of a cache candidate node for content A when popularity group g is 1 or 2 according to an embodiment of the present invention. The example of the first four steps of the node ID assignment procedure in an embodiment of the present invention. The example of popularity degree group allocation update in the case of b = a + 2 in one embodiment of this invention. Y and D characteristics for parameter (β). Improvement rate compared with W of each NW and W of CCN of the present invention (DCC). W improvement rate of each popularity degree group in 5 NWs with the smallest improvement rate of W and 5 NWs at the maximum. Reduction rate compared with CC of each NW Z and Z of the present invention (DCC). Z reduction rate of each popularity group in 5 NWs with minimum Z reduction rate and 5 NWs at maximum.

  Hereinafter, embodiments of the present invention will be described with reference to the drawings.

  FIG. 1 is a configuration example of a cache control device according to an embodiment of the present invention.

  The cache control device 100 is a device that realizes a distributed arrangement of content in CCN, and includes a content existence inspection unit 101, an Interest count unit 102, a PGT (Popularity Group Table) 103, a cache memory 104, a content transmission unit 105, an FIB ( Forwarding Information Base) inspection unit 106, FIB 107, FIB configuration unit 108, content popularity group classification unit 109, content reception unit 110, content popularity group determination unit 111, PIT (Pending Interest Table) inspection unit 112, PIT 113, OST 114. The cache control device 100 is provided in all routers.

  An Interest that has arrived from an adjacent router or a local user is checked by the content existence checking unit 101 whether or not the requested content exists in its own cache memory 104.

  When Interest arrives from the local user, the Interest count unit 102 increments the counter value IC of the Interest count unit 102 of the corresponding entry of the PGT 103.

  When the requested content exists in the cache memory 104, the content is transferred to the adjacent router or the local user by the content sending unit 105. If the requested content does not exist in the cache memory 104, information on the arrival input port is described in the PIT 113, the ID of the original server accommodating node is obtained by referring to the OST 114, and the corresponding entry in the FIB 107 is inspected by the FIB inspection unit 106. Interest is transferred from the corresponding output port to the adjacent router.

  Also, the FIB configuration unit 108 configures the FIB 107 by exchanging information regarding FIB entries between adjacent routers.

  Also, at regular intervals, the content popularity group classification unit 109 classifies each content into one of K popularity groups based on the IC value of the PGT 103 and stores the classification result in the PGT 103.

  On the other hand, when the content arrives at the content receiving unit 110 from the adjacent router, the content popularity group determination unit 111 checks the PGT 103 to obtain information about the popularity group of the arrived content, performs a cache determination, and determines that the cache is performed The received content is cached in the cache memory 104. Then, the corresponding entry of the PIT 113 is inspected by the PIT inspection unit 112, and the content is transferred to the obtained output port number.

  Next, details of the processing of the cache determination method for realizing the distributed arrangement of contents in the CCN according to the embodiment of the present invention will be described.

[1] Overview:
Assume a single ISP (Internet Service Provider) NW with Tier-1 or Tier-2 with CCN installed. Since a single autonomous business entity manages the entire NW, the same cache judgment method can be executed in all the routers that are configured. It is also assumed that the original server installed by the content provider that provides the content is connected to the router on the network. The characteristics of the cache determination method (DCC: Dispersed Content Caching) of the present invention are summarized below. Hereinafter, the method of the present invention is referred to as DCC.

・ Content placement using hash values:
The content popularity group determination unit 111 assigns a unique number (ID) represented by a K-bit binary number to each router, and has an ID corresponding to the K-bit hash value H (A) obtained from the content name A. Only the router sets the content A as a cache target, and realizes a state in which each content is spatially distributed and arranged by autonomous determination of each router.

-Control the number of copies placed according to popularity:
The content popularity group classification unit 109 classifies each content into K groups according to popularity, and the content popularity group determination unit 111 makes a cache determination for a content that exists in the highly popular group determined by the content popularity group determination unit 111. By reducing the number of reference bits of the ID of the PGT 103 that is sometimes referred to, a state in which more popular contents are arranged in a larger number of caches is realized.

-Packet transfer using node ID as locator:
The FIB inspection unit 106 uses a node ID that has a fixed number of bits and a smaller number of bits than the content name, thereby reducing the number of entries in the FIB 107 and the entry search processing load.

When there are N routers on NW, let ^{K be the} smallest integer that satisfies 2 ^K ≧ N. Then, an arbitrary binary number of K bits in the range of 0 to 2 ^K −1 is assigned to each router as a node ID so as not to overlap. A specific method for assigning the node ID will be described later in [4].

  In addition, each router autonomously measures the popularity of each content by counting the arrival Interest, and makes a cache determination according to the popularity.

  Hereinafter, details of the present invention will be described by dividing into a router operation mechanism, a cache determination method, a router ID assignment method, and a content grouping method.

[2] Router operating mechanism:
As shown in FIG. 2, in addition to the FIB 107, PIT 113, and content store used in the CCN, each router manages an OST (Original Server Table) 113 that manages the location of the original server, and a popularity group of each content. A PGT (Popularity Group Table) 103 is prepared. The FIB 107 is used to determine the transfer destination output port based on the target address of the arriving Interest, as in the conventional CCN, whereas the conventional CCN searches for an entry based on the hash value of the content name A, The present invention (DCC) searches based on the target node ID. Also, the PIT 113 stores the arrival input port number of Interest together with the hash value H (A) of the name A in the same way as the conventional CCN, and transfers the arrival content so that the content is transferred in the reverse direction of the Interest transfer path. Used to determine the destination port.

  The OST 114 stores a correspondence between the hash value H (A) of the content name A and the node ID in which the original server of the content name A is accommodated. When the router R accommodates (a case where a user such as a stub ISP is directly accommodated or a case where a user is indirectly accommodated via a lower-level ISP such as a Tier-1 ISP) the Interest for content A arrives at the router R The content existence checking unit 101 searches the entry of the OST 114 using H (A) as a key, and the FIB checking unit 106 sets the acquired node ID of the original server as the target node ID and sets the interest according to the information of the FIB 107. Is sent out.

  The router where Interest has arrived from the input port n caches the content A or sends the content A to the port n when accommodating the original server, as in the conventional CCN. If not, the PIT checking unit 112 determines whether an entry of H (A) exists in the PIT 113. If it exists, the input port n is added to PH (Previous Hop), and if not, a new hash value H Create entry (A) and set PH to n. On the other hand, the PIT inspection unit 112 of the router that has received the content transmits the content to the output port obtained from the PIT 113 using the hash value H (A) as a key, and deletes the corresponding entry in the PIT 113. As a result, the content is transferred to the request source through the Interest transfer path in the reverse direction.

The PGT 103 is used to manage the popularity group of each content, and has an entry of Interest observation counter IC and popularity group PG (Popularity Group) for each hash value H (A). Each time each router receives an interest from a user accommodated by the router, the interest count unit 102 increments the IC of the entry of the PGT 103 of H (A) (interests transferred from other routers are also counted). Then, since bias is applied depending on the position of each router in the NW, only the locally received Interest is targeted). Then, the content popular group classification unit 109 periodically uses the ratio q _m of the Interest observation counter IC of each content m with respect to the total sum of the contents IC as an estimated value of the requested ratio of the content m, and will be described later in [5]. In this way, each content m is classified into one of K popularity groups and registered in the PG of the PGT 103. However, group IDs are assigned in descending order of popularity, group 1 is the most popular content, and group K is the least popular content. In addition, the Interest observation counter IC for each content of all routers can be decremented at regular intervals to deal with the case where the popularity of the content changes over time. For low-popular contents, the observed Interest is small and the estimation accuracy of the request ratio is low, but the influence of the allocated popularity group is small because the total number of accesses is small.

  As described above, the PIT 113, OST 114, and PGT 103 in the present invention (DCC) are searched using the hash value H (A) of the content name A as a key, as in the conventional CCN, but the FIB entry search is performed using the node ID as a key. It is a great feature that it is implemented by using it. As a result of performing the entry search with the fixed-length node ID, it is expected that the required memory amount of the FIB and the entry search processing cost are reduced.

[3] Content cache judgment method:
This section describes the cache judgment method when content arrives at the router.

  The method described in this section has features that are significantly different from conventional CCN, and is the core technology of the present invention (DCC). When the content A arrives at the router R, the content receiving unit 110 of the router R grasps the popularity group S of the content A by referring to the entry of the hash value H (A) of the PGT 103, and the hash value A is cached in the cache memory 104 only when the upper g bits of H (A) match the upper g bits of the node ID of the router R. However, the router that houses A's original server does not cache A.

  FIG. 3 shows an example in which content A is distributed from the original server of content A with hash value H (A) = 101 to user terminals via routers e, d, c, b, a. When the popularity group g of the content A is 1, there are three routers a, c, and d having node IDs that match the most significant bit “1” of the hash value H (A) with the most significant bit. A is cached in three routers. On the other hand, when g = 2, there are two routers a and c having node IDs in which the upper 2 bits “10” of the hash value H (A) and the upper 2 bits match. Is cached.

  Therefore, when the bit pattern of the node ID is allocated without any bias (the specific allocation method will be described later in [4]), the content belonging to the popularity group g is included in N nodes.

Or

It becomes a cache target in each router. Therefore, highly popular content is cached in many routers. Also, as described in [4], the cache position of each content is distributed by assigning the same node ID to a router that exists in a spatially separated place with any upper k bits.

  When the router R that has received the content A determines that A is a cache target, if the R cache capacity is insufficient, one of the cached content is deleted. As the cache replacement method, the LRU that deletes the content with the longest elapsed time from the last access time achieves near-optimal performance even in CCN. Therefore, the LRU should also be used in the present invention (DCC). Is assumed.

[4] Node ID Assignment Method In the present invention (DCC), since the cache position of each content is determined by the node ID, the node ID assignment method to each router is important. This section describes the node ID assignment method performed as a pre-processing by the system administrator.

<Node ID allocation policy>
Since the arrangement pattern of the highly popular content has a larger influence on the overall performance, the same bits are assigned to routers that are located as far away as possible in order from the upper bits of the node ID. Let S _k (x) be a set of nodes in which x = (x ₁ , x ₂ ,..., X _k ) is assigned to the upper k bits. Then, the process of assigning the value of the k-th bit to each node n of n∈S _k−1 (x) is repeated in the order of k = 1, 2,. However, when k = 1, all node sets N are to be assigned (S ₋₁ (φ) = N).

FIG. 4 illustrates the first four steps of the process of assigning node IDs to N = 11 routers. As shown in FIG. 4A, the first bit is assigned to all the nodes N in the state where the node ID is not completely assigned first. Since each bit takes two values of 0 or 1, a node set S ₁ (0) assigned 0 to the first bit and a node set S ₁ (1) assigned 1 to the most significant bit Then, N is divided so that the difference in size between these two node sets is 1 or less.

Next, as shown in FIG. 4B, a second set of bits is assigned to each node n of n∈S ₁ (0), and a node set S ₂ (“00” is assigned to the most significant 2 bits) 0,0) and S ₁ (0) are divided into the node set S ₂ (0,1) to which “01” is assigned.

Then, FIG. 4 (c), the remaining allocated a second bit longer for one of the node set S ₁ (1), node set S ₂ (1 assigned to "10" at the top 2 bits , 0) and S ₁ (1) are divided into the node set S2 (1,1) to which “11” is assigned.

Next, the third bit for each of the obtained four node sets S ₂ (0,0), S ₂ (0,1), S ₂ (1,0), S ₂ (1,1) And divide each into two node sets. FIG. 4D illustrates a process of dividing S ₂ (0,0) into S ₃ (0,0,0) and S3 (0,0,1). Thereafter, this process is repeated until K bits are assigned to all N nodes.

< _K- th bit allocation method to node set S _k-1 (x)>
Next, a method for assigning the k-th bit to the node set of S _k−1 (x) in each step of the node ID assignment process will be described.

If the number of nodes constituting the two node sets A and B generated by the division is N _a and Nb, and y = | S _k-1 (x) |, then if y is an even number, then N _a = y / 2 If y is an odd number

Or

By doing so, the difference in size between A and B can be made 1 or less. Also, N _b = yN _a .

Since the contents of popularity group k are cached in all routers with the highest k bits matching, the average value F of the shortest hop distance from each node of N to A and the shortest hop distance to B is It is desirable to assign the kth bit of the node ID so as to minimize. Therefore, the following optimization problem for dividing S _k-1 (x) into A and B is defined.

Here, p _n is the ratio of the number of accommodated users of node n, and h _{n, j} is the shortest hop distance from node n to node j. Since the number of combinations that divide N routers into two groups increases exponentially with increasing N, it is difficult to strictly solve this optimization problem. Therefore, the solution is obtained by the greedy calculation method shown below.

(i) A and B are initially set to A = S _k-1 (x) and B = φ.

  (ii) The average value F when each node a of a∈A is moved to B is calculated, and the node a having the smallest F is moved from A to B (A → A− {a}, B → B + { a}).

  (iii) Repeat step (ii) until | A | = Na (if y is odd)

Or

Of which F is smaller).

<Consideration on node ID assignment>
By assigning a node ID to each router using the method described above, for each k where 1 ≦ k ≦ K, an ID with the same highest-order k bits is assigned to a router that is spatially separated. Therefore, the effect of spatially distributing the cache position of the content can be expected.

Incidentally, since it is N ≦ 2 ^K, the (2 ^K -N) pieces of ID does not exist allocation router, the popularity group K to the hash value of the content name A H (A) is identical to the non-allocated ID Content is not cached in any router. However, as described in [2], since Interest is transferred to the original server, distribution of content is performed without any problem in this case. Further, since the contents without the cache target router are only the contents of the group K having the lowest popularity, the influence on the overall performance is small.

  By the way, when the number of routers is increased, in order to maintain spatially distributed node ID assignment, node IDs are assigned again not only to newly added routers but also to all routers on the NW. Therefore, there is a possibility that the node ID of an existing router may change. However, by caching the content based on the newly assigned ID, the content cached based on the old ID is deleted by the LRU. Therefore, it is possible to shift to the allocation state based on the new ID step by step.

Next, consider the average hop distance Y _k from each node to the cache target node of content belonging to each popular group k. The content of the popular group k is cached only in the node whose upper k bits of the hash value match the node ID. Therefore, if a set of all patterns of k-bit binary numbers is X _k , a set S _k (x) of nodes to be cached for each content of the popular group k exists for each x∈X _k having 2 ^k patterns. To do. Therefore, Y _k is obtained by the following equation.

However, when O _n the average hop length leading to each node n from the original server, the original server of each content is stored in each node n with probability p _n,

It becomes.

[5] Content grouping method:
As described in [2], in the present invention (DCC), each content is classified into one of K popularity groups. This section describes how to classify M contents into K groups G ₁ , G ₂ ,..., G _k according to popularity when M contents are provided throughout the network. _Let m _{g be} the number of contents classified as G _g ,

Defined as

It becomes. A request ratio q _m to the content m, the use of average hop length Y _g to caching candidate router content of the popularity group g, the average hop length from each router on the NW until the cache candidate router of each content Y is

It is obtained with. However, R _g is the total demand ratio for the content of popularity group g,

If R ₁ = q (M ₁ ), then for each g of 2 ≦ g ≦ K
R _g = Q (M _g ) -Q (M _g-1 )
It becomes.

Consider classifying content into popularity groups so as to minimize Y obtained in this way. However, as more content is classified into highly popular groups, Y decreases, but since the number of contents that each router caches increases, the cache hit rate decreases and the distribution from the original server increases. On the other hand, for a given _mg , the cache candidate content number D in each router is

It becomes. Therefore, using a design parameter α that takes a real value of 1 or more, a constraint condition is set that suppresses the upper limit of D by α times the cache capacity C of each router. And defining the optimization problem for deriving a content number m _g to be allocated to each G _g by the following equation.

However, since the number of combinations increases exponentially as M increases, _mg is derived using the greedy calculation method shown below. However, the values of Y and D in the t-th iteration step are Y _t and D _t , respectively.

(i) In the initial state t = 0, the contents are classified into all contents G _{K of} M (m _g = 0 (1 ≦ g ≦ K−1), m _K = M).
(ii) When arbitrary integers a and b satisfying 1 ≦ a ≦ K, a <b ≦ K, and m _b > 0 are modified as m _b → m _b −1 and m _a → m _a +1 Y _t, calculate D _t of.

(iii) For all combinations of a and b, a combination of a, and b, a *, b * that satisfies D _t ≦ αC and has the maximum evaluation formula η below, m _{b *} → m _{b *} −1, m _{a *} → m _{a *} +1.

(iv) Repeat steps (ii) and (iii) as long as there exists a set of a and b that satisfy Y _t <Y _t−1 and D _t ≦ αC.

As illustrated in the case of b = a + 2 in FIG. 5, in step (ii), those of popularity up in the configuration content for each G _g ranging from a <g ≦ b respectively, G _g Move to _-1 . In order to move the content to a more popular group, H _t <H _t−1 , D _t > D _t−1 . Therefore, since D _t increases monotonously as the iteration proceeds, the above algorithm ends with a finite number of iterations.

In addition, D is maximum when all contents are classified as G ₁ (m ₁ = M), and the maximum value is M / 2. Therefore, D = min (αC, M / 2) On the other hand, D is minimized when all contents are classified as G _K (m _k = M), which corresponds to the initial state in the above algorithm. Therefore, the minimum possible value of D becomes D _min = M / 2 ^K. When D _min > αC, there is no content grouping pattern that satisfies the constraint condition D ≦ αC, and therefore α has a settable lower limit value α _min = N / C2 ^K. Therefore, α = βα _min is set using a parameter β that takes a real value of 1 or more.

[Numeric evaluation]
In the following, the commercial ISP backbone NW whose PoP level topology is disclosed on the CAIDA web page (http://www.caida.org/data) will be distributed to 30 NWs with 13 or more nodes. The result of applying the DCC proposed in the invention is shown. The number of contents is M = 10,000, the request generation ratio p _n of each node n is the ratio of the population of the city where the node n exists, the request ratio q _m of each content m is the Zipf distribution of parameter 1, and the cache of each router Set the capacity to C = 10 (content). As described in [2], each router estimates q _m based on the number of Interest measurements. In numerical evaluation, the set value of q _m is used in all nodes. Computer simulation is started with all router caches empty, and statistics are started when C contents are cached in all router caches.

In the evaluation, the average inter-node hop distance Y ₀ is

Define in. Y ₀ corresponds to the distribution flow average hop length when all contents are distributed from the original server without using a cache. In the NW of 30 used for the evaluation, Y ₀ is a value in the range of 1.77 to 9.31.

  Next, the optimum setting value of the parameter β is evaluated.

  The K of each NW of 30 takes one of 4, 5, 6, and 7 depending on the scale. FIG. 6A shows four NWs (N1, N2, N3, For N9), the average hop length Y to the cache candidate router of each content when β is changed in the range of 1 ≦ β <10 is plotted. Similarly, in FIG. 6B, the average cache target content number D of each router in each of these four NWs is plotted against β.

  Since the cache hit rate decreases as D increases, it is desirable that both Y and D are small. As β increases, the constraints on greedy calculation shown in [5] are relaxed, and as a result of categorizing more content into more popular groups, Y decreases, but in the region where β is close to 1. The degree of decrease is large, and the reduction rate of Y decreases as β increases. On the other hand, as β increases, α increases and D increases linearly, but becomes constant when M / 2 is reached.

  From the above trend, start from β = 1, and β is an arbitrary constant

The maximum value β * of β at which the Y reduction rate is larger than the D increase rate when it is increased only by β is set to β. In subsequent numerical evaluation

Set to.

In 30 NWs used for evaluation, β * was in the range of 1.10 to 1.28. However, as NW with a large Y ₀ , the effect of reducing Y increases, so β * is large and D is small. Y is independent of the scale of the NW, Big Y ₀ is as large NW.

[Cache hit rate]
In order to confirm the effectiveness of DCC, the average cache hit rate W in DCC is compared with W in conventional CCN. If the relevant content is cached in any router on the Interest transfer path before the Interest sent from the node where the distribution request originates reaches the original server accommodating node, the cache is considered to be hit, and the total distribution request Let W be the ratio of the number of cache hits to the number. However, in the calculation of W, if the corresponding content is cached at the request generation node and the delivery hop length becomes zero, it is excluded. CCN does not control the cache position of content, but caches it in all routers on the content transfer path (default-path).

In FIG. 7 (a), it is plotted respectively W in each of the 30 NW respect Y _0. Moreover, the improvement rate of W compared with CCN of DCC is plotted in FIG.7 (b). However, if the values of W in DCC and CCN are W _d and W _c , respectively, the improvement rate of W is defined as (W _d −W _c ) / Wc. By using DCC, an improvement effect of about 5% to 70% of W is observed in all NWs, but the effectiveness of DCC is particularly remarkable in NWs with a large Y ₀ .

In addition, in FIG. 8 (a), the improvement rate of W of _mg contents constituting each popularity group g is shown for each of the 5 NWs having the smallest improvement rate of 30 NWs. Plot against g. Similarly, in FIG. 8B, the improvement rate of W for each group is plotted against each of the five NWs having the largest improvement rate of W. In many NWs, the improvement effect of W can be seen for popular contents classified into the top three groups, G ₁ , G ₂ , and G ₃ , in which the most popular contents are classified. The W improvement effect of content that is classified as G ₂ or G ₃ but is not at the top level but relatively high in popularity is great. When all routers target content as caches, caches of many routers are filled with a small number of content items with the highest level of popularity, so the cache hit rate of content that decreases in popularity decreases. On the other hand, by using DCC, the cache position of the top-level content is limited to half of the routers, and the free space of the generated cache can be used effectively for content that is slightly less popular.

On the other hand, W of a group such as G _{4 to} G ₇ in which content with low popularity is classified is reduced by using DCC. In conventional CCN, even low-popular content is cached in all routers and remains cached until it is deleted by LRU, whereas in the present invention (DCC) This is because only a small number of routers are always candidates for cache locations for low popularity content. From the above, it is confirmed that the present invention (DCC) can distribute the cache position of the content according to the popularity and improve the average cache hit rate as a whole.

[Hop length of distribution flow]
FIG. 9A plots the average delivery flow hop length Z of 30 NWs against Y ₀ , and FIG. 9B plots the reduction rate of Z compared to the CCN of the present invention (DCC). However, if the values of Z in the DCC and CCN of the present invention are Z _d and Z _c , respectively, the reduction rate of Z is defined as (Z _c −Z _d ) / Zc. If the average hop length at the time of cache hit is Z _c and the average hop length at the time of delivery from the original server due to a cache miss is Z _s , Z = WZ _c + (1-W) Z _s , but Z _s is DCC Since both CCNs are equal, the effect of reducing Z by the present invention (DCC) is small compared to the effect of improving W. However, by using the present invention (DCC), Z is reduced in all NWs, and a reduction effect of about 3% to 20% is seen compared to conventional CCN. Similar to the cache hit rate, the effectiveness of DCC becomes particularly noticeable in NW where Y ₀ is large.

FIG. 10 (a) plots the Z reduction rate of each popularity group g against g for each of the 5 NWs having the smallest Z reduction rate among 30 NWs. Similarly, FIG. 10B plots the group-specific Z reduction rate for each of the five NWs having the largest Z reduction rate. In many NW, a large reduction of Z for the high popularity content classified into G _1. As seen in Fig. 8, the improvement rate of W is larger than G _{1 for} G ₂ and G _3, but the content of G ₁ is cached by many routers, and the Z reduction effect at the time of cache hit is maximized . Although the reduction of Z is seen in the high-to-medium groups, Z increases slightly in the low-ranking groups.

  The processing of the configuration of the cache control device shown in FIG. 1 can be constructed as a program, installed on a computer that becomes a node on the CCN, executed, or distributed via a network.

  The present invention is not limited to the above-described embodiments, and various modifications and applications are possible within the scope of the claims.

100 Cache Control Device 101 Content Existence Checking Unit 102 Interest Counting Unit 103 PGT
104 Cache memory 105 Content transmission unit 106 FIB inspection unit 107 FIB
108 FIB composition unit 109 Content popularity group classification unit 110 Content reception unit 111 Content popularity group determination unit 112 PIT inspection unit 113 PIT
114 OST

Claims (8)

In CCN (Content Centric Networking) that caches content and performs data transfer with the content name as the address, a cache control device provided on the router for distributing and distributing the content to each router,
An original number providing a unique number (node ID) represented by a binary number of ^K bits (where K is a minimum integer satisfying 2 ^K ≧ N) is assigned to N routers on the CCN and provides content If the server is connected,
A K-bit hash value H (A) obtained from the content name A and an original server table (OST) in which the ID of the original server providing the content is stored in association with each other;
When interest arrives from the input port n, the requested content A of the interest is stored in the cache memory, or if the original server is accommodated with reference to the OST, the requested content A is input to the input port n. If not, the hash value H (A) is searched based on the hash value H (A). If the input port n is not registered, the hash value is searched. Content existence inspection means for registering H (A) in the PIT;
When receiving the content, based on the hash value H (A), search the PIT, content receiving means for sending the content to the obtained port;
A cache control device comprising: Calculates the popularity of the content based on the interest count that arrived at its own device, classifies it into K groups according to the popularity, and stores it in the popularity group table (PGT) together with the hash value H (A) A content popular group classification means for
The content existence inspection means includes:
By referring to the entry of the hash value H (A) of the PGT, the popularity group g of the content A is acquired, and the upper g bits of the hash value H (A) are the upper g bits of the node ID of the router The cache control apparatus according to claim 1, further comprising means for caching the content A only when it matches. 2. The cache control apparatus according to claim 1, further comprising means for transferring the interest using a node ID having a fixed bit length and a smaller number of bits as compared to the content name. It also has a table (FIB) that stores the target node ID and the next hop destination,
The PIT is
The input port number where the interest arrived is stored together with the hash value of the content name A,
The content receiving means includes
The cache control device according to claim 1, further comprising means for determining a transfer destination output port of the arrived content with reference to the PIT and the FIB. The node ID set for each node is set so that S _k (x) is set to the upper k bits in order to assign the same bit to the router existing spatially away from the upper bit of the node ID. A process of assigning the k-th bit value to each node n of n∈S _k−1 (x), where x = (x ₁ , x ₂ ,..., x _k ) 2. The cache control device according to claim 1, wherein the cache control device is an ID obtained by repeating in the order of k = 1, 2,. In CCN (Content Centric Networking) that caches content and transfers data with the content name as the address, a cache control method provided on the router for distributing and distributing the content to each router,
An original server that provides content by assigning a unique number (node ID) represented by a binary number of K (where K is the smallest integer satisfying 2 ^K ≧ N) to N routers on the CCN Is connected,
In an apparatus having an original server table (OST) in which the K-bit hash value H (A) obtained from the content name A and the ID of the original server providing the content are stored in association with each other,
When interest arrives from the input port n, the requested content A of the interest is stored in the cache memory, or if the original server is accommodated with reference to the OST, the requested content A is input to the input port n. If not, the hash value H (A) is searched based on the hash value H (A). If the input port n is not registered, the hash value is searched. A content existence inspection step of registering H (A) in the PIT;
When receiving the content, based on the hash value H (A), searching for the PIT, a content receiving step of sending the content to the obtained port;
And a cache control method. For the node ID set for each node, further performs a node allocation step of allocating the same bit to a router existing in a spatially distant place from the higher-order bit of the node ID,
In the node assignment step,
When S _k (x) is a set of nodes in which x = (x ₁ , x ₂ , ..., x _k ) is assigned to the upper k bits, for each node n of n∈S _k-1 (x) The cache control method according to claim 6, wherein the process of assigning the k-th bit value is repeated in the order of k = 1, 2,. A cache control program for causing a computer to function as each unit of the cache control device according to any one of claims 1 to 5.