CN109769136B - Online video cache management method and system based on instantaneous access rate value - Google Patents
Online video cache management method and system based on instantaneous access rate value Download PDFInfo
- Publication number
- CN109769136B CN109769136B CN201811491430.2A CN201811491430A CN109769136B CN 109769136 B CN109769136 B CN 109769136B CN 201811491430 A CN201811491430 A CN 201811491430A CN 109769136 B CN109769136 B CN 109769136B
- Authority
- CN
- China
- Prior art keywords
- video block
- video
- certain
- user
- block
- 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.)
- Active
Links
Images
Landscapes
- Two-Way Televisions, Distribution Of Moving Picture Or The Like (AREA)
Abstract
The invention provides an online video cache management method and system based on an instantaneous access rate value. The method comprises the following steps: the video is divided into a plurality of continuous video blocks with the same byte number according to the time sequence, and after the video cache device receives a request of a certain video block sent by a user, the video cache device obtains the certain video block from a local or remote video server if necessary and sends the certain video block to the user; the video caching device calculates the maximum instantaneous access rate value of each video block and a certain video block in the caching space according to the information recorded in the FIFO data structure and the user behavior file of each video block, and determines the caching mode of the certain video block according to the maximum instantaneous access rate value of each video block. The invention utilizes the user watching behavior characteristic of the video on demand service system, and the basis of calculating the instantaneous access rate comes from the on-line user future watching behavior, so that the importance value of the video block and the prediction accuracy of video watching are high, and the video caching efficiency can be improved.
Description
Technical Field
The invention relates to the technical field of video storage management, in particular to an online video cache management method and system based on an instantaneous access rate value.
Background
As the number of users viewing videos online increases and the number and size of videos available for download increases, video servers face significant file storage pressure and bandwidth overhead. File video caching is a common method to alleviate this pressure.
In the field of video caching, existing cache replacement methods include an LRU (Least recent Used) policy and an LFU (Least frequent Used) policy. The common method of the method is that the future behavior of the user is assumed to be similar to the past behavior, and the access mode of the file is predicted according to the historical access record of the user to the file; when the cache is full, these caching policies prioritize the least likely to be accessed files from the cache. The LRU strategy preferentially eliminates the file with the earliest latest access time from the cache based on the historical access record; the essence is to predict the access pattern of a file based on its short-term popularity, i.e., if the file was accessed recently, it is more likely to be accessed in the future. The LFU strategy counts the requested frequency of the file according to the historical access record, and preferentially eliminates the file with the minimum access frequency from the cache; the essence of this is that the access pattern of a long-term file is predicted based on its long-term popularity, i.e. if the file has been accessed many times in the past, it will be accessed more often in the future.
The above-mentioned cache replacement method for video in the prior art has the following disadvantages: both the LRU policy and the LFU policy are modes in which historical accessed information of a file replaces future access of the file, often resulting in misjudgment and limited accuracy.
Disclosure of Invention
The embodiment of the invention provides an online video cache management method and system based on an instantaneous access rate value, which aim to improve the efficiency of video cache.
In order to achieve the purpose, the invention adopts the following technical scheme.
According to an aspect of the present invention, there is provided an online video cache management method based on an instantaneous access rate value, which cuts a video into a plurality of video blocks with the same number of bytes and continuous in time sequence, the method including:
after receiving a request of a certain video block sent by a user, a video cache device acquires the certain video block from a remote video server, sends the certain video block to the user, and records historical access information of the user and the video block;
the video caching device calculates the maximum instantaneous access rate MIRR of each video block and the certain video block in the video block set according to historical access information of users and the video blocks, and determines the caching mode of the certain video block according to the MIRR of each video block.
Further, the cutting the video into a plurality of video blocks with the same number of bytes and continuous according to the time sequence includes:
dividing the video into a plurality of continuous video blocks with the same byte number according to the time sequence, storing and managing each video in a video block mode in a cache space inside the video cache device, storing and managing all videos in the video block mode by a remote video server, and carrying out data communication between the remote video server and each video cache device through a communication network;
the video caching device stores and manages historical data information of video blocks, wherein the historical data information comprises: the method comprises the steps that a user watching progress file and/or a video block access counting file are/is used, the user watching progress file is used for recording video blocks watched by each online user last time and watching time, and the video block access counting file is used for recording the accumulated access times of each video block when each video block is accessed.
Further, after receiving a request of a video block from a user, the video caching apparatus acquires the video block from a remote video server, and sends the video block to the user, including:
after the video cache device receives a request of a certain video block sent by a user, searching and comparing whether the certain video block exists in a video block set stored by the video cache device, if the certain video block exists, returning the certain video block to the user, updating historical data information of the certain video block, and ending the process;
if the certain video block does not exist, the video cache device acquires the certain video block from the remote video server, returns the certain video block to the user, then sequentially executes the step S2, updates the historical data information of the certain video block, and ends the process.
Further, the determining the caching mode of the certain video block according to the MIRR of each video block includes:
the video cache device compares the free cache space with the memory size of a certain video block needing to be cached, and when the free cache space is larger than or equal to the memory of the certain video block, the video cache device stores the certain video block into the free cache space;
when the free cache space is smaller than the memory of the certain video block, the video cache device calculates the MIRR value of each video block in the video block set and the certain video block according to the historical data information of each video block stored by the video cache device; when the video block with the minimum MIRR value is not the certain video block, deleting the video block with the minimum MIRR value in a cache space, and storing the certain video block in a corresponding cache space; and when the video block with the minimum MIRR value is the certain video block, not storing the certain video block in the local cache.
Further, the video caching device calculates the maximum instantaneous access rate MIRR of each video block in the video block set and the certain video block according to the historical access information of the user and the video blocks, and the method comprises the following steps:
let Γ be the set of video blocks and the video block that the video caching apparatus has cached, for each video block in Γ, perform the following operations:
calculating the maximum online user request rate of a video block according to the watching requirements of online users;
calculating the off-line user request rate of the video block according to the watching requirements of the off-line user;
and combining the maximum online user request rate of the video block and the offline user request rate of the video block with a certain strategy according to the position of the video block in the video to form the MIRR of the video block.
Further, the calculating the maximum online user request rate of the video block according to the viewing requirements of the online users includes:
for any video block (v ', i ') in the set Γ, where v ', i ' are the video block number and the video block number corresponding to the video block, respectively, a maximum observation window length of [0, i ' -1 ] is given]According to the maximum observation window length [0, i' -1 ] being watched by the online user]Video blocks within range (v', j)k) Position of (a), jk≦ i ', and video blocks (v', i ') and (v', j) derived based on the video block access count filek) Obtaining the viewing probability and the request time of the video block (v ', i ') of the online user, and taking the request time as the maximum observation window length [0, i ' -1 ]]An observation window length within the range;
and in the length of each observation window, taking the sum of the viewing probabilities of all users on the video blocks (v ', i') as the total number of times that the video blocks (v ', i') measured on the length of the observation window are to be viewed, dividing the total number of times by the length of the corresponding observation window to obtain the online user access rate IRR of the video blocks (v ', i') corresponding to the length of the observation window, comparing the IRRs corresponding to the lengths of all observation windows, and taking the maximum value of the IRR as the maximum online user request rate of the video blocks (v ', i').
Further, the calculating the offline user request rate of the video block according to the viewing demand of the offline user includes:
and for any video block (v ', i') in the set Γ, calculating the offline user request rate of the video block (v ', i') at the current time according to the earliest requested time, the latest requested time and the accumulated total number of accesses of the video block (v ', i') recorded in the video block access count file.
Further, the forming the MIRR of the video block according to the position of the video block in the video and combining the maximum online user request rate of the video block and the offline user request rate of the video block with a certain policy includes:
setting a number threshold value theta of the video block, and directly using the maximum online user request rate of the video block with the number larger than theta as the MIRR of the video block; for the video blocks with the numbers less than or equal to theta, taking the maximum value of the maximum online user request rate and the maximum value of the offline user request rate of the video blocks as the MIRR of the video blocks;
alternatively, the first and second electrodes may be,
setting a number threshold value theta of the video block, and directly using the maximum online user request rate of the video block with the number larger than theta as the MIRR of the video block; for video blocks with the number less than or equal to theta, compensating the watching demand of the online user by the ARR of the video blocks, and calculating a new compensated user request rate IRR+ (v,i)Maximum online user request rate and IRR using the video block+ (v,i)The maximum value of (d) is taken as the MIRR of the video block.
According to an aspect of the present invention, there is provided an online video cache management system based on an instantaneous access rate value, including: the system comprises a video cache device and a remote video server;
the remote video server is used for dividing the video into a plurality of continuous video blocks with the same byte number according to the time sequence, storing and managing all the videos in a video block mode, and carrying out data communication with each video cache device through a communication network;
the video cache device is used for acquiring a certain video block from a remote video server after receiving a request of the certain video block sent by a user, sending the certain video block to the user, and simultaneously recording historical access information of the user and the video block;
and calculating the maximum instantaneous access rate MIRR of each video block and the certain video block in the video block set according to the historical access information of the user and the video blocks, and determining the caching mode of the certain video block according to the MIRR of each video block.
Further, comprising: the video caching device comprises a video caching module, a historical data information management module for a user to watch videos, a video block transmission module, a video block access rate calculation module and a video block caching processing module;
the video cache module is used for dividing the video into a plurality of continuous video blocks with the same byte number according to the time sequence, and storing and managing the video blocks of each video through a cache space;
the historical data information management module for video watching of the user is used for storing and managing historical data information of the video block, and the historical data information comprises: the method comprises the steps that a user watching progress file and/or a video block access counting file are/is used for recording a video block watched by each online user last time and a watching moment, and the video block access counting file is used for recording the accumulated access times of each video block when each video block is accessed;
the video block transmission module is used for searching and comparing whether a certain video block exists in a video block set stored in the video cache device after receiving a request of the certain video block sent by a user, if the certain video block exists, returning the certain video block to the user, updating historical data information of the certain video block, and ending the process; if the certain video block does not exist, the video cache device acquires the certain video block from a remote video server and returns the certain video block to the user;
the video block access rate calculation module is used for calculating the maximum instantaneous access rate MIRR of each video block and the certain video block in the video block set according to historical access information of users and the video blocks;
let Γ be the set of video blocks and the video block that the video caching apparatus has cached, for each video block in Γ, perform the following operations: calculating the maximum online user request rate of a video block according to the watching requirements of online users; calculating the off-line user request rate of the video block according to the watching requirements of the off-line user; according to the position of a video block in a video, combining the maximum online user request rate of the video block and the offline user request rate of the video block with a certain strategy to form the MIRR of the video block;
the video block cache processing module is used for comparing the free cache space with the memory size of a certain video block needing to be cached, and storing the certain video block into the free cache space when the free cache space is larger than or equal to the memory of the certain video block; when the free cache space is smaller than the memory of the certain video block, acquiring the MIRR value of each video block in the video block set and the certain video block calculated by the video block access rate calculation module, and when the video block with the minimum MIRR value is not the certain video block, deleting the video block with the minimum MIRR value in the cache space and storing the certain video block in the corresponding cache space; and when the video block with the minimum MIRR value is the certain video block, not storing the certain video block in the local cache.
It can be seen from the technical solutions provided by the embodiments of the present invention that, the method of the embodiments of the present invention utilizes the user viewing behavior characteristics of the video on demand service system, and the basis for calculating the instantaneous access rate is from the future viewing behavior of the online user, so that the importance value of the video block and the prediction accuracy of video viewing are high, thereby improving the efficiency of video caching and improving the user service quality.
Additional aspects and advantages of the invention will be set forth in part in the description which follows, and in part will be obvious from the description, or may be learned by practice of the invention.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings needed to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.
Fig. 1 is a processing flow chart of an online video cache management method based on an instantaneous access rate value according to an embodiment of the present invention;
fig. 2 is an exemplary diagram of an observation window of a video block according to an embodiment of the present invention.
Fig. 3 is a schematic structural diagram of an online video caching system based on an instantaneous access rate value of a video block according to an embodiment of the present invention.
Detailed Description
Reference will now be made in detail to embodiments of the present invention, examples of which are illustrated in the accompanying drawings, wherein like reference numerals refer to the same or similar elements or elements having the same or similar function throughout. The embodiments described below with reference to the accompanying drawings are illustrative only for the purpose of explaining the present invention, and are not to be construed as limiting the present invention.
As used herein, the singular forms "a", "an", "the" and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms "comprises" and/or "comprising," when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof. It will be understood that when an element is referred to as being "connected" or "coupled" to another element, it can be directly connected or coupled to the other element or intervening elements may also be present. Further, "connected" or "coupled" as used herein may include wirelessly connected or coupled. As used herein, the term "and/or" includes any and all combinations of one or more of the associated listed items.
It will be understood by those skilled in the art that, unless otherwise defined, all terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs. It will be further understood that terms, such as those defined in commonly used dictionaries, should be interpreted as having a meaning that is consistent with their meaning in the context of the prior art and will not be interpreted in an idealized or overly formal sense unless expressly so defined herein.
For the convenience of understanding the embodiments of the present invention, the following description will be further explained by taking several specific embodiments as examples in conjunction with the drawings, and the embodiments are not to be construed as limiting the embodiments of the present invention.
Example one
The embodiment of the invention predicts the importance of the video block according to the total requirements of online and offline users on the video block and makes a cache decision of the video block according to the importance of the video block.
In a practical line-streaming media system, a user typically does not watch the entire video from beginning to end, so that different segments of the same video have different popularity. According to the embodiment of the invention, each video is equally divided into N continuous video blocks according to the natural sequence of the video, and for the video v, the playing time length of each divided video block is TvThe video blocks are respectively numbered as 0,1, 2, and N-1 in sequence, the start time of the corresponding video block in the video is respectively 0, and T isv，2×Tv…，(N-1)×Tv. Thus, the popularity of the entire video file may be refined to the popularity of each video chunk in the video file. Furthermore, in the present invention, the cache system is designed to preferentially store the most popular video blocks rather than the entire video file of the most popular video, so as to improve the utilization rate of the cache space and further improve the overall performance of the cache system.
In the embodiment of the present invention, the importance of the video block is measured by using the MIRR (Maximum instantaneous Request Rate) of the video block. Since the user usually watches the video in the natural order after entering the system and may leave the video midway (with a certain probability), the watching probability and the starting time of each subsequent video block can be predicted according to the current watching position. Given a given current moment, there may be multiple users watching different locations of the same video at the same time. Thus, for any given video block, it is possible that multiple users may be viewing in the future. Given an observation time window, users at different viewing schedules can view the video block at different times with different probabilities; the sum of these viewing probabilities is the statistical significance of the video blockThe total number of times that the viewer will be viewed online within the observation time window; further, the total number of times of being viewed is divided by the length of the observation time window to obtain the online user request rate of the video block on the observation window, which is referred to as IRR in the embodiment of the present invention. The method calculates the corresponding IRR values on different observation window scales for each video block, and records the maximum online user request rate value as MIRRonline. MIRR of video blocksonlineA larger value indicates that more online users are viewing this video block during the observation period, or/and that the user is more urgently required to view the video block, and therefore the video block is of higher importance. Thus, the present invention utilizes the MIRR of each video blockonlineThe value evaluates the importance of the corresponding video block to the online user.
On the other hand, each video chunk has an offline user request rate based on the user's historical viewing records, referred to herein as ARR. In the present invention, a video block is given an ARR value equal to the total number of times the video block has been viewed in the past period of time divided by the duration of the period of time. To this end, the present invention records access information for each video block using a fixed length FIFO (First Input First Output data structure). Specifically, each time the video block is requested, the FIFO will record the time it was requested and the total number of times it was accessed by the current time and the total number of times the video was viewed continuously. Based on the above information recorded in the FIFO, it can be known that the difference between the total number of times of requests corresponding to the latest and oldest request records stored in the FIFO is the total number of times the video block was viewed in the past period of time; the ARR value for the video block is obtained by dividing this total number by the difference between the current time and the oldest recorded time in the FIFO. The ARR value reflects the importance of a video block over a period of time. The length of the FIFO affects the stability and sensitivity of the ARR value: the longer the length, the longer the observation period, the more reflective of the long-term average statistical characteristics of the video block, and the shorter the length, the shorter the observation period, the more reflective of the short-term statistical characteristics of the video block.
Practice of the inventionColumns provide different methods to reflect the MIRR of video block importance to online usersonlineThe value is combined with the ARR value for the importance of the offline user to obtain the MIRR value for measuring the importance of the video block.
The processing flow of the online video cache management method based on the maximum instantaneous access rate value of the video block provided by the embodiment of the invention is shown in fig. 1, and comprises the following processing steps:
in step S110, the video caching apparatus receives a request of a video block i of a video v sent by a user.
In step S120, the video caching apparatus responds to the user request. It is determined whether or not there is a video block i of the video v in the buffer space inside (hereinafter referred to simply as (v, i)). If the (v, i) exists, directly returning the (v, i) to the user, triggering and updating historical access information of the user and the video block, namely the y user watching progress file and the video block access counting file, and then returning to the step S110 to continuously wait for the next request of the users; otherwise, (v, i) will be downloaded from the remote video server by the video caching device and returned to the user, and then the process continues to step S130.
The user watching progress file is a data structure which takes an online user ID as a key and a quadruple corresponding to the user as a value, the user watching progress file of each online user corresponds to one quadruple, and the quadruple elements comprise the online user ID, a video block ID watched by the user and the starting time of a video block watched by the user recently;
the video block access count file is a plurality of FIFO queues for recording accessed information of video blocks, each FIFO queue is for recording accessed information of one video block, a new record is generated in a corresponding FIFO each time a video block is requested, each record corresponds to a triplet, and the contents include: the video block is accessed by the requesting time, by the total number of times the video block was accessed by the current time, and by the total number of times the video block was accessed by users who continuously viewed the video by the current time.
The process of updating the historical access information of the user and the video block involved in the above process is as follows:
the updating process of the user viewing progress file is as follows: the record (u, v, i, t) is updated at the user viewing progress file, where u is the user ID of the requesting video block, v and i are the video and video block numbers requested by the user, respectively, and t is the current time of the system.
The update process of the video block access count file is as follows. Adding a record in the FIFO data structure corresponding to (v, i), and recording the return time t of the video block(v，i)By the total number of times m the video block has been accessed by this timet (v，i)And the total number s of times the video block has been accessed by a user who continuously viewed the video by the current timet (v，i)。
In step S130, the video caching apparatus compares the free cache space V with the memory size J of the video block (V, i) to be cached: when V > is J, the video caching apparatus stores the video block (V, i) in a free location in the cache space, and triggers to update the historical access information of the user and the video block (the updating method is the same as S120), and the process ends. Then returning to step S110 to continue waiting for the next request of the users; when V < J, step S140 is triggered.
Step S140, calculating MIRR of each video block (including video block (v, i) to be cached and all stored video blocks in the cache space, which are represented by video block set Γ)onlineValues and ARR values. Step S150 will then be triggered. MIRRonlineThe values and ARR values are calculated as follows:
for any video block (v ', i ') in the set Γ, where v ', i ' are the video block number and the video block number corresponding to the video block, respectively, a maximum observation window length of [0, i ' -1 ] is given]According to the maximum observation window length [0, i' -1 ] being watched by the online user]Video blocks within range (v', j)k) Position of (a), jk≦ i ', and video blocks (v', i ') and (v', j) derived based on the video block access count filek) Obtaining the viewing probability and the request time of the video block (v ', i') of the online user, and taking the request time as the maximum observation window lengthDegree [0, i' -1]An observation window length within the range;
and in the length of each observation window, taking the sum of the viewing probabilities of all users on the video blocks (v ', i') as the total number of times that the video blocks (v ', i') measured on the length of the observation window are to be viewed, dividing the total number of times by the length of the corresponding observation window to obtain the online user access rate IRR of the video blocks (v ', i') corresponding to the length of the observation window, comparing the IRRs corresponding to the lengths of all observation windows, and taking the maximum value of the IRR as the maximum online user request rate of the video blocks (v ', i').
Fig. 2 is an exemplary diagram of an observation window of a video block according to an embodiment of the present invention. Suppose that given a video block (v ', i ') ∈ Γ at the current time instant t, and its maximum observation window is [0, i ' -1 ]]The MIRR of (v ', i') is calculated as followsonline。
Suppose that k online users are watching some video blocks numbered 0 to i' -1, respectively, within the maximum observation window. These particular viewing positions form a set Ω ═ σ ═ ak|0≤σk<i'×Tv'K is 0,1, …, | Ω | -1}, where T isv'Is the length of the play time of each video block. Each element σ in ΩkIs a video viewing position, and means that there is a user from the video start position 0 seconds to the current viewing position σkSecond and σ0≤σ1≤…≤σ|Ω|-1。
Without loss of generality, each at a viewing position σkThe user of (2), who is currently watching a video block of
The video block i' is viewed subsequently with a certain viewing probability, which is noted as
The calculation formula is as follows:
wherein the numerator and denominator are a total number of times the video block (v ', i ') is viewed consecutively and the video block (v ', j) are derived from the video block access count file, respectivelyk) A total number of consecutive views; the user will spend a certain time deltakA post-request (v ', i'),
Δk＝i'×Tv'-σk (3)
the time deltakIs referred to as the request time for the user to video block (v ', i'), while deltakIs also defined as the length of an observation window within the maximum observation window range, the corresponding observation range being the interval [ sigma ]k,i'×Tv')。
The invention is based on the length delta of each observation windowkK is 0,1, …, | Ω | -1, an online user access rate is calculated for each video block (v ', i'). Assuming a length ΔkObservation window [ sigma ]k,i'×Tv') Total of L onkAn online user, wherein each user L, L ═ 0,1, …, Lk-1, different video blocks epsilon are being viewedl，jk≤εl<i'. All of this LkThe sum of the viewing probabilities of the user pairs (v ', i') is the length Delta of the observation windowk(v ', i') measured above the total number of times (denoted as C) that the viewer will be viewedk) Namely:
with CkDivided by the corresponding observation window length ΔkObtained at akThe average access rate of the video blocks (v ', i') measured over an observation window of length, referred to herein as the online user access rate, is noted
The formula is as follows:
all observation window lengths deltakIRR corresponding to 0,1, …, | Ω | -1 is compared, and the maximum value is the maximum online user request rate of the video block (v ', i'), which is recorded as
Next, the ARR value of the video block (v ', i') is calculated as follows. For any video block (v ', i'). epsilon.f), it is assumed that the earliest requested time instant at which this video block is recorded in the FIFO data structure is tsThe total number of accumulated accesses is
The time of the last request is teThe total number of accumulated accesses is
Given the current time t, the offline user request rate ARR of video blocks (v ', i')(v′,i′)The calculation formula of (a) is as follows:
thus, the ARR value and MIRR of each video block are obtainedonlineValue, and then triggers step S150.
Step S150, executing the video block MIRR value pair by using the video block ARR valueonlineA compensation mechanism for the value.
The invention provides an IRR compensation mechanism based on ARR according to two access rates of each video block. Each video block has an ARR value and a plurality of IRR values. Wherein the MIRR of each video blockonlineThe value calculation depends on the position of the video block before the video block positionThe viewing locations of those online users. For example, for the last video block, each online user is likely to have future access to it, and thus the video block has enough future access requests to accurately evaluate its MIRRsonlineA value; conversely, for the first video block, the online user will no longer make access requests to the first video block since all online users have or are viewing the video block, and therefore the video block will not have enough future access requests to accurately evaluate its MIRRonlineThe value is obtained.
Due to MIRRonlineThe value is calculated based on the actual future demand of the online user, while the ARR value is calculated based on the historical access requests of the user, hence the MIRRonlineThe actual importance of the video block is more reliably reflected.
The invention is therefore based as much as possible on the MIRRonlineTo determine video block importance. Specifically, the present invention uses MIRR directly on the later positioned video blocksonlineThe MIRR is used as the video block and is used for judging the importance of the video block; will align the video block located in the front, and use the ARR of the video block to align its MIRRonlineCompensation is performed and then MIRR is calculated to determine video block importance.
The compensation method comprises complete ARR compensation or partial ARR compensation:
the method comprises the following steps: complete ARR compensation mechanism
And dividing all N video blocks of one video into two parts according to a threshold value theta, wherein the video blocks with the numbers less than or equal to theta and the video blocks with the numbers more than theta. The compensation mechanism is as follows:
according to the formula, the MIRR is directly taken out without compensating the video blocks with the numbers larger than thetaonlineThe value is taken as the video block importance value MIRR; otherwise, selecting the larger value of the ARR value and the MIRR value of the video block as the importance value MIRR of the video block.
The method 2 comprises the following steps: partial ARR compensation mechanism.
And dividing all N video blocks of one video into two parts according to a threshold value theta, wherein the video blocks with the numbers less than or equal to theta and the video blocks with the numbers more than theta.
For the video block with the number larger than theta, directly using the maximum online user request rate as the MIRR of the video block; for video blocks with the number less than or equal to theta, the ARR of the video block is used for compensating the watching requirement of the online user, and a new compensated user request rate is calculated. Assuming that the video block to be rate compensated is (v, i), and given an ideal observation window length (assumed to be equal to θ), the new compensated user request rate calculation method is:
then, the maximum online user request rate and IRR of the video block are used+ (v,i)As the MIRR of the video block, the compensation mechanism is as follows:
according to the formula, the MIRR is directly taken out without compensating the video blocks with the numbers larger than thetaonlineThe value is taken as the video block importance value MIRR; for video blocks with the number less than or equal to theta, the maximum online user request rate and IRR of the video block are used+ (v,i)The maximum value of (d) is taken as the MIRR of the video block.
Thus, the ARR value and MIRR of each video block are obtainedonlineValue, then triggers step S160.
Step S160, performing cache replacement according to the importance value MIRR of the video block calculated in step S150.
According to the above steps, importance values of all video blocks (v, i) ∈ Γ (including new video blocks and all stored video blocks in the cache) can be obtained, and the video block with the smallest importance value is selected and eliminated, wherein the video block with the smallest importance (v ', r') is given by the following formula,
if the video block (v ', r') is the video block (v, r) to be stored, triggering to update the historical access information of the user and the video block (the updating method is the same as S120), and then returning to the step S110; otherwise, (v, r) is stored to the corresponding position of (v ', r'), and the historical access information of the user and the video block is triggered to be updated (the updating method is the same as S120), and then the step S110 is returned.
The method of the embodiment of the invention is suitable for online streaming media playing systems such as the Internet, cable televisions, videos, audios and the like.
Example two
Fig. 3 is a schematic structural diagram of an online video cache management system based on an instantaneous access rate value according to the embodiment, and the structural diagram includes: a video caching device 31 and a remote video server 32;
the remote video server 32 is configured to divide the video into a plurality of consecutive video blocks with the same byte number according to a time sequence, store and manage all the videos in a video block manner, and perform data communication with each video cache device through a communication network;
the video caching device 31 is configured to divide a video into a plurality of consecutive video blocks with the same byte number according to a time sequence, acquire a certain video block from a remote video server after receiving a request of the certain video block sent by a user, and send the certain video block to the user;
and calculating MIRR of each video block and the certain video block in the video block set according to the historical access information of the user and the video blocks, and determining the caching mode of the certain video block according to the MIRR of each video block.
Specifically, the video caching device 31 includes a video caching module 311, a user viewing video history data information management module 312, a video block transmission module 313, a video block access rate calculation module 314, and a video block caching processing module 315.
The video cache module 311 is configured to divide a video into a plurality of video blocks with the same and continuous byte number according to a time sequence, and store and manage the video blocks of each video through a cache space;
the historical data information management module 312 for the video watched by the user stores and manages the historical data information of the video block, where the historical data information includes: the user watching progress file is used for recording the video block watched by each online user for the last time and the watching time; and/or a video block access count file for recording the number of accesses each video block accumulates until each access. The module updates the historical data information of the video block at the end of each process.
The video block transmission module 313 is configured to, after receiving a request of a certain video block sent by a user, search and compare whether the certain video block exists in a video block set stored in the video cache device, if the certain video block exists, return the certain video block to the user, update historical data information of the certain video block, and end the process; and if the certain video block does not exist, the video cache device acquires the certain video block from a remote video server and returns the certain video block to the user. Specifically, the method comprises the following steps: after receiving a request of a video block i of a video v sent by a user, judging whether the video block i of the video v (hereinafter referred to as (v, i)) exists in a buffer space inside the video block i, if the video block i of the video v exists, directly returning the video block i to the user, updating a video block counting file in an FIFO (v, i) data structure, and ending the process; otherwise, (v, i) is downloaded from the remote video server and returned to the user, the video block count file in the FIFO data structure of (v, i) is updated, and then the subsequent caching process of (v, i) is continuously executed;
(vi) the video block count file in the FIFO data structure of updates (v, i) comprises: adding a record in the FIFO data structure corresponding to (v, i), and recording the return time t of the (v, i)(v，i)M, total number of times the (v, i) is accessed by this timet (v，i)And the total number s of times the (v, i) is accessed by the user who continuously viewed the video by the current timet (v，i)。
The video block access rate calculation module 314 is configured to calculate a maximum instantaneous access rate value MIRR of a video block (v, i) to be cached and each video block in the video block set Γ in the cache space when the free cache space is smaller than the memory size of the video block (v, i) to be cached,
for any video block (v ', i ') in the set Γ, where v ', i ' are the video block number and the video block number corresponding to the video block, respectively, a maximum observation window length of [0, i ' -1 ] is given]According to the maximum observation window length [0, i' -1 ] being watched by the online user]Video blocks within range (v', j)k) Position of (a), jk≦ i ', and video blocks (v', i ') and (v', j) derived based on the video block access count filek) Obtaining the viewing probability and the request time of the video block (v ', i ') of the online user, and taking the request time as the maximum observation window length [0, i ' -1 ]]An observation window length within the range;
and in the length of each observation window, taking the sum of the viewing probabilities of all users on the video blocks (v ', i') as the total number of times that the video blocks (v ', i') measured on the length of the observation window are to be viewed, dividing the total number of times by the length of the corresponding observation window to obtain the online user access rate IRR of the video blocks (v ', i') corresponding to the length of the observation window, comparing the IRRs corresponding to the lengths of all observation windows, and taking the maximum value of the IRR as the maximum online user request rate of the video blocks (v ', i').
The MIRR value is calculated as follows:
suppose that k online users are watching some video blocks numbered 0 to i' -1, respectively, within the maximum observation window. These particular viewing positions form a set Ω ═ σ ═ ak|0≤σk<i'×Tv'K is 0,1, …, | Ω | -1}, where each element σ in ΩkIs a video viewing position, which means that there is a user from the video start position 0 second to the current viewingViewing position σkSecond, and σ0≤σ1≤…≤σ|Ω|-1，Tv'Is the length of the play time of each video block.
Without loss of generality, each at a viewing position σkThe user of (2), who is currently watching a video block of
The video block i' is viewed subsequently with a certain viewing probability, which is noted as
The calculation formula is as follows:
wherein the numerator and denominator are a total number of times the video block (v ', i ') is viewed consecutively and the video block (v ', j) are derived from the video block access count file, respectivelyk) A total number of consecutive views; the user will spend a certain time deltakA post-request (v ', i'),
Δk＝i'×Tv'-σk (3)
the time deltakIs referred to as the request time for the user to video block (v ', i'), while deltakIs also defined as the length of an observation window within the maximum observation window range, the corresponding observation range being the interval [ sigma ]k,i'×Tv')。
The invention is based on the length delta of each observation windowkK is 0,1, …, | Ω | -1, an online user access rate is calculated for each video block (v ', i'). Assuming a length ΔkObservation window [ sigma ]k,i'×Tv') Total of L onkAn online user, wherein each user L, L ═ 0,1, …, Lk-1, different video blocks epsilon are being viewedl，jk≤εl<i'. All of this LkView of (v ', i') by individual userThe sum of the viewing probabilities being the length Δ of the viewing windowk(v ', i') measured above the total number of times (denoted as C) that the viewer will be viewedk) Namely:
with CkDivided by the corresponding observation window length ΔkObtained at akThe average access rate of the video blocks (v ', i') measured over an observation window of length, referred to herein as the online user access rate, is noted
The formula is as follows:
all observation window lengths deltakIRR corresponding to 0,1, …, | Ω | -1 is compared, and the maximum value is the maximum online user request rate of the video block (v ', i'), which is recorded as
Next, the ARR value of the video block (v ', i') is calculated as follows. For any video block (v ', i'). epsilon.f), it is assumed that the earliest requested time instant at which this video block is recorded in the FIFO data structure is tsThe total number of accumulated accesses is
The time of the last request is teThe total number of accumulated accesses is
Given the current time t, the offline user request rate ARR of video blocks (v ', i')(v',i')The calculation formula of (a) is as follows:
then, calculating the importance value MIRR of the video block by adopting one of the following compensation methods:
the compensation method comprises complete ARR compensation or partial ARR compensation:
the method comprises the following steps: complete ARR compensation mechanism
And dividing all N video blocks of one video into two parts according to a threshold value theta, wherein the video blocks with the numbers less than or equal to theta and the video blocks with the numbers more than theta. The compensation mechanism is as follows:
according to the formula, the MIRR is directly taken out without compensating the video blocks with the numbers larger than thetaonlineThe value is taken as the video block importance value MIRR; otherwise, selecting the larger value of the ARR value and the MIRR value of the video block as the importance value MIRR of the video block.
The method 2 comprises the following steps: partial ARR compensation mechanism.
And dividing all N video blocks of one video into two parts according to a threshold value theta, wherein the video blocks with the numbers less than or equal to theta and the video blocks with the numbers more than theta.
For the video block with the number larger than theta, directly using the maximum online user request rate as the MIRR of the video block; for video blocks with the number less than or equal to theta, the ARR of the video block is used for compensating the watching requirement of the online user, and a new compensated user request rate is calculated. Assuming that the video block to be rate compensated is (v, i), and given an ideal observation window length (assumed to be equal to θ), the new compensated user request rate calculation method is:
then, the maximum online user request rate and IRR of the video block are used+ (v,i)As the MIRR of the video block, the compensation mechanism is as follows:
according to the formula, the MIRR is directly taken out without compensating the video blocks with the numbers larger than thetaonlineThe value is taken as the video block importance value MIRR; for video blocks with the number less than or equal to theta, the maximum online user request rate and IRR of the video block are used+ (v,i)The maximum value of (d) is taken as the MIRR of the video block.
The video block caching module 315 is configured to compare the size of the free caching space with the memory size of the video block (v, i) to be cached, and store the certain video block into the free caching space when the free caching space is greater than or equal to the memory size of the video block (v, i) to be cached; when the free cache space is smaller than the memory of the certain video block, acquiring the MIRR values of each video block and each video block in the video block set calculated by the video block access rate calculation module, taking the MIRR of each video block as the importance value of each video block, sequencing the importance values of the video blocks, deleting the video block with the minimum importance value from the cache space of the video cache device when the video block with the minimum importance value is not the video block (v, i) to be cached, and storing the video block (v, i) to be cached into the cache space of the video cache device; and when the video block with the minimum importance value is the video block (v, i) to be cached, not storing the video block (v, i) to be cached.
The specific processing procedure of performing online video caching based on the instantaneous access rate value of the video block by using the device of the embodiment of the invention is similar to that of the method embodiment, and is not repeated here.
In summary, the method of the embodiment of the present invention utilizes the user viewing behavior characteristics of the vod service system to partition the video into blocks, and uses the maximum instantaneous rate that each video block may be requested in a future period as the video block importance value, and performs cache replacement accordingly. The basis for calculating the instantaneous access rate in the embodiment of the invention comes from the future watching behavior of the online user, so that the importance value of the video block and the prediction accuracy of video watching are high, the video caching efficiency can be improved, and the user service quality can be improved.
Those of ordinary skill in the art will understand that: the figures are merely schematic representations of one embodiment, and the blocks or flow diagrams in the figures are not necessarily required to practice the present invention.
The embodiments in the present specification are described in a progressive manner, and the same and similar parts among the embodiments are referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, for apparatus or system embodiments, since they are substantially similar to method embodiments, they are described in relative terms, as long as they are described in partial descriptions of method embodiments. The above-described embodiments of the apparatus and system are merely illustrative, and the units described as separate parts may or may not be physically separate, and the parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment. One of ordinary skill in the art can understand and implement it without inventive effort.
The above description is only for the preferred embodiment of the present invention, but the scope of the present invention is not limited thereto, and any changes or substitutions that can be easily conceived by those skilled in the art within the technical scope of the present invention are included in the scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.
Claims (4)
1. An online video cache management method based on an instantaneous access rate value, wherein a video is divided into a plurality of video blocks with the same number of bytes and continuous according to a time sequence, and the method comprises the following steps:
after receiving a request of a certain video block sent by a user, a video cache device acquires the certain video block from a remote video server, sends the certain video block to the user, and records historical access information of the user and the video block;
the video caching device calculates the maximum instantaneous access rate MIRR of each video block in the video block set and the certain video block according to the historical access information of the user and the video block, and the method comprises the following steps:
let Γ be the set of video blocks and the video block that the video caching apparatus has cached, for each video block in Γ, perform the following operations:
calculating the maximum online user request rate of the video block according to the watching demand of the online user, comprising the following steps: for any video block (v ', i ') in the set Γ, where v ', i ' are the video block number and the video block number corresponding to the video block, respectively, a maximum observation window length of [0, i ' -1 ] is given]According to the maximum observation window length [0, i' -1 ] being watched by the online user]Video blocks within range (v', j)k) Position of (a), jk≦ i ', and video blocks (v', i ') and (v', j) derived based on the video block access count filek) Obtaining the viewing probability and the request time of the video block (v ', i ') of the online user, and taking the request time as the maximum observation window length [0, i ' -1 ]]An observation window length within the range;
in the length of each observation window, taking the sum of the viewing probabilities of all users on video blocks (v ', i') as the total number of times that the video blocks (v ', i') measured on the length of the observation window are to be viewed, dividing the total number of times by the length of the corresponding observation window to obtain the online user access rate IRR of the video blocks (v ', i') corresponding to the length of the observation window, comparing the IRRs corresponding to the lengths of all observation windows, and taking the maximum value of the IRR as the maximum online user request rate of the video blocks (v ', i');
calculating the off-line user request rate of the video block according to the watching demand of the off-line user, comprising the following steps: for any video block (v ', i') in the set Γ, the earliest requested time t recorded in the video block access count file according to the video block (v ', i') is recordedsThe total number of accumulated accesses is
The time of the last request is teThe total number of accumulated accesses is
Given the current time t, the offline user request rate ARR of video blocks (v ', i')(v′,i′)Is given by the following formula, with the ARR value equal to the total number of times the video block has been viewed in the past period of time divided by the duration of the period of time:
according to the position of a video block in a video, combining the maximum online user request rate of the video block and the offline user request rate of the video block with a certain strategy to form the MIRR of the video block, which comprises the following steps:
setting a number threshold value theta of the video block, and directly using the maximum online user request rate of the video block with the number larger than theta as the MIRR of the video block; for the video blocks with the numbers less than or equal to theta, taking the maximum value of the maximum online user request rate and the maximum value of the offline user request rate of the video blocks as the MIRR of the video blocks;
alternatively, the first and second electrodes may be,
setting a number threshold value theta of the video block, and directly using the maximum online user request rate of the video block with the number larger than theta as the MIRR of the video block; for numbers less than or equal toA video block equal to theta, compensating the viewing demand of the on-line user with the ARR of the video block, calculating a new compensated user request rate IRR+ (v,i)Maximum online user request rate and IRR using the video block+ (v,i)As the MIRR of the video block;
determining a caching mode of the certain video block according to the MIRR of each video block, wherein the caching mode comprises the following steps:
the video cache device compares the free cache space with the memory size of a certain video block needing to be cached, and when the free cache space is larger than or equal to the memory of the certain video block, the video cache device stores the certain video block into the free cache space;
when the free cache space is smaller than the memory of the certain video block, the video cache device calculates the MIRR value of each video block in the video block set and the certain video block according to the historical data information of each video block stored by the video cache device; when the video block with the minimum MIRR value is not the certain video block, deleting the video block with the minimum MIRR value in a cache space, and storing the certain video block in a corresponding cache space; and when the video block with the minimum MIRR value is the certain video block, not storing the certain video block in the local cache.
2. The method of claim 1, wherein the time-wise slicing the video into a plurality of consecutive video chunks having the same number of bytes comprises:
dividing the video into a plurality of continuous video blocks with the same byte number according to the time sequence, storing and managing each video in a video block mode in a cache space inside the video cache device, storing and managing all videos in the video block mode by a remote video server, and carrying out data communication between the remote video server and each video cache device through a communication network;
the video caching device stores and manages historical data information of video blocks, wherein the historical data information comprises: the method comprises the steps that a user watching progress file and/or a video block access counting file are/is used, the user watching progress file is used for recording video blocks watched by each online user last time and watching time, and the video block access counting file is used for recording the accumulated access times of each video block when each video block is accessed.
3. The method of claim 1, wherein the video caching device obtains a certain video block from a remote video server after receiving a request of the certain video block from a user, and sends the certain video block to the user, and the method comprises:
after the video cache device receives a request of a certain video block sent by a user, searching and comparing whether the certain video block exists in a video block set stored by the video cache device, if the certain video block exists, returning the certain video block to the user, updating historical data information of the certain video block, and ending the process;
if the certain video block does not exist, the video cache device acquires the certain video block from the remote video server, returns the certain video block to the user, then sequentially executes the step S2, updates the historical data information of the certain video block, and ends the process.
4. An online video cache management system based on instantaneous access rate values, comprising: the system comprises a video cache device and a remote video server;
the remote video server is used for dividing the video into a plurality of continuous video blocks with the same byte number according to the time sequence, storing and managing all the videos in a video block mode, and carrying out data communication with each video cache device through a communication network;
the video cache device is used for acquiring a certain video block from a remote video server after receiving a request of the certain video block sent by a user, sending the certain video block to the user, and simultaneously recording historical access information of the user and the video block;
according to the historical access information of the user and the video blocks, calculating the maximum instantaneous access rate MIRR of each video block and the certain video block in the video block set, and determining the cache mode of the certain video block according to the MIRR of each video block;
the video caching device comprises a video caching module, a historical data information management module for a user to watch videos, a video block transmission module, a video block access rate calculation module and a video block caching processing module;
the video cache module is used for dividing the video into a plurality of continuous video blocks with the same byte number according to the time sequence, and storing and managing the video blocks of each video through a cache space;
the historical data information management module for video watching of the user is used for storing and managing historical data information of the video block, and the historical data information comprises: the method comprises the steps that a user watching progress file and/or a video block access counting file are/is used for recording a video block watched by each online user last time and a watching moment, and the video block access counting file is used for recording the accumulated access times of each video block when each video block is accessed;
the video block transmission module is used for searching and comparing whether a certain video block exists in a video block set stored in the video cache device after receiving a request of the certain video block sent by a user, if the certain video block exists, returning the certain video block to the user, updating historical data information of the certain video block, and ending the process; if the certain video block does not exist, the video cache device acquires the certain video block from a remote video server and returns the certain video block to the user;
the video block access rate calculation module is used for calculating the maximum instantaneous access rate MIRR of each video block and the certain video block in the video block set according to historical access information of users and the video blocks;
let Γ be the set of video blocks and the video block that the video caching apparatus has cached, for each video block in Γ, perform the following operations:
calculating the maximum online user request rate of the video block according to the watching demand of the online user, comprising the following steps: for any video block (v ', i ') in the set Γ, where v ', i ' are the video block number and the video block number corresponding to the video block, respectively, a maximum observation window length of [0, i ' -1 ] is given]According to the maximum observation window length [0, i' -1 ] being watched by the online user]Video blocks within range (v', j)k) Position of (a), jk≦ i ', and video blocks (v', i ') and (v', j) derived based on the video block access count filek) Obtaining the viewing probability and the request time of the video block (v ', i ') of the online user, and taking the request time as the maximum observation window length [0, i ' -1 ]]An observation window length within the range;
in the length of each observation window, taking the sum of the viewing probabilities of all users on video blocks (v ', i') as the total number of times that the video blocks (v ', i') measured on the length of the observation window are to be viewed, dividing the total number of times by the length of the corresponding observation window to obtain the online user access rate IRR of the video blocks (v ', i') corresponding to the length of the observation window, comparing the IRRs corresponding to the lengths of all observation windows, and taking the maximum value of the IRR as the maximum online user request rate of the video blocks (v ', i');
calculating the off-line user request rate of the video block according to the watching demand of the off-line user, comprising the following steps: for any video block (v ', i') in the set Γ, the earliest requested time t recorded in the video block access count file according to the video block (v ', i') is recordedsThe total number of accumulated accesses is
The time of the last request is teThe total number of accumulated accesses is
Given a current time t, a video block(v ', i') off-line user request rate ARR(v′,i′)Is given by the following formula, with the ARR value equal to the total number of times the video block has been viewed in the past period of time divided by the duration of the period of time:
according to the position of a video block in a video, combining the maximum online user request rate of the video block and the offline user request rate of the video block with a certain strategy to form the MIRR of the video block, which comprises the following steps:
setting a number threshold value theta of the video block, and directly using the maximum online user request rate of the video block with the number larger than theta as the MIRR of the video block; for the video blocks with the numbers less than or equal to theta, taking the maximum value of the maximum online user request rate and the maximum value of the offline user request rate of the video blocks as the MIRR of the video blocks;
alternatively, the first and second electrodes may be,
setting a number threshold value theta of the video block, and directly using the maximum online user request rate of the video block with the number larger than theta as the MIRR of the video block; for video blocks with the number less than or equal to theta, compensating the watching demand of the online user by the ARR of the video blocks, and calculating a new compensated user request rate IRR+ (v,i)Maximum online user request rate and IRR using the video block+ (v,i)As the MIRR of the video block;
the video block cache processing module is used for comparing the free cache space with the memory size of a certain video block needing to be cached, and storing the certain video block into the free cache space when the free cache space is larger than or equal to the memory of the certain video block; when the free cache space is smaller than the memory of the certain video block, acquiring the MIRR value of each video block in the video block set and the certain video block calculated by the video block access rate calculation module, and when the video block with the minimum MIRR value is not the certain video block, deleting the video block with the minimum MIRR value in the cache space and storing the certain video block in the corresponding cache space; and when the video block with the minimum MIRR value is the certain video block, not storing the certain video block in the local cache.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811491430.2A CN109769136B (en) | 2018-12-07 | 2018-12-07 | Online video cache management method and system based on instantaneous access rate value |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811491430.2A CN109769136B (en) | 2018-12-07 | 2018-12-07 | Online video cache management method and system based on instantaneous access rate value |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109769136A CN109769136A (en) | 2019-05-17 |
| CN109769136B true CN109769136B (en) | 2021-02-19 |
Family
ID=66451191
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811491430.2A Active CN109769136B (en) | 2018-12-07 | 2018-12-07 | Online video cache management method and system based on instantaneous access rate value |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109769136B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111222004B (en) * | 2020-01-08 | 2023-03-31 | 广州小鹏汽车科技有限公司 | Audio playing method, terminal equipment and vehicle |
| CN114900732B (en) * | 2022-04-25 | 2024-01-12 | 北京奇艺世纪科技有限公司 | Video caching method and device, electronic equipment and storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105518539A (en) * | 2013-09-04 | 2016-04-20 | 依视路国际集团（光学总公司） | Methods and systems for augmented reality |
| CN105960790A (en) * | 2013-09-27 | 2016-09-21 | 阿尔卡特朗讯公司 | Method for caching |
| CN106294827A (en) * | 2016-08-17 | 2017-01-04 | 合网络技术（北京）有限公司 | The caching method of multimedia resource and device |
| CN108259929A (en) * | 2017-12-22 | 2018-07-06 | 北京交通大学 | A kind of prediction of video active period pattern and caching method |
| US10062414B1 (en) * | 2017-08-22 | 2018-08-28 | Futurewei Technologies, Inc. | Determining a future field of view (FOV) for a particular user viewing a 360 degree video stream in a network |
-
2018
- 2018-12-07 CN CN201811491430.2A patent/CN109769136B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105518539A (en) * | 2013-09-04 | 2016-04-20 | 依视路国际集团（光学总公司） | Methods and systems for augmented reality |
| CN105960790A (en) * | 2013-09-27 | 2016-09-21 | 阿尔卡特朗讯公司 | Method for caching |
| CN106294827A (en) * | 2016-08-17 | 2017-01-04 | 合网络技术（北京）有限公司 | The caching method of multimedia resource and device |
| US10062414B1 (en) * | 2017-08-22 | 2018-08-28 | Futurewei Technologies, Inc. | Determining a future field of view (FOV) for a particular user viewing a 360 degree video stream in a network |
| CN108259929A (en) * | 2017-12-22 | 2018-07-06 | 北京交通大学 | A kind of prediction of video active period pattern and caching method |
Non-Patent Citations (1)
| Title |
|---|
| 基于数据挖掘的缓存替换算法研究;肖敬伟;《中国优秀硕士学位论文全文数据库信息科技辑，2015年第9期》;20150915;第1-75页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109769136A (en) | 2019-05-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10305947B2 (en) | Pre-buffering audio streams | |
| CN104205772B (en) | Improved DASH clients and receiver with buffer water level decision-making | |
| CA2871626C (en) | Method and system for self-tuning cache management | |
| CN109769136B (en) | Online video cache management method and system based on instantaneous access rate value | |
| CN107493482B (en) | Video playback method and device | |
| US20110202633A1 (en) | Cache server control device, content distribution system, method of distributing content, and program | |
| US11758203B2 (en) | Adaptive bitrate video cache | |
| US9767033B2 (en) | Method and apparatus for managing cache memory in communication system | |
| CN108924667A (en) | A kind of maximized available bandwidth adaptive video fragment request method of support QoE | |
| CN109769135B (en) | Online video cache management method and system based on joint request rate | |
| CN110072130B (en) | HTTP/2-based HAS video slice pushing method | |
| US9210451B2 (en) | Replication decision in P2P VoD systems | |
| CN109511009B (en) | Video online cache management method and system | |
| CN111212301B (en) | Video code rate matching method, storage medium and terminal equipment | |
| JP2020188387A (en) | Control device, control method, and program | |
| CN117596376B (en) | 360-Degree video intelligent edge transmission method, system, wearable device and medium | |
| CN112565829B (en) | Network scheduling method, device and system and readable storage medium | |
| US11070607B2 (en) | Dynamic behavior modification for content download and playback | |
| Wu et al. | Reuse time based caching policy for video streaming | |
| CN109688421B (en) | Request message processing method, device and system, server and storage medium | |
| CN112511844B (en) | Transmission method and system based on 360-degree video stream | |
| EP3207457B1 (en) | Hierarchical caching for online media | |
| CN113709585A (en) | Streaming media playing method and device | |
| WO2022237461A1 (en) | Video pre-loading method and apparatus, device, and storage medium | |
| CN111328156B (en) | Access network caching method, device, base station and medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |