WO2017049488A1 - Procédé et appareil de gestion de mémoire cache - Google Patents

Procédé et appareil de gestion de mémoire cache Download PDF

Info

Publication number
WO2017049488A1
WO2017049488A1 PCT/CN2015/090416 CN2015090416W WO2017049488A1 WO 2017049488 A1 WO2017049488 A1 WO 2017049488A1 CN 2015090416 W CN2015090416 W CN 2015090416W WO 2017049488 A1 WO2017049488 A1 WO 2017049488A1
Authority
WO
WIPO (PCT)
Prior art keywords
space
record item
record
access
content data
Prior art date
Application number
PCT/CN2015/090416
Other languages
English (en)
Chinese (zh)
Inventor
吴问付
Original Assignee
华为技术有限公司
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by 华为技术有限公司 filed Critical 华为技术有限公司
Priority to CN201580083252.8A priority Critical patent/CN108351873B/zh
Priority to PCT/CN2015/090416 priority patent/WO2017049488A1/fr
Publication of WO2017049488A1 publication Critical patent/WO2017049488A1/fr

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor

Definitions

  • the present invention relates to the field of communications technologies, and in particular, to a cache management method and apparatus.
  • some content data may be buffered in the base station, and when the base station locally caches the content data requested by the user, it is directly returned to the user.
  • the traditional cache management method generally divides the cache space of the base station into two parts when managing the content data buffered by the base station. As shown in FIG. 3, a part is a record item space for storing a record item, and the record item is used to describe access information of content data, such as the last access time, the total number of accesses, etc.; the other part is a data cache space, For storing cached content data.
  • the total size of the record item space and the data cache space is fixed, but the respective sizes are not fixed. When adding a new record item, it is necessary to enlarge the record item space, and accordingly, the data cache space needs to be reduced.
  • the base station After the access request for a certain content data arrives at the base station, the base station first determines whether the content data requested to be accessed has a corresponding record item in the record item space of the base station, and if so, updates its record item; otherwise, it records In the item space, a record entry is added for the content data requested to be accessed. Then, the base station determines whether the content data requested to be accessed exists in the data buffer space of the base station, and if so, directly returns the content data buffered in the data buffer space to the requester; otherwise, the content data is sent to the upper level of the base station.
  • the request such as the Public Data Network GateWay (English: Public Data Network GateWay, PGW for short), and the content data received from the upper level are sent to the requester.
  • the existing cache management method retains the record corresponding to the content data even when deleting the cached content data, which will This leads to the accumulation of many outdated entries, which wastes the limited storage resources of the base station.
  • the embodiment of the invention provides a cache management method and device, which are used to solve the problem that the obsolete record item wastes too much storage resources.
  • an embodiment of the present invention provides a cache management method, including:
  • the deleted at least one record item does not have corresponding content data in the data cache space.
  • determining that the entry is empty Before the first available space also includes:
  • the setting condition is that at least one record item can be created, and after the stored at least one record item is deleted in the record item space, the method further includes:
  • the method before determining the first available space of the record item space, the method further includes:
  • the setting condition is that at least one record item can be created.
  • a record entry corresponding to the content data requested by the access request is created Previously, it also included:
  • the deleted at least one record entry is The data cache space does not have a record item whose access probability is ranked in the last n bits in at least one record item of the corresponding content data.
  • the deleted at least one record entry is The entry with the least probability of access is found in at least one record item in which the corresponding content data does not exist in the data cache space.
  • the content data stored in the data cache space is fixed in length Audio and video segments of value
  • the method further includes:
  • the access Requesting, by the second device, the audio and video segment requested by the access request, and the use of the audio and video segment of the requested audio and video segment, and the access probability of the audio and video segment having the smallest access probability stored in the data buffer space The audio and video segments returned by the second device replace the audio and video segments stored in the data buffer space with the least probability of access.
  • the method further includes:
  • the record item corresponding to the content data requested by the access request is updated.
  • the record entry includes the following fields:
  • Updating a record corresponding to the content data requested by the access request including:
  • the forgetting factor is updated periodically or irregularly according to the time-varying time when the device initiates the access request
  • the time variation of the device initiating the access request satisfies the following conditions:
  • ⁇ P represents the time variation of the device initiating the access request
  • P t (i) represents the probability that the content data corresponding to the record of the access probability ranked in the ith bit in the record item space is requested at time t
  • P t - ⁇ (i) represents the probability that the content data corresponding to the entry of the i-th bit in the record item space is requested at time t- ⁇
  • M represents the record included in the record space
  • the total number of N, N represents the total number of entries in the record item space in which the access probability ranks in the first N bits.
  • the updated forgetting factor satisfies the following conditions:
  • a' indicates the updated forgetting factor
  • a indicates the forgetting factor before the update
  • update rate indicates the preset parameter, 0 ⁇ update rate ⁇ 1.
  • the size of the recording item space is set according to Parameter RECORD LIMIT setting
  • the setting parameter RECORD LIMIT is used to characterize a ratio of a maximum number of entries stored in the record space to a maximum number of content data stored in the data cache space; the setting parameter RECORD LIMIT is greater than one.
  • the record item in the record item space Stored in a minimal heap structure is the record entry with the least probability of access in the record entry space.
  • an embodiment of the present invention provides a cache management apparatus, including:
  • a processing module configured to determine a first available space of the record item space; delete the stored at least one record item in the record item space when the determined first available space does not satisfy the set condition; The deleted at least one record item does not have corresponding content data in the data cache space.
  • the device further includes:
  • a receiving module configured to receive an access request of the first device before the processing module determines the first available space of the record item space
  • the processing module is further configured to: after determining that the content data requested by the access request does not have a corresponding record item in the record item space, after deleting the stored at least one record item in the record item space, Creating a record item corresponding to the content data requested by the access request in the record item space; the setting condition is that at least one record item can be created.
  • the device further includes:
  • a receiving module configured to receive an access request of the first device before the processing module determines the first available space of the record item space
  • the processing module is further configured to: if it is determined that the content data requested by the access request does not have a corresponding record item in the record item space, before determining the first available space of the record item space, in the record item space And creating a record item corresponding to the content data requested by the access request; the setting condition is that at least one record item can be created.
  • the processing module is further configured to:
  • the deleted at least one record item is The data cache space does not have a record item whose access probability is ranked in the last n bits in at least one record item of the corresponding content data.
  • the deleted at least one record item is a record item having the smallest access probability among the at least one record item in which the corresponding content data does not exist in the data cache space.
  • the content data stored in the data cache space is fixed in length Audio and video segments of value
  • the processing module is further configured to:
  • the access Requesting, by the second device, the audio and video segment requested by the access request, and the use of the audio and video segment of the requested audio and video segment, and the access probability of the audio and video segment having the smallest access probability stored in the data buffer space The audio and video segments returned by the second device replace the audio and video segments stored in the data buffer space with the least probability of access.
  • the processing module is further configured to:
  • the record item corresponding to the content data requested by the access request is updated.
  • the record entry includes the following fields:
  • the processing module updates the record corresponding to the content data requested by the access request
  • the processing module is specifically configured to:
  • the forgetting factor is updated periodically or irregularly according to the time-varying time when the device initiates the access request
  • the time variation of the device initiating the access request satisfies the following conditions:
  • ⁇ P represents the time variation of the device initiating the access request
  • P t (i) represents the probability that the content data corresponding to the record of the access probability ranked in the ith bit in the record item space is requested at time t
  • P t - ⁇ (i) represents the probability that the content data corresponding to the entry of the i-th bit in the record item space is requested at time t- ⁇
  • M represents the record included in the record space
  • the total number of N, N represents the total number of entries in the record item space in which the access probability ranks in the first N bits.
  • the updated forgetting factor satisfies the following conditions:
  • a' indicates the updated forgetting factor
  • a indicates the forgetting factor before the update
  • update rate indicates the preset parameter, 0 ⁇ update rate ⁇ 1.
  • the size of the recording item space is set according to Parameter RECORD LIMIT setting
  • the setting parameter RECORD LIMIT is used to characterize a ratio of a maximum number of entries stored in the record space to a maximum number of content data stored in the data cache space; the setting parameter RECORD LIMIT is greater than one.
  • the record item in the record item space Stored in a minimal heap structure is the record entry with the least probability of access in the record entry space.
  • the embodiment of the present invention by maintaining a fixed-size record item space, the old record items are selectively eliminated, thereby solving the problem that the obsolete record items waste too much storage resources.
  • 1A is a schematic diagram of user response in a conventional network in the prior art
  • FIG. 1B is a schematic diagram of user response in a CDN in the prior art
  • FIG. 2 is a schematic diagram of user response in a CDN based on a mobile network in the prior art
  • FIG. 3 is a schematic diagram of allocation of a record item space and a data cache space in the prior art
  • FIG. 4 is a flowchart of a cache management method according to an embodiment of the present invention.
  • FIG. 5 is a schematic diagram of an access probability distribution of content data according to an embodiment of the present invention.
  • FIG. 6 is a schematic diagram of a video segment identifier according to an embodiment of the present disclosure.
  • FIG. 7 is a detailed flowchart of a base station management video buffer according to an embodiment of the present invention.
  • FIG. 8 is a schematic structural diagram of a cache management apparatus according to an embodiment of the present disclosure.
  • FIG. 9 is a schematic structural diagram of a cache management device according to an embodiment of the present invention.
  • the embodiment of the invention provides a cache management method and device, which selectively eliminates stale entries by maintaining a fixed-size record item space, thereby solving the problem that the obsolete record items waste too much storage resources.
  • the technical solution of the embodiment of the present invention can be applied to a device with limited storage resources such as a base station and a PGW, and can also be applied to a device with rich storage resources such as a CDN cache server.
  • FIG. 4 is a flowchart of implementing a cache management method according to an embodiment of the present invention, including:
  • Step 401 Determine a first available space of the record item space.
  • the available space is the space remaining in the current record item space except for the space occupied by the stored record items.
  • the total size of the record item space in the embodiment of the present invention is fixed, that is, the total number of record items that can be stored in the record item space is fixed, and does not increase continuously with the increase of the content data that appears.
  • the size of the record item space may be set according to the setting parameter RECORD LIMIT , where the setting parameter RECORD LIMIT is used to represent the maximum number of records items stored in the record item space and the data cache space.
  • the ratio of the maximum number of stored content data; the set parameter RECORD LIMIT is greater than one.
  • the specification of a base station is to store a maximum of 10,000 videos. If the parameter RECORD LIMIT is set to 2, it is considered that the space occupied by each entry generally does not exceed 1 kilobyte (unit: KB), so the record can be recorded. The size of the space is set to 20000KB.
  • Step 402 Delete at least one stored item in the record item space when the determined first available space does not satisfy the set condition; wherein the deleted at least one record item does not have a corresponding content in the data cache space data.
  • the setting condition may be that at least one record item can be created; the so-called unsatisfied setting condition that the available space for characterizing the current record item space is insufficient to create at least one record item.
  • the deleted at least one record item may be a record item whose access probability is ranked in the last n bits in at least one record item in which the corresponding content data does not exist in the data cache space; or the deleted at least A record item may be a record item with the least probability of access in at least one record item in which the corresponding content data does not exist in the data cache space.
  • the embodiment of the present invention can achieve the effect of being almost the same as storing all the recorded items by storing only a part of the recorded items, which is due to the concentrated characteristics of the device behavior.
  • most of the device-initiated access requests are concentrated on a small amount of specific content data, while the rest of the content data has very few accesses.
  • For systems with limited storage resources generally only A portion of the content data with the highest probability of access is stored in the data cache space.
  • the embodiment of the present invention selects to discard the record items of the content data with low access probability, and selects the record items of the content data with high access probability, so that the storage resources can be saved, and the tracking content data can be obviously not affected. Access probability.
  • the method flow shown in FIG. 4 can have the following two trigger conditions:
  • Condition 1 According to the set period
  • Condition 2 Unscheduled, such as receiving an access request of the first device, and determining that the content data requested by the access request does not have a corresponding record item in the record item space.
  • Sequence one first receiving an access request of the first device, and when determining that the content data requested by the access request does not have a corresponding record item in the record item space, performing step 401 and step 402, and then performing the record item In the space, a record item corresponding to the content data requested by the access request is created.
  • Sequence 2 first receiving an access request of the first device, and when determining that the content data requested by the access request does not have a corresponding record item in the record item space, creating and accessing the record item space The record corresponding to the requested content data is requested, and then steps 401 and 402 are performed.
  • Sequence 3 first receiving an access request of the first device, and determining that the content data requested by the access request does not have a corresponding record item in the record item space, determining a second available space of the record item, determining When the second available space satisfies the set condition, a record corresponding to the content data requested by the access request is created in the record item space, and then steps 401 and 402 are performed.
  • the record item corresponding to the content data requested by the access request needs to be updated.
  • EWMA Exponentially Weighted Moving-Average
  • a record entry includes the following three fields: last access time, average access interval, and number of accesses; wherein the last access time and the average access interval are generally double-precision floating-point types (English: double)
  • the variable, the number of accesses is generally an integer (English: int) variable; the average access interval is used to characterize the access probability.
  • the access request When an access request is received, the access request generally carries an access time and an identifier of the requested content data, and the EWMA algorithm finds the record with the same identifier in the record item space according to the identifier of the content data requested by the access request. And then updating a field included in the record corresponding to the content data requested by the access request according to the access time included in the access request and the set forgetting factor;
  • the updated average access time interval meets the following conditions:
  • the updated last access time meets the following conditions:
  • T' denotes the updated average access interval
  • T denotes the average access interval before the update
  • a denotes the forgetting factor
  • t cur denotes the access time carried by the access request
  • t last denotes the last access time before the update
  • t Last ' indicates the last access time before the update
  • Count' indicates the number of accesses after the update
  • Count indicates the number of accesses before the update.
  • the forgetting factor in the existing EWMA algorithm is a value between 0 and 1.
  • the forgetting factors used by different systems should take different values. As the same system changes over time, the access behavior of the device group will also change, and the forgetting factor adopted should also change accordingly.
  • the existing EWMA algorithm cannot know in advance the time-varying size of the device-initiated access request, the setting of the forgetting factor becomes an important issue.
  • the embodiment of the present invention provides a method for adaptively adjusting the forgetting factor, which can dynamically adjust the forgetting factor by predicting the time variation of the access request initiated by the device. For example, when the time when the device initiates the access request is large, a larger forgetting factor is selected, and when the time when the device initiates the access request is small, a smaller forgetting factor is selected.
  • FIG. 5 it is a schematic diagram of an access probability distribution of content data, wherein the horizontal axis represents the ranking of the access probability of the content data corresponding to each record item in the record item space, for example, the access probability row in the record item space.
  • the value of the content data corresponding to the record of the first bit on the horizontal axis is 1; the vertical axis represents the access probability; and the curve P t represents the access probability distribution of the content data corresponding to each record item in the record entry space at time t.
  • the curve P t- ⁇ represents the access probability distribution of the content data corresponding to each record item in the record item space at the time t- ⁇ .
  • the amount of change in the device-initiated access request from the time t- ⁇ to the time t can be expressed by the phase difference between the curve P t and the curve P t- ⁇ , as shown by the dark portion in FIG. Assuming that the total number of entries included in the entry space is M, then the time variant of the device initiating the access request satisfies the following conditions:
  • P t (i) represents the probability that the content data corresponding to the record of the ith bit in the record item space is requested at time t
  • P t - ⁇ (i) indicates the probability that the content data corresponding to the record in which the popularity of the i-th bit ranks in the record item space is requested at time t- ⁇ .
  • the time-varying time when the device initiates the access request is mainly reflected in the change of the device requesting the access to the content data with high probability of access in different time periods, it is also possible not to accumulate the record.
  • the access probability of the content data corresponding to each record item in the record space changes, but the access probability change of the content data corresponding to the record item whose access probability is ranked in the top N bits in the accumulated record space.
  • the time-varying ⁇ P of the device initiating the access request satisfies the following conditions:
  • N is the total number of entries in the record item space whose access probability is ranked in the first N bits.
  • the forgetting factor is updated periodically or irregularly according to the time variation of the device initiated access request, and the updated forgetting factor satisfies the following conditions:
  • a' denotes the updated forgetting factor
  • a denotes the forgetting factor before the update
  • update rate denotes the preset parameter
  • 0 ⁇ update rate ⁇ 1 the value of ⁇ P can be referred to formula (4) or formula (5).
  • Equation (6) can be understood as smoothing the forgetting factor using a low pass filter, where update rate can be understood as a filter parameter.
  • update rate can be taken as 0.4.
  • the technical means for setting the forgetting factor does not depend on the technical solution of the present invention, and is not limited to the scenario of managing the cache.
  • the technical means may be implemented in cooperation with other technical means, or may be implemented separately.
  • the corresponding cache in the data cache space may be directly sent. Give the first device.
  • the corresponding content data may be requested from the second device, and the content data returned by the second device is sent to the first device.
  • the second device may be the same level device or a higher level device of the device that receives the access request, for example, the device that receives the access request is a base station, and the second device may be the same.
  • Other base stations of the level may also be PGW or CDN cache servers of the upper level.
  • the content data may be directly stored in the data cache space; if the available space of the data cache space is smaller than that returned by the second device For the occupied space of the content data, it is further determined whether the access probability of the content data is greater than the access probability of the content data having the smallest access probability in the data cache space. When it is determined that the access probability of the content data returned by the second device is not greater than the access probability of the content data with the smallest access probability, the content data returned by the second device may not be stored.
  • the access probability of the content data returned by the second device is greater than the access probability of the content data with the smallest access probability
  • the content data with the smallest access probability may be deleted, if the data cache space after the deletion is sufficient for storing
  • the content data returned by the second device is stored, and the content data returned by the second device is stored, otherwise the operation is repeated, and the content data with the lowest current access probability and the content returned by the second device are continuously compared.
  • the access probability of the data until a sufficient space is deleted in the data cache space for storing the content data returned by the second device, or access to the content data having the smallest current access probability in the data cache space is determined
  • the probability is greater than the content data returned by the second device, the content data returned by the second device is discarded.
  • the embodiment of the present invention proposes a method of performing equal length segmentation on audio and video.
  • the CDN cache server is responsible for equal length segmentation of each audio and video.
  • the length of each audio and video segment is a fixed value, and different audio and video will be divided into different portions of audio and video segments. For example, if the fixed length of each audio and video segment is set to 1 minute, then the 10-minute video will be divided into 10 copies, and the 14-minute video will be divided into 14 copies.
  • the CDN cache server is also responsible for marking the audio and video after these segments.
  • Each audio segment has a unique identifier.
  • the logo consists of two parts, one is the audio and video number, and the other is the segment number of the audio and video segment in the audio and video. For example, if the length of the video is 10 minutes and is divided into 10 video segments, the identifier of the fifth video segment is: ⁇ 1:5 ⁇ , as shown in FIG. 6.
  • the base station is responsible for converting the access request sent by the user equipment into a request for the audio and video segment. For example, When a user equipment requests the 5th to 6th minutes of the video No. 1, the predetermined length of each audio and video segment is 1 minute, the base station can convert the request of the user equipment into a pair of ⁇ 1:5 ⁇ . And the request for the audio and video segment identification of ⁇ 1:6 ⁇ .
  • the audio and video segment identifiers can communicate with each other to determine the audio and video segments that need to be processed.
  • the access probability of the audio and video segment requested by the access request is greater than the access probability of the audio and video segment having the smallest access probability stored in the data buffer space, and then the audio and video segment requested by the access request may be requested from the second device. And replacing the audio and video segments stored in the data buffer space with the least probability of access using the audio and video segments returned by the second device.
  • an audio and video segment can be cached to cache an audio and video segment, which is beneficial to reduce the calculation pressure.
  • the access probability of different parts of the same audio and video is different in practical applications, for example, the user fast forwards or rewinds a video, which may cause a certain time period within the video with a high probability of access. The access probability is relatively low. Obviously, this part of the video segment with a small probability of access is not necessary to be cached in the system. However, if the audio and video segmentation is not performed, the complete video needs to be cached. Therefore, the audio and video segmentation can avoid the access probability. Small audio and video segments occupy the system's storage resources.
  • the record item in the record item space may be stored in a minimum heap structure manner, and the root node of the minimum heap is the record item with the smallest access probability in the record item space.
  • the node when determining whether to create a record item of the content data requested by the access request, the node may be taken from the top to the bottom of the root node of the minimum heap, if a node satisfies the corresponding record item in the data cache space. If there is no corresponding content data and the access probability of the record item is less than the access probability of the audio and video segment requested by the access request, the record corresponding to the node is replaced with the content data requested by the access request. Record item.
  • the method for managing a video buffer by a base station is as follows:
  • Step 701 The base station receives an access request of the user equipment.
  • Step 702 The base station determines identifiers of all video segments requested by the access request, and performs the following processing segment by segment.
  • Step 703 The base station determines whether the video segment requested by the access request has a corresponding record item in the record item space. If yes, step 704 is performed; otherwise, step 705 is performed.
  • Step 704 The base station updates the record corresponding to the video segment requested by the access request, and proceeds to step 708;
  • Step 705 The base station determines whether the record item space is sufficient to create a record item. If yes, step 707 is performed; otherwise, step 706 is performed.
  • Step 706 The base station searches for and deletes a record item having the smallest access probability among the records of the video in which the corresponding video does not exist in the record item stored in the record item space.
  • Step 707 The base station creates a record corresponding to the video requested by the access request in the record item space, and initializes each field included in the record item.
  • Step 708 The base station determines whether the video segment requested by the access request is stored in the data cache space. If yes, go to step 714; otherwise, go to step 709.
  • Step 709 The base station requests the video segment requested by the access request from the PGW cache server of the upper layer.
  • Step 710 The base station determines whether the data cache space is sufficient to store the video segment requested by the access request returned by the PGW cache server. If yes, go to step 713; otherwise, go to step 711.
  • Step 711 The base station determines whether the access probability of the video segment requested by the access request is greater than the access probability of the video segment with the smallest access probability stored in the data cache space. If yes, go to step 712; otherwise, go to step 714.
  • Step 712 The base station deletes a video segment that has the smallest access probability stored in the data cache space.
  • Step 713 The base station stores a video segment requested by the access request returned by the PGW cache server.
  • Step 714 The base station returns the video segment requested by the access request to the user equipment.
  • the cache management device and the cache management device provided by the embodiment of the present invention are described in detail below with reference to FIG. 8 and FIG.
  • FIG. 8 is a schematic structural diagram of a cache management apparatus 80 according to an embodiment of the present invention. As shown in FIG. 8, the apparatus 80 includes:
  • the processing module 801 is configured to determine a first available space of the record item space; when the determined first available space does not satisfy the set condition, delete the stored at least one record item in the record item space; wherein, at least one of the deleted items is deleted A record item does not have corresponding content data in the data cache space.
  • the device 80 further includes:
  • the receiving module 802 is configured to receive an access request of the first device before the processing module 801 determines the first available space of the record item space.
  • the processing module 801 may be further configured to: if it is determined that the content data requested by the access request does not have a corresponding record item in the record item space, then After deleting the stored at least one record item in the record item space, creating a record item corresponding to the content data requested by the access request in the record item space; the setting condition is that at least one record item can be created .
  • the processing module 801 may be further configured to determine the record if it is determined that the content data requested by the access request does not have a corresponding record item in the record item space. Before the first available space of the item space, in the record item space, a record item corresponding to the content data requested by the access request is created; the setting condition is that at least one record item can be created.
  • the processing module 801 may be further configured to: if it is determined that the content data requested by the access request does not exist in the record item space An entry record, determining a second available space of the record item space before determining the first available space of the record item space; and determining the second available space when the set condition is determined In the item space, a record item corresponding to the content data requested by the access request is created; the setting condition is that at least one record item can be created.
  • the deleted at least one record item is a record item whose access probability is ranked in the last n bits in at least one record item in which the corresponding content data does not exist in the data cache space.
  • the deleted at least one record item is a record item having the smallest access probability among the at least one record item in which the corresponding content data does not exist in the data cache space.
  • the processing module 801 is further configured to: if the audio and video segment requested by the access request is not stored in The occupied space of the audio and video segments requested by the access request is larger than the available space of the data cache space, and the access probability of the audio and video segments requested by the access request is greater than that stored in the data cache space. And an access probability of the audio and video segment having the smallest access probability in the data buffer space, requesting, by the second device, the audio and video segment requested by the access request, and replacing the audio and video segment returned by using the second device with the data. The audio and video segment with the least probability of access in the cache space.
  • the processing module 801 is further configured to: if the content data requested by the access request has a corresponding record item in the record item space, update the record item corresponding to the content data requested by the access request .
  • the record item includes the following fields: last access time, average access interval, and number of accesses; the average access interval is used to represent an access probability;
  • the method is specifically configured to: update and request the access request according to the access time and the set forgetting factor included in the access request.
  • the forgetting factor is updated periodically or irregularly according to the time-varying time when the device initiates the access request; the device initiates the time-varying access request, and satisfies the following conditions:
  • ⁇ P represents the time variation of the device initiating the access request
  • P t (i) represents the probability that the content data corresponding to the record of the access probability ranked in the ith bit in the record item space is requested at time t
  • P t - ⁇ (i) represents the probability that the content data corresponding to the entry of the i-th bit in the record item space is requested at time t- ⁇
  • M represents the record included in the record space
  • the total number of N, N represents the total number of entries in the record item space in which the access probability ranks in the first N bits.
  • the updated forgetting factor satisfies the following conditions:
  • a' indicates the updated forgetting factor
  • a indicates the forgetting factor before the update
  • update rate indicates the preset parameter, 0 ⁇ update rate ⁇ 1.
  • the size of the record item space is set according to a setting parameter RECORD LIMIT ;
  • the setting parameter RECORD LIMIT is used to represent the maximum number of records stored in the record item space and the content stored in the data cache space.
  • the ratio of the maximum number of data; the set parameter RECORD LIMIT is greater than one.
  • the record items in the record item space are stored in a minimum heap structure, and the root node of the minimum heap is a record item having the smallest access probability in the record item space.
  • FIG. 9 is a schematic structural diagram of a cache management device 90 according to an embodiment of the present invention. As shown in FIG. 9, the device 90 includes:
  • processor 902 connected to the bus
  • a transceiver 904 coupled to the bus.
  • the processor 902 by using the bus 901, invokes a program stored in the memory 903 for determining a first available space of a record item space; the first available space is determined to be dissatisfied When the condition is set, the stored at least one record item is deleted in the record item space; wherein the deleted at least one record item does not have corresponding content data in the data cache space.
  • the transceiver 904 is configured to complete the function of the receiving module 802 in the cache management device 80 under the control of the processor 902.
  • the processor 902 is further configured to complete the functions of the processing module 801 in the cache management device 80.
  • the bus 901 may include a power bus, a control bus, a status signal bus, and the like in addition to the data bus.
  • the various buses are labeled as buses in the figure.
  • the processor 902 can be a central processing unit (English: Central Processing Unit, CPU for short), and can also be other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASICs), and ready-to-use programmable circuits. Gate array (abbreviation: FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components, etc.
  • the general purpose processor may be a microprocessor or may be any conventional processor or the like.
  • Memory 903 can include read only memory and random access memory and provides instructions and data to processor 902. A portion of the memory 903 may also include a non-volatile random access memory.
  • the transceiver 904 can include a transmit circuit, a receive circuit, a power controller, a decoder, and an antenna.
  • the technical solution provided by the embodiment of the present invention maintains a fixed-size record item space that does not grow with time for storing a record item, and selectively selects an old record item according to the access probability included in the record item. Solved the problem that too many obsolete records are wasting storage resources.
  • embodiments of the present invention can be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment, or a combination of software and hardware. Moreover, the invention can take the form of a computer program product embodied on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) including computer usable program code.
  • computer-usable storage media including but not limited to disk storage, CD-ROM, optical storage, etc.
  • the computer program instructions can also be stored in a computer readable memory that can direct a computer or other programmable data processing device to operate in a particular manner, such that the instructions stored in the computer readable memory produce an article of manufacture comprising the instruction device.
  • the apparatus implements the functions specified in one or more blocks of a flow or a flow and/or block diagram of the flowchart.
  • These computer program instructions can also be loaded onto a computer or other programmable data processing device such that a series of operational steps are performed on a computer or other programmable device to produce computer-implemented processing for execution on a computer or other programmable device.
  • the instructions provide steps for implementing the functions specified in one or more of the flow or in a block or blocks of a flow diagram.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Data Mining & Analysis (AREA)
  • Databases & Information Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

La présente invention concerne un procédé et un appareil de gestion de mémoire cache. En maintenant un espace d'entrée d'enregistrement d'une taille fixe et en éliminant sélectivement des entrées d'enregistrement périmées, le problème du gaspillage de ressources de stockage dû à un trop grand nombre d'entrées d'enregistrement obsolètes est résolu. Le procédé comprend les étapes consistant : à déterminer un premier espace disponible d'un espace d'entrée d'enregistrement ; et lorsque le premier espace disponible déterminé ne satisfait pas une condition prédéfinie, à supprimer au moins une entrée d'enregistrement stockée dans l'espace d'entrée d'enregistrement, ladite au moins une entrée d'enregistrement supprimée n'ayant pas de données de contenu correspondantes dans un espace d'antémémoire de données.
PCT/CN2015/090416 2015-09-23 2015-09-23 Procédé et appareil de gestion de mémoire cache WO2017049488A1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN201580083252.8A CN108351873B (zh) 2015-09-23 2015-09-23 一种缓存管理方法和装置
PCT/CN2015/090416 WO2017049488A1 (fr) 2015-09-23 2015-09-23 Procédé et appareil de gestion de mémoire cache

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2015/090416 WO2017049488A1 (fr) 2015-09-23 2015-09-23 Procédé et appareil de gestion de mémoire cache

Publications (1)

Publication Number Publication Date
WO2017049488A1 true WO2017049488A1 (fr) 2017-03-30

Family

ID=58385578

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2015/090416 WO2017049488A1 (fr) 2015-09-23 2015-09-23 Procédé et appareil de gestion de mémoire cache

Country Status (2)

Country Link
CN (1) CN108351873B (fr)
WO (1) WO2017049488A1 (fr)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112954383B (zh) * 2021-03-02 2023-05-16 山东省计算中心（国家超级计算济南中心） 视频点播方法、视频点播代理服务器、基站及存储介质
CN114900732B (zh) * 2022-04-25 2024-01-12 北京奇艺世纪科技有限公司 视频缓存方法、装置、电子设备及存储介质

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101105800A (zh) * 2007-07-04 2008-01-16 深圳市中兴移动技术有限公司 一种嵌入式系统中大容量数据记录的存储方法
CN101510332A (zh) * 2008-12-25 2009-08-19 北京握奇数据系统有限公司 一种智能卡中存储空间的管理方法和装置
CN101795272A (zh) * 2010-01-22 2010-08-04 联想网御科技(北京)有限公司 非法网站过滤方法及装置
CN102006368A (zh) * 2010-12-03 2011-04-06 重庆新媒农信科技有限公司 基于移动终端记忆卡缓存技术的流媒体音频文件播放方法
US8484097B1 (en) * 2011-03-31 2013-07-09 Amazon Technologies, Inc. Method, system, and computer readable medium for selection of catalog items for inclusion on a network page

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101557331B (zh) * 2008-04-07 2012-02-15 华为技术有限公司 内容索引处理方法及系统、内容路由功能及内容分发控制实体
US20100161537A1 (en) * 2008-12-23 2010-06-24 At&T Intellectual Property I, L.P. System and Method for Detecting Email Spammers
CN101916302B (zh) * 2010-09-01 2012-11-21 中国地质大学（武汉） 基于哈希表的三维空间数据自适应缓存管理方法及系统
CN102479159A (zh) * 2010-11-25 2012-05-30 大唐移动通信设备有限公司 多进程harq数据的缓存方法和设备
WO2011157120A2 (fr) * 2011-05-31 2011-12-22 华为技术有限公司 Procédé, dispositif et système de contrôle d'accès pour cache de nœud b
CN104253855B (zh) * 2014-08-07 2018-04-24 哈尔滨工程大学 一种面向内容中心网络中基于内容分类的类别流行度缓存替换方法

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101105800A (zh) * 2007-07-04 2008-01-16 深圳市中兴移动技术有限公司 一种嵌入式系统中大容量数据记录的存储方法
CN101510332A (zh) * 2008-12-25 2009-08-19 北京握奇数据系统有限公司 一种智能卡中存储空间的管理方法和装置
CN101795272A (zh) * 2010-01-22 2010-08-04 联想网御科技(北京)有限公司 非法网站过滤方法及装置
CN102006368A (zh) * 2010-12-03 2011-04-06 重庆新媒农信科技有限公司 基于移动终端记忆卡缓存技术的流媒体音频文件播放方法
US8484097B1 (en) * 2011-03-31 2013-07-09 Amazon Technologies, Inc. Method, system, and computer readable medium for selection of catalog items for inclusion on a network page

Also Published As

Publication number Publication date
CN108351873A (zh) 2018-07-31
CN108351873B (zh) 2021-05-11

Similar Documents

Publication Publication Date Title
US11665259B2 (en) System and method for improvements to a content delivery network
US20140258375A1 (en) System and method for large object cache management in a network
US10862992B2 (en) Resource cache management method and system and apparatus
US8812791B2 (en) System and method of selectively caching information based on the interarrival time of requests for the same information
US9313270B2 (en) Adaptive asynchronous data replication in a data storage system
CN107249035B (zh) 一种等级动态可变的共享重复数据存储和读取方法
EP1678642A1 (fr) Procede de classement par ordre de priorite de segments de contenu multimedia dans une antememoire mandataire
CN102307234A (zh) 基于移动终端的资源检索方法
WO2011143946A1 (fr) Procédé et système permettant de gérer les mémoires caches à plusieurs niveaux d'un serveur de périphérie dans un cdn
TW201428503A (zh) 快取檔案的管理方法及系統
CN114697683A (zh) 流媒体文件的智能调度方法、设备和计算机程序产品
WO2017049488A1 (fr) Procédé et appareil de gestion de mémoire cache
CN112631504A (zh) 利用堆外内存实现本地缓存的方法和装置
TW201445987A (zh) 傳輸資訊的方法及裝置
CN102609508A (zh) 一种面向网络存储的文件高速访问方法
WO2023165543A1 (fr) Procédé et appareil de gestion de mémoire cache partagée, et support de stockage
US9871732B2 (en) Dynamic flow control in multicast systems
US20160112534A1 (en) Hierarchical caching for online media
KR101690944B1 (ko) 이종 컴퓨터 환경에서 부하 분산을 고려한 분산 캐시 관리 방법 및 장치
US20130176851A1 (en) Dynamic flow control in multicast systems
US10187488B2 (en) Methods for managing replacement in a distributed cache environment and devices thereof
CN110795461A (zh) 一种基于iOS应用的数据缓存方法

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 15904375

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 15904375

Country of ref document: EP

Kind code of ref document: A1