Multi-attribute collaborative caching method for information center network cache privacy protection

[0018] The present invention will be further described below in conjunction with the accompanying drawings.

[0019] The present invention analyzes the cache privacy leakage problem of the information center network, and proposes a multi-attribute cooperative cache decision-making method for information center network cache privacy protection based on the existing cache privacy protection method and utilizing cooperative cache between nodes.

[0020] The present invention realizes the attribution uncertainty of cached content, reduces the possibility of cached privacy leakage, improves network performance, improves cache hit rate, and reduces retrieval time delay and average hops.

[0021] The present invention collects the future popularity of the request content of the nodes along the way, the node betweenness, the node hop count, and the node cache pressure by using the interest packet to form a four-tuple information set, and then uses the TOPSIS algorithm to hit the node (cached the request) content nodes) judge these four-tuple information to obtain the best node for caching data content, and then use the returned hop number information to store the content requested by the user in the best cache node. On the one hand, it can reduce cache redundancy and improve network Performance, on the other hand, increases the ownership uncertainty of cached content, thereby reducing user cache privacy leaks and protecting user cache privacy.

[0022] Although there are some solutions to cache privacy leaks, these methods have large transmission delay and cache redundancy. The multi-attribute cooperative cache decision-making method considers four important attributes that affect the cache performance, namely the future popularity of the requested content, node betweenness, node hops and node cache pressure, and caches based on the information of these four attributes of the nodes to be decided Decision-making, the content of the data packet load is cached at the best node determined by the decision, on the one hand, the uncertainty of the ownership of the cached content is increased, and on the other hand, four attribute values ​​​​are used in the cache decision, and the four attributes of the nodes along the way are considered comprehensively. The information of various attributes can realize local optimal cache deployment, minimize cache redundancy, reduce the homogeneity of node cache, improve cache hit rate, and reduce the number of hops and retrieval delay of Interest packet requests.

[0023] In the present invention, firstly, the content requester requests a content of interest to send an interest packet, and when the interest packet passes through a node during routing and forwarding, the access times of the requested content of the node will be updated. Then look for CS, if there is no content with the same name in CS, then look up the PIT table to see if there is a match; if there is no match, check if there is a record in FIB, if there is, call the content popularity prediction module to get the predicted content future Popularity, get the betweenness of the current node, get the hop count of the current node (get the hop count of the previous forwarding node and add 1, set the request user’s hop count to 0), call the cache pressure estimation module to get the cache pressure of the current node , after obtaining the four-tuple information and attaching it to the Interest packet, and then forwarding the Interest packet according to the FIB entry; if there is a match in the PIT, add the access interface of the Interest packet to the corresponding entry of the PIT , and delete the interest packet. If there is corresponding content in CS, that is, the node is a cache node, the node obtains its own 4-tuple information, and obtains the 4-tuple information of other nodes along the way from the Interest packet; the node calls TOPSIS according to the obtained 4-tuple information set The algorithm obtains the best cache node and calculates the number of return hops, constructs the data packet, and then in the Hop of the data packet back Add the number of return hops to the option, and then send the data packet to the network.

[0024] When the data packet returns along the original path forwarded by the route of the Interest packet, it will first check whether there is the same content in the CS every time it passes through a node. If there is the same content, it means that the node has a copy of the content. The information carried by the data packet is Redundant information will directly delete the data packet. If it does not exist, then check whether there is a matching record in the PIT table. If the matching fails, it means that the node has not forwarded the Interest packet requesting the content in the recent period, and then directly delete the data packet. If the matching PIT table is successful, it means that the node has forwarded the interest packet requesting the content in the recent period, and this node may be the best cache node.

[0025] In order to judge whether the node is the best cache node, the hop number information (location information) stored in the data packet should be obtained at this time. If the hop number information is greater than 0, the hop number information will be reduced by 1. If the hop number information becomes 0, indicating that the node is the optimal cache node determined, and at this time, the content information stored in the data packet should be cached in the CS resource library of the node. Then the modified hop information needs to be updated to the Hop of the data packet back field, and then proceed to forward the packet to the next node. If the number of hops is not greater than 0, it means that the data content has been cached to the best cache node, and other nodes only need to forward the data packet.

[0026] The above descriptions are only preferred embodiments of the present invention, and are not intended to limit the present invention. For those skilled in the art, the present invention may have various modifications and changes. Any modifications, equivalent replacements, improvements, etc. made within the spirit and principles of the present invention shall be included within the protection scope of the present invention.