CN110086857A - Information centre's network-caching dispositions method based on cache node state and position - Google Patents
Information centre's network-caching dispositions method based on cache node state and position Download PDFInfo
- Publication number
- CN110086857A CN110086857A CN201910300134.8A CN201910300134A CN110086857A CN 110086857 A CN110086857 A CN 110086857A CN 201910300134 A CN201910300134 A CN 201910300134A CN 110086857 A CN110086857 A CN 110086857A
- Authority
- CN
- China
- Prior art keywords
- state
- state value
- value
- node
- cache
- 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.)
- Granted
Links
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
Abstract
The invention belongs to field of communication technology, information centre's network-caching dispositions method based on cache node state and position is disclosed, comprises the following steps: step (1): calculating finally obtained state value；Step (2): caching rate is calculated；Step (3): it establishes data packet state value: adding an additional field in data packet and be denoted as data packet state value；Step (4): it establishes state record table: increasing a state record table in each cache node, state record table includes data name and state record table state value in interest packet；Step (5): selection cache node, and updated data package state value, modification state record table.The present invention improves the hit rate of caching, reduces network delay, reduces the average request length of user；Comprehensively consider state and the position of cache node, more preferably cache location is obtained with very small communication cost；It does not need to increase multi-field in the packet, not will lead to the too fat to move of network packet.
Description
Technical field
The invention belongs to fields of communication technology, more particularly to information centre's network based on cache node state and position is slow
Deposit dispositions method.
Background technique
Caching function is the advantage place of information centre's network, and the efficiency of caching directly determines the whole of information centre's network
Body performance, and the deployment strategy cached is then the most important thing of cache policy.In recent years, scholars focus more on research caching
Deployment strategy is to information centre's network bring performance boost.For the deployment strategy of caching, it should pay close attention to efficient net emphatically
Network utilization rate, the high availability of data.From the point of view of P2P system and CDN technology, caching, which is deployed in network edge, is ordered caching is improved
Middle rate has very great help, but caching is disposed in information centre's network support on all-router, is not only fringe node, center
Node is also still suitble to deployment caching, and therefore, the deployment strategy of caching will determine information centre's overall performance of network
Sexual factor.
Caching deployment strategy is also referred to as cache decision strategy, can be divided into three classes according to approach to cooperation, be non-cooperating respectively
Caching, explicit cooperation caching and implicit cooperation caching.
Although explicit cooperation caching can bring higher buffer efficiency, it require that a large amount of interactive information, calculates
Method is excessively complicated, rather than cooperation caching has a large amount of data redundancy again.Implicit cooperation caching combines both the above caching
The advantages of cooperation mode.
Implicit cooperation caching mainly carries out cache decisions by some additional message, such as cache node position, interior
Hold popularity, probability, cache node state etc..Since the performance of implicit cooperation caching is high, cost is small, disposes plan in three cachings
In slightly, implicit cooperation caching accounting highest.Implicit cooperation caching is a kind of cache way for being highly suitable for network in information, it
Both the global calculation and communication capacity for not needed explicit cooperation caching there will not be the bulk redundancy that non-cooperating formula caching generates
Data.Typical Representative in implicit cooperation caching is LCD, MCD, ProbCache etc., these three cache policies are provided to allow slow
Deposit on the link closer to consumer, to reduce network delay, but do not account for each cache node state whether
It is suitble to continue cache information.
Summary of the invention
It is an object of the invention to open cache hit rate height, average request length are small based on cache node state and position
The information centre's network-caching dispositions method set.
The object of the present invention is achieved like this:
Information centre's network-caching dispositions method based on cache node state and position, comprises the following steps:
Step (1): finally obtained state value is calculated；
Step (2): caching rate is calculated；
Step (3): it establishes data packet state value: adding an additional field in data packet and be denoted as data packet state value；
Step (4): it establishes state record table: increasing a state record table, state record table packet in each cache node
Data name and state record table state value in packet containing interest；
Step (5): selection cache node, and updated data package state value, modification state record table.
Further, finally obtained state value Value:
Value=α * Vk+β*Vhop+γ*Vhitk,α,β,γ∈N；
In above formula, VkIt is the state value obtained according to pre-filtering queue number K, VhopIt is the shape obtained according to links location
State value, VhitkIt is there are the data of data name in interest packet in which pre-filtering queue, α is according to pre-filtering queue
The weight for the state value that number K is obtained, β is the weight of the state value obtained according to links location, which pre-filtering team γ is in
There are the weights of the data of data name in interest packet in column.
Further, caching rate CacheRate:
In above formula, NCachedIt is selected cache node number, NtotalIt is the interest packet received.
Further, meaning when data packet state value is 0 is that maximum rating value node has cached, minimal cache rate node
It has cached；Meaning when data packet state value is 1 is that maximum rating value node has cached, and minimal cache rate node is uncached；Number
Meaning when according to bag-like state value being 2 is that maximum rating value node is uncached, and minimal cache rate node has cached；Data packet state value
Meaning when being 3 is that maximum rating value node is uncached, and minimal cache rate node is uncached.
Further, meaning when state record table state value is 1 is to be unlikely to be maximum rating value node, it may be possible to most
Small caching rate node；Meaning when state record table state value is 2 be may be maximum rating value node, it is impossible to be minimum slow
Deposit rate node；Meaning when state record table state value is 3 be may be maximum rating value node, it may be possible to minimal cache rate section
Point.
Further, the selection cache node in step (5) specifically: choose one on the request path of each interest packet
A or two nodes for possessing maximum rating value and the node of minimal cache rate as the data cached packet of cache node, if two
Cache node is same node, then only caching on this node, is otherwise cached in the two cache nodes.
Further, the updated data package state value in step (5), modification state record table specifically:
Maximum rating value when client issues interest packet in setting interest packet is 0, and minimal cache rate is 1；At each
On cache node, by the finally obtained state value and caching rate, with interest packet of current cache node maximum rating value and
Minimal cache rate is compared: if the finally obtained state value of current cache node is greater than the maximum rating in interest packet
Value then updates the maximum rating value in interest packet, if the caching rate of current cache node is less than in interest packet in forwarding
Minimal cache rate then updates the minimal cache rate in interest packet in forwarding, is recorded in state record table according to comparison result
Data name and state record table state value；If the finally obtained state value of current cache node is less than in interest packet most
Big state value, the caching rate of current cache node are higher than the minimal cache rate in interest packet, then do not modify the maximum shape of interest packet
State value and minimal cache rate；When the finally obtained state value of current cache node and the maximum rating value of interest packet are identical or work as
When the caching rate of preceding cache node and the identical minimal cache rate of interest packet, without caching；
When the data packet of response is returned by the producer along interest packet path, interest packet content name in each cache node is inquired
Claim corresponding state record table, then directly forwards data packet if there is no record；If there is record then by data packet state
Value is carried out and is operated with state record table state value, if being greater than 0 with operating result, is cached to the data packet, then will
Data packet state value is updated to data packet state value and the difference with operating result, and the deletion record in state record table.
Further, with the rule of operation is defined as:
It is 0 with operating result when state record table state value is 1, data packet state value is 0；
It is 1 with operating result when state record table state value is 1, data packet state value is 1；
It is 0 with operating result when state record table state value is 1, data packet state value is 2；
It is 1 with operating result when state record table state value is 1, data packet state value is 3；
It is 0 with operating result when state record table state value is 2, data packet state value is 0；
It is 0 with operating result when state record table state value is 2, data packet state value is 1；
It is 2 with operating result when state record table state value is 2, data packet state value is 2；
It is 2 with operating result when state record table state value is 2, data packet state value is 3；
It is 0 with operating result when state record table state value is 3, data packet state value is 0；
It is 1 with operating result when state record table state value is 3, data packet state value is 1；
It is 2 with operating result when state record table state value is 3, data packet state value is 2；
It is 3 with operating result when state record table state value is 3, data packet state value is 3.
The invention has the benefit that
The present invention improves the hit rate of caching, reduces network delay, reduces the average request length of user；Comprehensively consider
The state of cache node and position obtain more preferably cache location with very small communication cost；It does not need in the packet
Increase multi-field, and not will lead to the too fat to move of network packet.
Detailed description of the invention
Fig. 1 is information centre's network-caching dispositions method block diagram based on cache node state and position；
Fig. 2 is the interest packet forwarding process of information centre's network-caching dispositions method based on cache node state and position
Schematic diagram；
Fig. 3 is the data packet forwarding process of information centre's network-caching dispositions method based on cache node state and position
Schematic diagram；
Fig. 4 is the experimental comparison figure of cache hit rate；
Fig. 5 is the experimental comparison figure of request path magnification；
Fig. 6 is the experimental comparison figure of different content concentration degree；
Fig. 7 is the experimental comparison figure of different cache sizes.
Specific embodiment
Further describe the present invention with reference to the accompanying drawing:
Such as Fig. 1, information centre's network-caching dispositions method based on cache node state and position is comprised the following steps:
Step (1): finally obtained state value is calculated；
Cache node state value is important indicator of the cache node in evaluation information central site network if appropriate for caching, is delayed
Content more fewer more suitable caching is deposited, apart from the more closer more suitable caching of user.The state value of current each cache node is by three parts
Factor determines, but for the cache node in different network environments, specific gravity shared by each factor should be different, therefore
It is calculated by the way of weighting.
Finally obtained state value Value:
Value=α * Vk+β*Vhop+γ*Vhitk,α,β,γ∈N；
In above formula, VkIt is the state value obtained according to pre-filtering queue number K, VhopIt is the shape obtained according to links location
State value, VhitkIt is there are the data of data name in interest packet in which pre-filtering queue, α is according to pre-filtering queue
The weight for the state value that number K is obtained, β is the weight of the state value obtained according to links location, which pre-filtering team γ is in
There are the weights of the data of data name in interest packet in column.Bring precision problem is indicated in order to reduce floating type, is all made of
Nonnegative integer indicates.
Buffer queue state determines by the K value in dynamic LRU-K algorithm, i.e. the number of pre-filtering queue.Delay when one
Deposit node pre-filtering queue number it is more when, illustrate that the node needs the number that caches more, relative to the lesser caching of K value
For node, buffer queue can be just placed by being put into the filtering that the biggish cache node of K value takes a long time.
It in the information in heart network, prefers to information and is buffered on edge caching nodes, can reduce user's in this way
Average request hop count reduces the load of central site network to reduce network delay.Links location is using hop count as unit of account, every warp
It crosses a router hops and adds one.
The strategy was mentioned in dynamic LRU-K cache replacement policy and possesses K pre-filtering queue, and only data packet is slow at this
Node is deposited after the caching number of k-th queued requests, just the data packet can be put into buffer queue, so when judging one
When cache node is if appropriate for some data packet is cached, it is contemplated that whether it is at present in pre-filtering queue, and at which
In a pre-filtering queue.The main purpose of this parameter is the influence for reducing multinode to data filtering, is determined according to parameter
The importance of Value value calculation formula, in general, it should node of the data in pre-filtering queue is paid the utmost attention to,
To make the data be buffered as early as possible.
Step (2): caching rate CacheRate is calculated:
Caching rate is the ratio of selected cache node number and the interest packet received, proposes that the concept of caching rate is mainly
Because fringe node can be frequently selected as cache node, lead to the main of this problem when selecting cache node by state value
The reason is that state Distribution value is relatively uneven, the nodal cache probability close to content source is very small, so caching rate is proposed, emerging
The smallest point of caching rate is chosen on the forward-path of interest packet once to be cached, and caching section is only selected by state value to make up
Point bring is insufficient.
In above formula, NCachedIt is selected cache node number, NtotalIt is the interest packet received.
Step (3): it establishes data packet state value: adding an additional field in data packet and be denoted as data packet state value；
Such as Fig. 3, data packet be content publisher according to interest packet transmitting path direction send back come response data packet, number
According to containing the title and data content of data in packet, but this data packet can not be known for current deployment strategy
Whether cached on path, it is therefore desirable to add an additional field to tell whether further cache node can cache this
A data packet.When data packet is after some node is buffered, it should modify the state value of the field, subsequent node is according to shape
State value judges whether to continue to cache this data packet.In the transmission path of data packet, need to find maximum rating value and minimum
Two nodes of caching rate, it is therefore desirable to two states are marked, there are four types of situations altogether, can be indicated respectively with 0,1,2,3.
Meaning when data packet state value is 0 is that maximum rating value node has cached, and minimal cache rate node has cached；Number
Meaning when according to bag-like state value being 1 is that maximum rating value node has cached, and minimal cache rate node is uncached；Data packet state value
Meaning when being 2 is that maximum rating value node is uncached, and minimal cache rate node has cached；Containing when data packet state value is 3
Justice is that maximum rating value node is uncached, and minimal cache rate node is uncached.
Step (4): state record table is established: such as Fig. 2, for the ease of recording the cache node of some interest packet process
Maximum rating value and minimal cache rate increase a state record table in each cache node, and state record table includes interest packet
In data name and state record table state value；When data packet returns, it is corresponding to inquire data name in state record table
When state record table state value, if there is no record, illustrate that state value is not above maximum at that time when interest packet transmits
State value, caching rate is also not below minimal cache rate at that time, therefore this node is not selected for cache node.
State record table state value, not as cache node node to be selected when, be not stored in SRT, it is not necessary that
Prepare a state value exclusively for this state, while also reducing the data space of occupancy.
Being maximum rating value node and minimum cannot directly be judged whether for the state value being stored in state record table
Caching rate node, needs the state value in combined data packet to be judged, main cause be in the repeating process of interest packet, and
Do not know whether subsequent node has bigger state value or smaller caching rate, is when interest forwards a packet to present node only
Maximum rating value or minimal cache rate, it is therefore desirable to plus possible two words.When data packet is returned along the path that interest packet forwards
Hui Shi, if encountering a node may be maximum rating value, and the state value in data packet shows not yet in maximum rating
Value node caching, then showing that present node is exactly the node of maximum rating value, the judgement of minimal cache rate node is also such.
Meaning when state record table state value is 1 is to be unlikely to be maximum rating value node, it may be possible to minimal cache rate
Node；Meaning when state record table state value is 2 be may be maximum rating value node, it is impossible to be minimal cache rate section
Point；Meaning when state record table state value is 3 be may be maximum rating value node, it may be possible to minimal cache rate node.
Step (5): selection cache node, and updated data package state value, modification state record table.
One or two node and minimal cache for possessing maximum rating value are chosen on the request path of each interest packet
The node of rate is as the data cached packet of cache node, if two cache nodes are same nodes, only in this node
Otherwise upper caching is cached in the two cache nodes.
Maximum rating value when client issues interest packet in setting interest packet is 0, and minimal cache rate is 1；At each
On cache node, by the finally obtained state value and caching rate, with interest packet of current cache node maximum rating value and
Minimal cache rate is compared: if the finally obtained state value of current cache node is greater than the maximum rating in interest packet
Value then updates the maximum rating value in interest packet, if the caching rate of current cache node is less than in interest packet in forwarding
Minimal cache rate then updates the minimal cache rate in interest packet in forwarding, is recorded in state record table according to comparison result
Data name and state record table state value；If the finally obtained state value of current cache node is less than in interest packet most
Big state value, the caching rate of current cache node are higher than the minimal cache rate in interest packet, then do not modify the maximum shape of interest packet
State value and minimal cache rate；When the finally obtained state value of current cache node and the maximum rating value of interest packet are identical or work as
When the caching rate of preceding cache node and the identical minimal cache rate of interest packet, without caching；Because there are network edges more to have
Conducive to the distribution of content, so without replacement when state value or equal caching rate.
When the data packet of response is returned by the producer along interest packet path, interest packet content name in each cache node is inquired
Claim corresponding state record table, then directly forwards data packet if there is no record；If there is record then by data packet state
Value is carried out and is operated with state record table state value, if being greater than 0 with operating result, is cached to the data packet, then will
Data packet state value is updated to data packet state value and the difference with operating result, and the deletion record in state record table.
With the rule of operation is defined as:
It is 0 with operating result when state record table state value is 1, data packet state value is 0；
It is 1 with operating result when state record table state value is 1, data packet state value is 1；
It is 0 with operating result when state record table state value is 1, data packet state value is 2；
It is 1 with operating result when state record table state value is 1, data packet state value is 3；
It is 0 with operating result when state record table state value is 2, data packet state value is 0；
It is 0 with operating result when state record table state value is 2, data packet state value is 1；
It is 2 with operating result when state record table state value is 2, data packet state value is 2；
It is 2 with operating result when state record table state value is 2, data packet state value is 3；
It is 0 with operating result when state record table state value is 3, data packet state value is 0；
It is 1 with operating result when state record table state value is 3, data packet state value is 1；
It is 2 with operating result when state record table state value is 3, data packet state value is 2；
It is 3 with operating result when state record table state value is 3, data packet state value is 3.
Such as Fig. 4, the experimental comparison figure of cache hit rate, MINE is result of the invention, it can be seen that in different parameters
A, under C, different experimental group GEANT, WIDE, GARR, TISCALI, cache hit rate of the invention is consistently higher than its other party
Method.
Secondly, from the experimental comparison figure of Fig. 5 request path magnification, it can be seen that in different experiment parameter A, C
Under, cache hit rate of the invention is also all higher than LCE, LCD, ProbCache, Random (Bernoulli) group.
Again, such as Fig. 6, different content concentration degree, under different parameters T, C, cache hit rate of the invention is than other groupings
It is high.
Finally, from the experimental comparison figure of Fig. 7 difference cache size, at different parameters T, A, different cache sizes, this
The cache hit rate of invention is also above LCE, LCD, ProbCache, Random (Bernoulli) group.
So as can be seen that the present invention can be obviously improved cache hit rate from Fig. 4, Fig. 5, Fig. 6 and Fig. 7.
Compared with prior art, the present invention improves the hit rate of caching, reduces network delay, reduces averagely asking for user
Seek length；Comprehensively consider state and the position of cache node, more preferably cache location is obtained with very small communication cost；No
It needs to increase in the packet multi-field, not will lead to the too fat to move of network packet.
The above is not intended to restrict the invention, and for those skilled in the art, the present invention can have various
Change and variation.All within the spirits and principles of the present invention, any modification, equivalent replacement, improvement and so on should all include
Within protection scope of the present invention.
Claims (8)
1. information centre's network-caching dispositions method based on cache node state and position, it is characterised in that: include following step
It is rapid:
Step (1): finally obtained state value is calculated；
Step (2): caching rate is calculated；
Step (3): it establishes data packet state value: adding an additional field in data packet and be denoted as data packet state value；
Step (4): it establishes state record table: increasing a state record table in each cache node, state record table includes emerging
Data name and state record table state value in interest packet；
Step (5): selection cache node, and updated data package state value, modification state record table.
2. information centre's network-caching dispositions method according to claim 1 based on cache node state and position,
It is characterized in that: the finally obtained state value Value:
Value=α * Vk+β*Vhop+γ*Vhitk,α,β,γ∈N；
In above formula, VkIt is the state value obtained according to pre-filtering queue number K, VhopIt is the state value obtained according to links location,
VhitkIt is there are the data of data name in interest packet in which pre-filtering queue, α is obtained according to pre-filtering queue number K
The weight of the state value arrived, β are the weights of the state value obtained according to links location, and γ is deposited in which pre-filtering queue
The weight of the data of data name in interest packet.
3. information centre's network-caching dispositions method according to claim 1 based on cache node state and position,
It is characterized in that: the caching rate CacheRate:
In above formula, NCachedIt is selected cache node number, NtotalIt is the interest packet received.
4. information centre's network-caching dispositions method according to claim 1 based on cache node state and position,
Be characterized in that: the meaning when data packet state value is 0 is that maximum rating value node has cached, and minimal cache rate node is
Caching；Meaning when data packet state value is 1 is that maximum rating value node has cached, and minimal cache rate node is uncached；Data
Meaning when bag-like state value is 2 is that maximum rating value node is uncached, and minimal cache rate node has cached；Data packet state value is
Meaning when 3 is that maximum rating value node is uncached, and minimal cache rate node is uncached.
5. information centre's network-caching dispositions method according to claim 1 based on cache node state and position,
Be characterized in that: the meaning when state record table state value is 1 is to be unlikely to be maximum rating value node, it may be possible to minimum
Caching rate node；Meaning when state record table state value is 2 be may be maximum rating value node, it is impossible to be minimal cache
Rate node；Meaning when state record table state value is 3 be may be maximum rating value node, it may be possible to minimal cache rate section
Point.
6. information centre's network-caching dispositions method according to claim 1 based on cache node state and position,
It is characterized in that: the selection cache node in the step (5) specifically:
Node that one or two possesses maximum rating value and minimal cache rate are chosen on the request path of each interest packet
Node is as the data cached packet of cache node, if two cache nodes are same nodes, only delays on this node
It deposits, is otherwise cached in the two cache nodes.
7. information centre's network-caching dispositions method according to claim 1 based on cache node state and position,
It is characterized in that: updated data package state value, modification state record table in the step (5) specifically:
Maximum rating value when client issues interest packet in setting interest packet is 0, and minimal cache rate is 1；In each caching
On node, by the maximum rating value and minimum in the finally obtained state value and caching rate, with interest packet of current cache node
Caching rate is compared: if the finally obtained state value of current cache node is greater than the maximum rating value in interest packet,
The maximum rating value in interest packet is updated in forwarding, if the caching rate of current cache node is less than the minimum in interest packet and delays
Rate is deposited, then updates the minimal cache rate in interest packet in forwarding, data name is recorded in state record table according to comparison result
Claim and state record table state value；If the finally obtained state value of current cache node is less than the maximum rating in interest packet
Value, the caching rate of current cache node are higher than the minimal cache rate in interest packet, then do not modify interest packet maximum rating value and
Minimal cache rate；When the finally obtained state value of current cache node and the maximum rating value of interest packet is identical or current cache
When the caching rate of node and the identical minimal cache rate of interest packet, without caching；
When the data packet of response is returned by the producer along interest packet path, interest packet content name pair in each cache node is inquired
The state record table answered then directly forwards data packet if there is no record；If there is record then by data packet state value with
State record table state value carries out and operation, if being greater than 0 with operating result, caches to the data packet, then by data
Bag-like state value is updated to data packet state value and the difference with operating result, and the deletion record in state record table.
8. information centre's network-caching dispositions method according to claim 7 based on cache node state and position,
It is characterized in that: the rule with operation is defined as:
It is 0 with operating result when state record table state value is 1, data packet state value is 0；
It is 1 with operating result when state record table state value is 1, data packet state value is 1；
It is 0 with operating result when state record table state value is 1, data packet state value is 2；
It is 1 with operating result when state record table state value is 1, data packet state value is 3；
It is 0 with operating result when state record table state value is 2, data packet state value is 0；
It is 0 with operating result when state record table state value is 2, data packet state value is 1；
It is 2 with operating result when state record table state value is 2, data packet state value is 2；
It is 2 with operating result when state record table state value is 2, data packet state value is 3；
It is 0 with operating result when state record table state value is 3, data packet state value is 0；
It is 1 with operating result when state record table state value is 3, data packet state value is 1；
It is 2 with operating result when state record table state value is 3, data packet state value is 2；
It is 3 with operating result when state record table state value is 3, data packet state value 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 true CN110086857A (en) | 2019-08-02 |
| CN110086857B 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 (9)
| 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 |
| US20140149532A1 (en) * | 2012-11-26 | 2014-05-29 | Samsung Electronics Co., Ltd. | Method of packet transmission from node and content owner in content-centric networking |
| CN104753797A (en) * | 2015-04-09 | 2015-07-01 | 清华大学深圳研究生院 | Content center network dynamic routing method based on selective caching |
| US20160294971A1 (en) * | 2015-03-30 | 2016-10-06 | Huawei Technologies Co., Ltd. | Distributed Content Discovery for In-Network 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 |
-
2019
- 2019-04-15 CN CN201910300134.8A patent/CN110086857B/en active Active
Patent Citations (9)
| 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 |
| US20140149532A1 (en) * | 2012-11-26 | 2014-05-29 | Samsung Electronics Co., Ltd. | Method of packet transmission from node and content owner in content-centric networking |
| CN106464657A (en) * | 2014-05-30 | 2017-02-22 | 华为技术有限公司 | Method, device and system for transmitting data |
| US20160294971A1 (en) * | 2015-03-30 | 2016-10-06 | Huawei Technologies Co., Ltd. | Distributed Content Discovery for In-Network Caching |
| 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 |
|---|
| WEI WANG: "CRCache：Exploiting the correlation between content popularity and netork topology information for ICN caching", 《2014 IEEE INTERNTIONAL CONFERENCE ON COMMUNICATIONS》 * |
| 崔现东: "内容中心网络网内缓存策略研究", 《中国博士学位论文全文数据库信息科技辑》 * |
| 蔡凌: "基于混存开销的信息中心网络缓存协作策略", 《东北大学学报（自然科学版）》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110086857B (en) | 2022-01-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Pang et al. | Toward smart and cooperative edge caching for 5G networks: A deep learning based approach | |
| CN105049254B (en) | Data buffer storage replacement method based on content rating and popularity in a kind of NDN/CCN | |
| CN105022700B (en) | A kind of name data network cache management system and management method based on spatial cache division and content similarity | |
| CN104395892B (en) | The method that the storage of the list of N items is managed in the memory buffers device of the C items of caching system | |
| CN105656788B (en) | CCN content buffering method based on popularity statistics | |
| CN108900570A (en) | A kind of buffer replacing method based on content value | |
| CN106911574B (en) | Name data network multiple constraint routing algorithm based on population | |
| CN106528451B (en) | The cloud storage frame and construction method prefetched for the L2 cache of small documents | |
| Tian et al. | Efficient federated DRL-based cooperative caching for mobile edge networks | |
| CN110213351A (en) | A kind of dynamic self-adapting I/O load equalization methods towards wide area high-performance computing environment | |
| CN110149394A (en) | Dispatching method, device and the storage medium of system resource | |
| CN108900599B (en) | Software-defined content-centric network device and cluster cache decision method thereof | |
| CN109067920A (en) | A kind of load balancing and method for routing for server content update | |
| US20150229558A1 (en) | Method for acquiring content, user equipment and cache node | |
| CN113810931A (en) | Self-adaptive video caching method facing mobile edge computing network | |
| CN110086857A (en) | Information centre's network-caching dispositions method based on cache node state and position | |
| Shi et al. | Content caching policy for 5g network based on asynchronous advantage actor-critic method | |
| CN106941695B (en) | It is a kind of in opportunistic network to be based on the matched data distributing method of interest | |
| CN103905539A (en) | Optimal cache storing method based on popularity of content in content center network | |
| CN106973088B (en) | A kind of buffering updating method and network of the joint LRU and LFU based on shift in position | |
| CN109525494A (en) | Opportunistic network routing mechanism implementation method based on message next-hop Dynamic Programming | |
| CN107302571B (en) | The routing of information centre's network and buffer memory management method based on drosophila algorithm | |
| CN106354747B (en) | Service providing method for big data | |
| CN112954026B (en) | Multi-constraint content cooperative cache optimization method based on edge calculation | |
| Pal et al. | NACID: A neighborhood aware caching and interest dissemination in content centric networks |
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 |