CN105653473A - Cache data access method and device based on binary identification - Google Patents
Cache data access method and device based on binary identification Download PDFInfo
- Publication number
- CN105653473A CN105653473A CN201511028589.7A CN201511028589A CN105653473A CN 105653473 A CN105653473 A CN 105653473A CN 201511028589 A CN201511028589 A CN 201511028589A CN 105653473 A CN105653473 A CN 105653473A
- Authority
- CN
- China
- Prior art keywords
- mark
- 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.)
- Granted
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)
- Memory System Of A Hierarchy Structure (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention relates to a cache data access method and device based on binary identification. The method comprises the steps that a current cache node obtains first identification of a target data block in a data access request; the current cache node is searched for a first-stage mapping relation according to the current cache node; if the first-stage mapping relation is found, the current cache node obtains the target data block corresponding to a second mapping relation according to second identification corresponding to the first-stage mapping relation, and therefore access response information is sent according to the target data block. On the basis that the requirement of service provider content for individual naming is met, the cache node can recognize the repeated content with different content provider identification, repeated content stored in the cache node can be effectively reduced, and then the resource utilization rate of cache is improved.
Description
Technical field
The present invention relates to computer networking technology, particularly relate to a kind of cache data access method based on binary mark and device.
Background technology
At present, the access of the Internet is transferred to, from the mode that point-to-point communication has been master, the mode that content obtaining is master by user gradually. Traditional TCP/IP network is only capable of realizing transmission data, the not content of the transmitted data of perception, occurs thus result in the phenomenon of bulk redundancy flow transmission on network.
Currently in order to solve the redundant flow transmission problem caused due to content obtaining, it is no matter practical application or the future network imagination of academic research community of internet arena, all using data buffer storage as basic means, to meet user's asynchronous access with heavytailed distribution feature to content. Such as, the transparent network-caching WebCache that the Internet adopts, based on the PPCache in the content distributing network of P2P, content distributing network (ContentDeliveryNetwork, CDN) content caching in, and the information/content central site network name data network (NamedDataNetworking that academic research community proposes, NDN), DONA etc.
But, these caching systems content that to be faced with in cache node None-identified identical, the problem causing repeating storage identical content, and then cause that Buffer Utilization is low. Such as, in existing data buffer storage mode, data content is many with URL (UniformResourceLocator in the buffer, URL) for mark, and same content can be endowed different URL at different places of content supplier, cause that buffer memory is difficult to, according to URL, the object that actual content is identical, and then cause repeating in the buffer to store this object.
Summary of the invention
The technical problem to be solved is how to reduce content caching to repeat storage, improves the utilization rate of buffer memory.
For solving above-mentioned technical problem, one aspect of the present invention proposes a kind of cache data access method based on binary mark, and the method includes:
Current cache node obtains the first mark of target data block in data access request, and described first mark is for distinguishing the content supplier of described target data block;
Described current cache node searches first order mapping relations according to described first mark in described current cache node, described first order mapping relations are that described current cache node identifies relation that set up, for described first mark and described second mark being associated with the second mark previously according to the first of the described target data block obtained, and described second is designated the mark of the content for distinguishing described target data block belonging to described target data block;
If finding, then described current cache node obtains, according to the second mark that described first order mapping relations are corresponding, the described target data block that the second mapping relations are corresponding, to send access response information according to this target data block, described second level mapping relations are that described current cache node identifies relation that set up, for described second mark and described target data block being associated with described target data block previously according to described the second of described target data block.
Preferably, before described current cache node searches first order mapping relations according to described first mark in described current cache node, the method also includes:
Described current cache node obtains described first mark of described target data block and described second mark;
According to described target data block, described first mark and described second mark, described current cache node judges whether described first order mapping relations and described second level mapping relations exist, set up described first order mapping relations to determine according to judged result, or described target data block is stored in described current cache node and sets up described first order mapping relations and described second level mapping relations.
Preferably, according to described target data block, described first mark and described second mark, described current cache node judges whether described first order mapping relations and described second level mapping relations exist, described first order mapping relations are set up to determine according to judged result, or described target data block is stored in described current cache node and sets up described first order mapping relations and described second level mapping relations, including:
According to described first mark and described second mark, described current cache node judges whether described first order mapping relations exist, if it is not, then judge whether described second level mapping relations exist according to described target data block and described second mark;
If existing, then set up described first order mapping relations according to the second mark in described first mark and these already present second level mapping relations;
If being absent from, then described target data block is stored in current cache node, and sets up second level mapping relations according to described second mark and described target data block, set up described first order mapping relations according to described first mark and described second mark.
Preferably, described current cache node obtains described first mark of described target data block and described second mark, including:
Described current cache node monitors also stores the described first the first buffer memory replacement status information identified, and described first buffer memory replaces at least one that status information includes in this first last visit time identified and the first Preset Time in access times;
Described current cache node monitors also stores the described second the second buffer memory replacement status information identified, and described second buffer memory replaces at least one that status information includes in this second last visit time identified and the second Preset Time in access times.
Preferably, it is that the first buffer memory according to each association the first mark replaces the information that status information is determined that second buffer memory of described second mark replaces status information, described each association first to be designated in described current cache node all first identifying of associate with this second mark.
Preferably, described second mark includes the Hash HASH value of described target data block.
Preferably, described first mark includes the uniform resource position mark URL of described target data block.
Preferably, according to described target data block, described first mark and described second mark, described current cache node judges whether described first order mapping relations and described second level mapping relations exist, described first order mapping relations are set up to determine according to judged result, or described target data block is stored in described current cache node and sets up before described first order mapping relations and described second level mapping relations, the method also includes:
The list item storage state of described current cache nodal test self, to judge whether described list item storage state reaches predetermined threshold value, if described list item storage state reaches described predetermined threshold value, then replace status information according to the first buffer memory of the first mark storing data block and determine whether to replace this first mark having stored data block, and the second buffer memory having stored the second mark of data block according to this is replaced status information and determined whether to replace this second mark.
Preferably, described basis has stored the first buffer memory replacement status information of the first mark of data block and has determined whether to replace this first mark having stored data block, including:
The first buffer memory according to the first mark storing data block is replaced status information and is determined whether that meeting the first preset buffer memory replaces condition, if so, then judge this first mark associated second identify whether also to be associated with other the first marks;
If association, then only delete this first buffer memory and replace the first mark that status information is corresponding;
If not associated, then delete this first buffer memory and replace the second associated mark of the first mark corresponding to status information, this first mark described and this has stored data block;
Second buffer memory replacement status information of this second mark having stored data block of described basis determines whether to replace this second mark, including:
The the second buffer memory replacement status information having stored the second mark of data block according to this determines whether that meeting the second preset buffer memory replaces condition, if, then delete this second mark and this has stored data block, and delete all first marks associated with this second mark.
On the other hand, present invention also offers a kind of cache data access device based on binary mark, this device includes:
First mark acquiring unit, for obtaining the first mark of target data block in data access request, described first mark is for distinguishing the content supplier of described target data block;
First order mapping relationship searching unit, for searching first order mapping relations in described current cache node according to described first mark, described first order mapping relations are that described current cache node identifies relation that set up, for described first mark and described second mark being associated with the second mark previously according to the first of the described target data block obtained, and described second is designated the mark of the content for distinguishing described target data block belonging to described target data block;
Access response unit, for when described first order mapping relationship searching unit finds described first order mapping relations, the described target data block that the second mapping relations are corresponding is obtained according to the second mark that described first order mapping relations are corresponding, to send access response information according to this target data block, described second level mapping relations are that described current cache node identifies relation that set up, for described second mark and described target data block being associated with described target data block previously according to described the second of described target data block.
The present invention is by setting up first order mapping relations and the second level mapping relations of several piece, and carry out data storage, access and replacement by both mapping relations, name on the basis of demand in the personalization meeting service provider's content, can make cache node that the duplicate contents with different content provider mark is identified, can realize effectively reducing the storage of duplicate contents in cache node, and then improve the resource utilization of buffer memory.
Accompanying drawing explanation
In order to be illustrated more clearly that the embodiment of the present invention or technical scheme of the prior art, the accompanying drawing used required in embodiment or description of the prior art will be briefly described below, apparently, accompanying drawing in the following describes is some embodiments of the present invention, for those of ordinary skill in the art, under the premise not paying creative work, it is also possible to obtain other accompanying drawing according to these accompanying drawings.
Fig. 1 illustrates the flow chart of the cache data access method based on binary mark of one embodiment of the invention;
Fig. 2 illustrates the flow chart of the cache data access method based on binary mark of another embodiment of the present invention;
Fig. 3 illustrates the flow chart of the cache data access method based on binary mark of another embodiment of the present invention;
Fig. 4 illustrates the flow chart of the cache data access method based on binary mark of another embodiment of the present invention;
Fig. 5 illustrates the structured flowchart of the cache data access device based on binary mark of one embodiment of the invention.
Detailed description of the invention
For making the purpose of the embodiment of the present invention, technical scheme and advantage clearly, below in conjunction with the accompanying drawing in the embodiment of the present invention, the technical scheme in the embodiment of the present invention is explicitly described, it is clear that, described embodiment is a part of embodiment of the present invention, rather than whole embodiments. Based on the embodiment in the present invention, the every other embodiment that those of ordinary skill in the art obtain under not making creative work premise, broadly fall into the scope of protection of the invention.
Fig. 1 illustrates the flow chart of the cache data access method based on binary mark of one embodiment of the invention. As it is shown in figure 1, the method includes:
A1: current cache node obtains the first mark of target data block in data access request, and described first mark is for distinguishing the content supplier of described target data block;
A2: described current cache node searches first order mapping relations according to described first mark in described current cache node, described first order mapping relations are that described current cache node identifies relation that set up, for described first mark and described second mark being associated with the second mark previously according to the first of the described target data block obtained, and described second is designated the mark of the content for distinguishing described target data block belonging to described target data block;
A3: if finding, then described current cache node obtains, according to the second mark that described first order mapping relations are corresponding, the described target data block that the second mapping relations are corresponding, to send access response information according to this target data block, described second level mapping relations are that described current cache node identifies relation that set up, for described second mark and described target data block being associated with described target data block previously according to described the second of described target data block;
A4: if not finding, then forward rule to forward described data access request to other cache nodes according to presetting.
The present embodiment carries out the cache data access based on binary mark by the first order mapping relations and second level mapping relations searching several piece, it is achieved that effectively reduces the storage of duplicate contents in cache node, and then improves the resource utilization of buffer memory.
Fig. 2 illustrates the flow chart of the cache data access method based on binary mark of another embodiment of the present invention; As in figure 2 it is shown, before step A2, the method can farther include:
S1: described current cache node obtains described first mark of described target data block and described second mark;
S2: according to described target data block, described first mark and described second mark, described current cache node judges whether described first order mapping relations and described second level mapping relations exist, set up described first order mapping relations to determine according to judged result, or described target data block is stored in described current cache node and sets up described first order mapping relations and described second level mapping relations.
Fig. 3 illustrates the flow chart of the cache data access method based on binary mark of another embodiment of the present invention; As it is shown on figure 3, step S2 preferably includes:
S21: according to described first mark and described second mark, described current cache node judges whether described first order mapping relations exist;
S22: if so, then without this target data block of buffer memory (showing there is the data block identical with this target data block content);
S23: if it is not, then judge whether described second level mapping relations exist according to described target data block and described second mark;
S24: if existing, then set up described first order mapping relations according to the second mark in described first mark and these already present second level mapping relations;
S25: if being absent from, then described target data block is stored in current cache node, and set up second level mapping relations according to described second mark and described target data block, set up described first order mapping relations according to described first mark and described second mark.
Preferred as this enforcement, step S1 comprises the steps that further
S11: described current cache node monitors also stores the described first the first buffer memory replacement status information identified, and described first buffer memory replaces at least one that status information includes in this first last visit time identified and the first Preset Time in access times.
S12: described current cache node monitors also stores the described second the second buffer memory replacement status information identified, and described second buffer memory replaces at least one that status information includes in this second last visit time identified and the second Preset Time in access times;
Further, it can be that the first buffer memory according to each association the first mark replaces the information that status information be determined that second buffer memory of above-mentioned second mark replaces status information, described each association first to be designated in described current cache node all first identifying of associate with this second mark.
Specifically, it is assumed that the set of the first mark (content supplier relies on mark, PA-ID) pointing to the second mark (i.e. content supplier's independent identification, PI-ID) is Then, PI (idi) buffer status byIn buffer status combine and determine, for instance, if what adopt is that the least recently used page (LeastRecentlyUsed, LRU) replaces algorithm, then PI (idi) the nearest access time should beIn in all nearest access times distance currently nearest, and if what adopt is that least commonly used page (leastfrequentlyused, LFU) replaces algorithm, then PI (idi) visitation frequency should beIn the accumulation of all visitation frequency.
On this basis, above-mentioned second mark includes the Hash HASH value of described target data block, and the first mark includes the uniform resource position mark URL of described target data block.
Fig. 4 illustrates the flow chart of the cache data access method based on binary mark of another embodiment of the present invention, and as shown in Figure 4, before step S2, the method also can farther include:
B1: the list item storage state of described current cache nodal test self;
B2: judge whether described list item storage state reaches predetermined threshold value;
B3: if described list item storage state is not up to predetermined threshold value, then without processing;
B4: if described list item storage state reaches described predetermined threshold value, then replace status information according to the first buffer memory of the first mark storing data block and determine whether to replace this first mark having stored data block, and the second buffer memory having stored the second mark of data block according to this is replaced status information and determined whether to replace this second mark.
Further, in step B4, the first buffer memory replacement status information according to the first mark storing data block determines whether to replace this first mark having stored data block, can farther include:
B41: replace status information according to the first buffer memory of the first mark storing data block and determine whether that meeting the first preset buffer memory replaces condition, if so, then judge this first mark associated second identify whether also to be associated with other the first marks;
If association, then only delete this first buffer memory and replace the first mark that status information is corresponding;
If not associated, then delete this first buffer memory and replace the second associated mark of the first mark corresponding to status information, this first mark described and this has stored data block;
Alternatively, the second buffer memory replacement status information having stored the second mark of data block in step B4 according to this determines whether to replace this second mark, can farther include:
B42: the second buffer memory replacement status information having stored the second mark of data block according to this determines whether that meeting the second preset buffer memory replaces condition, if, then delete this second mark and this has stored data block, and delete all first marks associated with this second mark.
Fig. 5 illustrates the structured flowchart of the cache data access device based on binary mark of one embodiment of the invention. As it is shown in figure 5, this device includes:
First mark acquiring unit 10, for obtaining the first mark of target data block in data access request, described first mark is for distinguishing the content supplier of described target data block;
First order mapping relationship searching unit 20, for searching first order mapping relations in described current cache node according to described first mark, described first order mapping relations are that described current cache node identifies relation that set up, for described first mark and described second mark being associated with the second mark previously according to the first of the described target data block obtained, and described second is designated the mark of the content for distinguishing described target data block belonging to described target data block;
Access response unit 30, for when first order mapping relationship searching unit 20 finds described first order mapping relations, the described target data block that the second mapping relations are corresponding is obtained according to the second mark that described first order mapping relations are corresponding, to send access response information according to this target data block, described second level mapping relations are that described current cache node identifies relation that set up, for described second mark and described target data block being associated with described target data block previously according to described the second of described target data block.
The cache data access device based on binary mark described in the present embodiment may be used for performing the above-mentioned cache data access embodiment of the method based on binary mark, and its principle is similar with technique effect, repeats no more herein.
The present invention is by setting up first order mapping relations and the second level mapping relations of several piece, and carry out data buffer storage, data access and data deletion by both mapping relations, name on the basis of demand in the personalization meeting service provider's content, can make cache node that the duplicate contents with different content provider mark is identified, can realize effectively reducing the storage of duplicate contents in cache node, and then improve the resource utilization of buffer memory.
Above example is merely to illustrate technical scheme, is not intended to limit;Although the present invention being described in detail with reference to previous embodiment, it will be understood by those within the art that: the technical scheme described in foregoing embodiments still can be modified by it, or wherein portion of techniques feature is carried out equivalent replacement; And these amendments or replacement, do not make the essence of appropriate technical solution depart from the spirit and scope of various embodiments of the present invention technical scheme.
Claims (10)
1. the cache data access method based on binary mark, it is characterised in that including:
Current cache node obtains the first mark of target data block in data access request, and described first mark is for distinguishing the content supplier of described target data block;
Described current cache node searches first order mapping relations according to described first mark in described current cache node, described first order mapping relations are that described current cache node identifies relation that set up, for described first mark and described second mark being associated with the second mark previously according to the first of the described target data block obtained, and described second is designated the mark of the content for distinguishing described target data block belonging to described target data block;
If finding, then described current cache node obtains, according to the second mark that described first order mapping relations are corresponding, the described target data block that the second mapping relations are corresponding, to send access response information according to this target data block, described second level mapping relations are that described current cache node identifies relation that set up, for described second mark and described target data block being associated with described target data block previously according to described the second of described target data block.
2. the cache data access method based on binary mark as claimed in claim 1, it is characterised in that before described current cache node searches first order mapping relations according to described first mark in described current cache node, the method also includes:
Described current cache node obtains described first mark of described target data block and described second mark;
According to described target data block, described first mark and described second mark, described current cache node judges whether described first order mapping relations and described second level mapping relations exist, set up described first order mapping relations to determine according to judged result, or described target data block is stored in described current cache node and sets up described first order mapping relations and described second level mapping relations.
3. the cache data access method based on binary mark as claimed in claim 2, it is characterized in that, according to described target data block, described first mark and described second mark, described current cache node judges whether described first order mapping relations and described second level mapping relations exist, described first order mapping relations are set up to determine according to judged result, or described target data block is stored in described current cache node and sets up described first order mapping relations and described second level mapping relations, including:
According to described first mark and described second mark, described current cache node judges whether described first order mapping relations exist, if it is not, then judge whether described second level mapping relations exist according to described target data block and described second mark;
If existing, then set up described first order mapping relations according to the second mark in described first mark and these already present second level mapping relations;
If being absent from, then described target data block is stored in current cache node, and sets up second level mapping relations according to described second mark and described target data block, set up described first order mapping relations according to described first mark and described second mark.
4. the cache data access method based on binary mark as claimed in claim 2, it is characterised in that described current cache node obtains described first mark of described target data block and described second mark, including:
Described current cache node monitors also stores the described first the first buffer memory replacement status information identified, and described first buffer memory replaces at least one that status information includes in this first last visit time identified and the first Preset Time in access times;
Described current cache node monitors also stores the described second the second buffer memory replacement status information identified, and described second buffer memory replaces at least one that status information includes in this second last visit time identified and the second Preset Time in access times.
5. the cache data access method based on binary mark as claimed in claim 4, it is characterized in that, it is that the first buffer memory according to each association the first mark replaces the information that status information is determined that second buffer memory of described second mark replaces status information, described each association first to be designated in described current cache node all first identifying of associate with this second mark.
6. the cache data access method based on binary mark as claimed in claim 1, it is characterised in that described second mark includes the Hash HASH value of described target data block.
7. the cache data access method based on binary mark as claimed in claim 1, it is characterised in that described first mark includes the uniform resource position mark URL of described target data block.
8. the cache data access method based on binary mark as claimed in claim 2, it is characterized in that, according to described target data block, described first mark and described second mark, described current cache node judges whether described first order mapping relations and described second level mapping relations exist, described first order mapping relations are set up to determine according to judged result, or described target data block is stored in described current cache node and sets up before described first order mapping relations and described second level mapping relations, the method also includes:
The list item storage state of described current cache nodal test self, to judge whether described list item storage state reaches predetermined threshold value, if described list item storage state reaches described predetermined threshold value, then replace status information according to the first buffer memory of the first mark storing data block and determine whether to replace this first mark having stored data block, and the second buffer memory having stored the second mark of data block according to this is replaced status information and determined whether to replace this second mark.
9. the cache data access method based on binary mark as claimed in claim 8, it is characterised in that described basis has stored the first buffer memory replacement status information of the first mark of data block and determined whether to replace this first mark having stored data block, including:
The first buffer memory according to the first mark storing data block is replaced status information and is determined whether that meeting the first preset buffer memory replaces condition, if so, then judge this first mark associated second identify whether also to be associated with other the first marks;
If association, then only delete this first buffer memory and replace the first mark that status information is corresponding;
If not associated, then delete this first buffer memory and replace the second associated mark of the first mark corresponding to status information, this first mark described and this has stored data block;
Second buffer memory replacement status information of this second mark having stored data block of described basis determines whether to replace this second mark, including:
The the second buffer memory replacement status information having stored the second mark of data block according to this determines whether that meeting the second preset buffer memory replaces condition, if, then delete this second mark and this has stored data block, and delete all first marks associated with this second mark.
10. the cache data access device based on binary mark, it is characterised in that including:
First mark acquiring unit, for obtaining the first mark of target data block in data access request, described first mark is for distinguishing the content supplier of described target data block;
First order mapping relationship searching unit, for searching first order mapping relations in described current cache node according to described first mark, described first order mapping relations are that described current cache node identifies relation that set up, for described first mark and described second mark being associated with the second mark previously according to the first of the described target data block obtained, and described second is designated the mark of the content for distinguishing described target data block belonging to described target data block;
Access response unit, for when described first order mapping relationship searching unit finds described first order mapping relations, the described target data block that the second mapping relations are corresponding is obtained according to the second mark that described first order mapping relations are corresponding, to send access response information according to this target data block, described second level mapping relations are that described current cache node identifies relation that set up, for described second mark and described target data block being associated with described target data block previously according to described the second of described target data block.
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 true CN105653473A (en) | 2016-06-08 |
| CN105653473B 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) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106487923A (en) * | 2016-11-15 | 2017-03-08 | 清华大学 | Configurable mobile terminal cooperation caching method |
| CN107562385A (en) * | 2017-09-13 | 2018-01-09 | 郑州云海信息技术有限公司 | Distributed storage client reads the method, apparatus and equipment of data |
| CN108494870A (en) * | 2018-04-03 | 2018-09-04 | 中国平安人寿保险股份有限公司 | Dynamic data loading method based on CDN and device |
| CN109565518A (en) * | 2016-07-29 | 2019-04-02 | 微软技术许可有限责任公司 | Interchangeable content retrieval |
| CN109614347A (en) * | 2018-10-22 | 2019-04-12 | 中国平安人寿保险股份有限公司 | Processing method, device, storage medium and the server of multi-level buffer data |
| CN110109845A (en) * | 2019-04-26 | 2019-08-09 | 深圳忆联信息系统有限公司 | Data cached management method, device, computer equipment and storage medium |
| CN115550445A (en) * | 2022-10-31 | 2022-12-30 | 浪潮云信息技术股份公司 | 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 |
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109565518A (en) * | 2016-07-29 | 2019-04-02 | 微软技术许可有限责任公司 | Interchangeable content retrieval |
| CN109565518B (en) * | 2016-07-29 | 2021-08-17 | 微软技术许可有限责任公司 | Method and system for interchangeable content retrieval |
| CN106487923A (en) * | 2016-11-15 | 2017-03-08 | 清华大学 | Configurable mobile terminal cooperation caching method |
| CN106487923B (en) * | 2016-11-15 | 2019-07-02 | 清华大学 | Configurable mobile terminal cooperation caching method |
| CN107562385A (en) * | 2017-09-13 | 2018-01-09 | 郑州云海信息技术有限公司 | Distributed storage client reads the method, apparatus and equipment of data |
| CN108494870A (en) * | 2018-04-03 | 2018-09-04 | 中国平安人寿保险股份有限公司 | Dynamic data loading method based on CDN and device |
| CN108494870B (en) * | 2018-04-03 | 2022-05-17 | 中国平安人寿保险股份有限公司 | CDN-based dynamic data loading method and device |
| CN109614347A (en) * | 2018-10-22 | 2019-04-12 | 中国平安人寿保险股份有限公司 | Processing method, device, storage medium and the server of multi-level buffer data |
| CN109614347B (en) * | 2018-10-22 | 2023-07-21 | 中国平安人寿保险股份有限公司 | Processing method and device for multi-level cache data, storage medium and server |
| CN110109845A (en) * | 2019-04-26 | 2019-08-09 | 深圳忆联信息系统有限公司 | Data cached management method, device, computer equipment and storage medium |
| CN115550445A (en) * | 2022-10-31 | 2022-12-30 | 浪潮云信息技术股份公司 | Distributed system request response method and related components |
| CN115550445B (en) * | 2022-10-31 | 2023-08-01 | 浪潮云信息技术股份公司 | Distributed system request response method and related components |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105653473B (en) | 2019-03-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105653473A (en) | Cache data access method and device based on binary identification | |
| US11194719B2 (en) | Cache optimization | |
| US10778801B2 (en) | Content delivery network architecture with edge proxy | |
| KR102301353B1 (en) | Method for transmitting packet of node and content owner in content centric network | |
| US7904562B2 (en) | Server and connecting destination server switch control method | |
| US9514243B2 (en) | Intelligent caching for requests with query strings | |
| Carofiglio et al. | LAC: Introducing latency-aware caching in information-centric networks | |
| US20140280606A1 (en) | Method and Apparatus for Content Management | |
| US20110099226A1 (en) | Method of requesting for location information of resources on network, user node and server for the same | |
| JP2013522736A (en) | Method and system for providing a message including a universal resource locator | |
| CN111046065B (en) | Extensible high-performance distributed query processing method and device | |
| CN111464661A (en) | Load balancing method and device, proxy equipment, cache equipment and service node | |
| US6973536B1 (en) | Self-adaptive hybrid cache | |
| CN109873855A (en) | A kind of resource acquiring method and system based on block chain network | |
| CN109002260A (en) | A kind of data cached processing method and processing system | |
| CN103107944A (en) | Content locating method and route equipment | |
| CN102404372A (en) | Method, system and node device for storing content in WEB cache in distributed mode | |
| CN103825916A (en) | Resource downloading method and resource downloading system | |
| JP2016099969A (en) | Information processing apparatus, data storage system, and data storage method | |
| CN114095573B (en) | Content copy placement method of CDN-P2P network based on edge cache | |
| CN111614750B (en) | Data updating method, system, equipment and storage medium | |
| KR101381199B1 (en) | Method and System for Content Delivery and Caching | |
| CN114124971B (en) | Content copy placement method of CDN-P2P network based on edge cache | |
| Nikolaou et al. | Cooperative client caching strategies for social and web applications | |
| CN113992653B (en) | CDN-P2P network content downloading, pre-storing and replacing method based on edge cache |
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 |