CN105653473B - Cache data access method and device based on binary mark - Google Patents
Cache data access method and device based on binary mark Download PDFInfo
- Publication number
- CN105653473B CN105653473B CN201511028589.7A CN201511028589A CN105653473B CN 105653473 B CN105653473 B CN 105653473B CN 201511028589 A CN201511028589 A CN 201511028589A CN 105653473 B CN105653473 B CN 105653473B
- Authority
- CN
- China
- Prior art keywords
- identifier
- data block
- mapping relations
- target data
- cache node
- 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.)
- Expired - Fee Related
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/08—Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
- G06F12/0802—Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches
- G06F12/0806—Multiuser, multiprocessor or multiprocessing cache systems
- G06F12/0811—Multiuser, multiprocessor or multiprocessing cache systems with multilevel cache hierarchies
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/08—Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
- G06F12/0802—Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches
- G06F12/0866—Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches for peripheral storage systems, e.g. disk cache
- G06F12/0873—Mapping of cache memory to specific storage devices or parts thereof
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/08—Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
- G06F12/12—Replacement control
- G06F12/121—Replacement control using replacement algorithms
- G06F12/128—Replacement control using replacement algorithms adapted to multidimensional cache systems, e.g. set-associative, multicache, multiset or multilevel
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Memory System Of A Hierarchy Structure (AREA)
Abstract
The present invention relates to the cache data access method and devices identified based on binary, this method comprises: current cache node obtains the first identifier of target data block in data access request；The current cache node searches first order mapping relations according to the first identifier in the current cache node；If finding, the current cache node obtains the corresponding target data block of the second mapping relations according to the corresponding second identifier of the first order mapping relations, to send access response information according to the target data block.The present invention is on the basis of meeting the personalized name demand of service provider's content, cache node can be made to identify the duplicate contents identified with different content provider, it can be achieved to effectively reduce the storage of duplicate contents in cache node, and then improve the resource utilization of caching.
Description
Technical field
The present invention relates to computer networking technology more particularly to it is a kind of based on binary mark cache data access method and
Device.
Background technique
Currently, user gradually switchs to based on content obtains mode of the access of internet based on the point-to-point communication
Mode.Traditional TCP/IP network is only able to achieve transmission data, the content of transmitted data is not perceived, so as to cause net
The phenomenon that bulk redundancy flow transmits on network.
Currently in order to solving due to the redundant flow transmission problem that content obtains and causes, the either reality of internet area
The future network of border application or academic research community is imagined, internal to meet user all using data buffer storage as basic means
The asynchronous access with heavytailed distribution feature held.For example, the transparent network-caching Web Cache that internet uses, is based on
It is interior in PPCache, content distributing network (Content Delivery Network, CDN) in the content distributing network of P2P
The information/content central site network for holding caching and academic research community proposition names data network (Named Data
Networking, NDN), DONA etc..
But these caching systems, which are faced in cache node, can not identify identical content, cause to repeat to store phase
The problem of with content, and then cause Buffer Utilization low.For example, data content is caching in existing data buffer storage mode
In be mostly mark with uniform resource locator (Uniform Resource Locator, URL), and same content is different
It can be endowed different URL at content supplier, cause caching to be difficult to the identical object of actual content according to URL, in turn
Cause to repeat to store the object in the buffer.
Summary of the invention
The technical problem to be solved by the present invention is to how reduce content caching to repeat to store, the utilization rate of caching is improved.
In order to solve the above technical problems, one aspect of the present invention proposes a kind of cache data access side based on binary mark
Method, this method comprises:
Current cache node obtains the first identifier of target data block in data access request, and the first identifier is used for area
Divide the content supplier of the target data block；
The current cache node is searched first order mapping in the current cache node according to the first identifier and is closed
System, the first order mapping relations are first identifier of the current cache node previously according to the target data block of acquisition
Relationship established with second identifier, for the first identifier and the second identifier to be associated, the second identifier
For the mark of the content belonging to the target data block for distinguishing the target data block；
If finding, the current cache node obtains the according to the corresponding second identifier of the first order mapping relations
The corresponding target data block of two mapping relations, to send access response information, the second level according to the target data block
Mapping relations are the second identifier and the target data of the current cache node previously according to the target data block
Relationship that block is established, for the second identifier and the target data block to be associated.
Preferably, the current cache node searches the first order in the current cache node according to the first identifier
Before mapping relations, this method further include:
The current cache node obtains the first identifier and the second identifier of the target data block；
The current cache node is according to the judgement of the target data block, the first identifier and the second identifier
First order mapping relations and the second level mapping relations whether there is, to determine that establishing the first order reflects according to judging result
Relationship is penetrated, or the target data block is stored in the current cache node and establishes the first order mapping relations and institute
State second level mapping relations.
Preferably, the current cache node is according to the target data block, the first identifier and the second identifier
Judge that the first order mapping relations and the second level mapping relations whether there is, according to the determining foundation of judging result
First order mapping relations, or the target data block is stored in the current cache node and establishes the first order mapping
Relationship and the second level mapping relations, comprising:
The current cache node judges the first order mapping relations according to the first identifier and the second identifier
It whether there is, if it is not, then judging whether the second level mapping relations deposit according to the target data block and the second identifier
?；
If it exists, then institute is established according to the second identifier in the first identifier and the already present second level mapping relations
State first order mapping relations；
If it does not exist, then the target data block is stored in current cache node, and according to the second identifier and
The target data block establishes second level mapping relations, establishes the first order according to the first identifier and the second identifier
Mapping relations.
Preferably, the current cache node obtains the first identifier of the target data block and described second and marks
Know, comprising:
The current cache node monitor and store the first identifier first caching replacement status information, described first
Caching replacement status information include in the last visit time and the first preset time of the first identifier in access times at least
One；
The current cache node monitor and store the second identifier second caching replacement status information, described second
Caching replacement status information include in the last visit time and the second preset time of the second identifier in access times at least
One.
Preferably, the second caching replacement status information of the second identifier is to delay according to the first of each association first identifier
The information that replacement status information determines is deposited, each association first identifier is all in the current cache node and second mark
Know associated first identifier.
Preferably, the second identifier includes the Hash HASH value of the target data block.
Preferably, the first identifier includes the uniform resource position mark URL of the target data block.
Preferably, the current cache node is according to the target data block, the first identifier and the second identifier
Judge that the first order mapping relations and the second level mapping relations whether there is, according to the determining foundation of judging result
First order mapping relations, or the target data block is stored in the current cache node and establishes the first order mapping
Before relationship and the second level mapping relations, this method further include:
The list item storage state of the current cache nodal test itself, to judge whether the list item storage state reaches
Preset threshold, if the list item storage state reaches the preset threshold, according to the of the first identifier of storing data block
One caching replacement status information determines whether to replace the first identifier of the storing data block, and according to the storing data block
Second identifier second caching replacement status information determine whether to replace the second identifier.
Preferably, the basis the first identifier of storing data block first caching replacement status information determine whether to replace
Change the first identifier of the storing data block, comprising:
Determine whether that meeting first presets according to the first of the first identifier of storing data block the caching replacement status information
Replacement condition is cached, if so, judging whether second identifier associated by the first identifier is also associated with other first identifiers；
If association, the corresponding first identifier of the first caching replacement status information is only deleted；
If not associated, the corresponding first identifier of the first caching replacement status information, the described first identifier institute is deleted
Associated second identifier and the storing data block；
The basis this second identifier of storing data block second caching replacement status information determine whether replacement should
Second identifier, comprising:
Determine whether to meet second according to the second caching replacement status information of the second identifier of storing data block pre-
If caching replacement condition, if so, deleting the second identifier and the storing data block, and deletes and be associated with the second identifier
All first identifiers.
On the other hand, the present invention also provides a kind of cache data access device based on binary mark, which includes:
First identifier acquiring unit, for obtaining the first identifier of target data block in data access request, described first
Identify the content supplier for distinguishing the target data block；
First order mapping relationship searching unit, for searching in the current cache node according to the first identifier
Level-one mapping relations, the first order mapping relations are the target data block of the current cache node previously according to acquisition
First identifier and second identifier establish, relationship for the first identifier and the second identifier to be associated, institute
Stating second identifier is belonging to the target data block for distinguishing the mark of the content of the target data block；
Access response unit, for finding the first order mapping relations in the first order mapping relationship searching unit
When, the corresponding target data block of the second mapping relations is obtained according to the corresponding second identifier of the first order mapping relations,
To send access response information according to the target data block, the second level mapping relations are the preparatory root of current cache node
It is being established according to the second identifier of the target data block and the target data block, for by the second identifier and described
The relationship that target data block is associated.
The present invention is closed by establishing the first order mapping relations and second level mapping relations of several piece by both mappings
System carries out data storage, access and replacement can make to delay on the basis of meeting the personalized name demand of service provider's content
Node is deposited to identify the duplicate contents identified with different content provider, it can be achieved that effectively reducing in cache node repeatedly
The storage of content, and then improve the resource utilization of caching.
Detailed description of the invention
In order to more clearly explain the embodiment of the invention or the technical proposal in the existing technology, to embodiment or will show below
There is attached drawing needed in technical description to be briefly described, it should be apparent that, the accompanying drawings in the following description is the present invention
Some embodiments for those of ordinary skill in the art without creative efforts, can also basis
These attached drawings obtain other attached drawings.
Fig. 1 shows the flow chart of the cache data access method based on binary mark of one embodiment of the invention；
Fig. 2 shows the flow charts of the cache data access method based on binary mark of another embodiment of the present invention；
Fig. 3 shows the flow chart of the cache data access method based on binary mark of another embodiment of the present invention；
Fig. 4 shows the flow chart of the cache data access method based on binary mark of another embodiment of the present invention；
Fig. 5 shows the structural block diagram of the cache data access device based on binary mark of one embodiment of the invention.
Specific embodiment
In order to make the object, technical scheme and advantages of the embodiment of the invention clearer, below in conjunction with the embodiment of the present invention
In attached drawing, technical solution in the embodiment of the present invention is explicitly described, it is clear that described embodiment is the present invention
A part of the embodiment, instead of all the embodiments.Based on the embodiments of the present invention, those of ordinary skill in the art are not having
Every other embodiment obtained under the premise of creative work is made, shall fall within the protection scope of the present invention.
Fig. 1 shows the flow chart of the cache data access method based on binary mark of one embodiment of the invention.Such as
Shown in Fig. 1, this method comprises:
A1: current cache node obtains the first identifier of target data block in data access request, and the first identifier is used
In the content supplier for distinguishing the target data block；
A2: the current cache node searches first order mapping according to the first identifier in the current cache node
Relationship, the first order mapping relations are first mark of the current cache node previously according to the target data block of acquisition
Know relationship establish with second identifier, for the first identifier and the second identifier to be associated, second mark
Know is belonging to the target data block for distinguishing the mark of the content of the target data block；
A3: if finding, the current cache node is obtained according to the corresponding second identifier of the first order mapping relations
The corresponding target data block of the second mapping relations is taken, to send access response information according to the target data block, described the
Second level mapping relations are the second identifier and the target of the current cache node previously according to the target data block
Relationship that data block is established, for the second identifier and the target data block to be associated；
A4: if not finding, the data access request is forwarded to other cache nodes according to forward rule is preset.
The present embodiment identify based on binary by searching for the first order mapping relations and second level mapping relations of several piece
Cache data access, realize the storage for effectively reducing duplicate contents in cache node, so improve caching resource benefit
With rate.
Fig. 2 shows the flow charts of the cache data access method based on binary mark of another embodiment of the present invention；
As shown in Fig. 2, this method can further comprise before step A2:
S1: the current cache node obtains the first identifier and the second identifier of the target data block；
S2: the current cache node judges according to the target data block, the first identifier and the second identifier
The first order mapping relations and the second level mapping relations whether there is, to establish described first according to judging result determination
Grade mapping relations, or the target data block is stored in the current cache node and establishes the first order mapping relations
With the second level mapping relations.
Fig. 3 shows the flow chart of the cache data access method based on binary mark of another embodiment of the present invention；
As shown in figure 3, step S2 is preferably included:
S21: the current cache node judges that the first order maps according to the first identifier and the second identifier
Relationship whether there is；
S22: if so, (showing there are data identical with the target data block content without caching the target data block
Block)；
S23: if it is not, then whether judging the second level mapping relations according to the target data block and the second identifier
In the presence of；
S24: it if it exists, is then built according to the second identifier in the first identifier and the already present second level mapping relations
Found the first order mapping relations；
The target data block: if it does not exist, being then stored in current cache node by S25, and according to second mark
Know and the target data block establishes second level mapping relations, establishes described the according to the first identifier and the second identifier
Level-one mapping relations.
As the preferred of this implementation, step S1 is further can include:
S11: the current cache node monitors and stores the first caching replacement status information of the first identifier, described
First caching replacement status information includes in the last visit time and the first preset time of the first identifier in access times
At least one of.
S12: the current cache node monitors and stores the second caching replacement status information of the second identifier, described
Second caching replacement status information includes in the last visit time and the second preset time of the second identifier in access times
At least one of；
Further, the second caching replacement status information of above-mentioned second identifier can be for according to the of each association first identifier
The information that one caching replacement status information determines, each association first identifier be all in the current cache node and this
The two associated first identifiers of mark.
Specifically, it is assumed that (content mentions the first identifier of direction second identifier (i.e. content supplier's independent identification, PI-ID)
For quotient rely on identify, PA-ID) collection be combined intoThen, PI (idi) caching
Buffer status of the state in, which is combined, to be determined, for example, if using the least recently used page (Least
Recently Used, LRU) replacement algorithm, then PI (idi) last access time should be in all last access times
Middle distance is current nearest, and if replaced using page (least frequently used, LFU) is least commonly used
Algorithm, then PI (idi) visitation frequency should be in all visitation frequencies accumulation.
On this basis, above-mentioned second identifier includes the Hash HASH value of the target data block, and first identifier includes institute
State the uniform resource position mark URL of target data block.
Fig. 4 shows the flow chart of the cache data access method based on binary mark of another embodiment of the present invention,
As shown in figure 4, this method can also further comprise before step S2:
B1: the list item storage state of the current cache nodal test itself；
B2: judge whether the list item storage state reaches preset threshold；
B3: if the list item storage state is not up to preset threshold, without processing；
B4: if the list item storage state reaches the preset threshold, according to the first identifier of storing data block
First caching replacement status information determines whether to replace the first identifier of the storing data block, and according to the storing data
Second caching replacement status information of the second identifier of block determines whether to replace the second identifier.
Further, it is determined in step B4 according to the first of the first identifier of storing data block the caching replacement status information
The first identifier for whether replacing the storing data block can further comprise:
B41: satisfaction first is determined whether according to the first of the first identifier of storing data block the caching replacement status information
Preset cache replaces condition, if so, judging whether second identifier associated by the first identifier is also associated with other the first marks
Know；
If association, the corresponding first identifier of the first caching replacement status information is only deleted；
If not associated, the corresponding first identifier of the first caching replacement status information, the described first identifier institute is deleted
Associated second identifier and the storing data block；
Optionally, in step B4 according to this second identifier of storing data block second caching replacement status information determine
The second identifier whether is replaced, can further comprise:
B42: satisfaction the is determined whether according to the second caching replacement status information of the second identifier of storing data block
Two preset caches replace condition, if so, deleting the second identifier and the storing data block, and deletion and the second identifier
Associated all first identifiers.
Fig. 5 shows the structural block diagram of the cache data access device based on binary mark of one embodiment of the invention.
As shown in figure 5, the device includes:
First identifier acquiring unit 10, for obtaining the first identifier of target data block in data access request, described
One identifies the content supplier for distinguishing the target data block；
First order mapping relationship searching unit 20, for being searched in the current cache node according to the first identifier
First order mapping relations, the first order mapping relations are the target data of the current cache node previously according to acquisition
Relationship that the first identifier and second identifier of block are established, for the first identifier and the second identifier to be associated,
The second identifier is belonging to the target data block for distinguishing the mark of the content of the target data block；
Access response unit 30, for finding the first order mapping relations in first order mapping relationship searching unit 20
When, the corresponding target data block of the second mapping relations is obtained according to the corresponding second identifier of the first order mapping relations,
To send access response information according to the target data block, the second level mapping relations are the preparatory root of current cache node
It is being established according to the second identifier of the target data block and the target data block, for by the second identifier and described
The relationship that target data block is associated.
Cache data access device based on binary mark described in the present embodiment can be used for executing above-mentioned based on binary
The cache data access embodiment of the method for mark, principle is similar with technical effect, and details are not described herein again.
The present invention is closed by establishing the first order mapping relations and second level mapping relations of several piece by both mappings
System carries out data buffer storage, data access and data and deletes, on the basis for the personalized name demand for meeting service provider's content
On, cache node can be made to identify the duplicate contents identified with different content provider, it can be achieved that effectively reducing caching
The storage of duplicate contents in node, and then improve the resource utilization of caching.
The above examples are only used to illustrate the technical scheme of the present invention, rather than its limitations；Although with reference to the foregoing embodiments
Invention is explained in detail, those skilled in the art should understand that: it still can be to aforementioned each implementation
Technical solution documented by example is modified or equivalent replacement of some of the technical features；And these are modified or replace
It changes, the spirit and scope for technical solution of various embodiments of the present invention that it does not separate the essence of the corresponding technical solution.
Claims (8)
1. a kind of cache data access method based on binary mark characterized by comprising
Current cache node obtains the first identifier of target data block in data access request, and the first identifier is for distinguishing institute
State the content supplier of target data block；
The current cache node searches first order mapping relations, institute according to the first identifier in the current cache node
Stating first order mapping relations is the current cache node previously according to the first identifier of the target data block of acquisition and the
Relationship that two marks are established, for the first identifier and the second identifier to be associated, the second identifier is institute
It states belonging to target data block for distinguishing the mark of the content of the target data block；
If finding, the current cache node obtains the second level according to the corresponding second identifier of the first order mapping relations
The corresponding target data block of mapping relations, to send access response information according to the target data block, the second level is reflected
Penetrating relationship is the second identifier and the target data block of the current cache node previously according to the target data block
Relationship establish, for the second identifier and the target data block to be associated；
The current cache node searched in the current cache node according to the first identifier first order mapping relations it
Before, this method further include:
The current cache node obtains the first identifier and the second identifier of the target data block；
The current cache node judges described first according to the target data block, the first identifier and the second identifier
Grade mapping relations and the second level mapping relations whether there is, to determine that establishing the first order mapping closes according to judging result
System, or the target data block is stored in the current cache node to and is established the first order mapping relations and described the
Second level mapping relations.
2. the cache data access method as described in claim 1 based on binary mark, which is characterized in that the current cache
Node judges first order mapping relations and described according to the target data block, the first identifier and the second identifier
Second level mapping relations whether there is, and establish the first order mapping relations to determine according to judging result, or by the target
Data block is stored in the current cache node and establishes the first order mapping relations and the second level mapping relations, packet
It includes:
Whether the current cache node judges the first order mapping relations according to the first identifier and the second identifier
In the presence of if it is not, then judging that the second level mapping relations whether there is according to the target data block and the second identifier；
If it exists, then described the is established according to the second identifier in the first identifier and the already present second level mapping relations
Level-one mapping relations；
If it does not exist, then the target data block is stored in current cache node, and according to the second identifier and described
Target data block establishes second level mapping relations, establishes the first order according to the first identifier and the second identifier and maps
Relationship.
3. the cache data access method as described in claim 1 based on binary mark, which is characterized in that the current cache
Node obtains the first identifier and the second identifier of the target data block, comprising:
The current cache node monitors and stores the first caching replacement status information of the first identifier, first caching
Replacement status information includes at least one in the last visit time and the first preset time of the first identifier in access times；
The current cache node monitors and stores the second caching replacement status information of the second identifier, second caching
Replacement status information includes at least one in the last visit time and the second preset time of the second identifier in access times.
4. the cache data access method as claimed in claim 3 based on binary mark, which is characterized in that the second identifier
Second caching replacement status information be according to it is each association first identifier first caching replacement status information determine information, institute
Stating each association first identifier is all in the current cache node and associated first identifier of the second identifier.
5. the cache data access method as described in claim 1 based on binary mark, which is characterized in that the second identifier
Hash HASH value including the target data block.
6. the cache data access method as described in claim 1 based on binary mark, which is characterized in that the first identifier
Uniform resource position mark URL including the target data block.
7. the cache data access method as described in claim 1 based on binary mark, which is characterized in that the current cache
Node judges first order mapping relations and described according to the target data block, the first identifier and the second identifier
Second level mapping relations whether there is, and establish the first order mapping relations to determine according to judging result, or by the target
Data block be stored in the current cache node and establish the first order mapping relations and the second level mapping relations it
Before, this method further include:
The list item storage state of the current cache nodal test itself, to judge whether the list item storage state reaches default
Threshold value, it is slow according to the first of the first identifier of storing data block if the list item storage state reaches the preset threshold
Deposit the first identifier that replacement status information determines whether to replace the storing data block, and according to this storing data block the
Second caching replacement status information of two marks determines whether to replace the second identifier.
8. the cache data access method as claimed in claim 7 based on binary mark, which is characterized in that the basis has been deposited
The the first caching replacement status information for storing up the first identifier of data block determines whether to replace the first identifier of the storing data block,
Include:
Determine whether to meet the first preset cache according to the first of the first identifier of storing data block the caching replacement status information
Replacement condition, if so, judging whether second identifier associated by the first identifier is also associated with other first identifiers；
If association, the corresponding first identifier of the first caching replacement status information is only deleted；
If not associated, delete associated by the corresponding first identifier of the first caching replacement status information, the described first identifier
Second identifier and the storing data block；
The second caching replacement status information of the basis second identifier of storing data block determine whether to replace this second
Mark, comprising:
Determine whether to meet second according to the second caching replacement status information of the second identifier of storing data block default slow
Replacement condition is deposited, if so, deleting the second identifier and the storing data block, and deletion and the associated institute of the second identifier
There is first identifier.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201511028589.7A CN105653473B (en) | 2015-12-31 | 2015-12-31 | Cache data access method and device based on binary mark |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201511028589.7A CN105653473B (en) | 2015-12-31 | 2015-12-31 | Cache data access method and device based on binary mark |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105653473A CN105653473A (en) | 2016-06-08 |
| CN105653473B true CN105653473B (en) | 2019-03-22 |
Family
ID=56491165
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201511028589.7A Expired - Fee Related CN105653473B (en) | 2015-12-31 | 2015-12-31 | Cache data access method and device based on binary mark |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105653473B (en) |
Families Citing this family (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10375154B2 (en) * | 2016-07-29 | 2019-08-06 | Microsoft Technology Licensing, Llc | Interchangeable retrieval of content |
| CN106487923B (en) * | 2016-11-15 | 2019-07-02 | 清华大学 | Configurable mobile terminal cooperation caching method |
| CN107562385B (en) * | 2017-09-13 | 2020-08-04 | 郑州云海信息技术有限公司 | Method, device and equipment for reading data by distributed storage client |
| CN108494870B (en) * | 2018-04-03 | 2022-05-17 | 中国平安人寿保险股份有限公司 | CDN-based dynamic data loading method and device |
| CN109614347B (en) * | 2018-10-22 | 2023-07-21 | 中国平安人寿保险股份有限公司 | Processing method and device for multi-level cache data, storage medium and server |
| CN110109845B (en) * | 2019-04-26 | 2021-03-05 | 深圳忆联信息系统有限公司 | Cache data management method and device, computer equipment and storage medium |
| CN115550445B (en) * | 2022-10-31 | 2023-08-01 | 浪潮云信息技术股份公司 | Distributed system request response method and related components |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6836840B2 (en) * | 2001-07-30 | 2004-12-28 | International Business Machines Corporation | Slaves with identification and selection stages for group write |
| CN104901996A (en) * | 2015-01-15 | 2015-09-09 | 南京师范大学 | Method and device for avoiding repeated storage of content in distributed cache cooperation |
-
2015
- 2015-12-31 CN CN201511028589.7A patent/CN105653473B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6836840B2 (en) * | 2001-07-30 | 2004-12-28 | International Business Machines Corporation | Slaves with identification and selection stages for group write |
| CN104901996A (en) * | 2015-01-15 | 2015-09-09 | 南京师范大学 | Method and device for avoiding repeated storage of content in distributed cache cooperation |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105653473A (en) | 2016-06-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105653473B (en) | Cache data access method and device based on binary mark | |
| US9208097B2 (en) | Cache optimization | |
| EP3195130B1 (en) | Method and system for smart object eviction for proxy cache | |
| CN103812849B (en) | A kind of local cache update method, system, client and server | |
| KR20200040722A (en) | Method for transmitting packet of node and content owner in content centric network | |
| US9330004B2 (en) | Data processing method, cache node, collaboration controller, and system | |
| US6370620B1 (en) | Web object caching and apparatus for performing the same | |
| US20110099226A1 (en) | Method of requesting for location information of resources on network, user node and server for the same | |
| US9514243B2 (en) | Intelligent caching for requests with query strings | |
| US9565239B2 (en) | Selective access of multi-rate data from a server and/or peer | |
| US20140280606A1 (en) | Method and Apparatus for Content Management | |
| US20160072720A1 (en) | Managing resources in resource cache components | |
| Carofiglio et al. | LAC: Introducing latency-aware caching in information-centric networks | |
| CN106202581B (en) | A kind of data search method and device | |
| CN103067521B (en) | Node in a kind of distributed reptile cluster and system | |
| EP3021537B1 (en) | Method, device and system for determining content acquisition path and processing request | |
| CN102739720A (en) | Distributed cache server system and application method thereof, cache clients and cache server terminals | |
| US20130166680A1 (en) | Method, apparatus, and network system for acquiring content | |
| US20210203745A1 (en) | Data transmission method and system | |
| CN102438020A (en) | Method, device and network system for content distribution in content distribution network | |
| CN103873602A (en) | Network resource naming method and generating device | |
| CN103544149B (en) | A kind of method, system and picture servers accessing picture | |
| CN105657006A (en) | First visit acceleration method and system based on Internet acceleration network | |
| CN109002260A (en) | A kind of data cached processing method and processing system | |
| CN107786668A (en) | A kind of weight caching web site method based on CDN |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20190322 Termination date: 20191231 |