CN103905538A - Neighbor cooperation cache replacement method in content center network - Google Patents
Neighbor cooperation cache replacement method in content center network Download PDFInfo
- Publication number
- CN103905538A CN103905538A CN201410108361.8A CN201410108361A CN103905538A CN 103905538 A CN103905538 A CN 103905538A CN 201410108361 A CN201410108361 A CN 201410108361A CN 103905538 A CN103905538 A CN 103905538A
- Authority
- CN
- China
- Prior art keywords
- node
- content
- cache
- new data
- buffer memory
- 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.)
- Pending
Links
Images
Abstract
The invention relates to a neighbor cooperation cache replacement method in a content center network. The method is characterized by comprising the steps that step 1, when a node i has a new data einew request, if the cache space of the node i is full is judged; if the cache space of the node i is not full, the step 3 is executed directly; if the cache space of the node i is full, the step 2 is executed, and judging of cooperation cache replacement is carried out; step 2, if the new data einew is cached in a neighbor node of the node i is checked, and if the new data einew is cached, the new data einew is no longer cached in the node i; if the new data einew is not cached, the step 3 is executed; step 3, the new data einew is cached in the local through LRU cache replacement algorithm.
Description
Technical field
The present invention relates to neighbours' cooperation caching replacement method in a kind of content center network.
Background technology
Along with the fast development of computer and Internet technology, people obtain the demand of large data from the Internet increasing.Therefore, a kind of novel network centered by content (Content-Centric Network, CCN) architecture is arisen at the historic moment.Nearly 2 years, attract wide attention with the research of content center network architecture.Also comprise NDN(Named Data Networking with the next generation network framework of CCN common development), MobilityFirst, NEBULA, XIA(eXpressive Internet Architecture) etc.In numerous next generation network architectures, CCN has more advantage, is also to study at present more architecture.CCN has the name of network-caching, content, based on characteristics such as requestor's driving, data securities, wherein network-caching (In-Network Caching) is the important component part of CCN architecture.By content caching is arrived to CCN node, can alleviate server stress, reduce offered load, reduce request of data delay, strengthen mobility etc., thus raising network performance.
The effect of CCN nodal cache is data in network to store temporarily, improves the efficiency of request of data.At present, in CCN, node carries out buffer memory without distinction to the data of all processes, be called " through be buffer memory " mode, due to the spatial cache of node, to compare network data much smaller, when spatial cache need to take cache replacement algorithm to replace out historical data with buffer memory new data completely time.CCN node has similar function to route utensil in traditional IP, is responsible for routing addressing and the data retransmission of packet in network, and different is that CCN node carries out Route Selection according to the name of packet, has data buffer storage function simultaneously.For ensureing efficiently deal with data of CCN node, should not adopt the cache replacement policy that complexity is higher.
At present, and acquiescence employing in CCN " Leave Copy Everywhere(LCE) " buffer memory selection strategy, node carries out buffer memory without distinction to the data of all processes.Adopt LRU (Least Recently Used least recently used algorithm) cache replacement policy, the application of LRU cache policy in CCN has good behaviour, but LCE cache way based on CCN acquiescence, can cause the redundancy of cache contents in network.In the middle of traditional buffer memory network, for the cache way of LCE, query is proposed, in addition in document " Cache " Less forMore " in Information-Centric Networks ", designed two groups of experiment Rdm+LRU and NNC+LRU, experimental result shows that the application of LCE cache way in CCN has lower efficiency.In CCN, adopt the cache way of LCE can cause cache contents bulk redundancy, simultaneously with respect to content total amount in network, spatial cache is again very little, so cannot obtain content from network-caching in the time of meaningful request, just need directly to obtain content from content server, therefore, increased taking of the network bandwidth, increase the load of content server, also increased the delay of user content request.
Summary of the invention
The object of the invention is to provide neighbours' cooperation caching replacement method in a kind of content center network, can effectively reduce the redundancy of cache contents between node neighbours, improves Web content distribution efficiency.
Realize the object of the invention technical scheme:
Neighbours' cooperation caching replacement method in a kind of content center network, is characterized in that:
Step 1: when node i has new data e
inewwhen request, whether the spatial cache of first decision node i is full; If less than, directly enter step 3; If full, enter step 2, carry out cooperation caching and replace judgement;
Step 2: the whether buffer memory new data e of neighbor node that checks node i
inewif, buffer memory, no longer buffer memory new data e of node i
inew; If not buffer memory, enters step 3;
Step 3: utilize LRU cache replacement algorithm, by new data e
inewbe cached to this locality.
In step 2, check the whether buffer memory new data e of neighbor node of node i
inew, by checking whether the CS of neighbor node has new data e in showing
inewrealize.
Node i is set up neighborhood table NNT, and neighborhood table NNT is for recording the neighbor node within the scope of a node i jumping around.
Node i is arbitrary cache node in content center network.
The beneficial effect that the present invention has:
The present invention proposes a kind of neighbours' cooperation caching strategy (Neighbor-Referencing Cooperative Cache Policy, NRCCP) selectively carry out content caching, effectively avoid node and neighbor cache identical content around, thereby reduce the redundancy of cache contents between node neighbours, increase the kind of cache contents, improve network-caching capacity, thereby strengthened Web content distribution efficiency.On the mode basis of the present invention existing LCE+LRU in CCN, realize, algorithm is simple, is easy to realize.The simulation experiment result shows, NRCCP strategy of the present invention is compared to the LCE cache policy of giving tacit consent in CCN, aspect raising cache hit rate and the delay of minimizing request of data, is obtaining the significant effect of improving.
Brief description of the drawings
Fig. 1 is general flow chart of the present invention;
Fig. 2 is content requests process schematic diagram in CCN of the present invention;
Fig. 3 is response package process schematic diagram in CCN of the present invention;
Fig. 4 is the structural representation of neighbor table of the present invention;
Fig. 5 is single-link network topology structure schematic diagram of the present invention;
Fig. 6 is binary tree network topology schematic diagram of the present invention;
Fig. 7 is scale-free networks network topological structure schematic diagram of the present invention;
Fig. 8 is experimental configuration Parametric Representation intention of the present invention;
Fig. 9 is NRCCP of the present invention and LCE hit rate contrast schematic diagram;
Figure 10 is NRCCP of the present invention and LCE content requests time delay contrast schematic diagram;
Figure 11 is s of the present invention, and q value is to content requests time delay influence schematic diagram.
Embodiment
As shown in Figure 1, taking node i as example, content center People Near Me cooperation caching strategy (Neighbor-Referencing Cooperative Cache Policy, NRCCP) the NRCCP strategy course of work that the present invention proposes is described.
Suppose:
The Cache space size of node i is K, and ECS table can buffer memory K bar content, and all cache contents entry size are identical.
Node i has 1 neighbor node at least, nodes add up to M.
Node is initiated the request to content i, meets the Poisson process that parameter is λ i, and making Ni (t) is some nodes requested number of times of content i between 0 to moment t
Definition:
Ei
j(1≤j≤K) represents j Cache piece in node i.
Ne
irepresent neighbours' number that node i has.
R
il(1≤l≤nei) represents l neighbours of node i.
Represent the total quantity of content blocks in CCN with N.
NRCCP strategy of the present invention specifically comprises the following steps:
Step 1: when node i has new data e
inewwhen request, whether the spatial cache of first decision node i is full; If less than, directly enter step 3; If full, enter step 2, carry out cooperation caching and replace judgement (NRCCP judgement);
The Cache space size of supposing node i is K, passes through e
inew<=K
freewhether decision node i has these data of sufficient space buffer memory.
Step 2: the whether buffer memory new data e of neighbor node that checks node i
inewif, buffer memory, no longer buffer memory new data e of node i
inew; If not buffer memory, enters step 3,
r
ilrepresent l neighbours of node i, the sum that M is nodes;
Node i is set up neighborhood table NNT, and neighborhood table NNT, for recording the neighbor node within the scope of a node i jumping around, provides reference during for inquiry neighbor cache content.Search all information of neighbor nodes of present node by neighborhood table NNT, inquire about in the CS table of neighbor node whether comprise new data e
inew.
Step 3: utilize LRU cache replacement algorithm, by new data e
inewbe cached in the CS table (content storage list) of node i.
Above-mentioned node i is arbitrary cache node in content center network, on all cache node of network, all moves NRCCP strategy.
According to request of data principle in CCN in detail, the course of work of NRCCP strategy of the present invention is described in detail below.CCN model mainly comprises three kinds of data structures, is respectively content caching storehouse (Content Store, CS), forwarding information base (Forwarding Information Base, FIB) and interest table undetermined (Pending Interest Table, PIT).In CCN, node mainly relies on these three kinds of data structures to carry out data communication, and wherein CS carries out buffer memory to the content-data via node to respond fast this content subsequent request.In fib table and IP network, routing table is similar, be all data retransmission route foundation is provided, but what in FIB, store is the route entry of content-based title.Because content quantity is huge, of a great variety, FIB also supports the route aggregation of content-based title, and the capacity that reduces routing table improves router efficiency.The path of PIT for recording interest bag request of data, response data packet is returned to requesting node according to PIT record.PIT can filter identical content interest request bag, a large amount of expenses of avoiding repetitive requests to bring to network.
As shown in Figures 2 and 3, the requestor that user A is content, resources bank B has the content that user A asks.User A request content C is described below
iwhole process, comprise the operation of the CCN node on link.The equal initial condition of all nodal cache tables on initial link circuit, the not any content of buffer memory, CCN forwarding strategy adopts the mode of data inundation.Detailed process is as follows:
(1) user A sends and comprises C
ithe Interest bag of title, node
1receive request, first check CS, because initial CS table is for empty, so cannot directly respond C
irequest.
(2) secondly check PIT table, due to C
irequest for the first time, node
1pIT in do not comprise C
irequest record, therefore will ask port (face) and C
iadd in PIT.
(3) finally check fib table, if having with Interest bag in content C
ithe entry that title matches, is forwarded to next or multiple CCN nodes according to route entry instruction, as shown in Figure 2, Interest bag is transmitted to node
2.
(4) node
2with node
1identical CS, PIT, tri-tables of FIB of operating successively.What take due to forwarding strategy is the mode of inundation, and therefore Interest bag is transmitted to 7 and 3.Interest bag passes through node successively
3, node
4, node
5, finally forward large to resources bank B.
(5) B is to comprising C
iinterest bag respond, content is sent to node
5, node
5at cache contents to before CS, check neighbours around whether buffer memory C
i, with reference to figure 2, node
5neighbours node
4not buffer memory C
i, therefore node
5by C
ibe cached in CS.And according to C in PIT table
irequest record is by content C
ibe transmitted to node
4.
(6) node
4receive content C
iafter, first check neighbours node
3with node
5whether buffer memory C
i, find node
5buffer memory C
i, be therefore directly transmitted to node according to PIT
3.Mode is carried out according to this, final C
isend to user A.
NRCCP running need to communicate with neighbours, introduces a neighborhood table (Neighbor Node Table, NNT), and reference is provided when convenient inquiry neighbor cache content.Neighbor table has recorded the node within the scope of a present node jumping around.The identification information that wherein NodeId is neighbor node, FaceNumber is interfaces corresponding to neighbours, and Delay records these neighbours' response time, and UpdateTime represents these neighbours' the final updating time.As shown in Figure 4.
In order to analyze the specific performance of neighbours' cooperation caching replacement policy in content center network, we have carried out experiment simulation to the present invention by the ndnSIM platform based on NS-3.
Fig. 5, Fig. 6 and Fig. 7 are respectively single-link network topology structure schematic diagram of the present invention, binary tree network topology schematic diagram and scale-free networks network topological structure schematic diagram.The present invention tests topology and adopts single-link topology (Single Path Network, SPN), binary tree network topology (Binary Tree Networking, and the scale-free networks network topology (Scale-Free Network, SFN) of Reality simulation network BTN).On SPN link, adopt and comprise a requesting node, a data source nodes and 15 middle CCN nodes, as shown in Figure 5.BTN adopts tree-shaped hierarchy, and as shown in Figure 6, wherein node 1 is resource node, and leaf node is user's requesting node.Utilize the SFN topology with 50 nodes of NetworkX instrument generation as shown in Figure 7, wherein node 1 and node 0 are resource node, and leaf node is user node, and other nodes are CCN node.Distribution of content meets Zipf-Mandelbrot, and in network, consumer's content requests process meets Poisson distribution.
Fig. 8 is experimental configuration Parametric Representation intention of the present invention.In network, packet route adopts the BestRoute routing policy that ndnSIM provides, and user content request meets Zipf-Mandelbrot and distributes.All nodes have identical spatial cache size (being cacheable content blocks quantity).In experimental configuration, major parameter as shown in Figure 8.
The present invention is by under different topology environment, and the Performance Ratio of NRCCP and LCE.Topological structure is taked respectively SPN, the BTN and the SFN that propose above.Distribution of content meets Zipf-Mandelbrot and distributes, parameter s=0.7, q=0.7.
Fig. 9 is NRCCP of the present invention and LCE hit rate contrast schematic diagram.This figure has shown in different topology environment, in NRCCP strategy and the contrast of LCE strategy lower network cache hit rate.All in all, NRCCP has higher cache hit rate than LCE strategy, has promoted in 48%, BTN and promoted in 10%, BA and promoted 3% in SPN.As can be seen here, NRCCP has better performance in the time that link buffer memory capacity is larger.In Fig. 9 (a), first 15 seconds, NRCCP has identical cache hit rate with LCE, in LCE situation, on link, the buffer memory of node is all full, and in NRCCP situation, on link nodal cache request content, and retained nearly 50% spatial cache, along with the time increases the increase of cache contents kind, cache hit rate also promotes thereupon.
Figure 10 is NRCCP of the present invention and LCE content requests time delay contrast schematic diagram.This figure has shown in different topology environment, content requests delay contrast under NRCCP strategy and LCE strategy.Under several topological environmentals in experiment, NRCCP all has lower content requests to postpone.In SPN, NRCCP relatively LCE content requests latency reduction 40%.In BTN and BA, NRCCP request latency reduction 8%.The nodes of comparing SPN link due to BTN with BA is less, and buffer memory ability is less, therefore in performance, does not have larger lifting.
In network, the distribution of content meets Zipf-Mandelbrot, more meets real Web content request feature than Zipf.The content object request probability function that comes k position is f (k; N, q, s)=(k+q)
-s/ H
n, q, s, wherein
k is content array, the parameter that q and s are distribution of content, and N is natural number.From formula, s is less, q is larger, and the request probability of content is more even, only has on the contrary the content of minority can be by frequent requests.
Figure 11 is s of the present invention, and q value is to content requests time delay influence schematic diagram.Figure 11 be NRCCP strategy in BA topology, different s and q value on content requests postpone impact.S regulates the distribution trend of content, and q regulates the steady degree of content requests under this trend.Shown in Figure 11 (a), when s=0.5, distribution of content is more even, and in network, cache contents upgrades comparatively fast, and content requests postpones relatively high.When q=200, q is larger, and distribution of content is more steady, and therefore content requests time delay is also comparatively steady.Shown in Figure 11 (b), when s=0.5, the probability of Web content request is approximate, cache contents frequent updating, and cache hit rate is lower, and content requests postpones larger.
In order to improve spatial cache utilance, carry out content caching by promoting internode collaboration, a kind of cooperation caching replacement policy has been proposed.By judging that whether arrival content is by neighbor node buffer memory, ensure that neighbor node does not change identical content into, increase the kind of cache contents in network, thereby improve the utilance of network-caching.Simulation result shows, the LCE buffer memory plan of giving tacit consent in the tactful relatively CCN of NRCCP is obtaining good effect aspect raising cache hit rate and the delay of minimizing request of data.
Terminological interpretation
CCN:Content-Centric Networks, content center network
NRCCP:Neighbor-Referencing Cooperative Cache Policy, cooperation caching replacement policy
LRU:Least Recently Used, least recently used algorithm
NDN:Named Data Networking, named data network
LCE：Leave?Copy?Everywhere
CS:Content Store, content caching storehouse
FIB:Forwarding Information Base, forwarding information base
PIT:Pending Interest Table, interest table undetermined
NNT:Neighbor Node Table, neighborhood table
ECS:Extend CS, expansion content storage CS
SPN:Single Path Network, single-link topology
BTN:Binary Tree Networking, binary tree network topology
SFN:Scale-Free Network, scale-free networks network topology.
Claims (4)
1. neighbours' cooperation caching replacement method in content center network, is characterized in that:
Step 1: when node i has new data e
inewwhen request, whether the spatial cache of first decision node i is full; If less than, directly enter step 3; If full, enter step 2, carry out cooperation caching and replace judgement;
Step 2: the whether buffer memory new data e of neighbor node that checks node i
inewif, buffer memory, no longer buffer memory new data e of node i
inew; If not buffer memory, enters step 3;
Step 3: utilize LRU cache replacement algorithm, by new data e
inewbe cached to this locality.
2. whether neighbours' cooperation caching replacement method in content center network according to claim 1, is characterized in that: in step 2, check the neighbor node buffer memory new data e of node i
inew, by checking whether the CS of neighbor node has new data e in showing
inewrealize.
3. neighbours' cooperation caching replacement method in content center network according to claim 2, is characterized in that: node i is set up neighborhood table NNT, and neighborhood table NNT is for recording the neighbor node within the scope of a node i jumping around.
4. neighbours' cooperation caching replacement method in content center network according to claim 3, is characterized in that: node i is any cache node in content center network.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410108361.8A CN103905538A (en) | 2014-03-22 | 2014-03-22 | Neighbor cooperation cache replacement method in content center network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410108361.8A CN103905538A (en) | 2014-03-22 | 2014-03-22 | Neighbor cooperation cache replacement method in content center network |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN103905538A true CN103905538A (en) | 2014-07-02 |
Family
ID=50996693
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410108361.8A Pending CN103905538A (en) | 2014-03-22 | 2014-03-22 | Neighbor cooperation cache replacement method in content center network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103905538A (en) |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104253855A (en) * | 2014-08-07 | 2014-12-31 | 哈尔滨工程大学 | Content classification based category popularity cache replacement method in oriented content-centric networking |
| CN106055274A (en) * | 2016-05-23 | 2016-10-26 | 联想(北京)有限公司 | Data storage method, data reading method and electronic device |
| CN106657181A (en) * | 2015-10-30 | 2017-05-10 | 中国科学院声学研究所 | CCN (Content center network) based data push method |
| CN106790421A (en) * | 2016-12-01 | 2017-05-31 | 广东技术师范学院 | A kind of step caching methods of ICN bis- based on corporations |
| CN106982248A (en) * | 2017-03-01 | 2017-07-25 | 中国科学院深圳先进技术研究院 | The caching method and device of a kind of content center network |
| CN108616923A (en) * | 2018-02-27 | 2018-10-02 | 南京邮电大学 | A kind of cooperation caching system based on mobile ad-hoc network |
| CN108769251A (en) * | 2018-06-21 | 2018-11-06 | 河南科技大学 | A kind of heuristic CCN network cooperations caching method |
| CN108769252A (en) * | 2018-06-21 | 2018-11-06 | 河南科技大学 | A kind of ICN network pre-cache methods based on request content relevance |
| CN109040163A (en) * | 2018-04-25 | 2018-12-18 | 广东工业大学 | Name data network secret protection cache decision method based on k anonymity |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20130227048A1 (en) * | 2012-02-28 | 2013-08-29 | Futurewei Technologies, Inc. | Method for Collaborative Caching for Content-Oriented Networks |
| CN103607386A (en) * | 2013-11-15 | 2014-02-26 | 南京云川信息技术有限公司 | A cooperative caching method in a P2P Cache system |
| CN103618675A (en) * | 2013-11-11 | 2014-03-05 | 西安交通大学 | Content-network-oriented content-influence-based caching method |
-
2014
- 2014-03-22 CN CN201410108361.8A patent/CN103905538A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20130227048A1 (en) * | 2012-02-28 | 2013-08-29 | Futurewei Technologies, Inc. | Method for Collaborative Caching for Content-Oriented Networks |
| CN103618675A (en) * | 2013-11-11 | 2014-03-05 | 西安交通大学 | Content-network-oriented content-influence-based caching method |
| CN103607386A (en) * | 2013-11-15 | 2014-02-26 | 南京云川信息技术有限公司 | A cooperative caching method in a P2P Cache system |
Non-Patent Citations (1)
| Title |
|---|
| 巩存群: "基于MANET的协作缓存优化策略研究", 《中国优秀硕士学位论文全文数据库信息科技辑》 * |
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104253855B (en) * | 2014-08-07 | 2018-04-24 | 哈尔滨工程大学 | Classification popularity buffer replacing method based on classifying content in a kind of content oriented central site network |
| CN104253855A (en) * | 2014-08-07 | 2014-12-31 | 哈尔滨工程大学 | Content classification based category popularity cache replacement method in oriented content-centric networking |
| CN106657181A (en) * | 2015-10-30 | 2017-05-10 | 中国科学院声学研究所 | CCN (Content center network) based data push method |
| CN106055274A (en) * | 2016-05-23 | 2016-10-26 | 联想(北京)有限公司 | Data storage method, data reading method and electronic device |
| CN106790421A (en) * | 2016-12-01 | 2017-05-31 | 广东技术师范学院 | A kind of step caching methods of ICN bis- based on corporations |
| CN106790421B (en) * | 2016-12-01 | 2020-11-24 | 广东技术师范大学 | ICN two-step caching method based on community |
| CN106982248B (en) * | 2017-03-01 | 2019-12-13 | 中国科学院深圳先进技术研究院 | caching method and device for content-centric network |
| CN106982248A (en) * | 2017-03-01 | 2017-07-25 | 中国科学院深圳先进技术研究院 | The caching method and device of a kind of content center network |
| CN108616923A (en) * | 2018-02-27 | 2018-10-02 | 南京邮电大学 | A kind of cooperation caching system based on mobile ad-hoc network |
| CN109040163A (en) * | 2018-04-25 | 2018-12-18 | 广东工业大学 | Name data network secret protection cache decision method based on k anonymity |
| CN109040163B (en) * | 2018-04-25 | 2021-03-30 | 广东工业大学 | Named data network privacy protection caching decision method based on k anonymity |
| CN108769252A (en) * | 2018-06-21 | 2018-11-06 | 河南科技大学 | A kind of ICN network pre-cache methods based on request content relevance |
| CN108769251A (en) * | 2018-06-21 | 2018-11-06 | 河南科技大学 | A kind of heuristic CCN network cooperations caching method |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103905538A (en) | Neighbor cooperation cache replacement method in content center network | |
| CN104009920B (en) | The processing method of data source movement, the method for E-Packeting and its device | |
| Li et al. | A chunk caching location and searching scheme in content centric networking | |
| CN103347068B (en) | A kind of based on Agent cluster network-caching accelerated method | |
| CN104811493B (en) | The virtual machine image storage system and read-write requests processing method of a kind of network aware | |
| CN107277561A (en) | Content distributing network | |
| CN105262833B (en) | A kind of the cross-layer caching method and its node of content center network | |
| CN108900570B (en) | Cache replacement method based on content value | |
| CN105049254A (en) | Data caching substitution method based on content level and popularity in NDN/CCN | |
| CN102523285A (en) | Storage caching method of object-based distributed file system | |
| CN103501315A (en) | Cache method based on relative content aggregation in content-oriented network | |
| CN103905332B (en) | A kind of method and apparatus for determining cache policy | |
| CN103716254A (en) | Self-aggregation cooperative caching method in CCN | |
| CN103560959B (en) | Method and device for selecting static route | |
| CN111294394B (en) | Self-adaptive caching strategy method based on complex network junction | |
| CN107368608A (en) | The HDFS small documents buffer memory management methods of algorithm are replaced based on ARC | |
| CN109905480A (en) | Probability cache contents laying method based on content center | |
| CN104901996B (en) | The method and apparatus for avoiding content to repeat storage in distributed caching collaboration | |
| CN108965479B (en) | Domain collaborative caching method and device based on content-centric network | |
| CN112399485A (en) | CCN-based new node value and content popularity caching method in 6G | |
| CN108984433A (en) | Cache data control method and equipment | |
| CN108900618A (en) | Content buffering method in a kind of information centre's network virtualization | |
| CN103401953A (en) | End-to-end voice communication node addressing method based on dual-layer structure | |
| CN103905545A (en) | Reinforced LRU cache replacement method in content-centric network | |
| CN108093056A (en) | Information centre's wireless network virtualization nodes buffer replacing method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20140702 |
|
| WD01 | Invention patent application deemed withdrawn after publication |