Information center network node cache replacement method

Abstract

The invention discloses an information center network node cache replacement method. The method comprises the following steps: receiving, by a node, a data packet ck sent by an upper level node; calculating a cache probability pk of the ck at the node and a discarding probability of each data packet cached in the node; if a data packet with the cache probability smaller than the pick exists in thedata packets stored in the node, discarding, by the node, the stored data packet with the lowest cache value, and caching the ck; sending, by the node, the ck to a next level node; and updating the cache state of the node. By adoption of the technical scheme of the invention, the utilization rate of the cache space of the node and the network transmission efficiency are effectively improved.

Description

technical field [0001] The present invention relates to a new network environment combining wireless network virtualization (abbreviation, WNV) technology and information center network (abbreviation, ICN): wireless network virtualization information center (abbreviation, ICWNV) network data transmission technology, in particular to a Node data cache replacement method in ICWNV network. Background technique [0002] As one of the most promising architectures in the next-generation network architecture, WNV is to meet the needs of diverse applications by building a virtual network (VN for short) on the existing network while retaining the existing Internet. Network virtualization is the virtualization of network devices, that is, to enhance traditional routers, switches and other devices so that they can support a large number of scalable applications. WNV technology solves the rigid problem faced by the current Internet network architecture. It abstracts the shared underlyi...

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