CN110086857B - Information center network cache deployment method based on cache node state and position - Google Patents
Information center network cache deployment method based on cache node state and position Download PDFInfo
- Publication number
- CN110086857B CN110086857B CN201910300134.8A CN201910300134A CN110086857B CN 110086857 B CN110086857 B CN 110086857B CN 201910300134 A CN201910300134 A CN 201910300134A CN 110086857 B CN110086857 B CN 110086857B
- Authority
- CN
- China
- Prior art keywords
- state value
- cache
- state
- node
- data packet
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/52—Network services specially adapted for the location of the user terminal
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/56—Provisioning of proxy services
- H04L67/568—Storing data temporarily at an intermediate stage, e.g. caching
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/56—Provisioning of proxy services
- H04L67/568—Storing data temporarily at an intermediate stage, e.g. caching
- H04L67/5682—Policies or rules for updating, deleting or replacing the stored data
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention belongs to the technical field of communication, and discloses an information center network cache deployment method based on cache node states and positions, which comprises the following steps: step (1): calculating a finally obtained state value; step (2): calculating a cache rate; and (3): establishing a data packet state value: adding an extra field in the data packet to be recorded as a data packet state value; and (4): establishing a state record table: adding a state record table to each cache node, wherein the state record table comprises a data name and a state value of the state record table in the interest packet; and (5): and selecting a cache node, updating the state value of the data packet and modifying the state record table. The invention improves the hit rate of the cache, reduces the network delay and reduces the average request length of the user; the state and the position of the cache node are comprehensively considered, and a better cache position is obtained at very low communication cost; excessive fields do not need to be added in the data packet, and the data packet cannot be bloated.
Description
Technical Field
The invention belongs to the technical field of communication, and particularly relates to an information center network cache deployment method based on cache node states and positions.
Background
The caching function is the advantage of the information center network, the caching efficiency directly determines the overall performance of the information center network, and the deployment strategy of caching is the important priority of the caching strategy. In recent years, various scholars are more interested in researching the performance improvement of the information center network caused by the cache deployment strategy. For the deployment strategy of the cache, the efficient network utilization and the high availability of data should be focused. From the perspective of a P2P system and CDN technology, cache deployment at the network edge is very helpful for improving cache hit rate, but the information-centric network supports the deployment of caches on all routers, and not only edge nodes but also central nodes are still suitable for deploying caches, so that the deployment policy of caches will be a critical factor in determining the overall performance of the information-centric network.
The cache deployment strategy is also called a cache decision strategy, and can be divided into three types, namely a non-cooperative cache, an explicit cooperative cache and an implicit cooperative cache according to a cooperative mode.
Although the explicit cooperative cache can bring higher cache efficiency, the explicit cooperative cache needs a large amount of mutual information and is too complex in calculation method, and the non-cooperative cache has a large amount of data redundancy. The implicit cooperative cache integrates the advantages of the two cache cooperation modes.
Implicit cooperative caching mainly depends on some additional messages for caching decision, such as caching node position, content popularity, probability, caching node state and the like. Because the performance of the implicit cooperative cache is high and the cost is low, the implicit cooperative cache has the highest occupation ratio in the three cache deployment strategies. The implicit cooperative cache is a cache mode which is very suitable for a network in information, does not need the global computing and communication capacity of the explicit cooperative cache, and does not have a large amount of redundant data generated by the uncooperative cache. Typical representatives of implicit cooperative caching are LCD, MCD, ProbCache, etc., all of which are intended to bring the caching closer to the consumer on the link, thereby reducing network latency, but do not consider whether the status of each caching node is suitable for continuing to cache information.
Disclosure of Invention
The invention aims to disclose an information center network cache deployment method based on cache node states and positions, which has high cache hit rate and small average request length.
The purpose of the invention is realized as follows:
the information center network cache deployment method based on the cache node state and the position comprises the following steps:
step (1): calculating a finally obtained state value;
step (2): calculating a cache rate;
and (3): establishing a data packet state value: adding an extra field in the data packet to be recorded as a data packet state value;
and (4): establishing a state record table: adding a state record table to each cache node, wherein the state record table comprises a data name and a state value of the state record table in the interest packet;
and (5): and selecting a cache node, updating the state value of the data packet and modifying the state record table.
Further, the finally obtained status Value:
Value＝α*Vk+β*Vhop+γ*Vhitk,α,β,γ∈N；
in the above formula, VkIs a state value, V, obtained from the number K of pre-filter queueshopIs a state value, V, derived from the link positionhitkData of the data name in the interest packet exists in the first prefiltering queue, alpha is the weight of the state value obtained according to the number K of the prefiltering queues, beta is the weight of the state value obtained according to the link position, and gamma is the weight of the data name in the interest packet exists in the first prefiltering queue.
Further, the cache rate CacheRate:
in the above formula, NCachedIs the number of times the cache node is selected, NtotalIs the received interest package.
Further, when the state value of the data packet is 0, the meaning is that the node with the maximum state value is cached, and the node with the minimum caching rate is cached; when the data packet state value is 1, the meaning is that the node with the maximum state value is cached, and the node with the minimum caching rate is not cached; when the data packet state value is 2, the meaning is that the node with the maximum state value is not cached, and the node with the minimum caching rate is cached; the meaning of the data packet state value being 3 is that the maximum state value node is not cached, and the minimum cache rate node is not cached.
Further, when the state value of the state record table is 1, the meaning is that the node cannot be the maximum state value node, and the node can be the minimum cache rate node; when the state value of the state record table is 2, the node is possibly the maximum state value node and is not possibly the minimum cache rate node; the meaning of the state value of the state record table being 3 is that the node may be the maximum state value node, and may be the minimum cache rate node.
Further, the selecting a cache node in step (5) specifically includes: and selecting one or two nodes with the maximum state value and the node with the minimum cache rate on the request path of each interest packet as cache nodes to cache the data packet, wherein if the two cache nodes are the same node, the data packet is cached on the one node, and otherwise, the data packet is cached on the two cache nodes.
Further, the updating of the packet status value and the modifying of the status record table in step (5) are specifically as follows:
when the client sends out the interest packet, setting the maximum state value in the interest packet to be 0 and the minimum cache rate to be 1; on each cache node, comparing the finally obtained state value and cache rate of the current cache node with the maximum state value and the minimum cache rate in the interest packet: if the finally obtained state value of the current cache node is larger than the maximum state value in the interest packet, updating the maximum state value in the interest packet during forwarding, if the cache rate of the current cache node is smaller than the minimum cache rate in the interest packet, updating the minimum cache rate in the interest packet during forwarding, and recording the data name and the state value of the state record table in the state record table according to the comparison result; if the finally obtained state value of the current cache node is smaller than the maximum state value in the interest packet and the cache rate of the current cache node is higher than the minimum cache rate in the interest packet, the maximum state value and the minimum cache rate of the interest packet are not modified; when the finally obtained state value of the current cache node is the same as the maximum state value of the interest packet or the cache rate of the current cache node is the same as the minimum cache rate of the interest packet, not caching;
when the responding data packet is returned by the producer along the interest packet path, inquiring a state record table corresponding to the content name of the interest packet in each cache node, and if no record exists, directly forwarding the data packet; and if the record exists, performing AND operation on the data packet state value and the state record table state value, if the AND operation result is greater than 0, caching the data packet, updating the data packet state value into a difference value between the data packet state value and the operation result, and deleting the record in the state record table.
Further, the rule of AND operation is defined as:
when the state value of the state recording table is 1 and the state value of the data packet is 0, the AND operation result is 0;
when the state value of the state recording table is 1 and the state value of the data packet is 1, the AND operation result is 1;
when the state value of the state recording table is 1 and the state value of the data packet is 2, the AND operation result is 0;
when the state value of the state recording table is 1 and the state value of the data packet is 3, the AND operation result is 1;
when the state value of the state recording table is 2 and the state value of the data packet is 0, the AND operation result is 0;
when the state value of the state recording table is 2 and the state value of the data packet is 1, the AND operation result is 0;
when the state value of the state recording table is 2 and the state value of the data packet is 2, the AND operation result is 2;
when the state value of the state recording table is 2 and the state value of the data packet is 3, the AND operation result is 2;
when the state value of the state recording table is 3 and the state value of the data packet is 0, the AND operation result is 0;
when the state value of the state recording table is 3 and the state value of the data packet is 1, the AND operation result is 1;
when the state value of the state recording table is 3 and the state value of the data packet is 2, the AND operation result is 2;
when the status record table status value is 3 and the packet status value is 3, the and operation result is 3.
The invention has the beneficial effects that:
the invention improves the hit rate of the cache, reduces the network delay and reduces the average request length of the user; the state and the position of the cache node are comprehensively considered, and a better cache position is obtained at very low communication cost; excessive fields do not need to be added in the data packet, and the data packet cannot be bloated.
Drawings
FIG. 1 is a diagram of information centric networking cache deployment method steps based on cache node status and location;
FIG. 2 is a schematic diagram of an interest packet forwarding flow of an information centric network cache deployment method based on cache node states and locations;
FIG. 3 is a schematic diagram of a packet forwarding flow of an information centric network cache deployment method based on cache node status and location;
FIG. 4 is a graph comparing experiments of cache hit rates;
FIG. 5 is a comparison graph of experiments requesting stretch ratios of paths;
FIG. 6 is a comparison graph of experiments with different concentrations of content;
fig. 7 is a comparison graph of experiments with different buffer sizes.
Detailed Description
The invention is further described below with reference to the accompanying drawings:
as shown in fig. 1, the information center network cache deployment method based on the state and position of the cache node includes the following steps:
step (1): calculating a finally obtained state value;
the cache node state value is an important index for evaluating whether the cache node in the information center network is suitable for caching, and the cache node state value is more suitable for caching when the cache content is less and more suitable for caching when the cache node is closer to a user. At present, the state value of each cache node is determined by three parts of factors, but for cache nodes in different network environments, the proportion of each factor is different, and therefore, a weighting mode is adopted for calculation.
The resulting status Value:
Value＝α*Vk+β*Vhop+γ*Vhitk,α,β,γ∈N；
in the above formula, VkIs a state value, V, obtained from the number K of pre-filter queueshopIs a state value, V, derived from the link positionhitkData of the data name in the interest packet exists in the first prefiltering queue, alpha is the weight of the state value obtained according to the number K of the prefiltering queues, beta is the weight of the state value obtained according to the link position, and gamma is the weight of the data name in the interest packet exists in the first prefiltering queue. In order to reduce the precision problem brought by floating-point representation, non-negative integers are adopted for representation.
The buffer queue state is determined by the value of K in the dynamic LRU-K algorithm, i.e. the number of pre-filtering queues. When the number of the pre-filtering queues of one cache node is large, the number of the cache required by the node is large, and compared with the cache node with a small K value, the cache node with a large K value needs to be placed into the cache queue after long-time filtering.
In the information center network, the information is more hopefully cached on the edge cache node, so that the average request hop count of a user can be reduced, the network delay is reduced, and the load of the center network is reduced. The link position takes the hop count as a calculation unit, and the hop count is increased by one when passing through one router.
The dynamic LRU-K cache replacement policy mentions that the policy has K pre-filtering queues, and only after the cache node passes the number of times of caching required by the K-th queue, the data packet is placed in the cache queue, so when judging whether a cache node is suitable for caching a certain data packet, whether the data packet is currently in the pre-filtering queues and the number of pre-filtering queues should be considered. The main purpose of this parameter is to reduce the influence of multiple nodes on data filtering, and the importance of the Value calculation formula is determined according to the parameter, and generally speaking, the nodes of the data already in the pre-filtering queue should be considered preferentially, so that the data can be cached as soon as possible.
Step (2): calculating a cache rate, namely, CacheRate:
the cache rate is a ratio of the number of times of selecting the cache node to the received interest packet, and the concept of the cache rate is mainly provided because when the cache node is selected through the state value, the edge node is frequently selected as the cache node, so that the problem is mainly caused because the state value is distributed unevenly and the cache probability of the node close to the content source is very small, so that the cache rate is provided, and the point with the minimum cache rate is selected on the forwarding path of the interest packet for caching once, so as to make up the defect caused by selecting the cache node only through the state value.
In the above formula, NCachedIs the number of times the cache node is selected, NtotalIs the received interest package.
And (3): establishing a data packet state value: adding an extra field in the data packet to be recorded as a data packet state value;
as shown in fig. 3, the data packet is a response data packet sent back by the content publisher according to the direction of the sending path of the interest packet, and the data packet includes the name of the data and the data content, but it is not known for the current deployment policy whether the data packet is cached on the path, so an additional field needs to be added to tell the subsequent caching node whether the data packet can be cached. After a data packet is cached in a certain node, the state value of the field should be modified, and the subsequent node judges whether to continue caching the data packet according to the state value. On the transmission path of the data packet, two nodes of the maximum state value and the minimum buffer rate need to be found, so that two states need to be marked, and there are four cases in total, which can be respectively represented by 0, 1, 2 and 3.
When the data packet state value is 0, the meaning is that the node with the maximum state value is cached, and the node with the minimum caching rate is cached; when the data packet state value is 1, the meaning is that the node with the maximum state value is cached, and the node with the minimum caching rate is not cached; when the data packet state value is 2, the meaning is that the node with the maximum state value is not cached, and the node with the minimum caching rate is cached; the meaning of the data packet state value being 3 is that the maximum state value node is not cached, and the minimum cache rate node is not cached.
And (4): establishing a state record table: as shown in fig. 2, in order to record the maximum state value and the minimum cache rate of a cache node through which a certain interest packet passes, a state record table is added to each cache node, and the state record table includes a data name and a state record table state value in the interest packet; when the data packet returns, when the state value of the state record table corresponding to the data name in the state record table is inquired, if no record exists, it is shown that when the interest packet is transmitted, the state value is not higher than the maximum state value at the time, and the cache rate is not lower than the minimum cache rate at the time, so that the node is not selected as the cache node.
The state value of the state recording table is not stored in the SRT when not used as a node to be selected of the cache node, so that a state value does not need to be specially prepared for the state, and the occupied data space is reduced.
The main reason why the state values stored in the state record table cannot be directly judged whether to be the maximum state value node and the minimum cache rate node or not and need to be judged by combining the state values in the data packet is that whether the subsequent nodes have larger state values or smaller cache rates or not is not known in the forwarding process of the interest packet, and only the interest packet is the maximum state value or the minimum cache rate when being forwarded to the current node, so that two possible words need to be added. When the data packet returns along the path of the interest packet forwarding, if a node is encountered, which may be the maximum state value, and the state value in the data packet indicates that the node is not cached in the maximum state value node, it indicates that the current node is the node with the maximum state value, and the same is true for the judgment of the node with the minimum cache rate.
When the state value of the state record table is 1, the node cannot be the maximum state value node and can be the minimum cache rate node; when the state value of the state record table is 2, the node is possibly the maximum state value node and is not possibly the minimum cache rate node; the meaning of the state value of the state record table being 3 is that the node may be the maximum state value node, and may be the minimum cache rate node.
And (5): and selecting a cache node, updating the state value of the data packet and modifying the state record table.
And selecting one or two nodes with the maximum state value and the node with the minimum cache rate on the request path of each interest packet as cache nodes to cache the data packet, wherein if the two cache nodes are the same node, the data packet is cached on the one node, and otherwise, the data packet is cached on the two cache nodes.
When the client sends out the interest packet, setting the maximum state value in the interest packet to be 0 and the minimum cache rate to be 1; on each cache node, comparing the finally obtained state value and cache rate of the current cache node with the maximum state value and the minimum cache rate in the interest packet: if the finally obtained state value of the current cache node is larger than the maximum state value in the interest packet, updating the maximum state value in the interest packet during forwarding, if the cache rate of the current cache node is smaller than the minimum cache rate in the interest packet, updating the minimum cache rate in the interest packet during forwarding, and recording the data name and the state value of the state record table in the state record table according to the comparison result; if the finally obtained state value of the current cache node is smaller than the maximum state value in the interest packet and the cache rate of the current cache node is higher than the minimum cache rate in the interest packet, the maximum state value and the minimum cache rate of the interest packet are not modified; when the finally obtained state value of the current cache node is the same as the maximum state value of the interest packet or the cache rate of the current cache node is the same as the minimum cache rate of the interest packet, not caching; since there is a network edge that is more favorable for the distribution of the content, no replacement is performed when the state values or the cache rates are equal.
When the responding data packet is returned by the producer along the interest packet path, inquiring a state record table corresponding to the content name of the interest packet in each cache node, and if no record exists, directly forwarding the data packet; and if the record exists, performing AND operation on the data packet state value and the state record table state value, if the AND operation result is greater than 0, caching the data packet, updating the data packet state value into a difference value between the data packet state value and the operation result, and deleting the record in the state record table.
The rule of AND operation is defined as:
when the state value of the state recording table is 1 and the state value of the data packet is 0, the AND operation result is 0;
when the state value of the state recording table is 1 and the state value of the data packet is 1, the AND operation result is 1;
when the state value of the state recording table is 1 and the state value of the data packet is 2, the AND operation result is 0;
when the state value of the state recording table is 1 and the state value of the data packet is 3, the AND operation result is 1;
when the state value of the state recording table is 2 and the state value of the data packet is 0, the AND operation result is 0;
when the state value of the state recording table is 2 and the state value of the data packet is 1, the AND operation result is 0;
when the state value of the state recording table is 2 and the state value of the data packet is 2, the AND operation result is 2;
when the state value of the state recording table is 2 and the state value of the data packet is 3, the AND operation result is 2;
when the state value of the state recording table is 3 and the state value of the data packet is 0, the AND operation result is 0;
when the state value of the state recording table is 3 and the state value of the data packet is 1, the AND operation result is 1;
when the state value of the state recording table is 3 and the state value of the data packet is 2, the AND operation result is 2;
when the status record table status value is 3 and the packet status value is 3, the and operation result is 3.
Referring to fig. 4, comparing the experiments of cache hit rate, where MINE is the result of the present invention, it can be seen that the cache hit rate of the present invention is always higher than that of other methods under different parameters A, C and different experimental groups genant, WIDE, GARR, tisacli.
Secondly, from the experimental comparison chart of fig. 5 requesting the path scaling ratio, it can be seen that under different experimental parameters A, C, the cache hit rate of the present invention is also higher than that of the LCE, LCD, probbache, Random (Bernoulli) group.
Again, as in fig. 6, the cache hit rate is higher for the present invention than for other packets at different concentrations of content, and different parameters T, C.
Finally, from the experimental comparison chart of fig. 7 with different cache sizes, the cache hit rate of the present invention is also higher than that of LCE, LCD, ProbCache, Random (Bernoulli) group with different parameters T, A and different cache sizes.
Therefore, as can be seen from fig. 4, 5, 6 and 7, the present invention can significantly improve the cache hit rate.
Compared with the prior art, the invention improves the hit rate of the cache, reduces the network delay and reduces the average request length of the user; the state and the position of the cache node are comprehensively considered, and a better cache position is obtained at very low communication cost; excessive fields do not need to be added in the data packet, and the data packet cannot be bloated.
The above description is not intended to limit the present invention, and various modifications and changes may be made by those skilled in the art. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (7)
1. The information center network cache deployment method based on the cache node state and the position is characterized in that: comprises the following steps:
step (1): calculating a finally obtained state value;
the finally obtained state Value:
Value＝α*Vk+β*Vhop+γ*Vhitk,α,β,γ∈N；
in the above formula, VkIs a state value, V, obtained from the number K of pre-filter queueshopIs a state value, V, derived from the link positionhitkIs present in the second pre-filtering queueData of data names in the interest packets, wherein alpha is the weight of a state value obtained according to the number K of the pre-filtering queues, beta is the weight of a state value obtained according to the link position, and gamma is the weight of data of the data names in the interest packets in the second pre-filtering queue;
step (2): calculating a cache rate;
and (3): establishing a data packet state value: adding an extra field in the data packet to be recorded as a data packet state value;
and (4): establishing a state record table: adding a state record table to each cache node, wherein the state record table comprises a data name and a state value of the state record table in the interest packet;
and (5): and selecting a cache node, updating the state value of the data packet and modifying the state record table.
2. The cache deployment method of the information-centric network based on the state and the position of the cache node according to claim 1, characterized in that: the cache rate is as follows:
in the above formula, NCachedIs the number of times the cache node is selected, NtotalIs the received interest package.
3. The cache deployment method of the information-centric network based on the state and the position of the cache node according to claim 1, characterized in that: when the state value of the data packet is 0, the meaning is that the node with the maximum state value is cached, and the node with the minimum caching rate is cached; when the data packet state value is 1, the meaning is that the node with the maximum state value is cached, and the node with the minimum caching rate is not cached; when the data packet state value is 2, the meaning is that the node with the maximum state value is not cached, and the node with the minimum caching rate is cached; the meaning of the data packet state value being 3 is that the maximum state value node is not cached, and the minimum cache rate node is not cached.
4. The cache deployment method of the information-centric network based on the state and the position of the cache node according to claim 1, characterized in that: when the state value of the state record table is 1, the node cannot be the maximum state value node and can be the minimum cache rate node; when the state value of the state record table is 2, the node is possibly the maximum state value node and is not possibly the minimum cache rate node; the meaning of the state value of the state record table being 3 is that the node may be the maximum state value node, and may be the minimum cache rate node.
5. The cache deployment method of the information-centric network based on the state and the position of the cache node according to claim 1, characterized in that: the selecting a cache node in the step (5) is specifically:
and selecting one or two nodes with the maximum state value and the node with the minimum cache rate on the request path of each interest packet as cache nodes to cache the data packet, wherein if the two cache nodes are the same node, the data packet is cached on the one node, and otherwise, the data packet is cached on the two cache nodes.
6. The cache deployment method of the information-centric network based on the state and the position of the cache node according to claim 1, characterized in that: the updating of the state value of the data packet and the modification of the state record table in the step (5) are specifically as follows:
when the client sends out the interest packet, setting the maximum state value in the interest packet to be 0 and the minimum cache rate to be 1; on each cache node, comparing the finally obtained state value and cache rate of the current cache node with the maximum state value and the minimum cache rate in the interest packet: if the finally obtained state value of the current cache node is larger than the maximum state value in the interest packet, updating the maximum state value in the interest packet during forwarding, if the cache rate of the current cache node is smaller than the minimum cache rate in the interest packet, updating the minimum cache rate in the interest packet during forwarding, and recording the data name and the state value of the state record table in the state record table according to the comparison result; if the finally obtained state value of the current cache node is smaller than the maximum state value in the interest packet and the cache rate of the current cache node is higher than the minimum cache rate in the interest packet, the maximum state value and the minimum cache rate of the interest packet are not modified; when the finally obtained state value of the current cache node is the same as the maximum state value of the interest packet or the cache rate of the current cache node is the same as the minimum cache rate of the interest packet, not caching;
when the responding data packet is returned by the producer along the interest packet path, inquiring a state record table corresponding to the content name of the interest packet in each cache node, and if no record exists, directly forwarding the data packet; and if the record exists, performing AND operation on the data packet state value and the state record table state value, if the AND operation result is greater than 0, caching the data packet, updating the data packet state value into a difference value between the data packet state value and the operation result, and deleting the record in the state record table.
7. The cache deployment method of the information-centric network based on the state and the position of the cache node according to claim 6, characterized in that: the rules of the AND operation are defined as:
when the state value of the state recording table is 1 and the state value of the data packet is 0, the AND operation result is 0;
when the state value of the state recording table is 1 and the state value of the data packet is 1, the AND operation result is 1;
when the state value of the state recording table is 1 and the state value of the data packet is 2, the AND operation result is 0;
when the state value of the state recording table is 1 and the state value of the data packet is 3, the AND operation result is 1;
when the state value of the state recording table is 2 and the state value of the data packet is 0, the AND operation result is 0;
when the state value of the state recording table is 2 and the state value of the data packet is 1, the AND operation result is 0;
when the state value of the state recording table is 2 and the state value of the data packet is 2, the AND operation result is 2;
when the state value of the state recording table is 2 and the state value of the data packet is 3, the AND operation result is 2;
when the state value of the state recording table is 3 and the state value of the data packet is 0, the AND operation result is 0;
when the state value of the state recording table is 3 and the state value of the data packet is 1, the AND operation result is 1;
when the state value of the state recording table is 3 and the state value of the data packet is 2, the AND operation result is 2;
when the status record table status value is 3 and the packet status value is 3, the and operation result is 3.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910300134.8A CN110086857B (en) | 2019-04-15 | 2019-04-15 | Information center network cache deployment method based on cache node state and position |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910300134.8A CN110086857B (en) | 2019-04-15 | 2019-04-15 | Information center network cache deployment method based on cache node state and position |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110086857A CN110086857A (en) | 2019-08-02 |
| CN110086857B true CN110086857B (en) | 2022-01-14 |
Family
ID=67415028
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910300134.8A Active CN110086857B (en) | 2019-04-15 | 2019-04-15 | Information center network cache deployment method based on cache node state and position |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110086857B (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2009077057A1 (en) * | 2007-12-17 | 2009-06-25 | Alcatel Lucent | Method for distributing content data packages originated by users of a super peer-to-peer network |
| CN104753797A (en) * | 2015-04-09 | 2015-07-01 | 清华大学深圳研究生院 | Content center network dynamic routing method based on selective caching |
| CN106131182A (en) * | 2016-07-12 | 2016-11-16 | 重庆邮电大学 | A kind of cooperation caching method based on Popularity prediction in name data network |
| CN106464657A (en) * | 2014-05-30 | 2017-02-22 | 华为技术有限公司 | Method, device and system for transmitting data |
| CN106936877A (en) * | 2015-12-31 | 2017-07-07 | 华为软件技术有限公司 | A kind of content distribution method, apparatus and system |
| CN107181775A (en) * | 2016-03-10 | 2017-09-19 | 北京大学 | Route selection method and routing arrangement in content center network |
| CN108092899A (en) * | 2018-01-05 | 2018-05-29 | 北京工业大学 | Routing policy update method based on name data network under MANET environment |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR102100710B1 (en) * | 2012-11-26 | 2020-04-16 | 삼성전자주식회사 | Method for transmitting packet of node and content owner in content centric network |
| US10298713B2 (en) * | 2015-03-30 | 2019-05-21 | Huawei Technologies Co., Ltd. | Distributed content discovery for in-network caching |
-
2019
- 2019-04-15 CN CN201910300134.8A patent/CN110086857B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2009077057A1 (en) * | 2007-12-17 | 2009-06-25 | Alcatel Lucent | Method for distributing content data packages originated by users of a super peer-to-peer network |
| CN106464657A (en) * | 2014-05-30 | 2017-02-22 | 华为技术有限公司 | Method, device and system for transmitting data |
| CN104753797A (en) * | 2015-04-09 | 2015-07-01 | 清华大学深圳研究生院 | Content center network dynamic routing method based on selective caching |
| CN106936877A (en) * | 2015-12-31 | 2017-07-07 | 华为软件技术有限公司 | A kind of content distribution method, apparatus and system |
| CN107181775A (en) * | 2016-03-10 | 2017-09-19 | 北京大学 | Route selection method and routing arrangement in content center network |
| CN106131182A (en) * | 2016-07-12 | 2016-11-16 | 重庆邮电大学 | A kind of cooperation caching method based on Popularity prediction in name data network |
| CN108092899A (en) * | 2018-01-05 | 2018-05-29 | 北京工业大学 | Routing policy update method based on name data network under MANET environment |
Non-Patent Citations (3)
| Title |
|---|
| CRCache：Exploiting the correlation between content popularity and netork topology information for ICN caching;Wei Wang;《2014 IEEE Interntional Conference on Communications》;20140828;全文 * |
| 内容中心网络网内缓存策略研究;崔现东;《中国博士学位论文全文数据库信息科技辑》;20150415;I139-11 * |
| 基于混存开销的信息中心网络缓存协作策略;蔡凌;《东北大学学报（自然科学版）》;20180319;第39卷(第2期);166-171 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110086857A (en) | 2019-08-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Tang et al. | Coordinated en-route web caching | |
| CN111314224B (en) | Network caching method for named data | |
| EP2975820A1 (en) | Reputation-based strategy for forwarding and responding to interests over a content centric network | |
| US20080101233A1 (en) | Method and apparatus for load balancing internet traffic | |
| CN111107000B (en) | Content caching method in named data network based on network coding | |
| CN113783779B (en) | Hierarchical random caching method in named data network | |
| CN111935031B (en) | NDN architecture-based traffic optimization method and system | |
| Yu et al. | A caching strategy based on content popularity and router level for NDN | |
| CN113098783A (en) | Named data network congestion control method based on link bandwidth and time delay | |
| CN110505156B (en) | Low-overhead congestion control method in high-speed interconnection network | |
| CN112399485A (en) | CCN-based new node value and content popularity caching method in 6G | |
| Kumar et al. | Cpndd: Content placement approach in content centric networking | |
| CN111683017A (en) | Multi-level congestion control method, device, system and medium in high-speed interconnection network | |
| Abdelaal et al. | liteNDN: QoS-aware packet forwarding and caching for named data networks | |
| CN110086857B (en) | Information center network cache deployment method based on cache node state and position | |
| Lv et al. | A smart ACO‐inspired named data networking forwarding scheme with clustering analysis | |
| CN106657181B (en) | Data pushing method based on content-centric network | |
| CN109818855B (en) | Method for obtaining content by supporting pipeline mode in NDN (named data networking) | |
| Feng et al. | Cache-filter: A cache permission policy for information-centric networking | |
| CN114884893B (en) | Forwarding and control definable cooperative traffic scheduling method and system | |
| CN117439655A (en) | Space terahertz information center network lightweight caching method and device | |
| CN107135271B (en) | Energy-efficient content-centric network caching method | |
| CN111262785B (en) | Multi-attribute probability caching method in named data network | |
| Gulati et al. | AdCaS: Adaptive caching for storage space analysis using content centric networking | |
| CN117579543B (en) | Data stream segmentation method, device, equipment and computer readable storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |