Information Center Network Node Cache Replacement Method

Abstract

The invention discloses a cache replacement method of an information center network node, comprising: the node receives the data packet c sent by the upper node k ; calculate c k The caching probability p at the node ik and the discarding probability of each data packet that has been cached in the node; if the cached probability in the data packet that the node has saved is less than the p ik , the node discards the saved packet with the lowest cache value, and caches the c k ; the node sends the c k to its next-level node; update the cache status of said node. The technical scheme of the invention can effectively improve the utilization rate of the node cache space and the transmission efficiency of the network.

Description

Technical field [0001] The present invention relates to a new network environment combined with a wireless network virtualization (referred to as WNV) technology and information center network (referred to as ICN): wireless network virtualization information center (referred to as ICWNV) network data transmission technology, particularly Node data cache replacement method in the ICWNV network. Background technique [0002] As one of the most developed architectures of the next generation network architecture, WNV is one of the most developed architecture, that is, under the premise of retaining existing Internet, the demand for diverse applications is to meet the demand for diverse applications by building virtual networks (referred to as, VN) on existing networks. Network virtualization is virtualization of network devices, which is enhanced for traditional routers, switches, and other devices to support a large number of scalable applications. The WNV technology is to solve the...

AI Technical Summary

Problems solved by technology

[0009] The problem with the above three replacement methods is that the least-recently-used method only considers the most recent use time of the data, and when performing cache replacement, the content with high frequency of use will be deleted, while the content with low frequency of use will be retained; recently The lowest frequency method only considers the frequency of content usage. If a certain content has been requested a lot in the past period of time, the content has a relatively high request frequency. High-frequency requests make the content gain a larger proportion, so the content cannot be replaced in time even if the current request frequency is very low, thus occupying memory space for a long time; the first-in-first-out method is the simplest in node implementation, but in the process of Content replacement does not take into account node cache content usage

[0010] The above-mentioned problem of the prior art is that at the same time, when replacing the cached data, only a single factor that affects whether the data is cached or deleted is considered, such as the number of hops required by the current user to access the data, the latest access time, and the access frequency. The use value of data in the network is not considered comprehensively, which is not conducive to the caching of data in nodes and improving the overall transmission efficiency of the network

Images