CN102546716B - A kind of buffer queue management method, device and demand stream media system - Google Patents
A kind of buffer queue management method, device and demand stream media system Download PDFInfo
- Publication number
- CN102546716B CN102546716B CN201010618532.3A CN201010618532A CN102546716B CN 102546716 B CN102546716 B CN 102546716B CN 201010618532 A CN201010618532 A CN 201010618532A CN 102546716 B CN102546716 B CN 102546716B
- Authority
- CN
- China
- Prior art keywords
- file
- section
- file section
- duration
- accessed
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
- 238000007726 management method Methods 0.000 title claims abstract description 16
- 238000000034 method Methods 0.000 claims abstract description 16
- 230000011218 segmentation Effects 0.000 claims description 4
- 238000004364 calculation method Methods 0.000 claims description 2
- 238000000151 deposition Methods 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 239000000203 mixture Substances 0.000 description 2
- 230000003442 weekly effect Effects 0.000 description 2
- 230000006870 function Effects 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
Landscapes
- Two-Way Televisions, Distribution Of Moving Picture Or The Like (AREA)
Abstract
The invention discloses a kind of buffer queue management method, comprising: A, for each media file, be divided into two or more file section respectively; B, according to hot broadcast degree, determine the preferred value of each file section respectively, file section preferred value being in front M position is stored in the buffer area of proxy server, and M is positive integer.The present invention discloses a kind of buffer queue management device and a kind of demand stream media system.Apply methods, devices and systems of the present invention, can cache hit rate be improved.
Description
Technical field
The present invention relates to streaming media on demand technology, particularly a kind of buffer queue management method, device and demand stream media system.
Background technology
At present, market also exists a large amount of demand stream media systems, usually jumbo buffer area (being positioned on proxy server) all can be provided with in these demand stream media systems, and by hot broadcast media file, i.e. user's access (the namely watching) media file that rate is higher leaves in buffer area, to respond the access request of user fast.Fig. 1 is the existing buffer area schematic diagram depositing hot broadcast media file.
Once buffer memory does not hit, namely the media file of user's request access does not leave in buffer area, then need to read this media file in the hard disk of video server, can reduce the overall performance of system so undoubtedly, and the waiting time of meeting adding users, reduce Consumer's Experience.
Summary of the invention
In view of this, main purpose of the present invention is to provide a kind of buffer queue management method, can improve cache hit rate.
Another object of the present invention is to provide a kind of buffer queue management device, can cache hit rate be improved.
Another object of the present invention is to provide a kind of demand stream media system, can improve cache hit rate.
For achieving the above object, technical scheme of the present invention is achieved in that
A kind of buffer queue management method, comprising:
A, for each media file, be divided into two or more file section respectively;
B, according to hot broadcast degree, determine the preferred value of each file section respectively, file section preferred value being in front M position is stored in the buffer area of proxy server, and M is positive integer.
A kind of buffer queue management device, comprising:
First processing unit, for for each media file, is divided into two or more file section respectively;
Second processing unit, for according to hot broadcast degree, determines the preferred value of each file section respectively, and file section preferred value being in front M position is stored in the buffer area of proxy server, and M is positive integer.
A kind of demand stream media system, comprises said apparatus.
Visible, adopt technical scheme of the present invention, each media file is divided into multiple file section, and hot broadcast file section is left in buffer area, thus improve cache hit rate, and then improve overall performance and the Consumer's Experience of system.
Accompanying drawing explanation
Fig. 1 is the existing buffer area schematic diagram depositing hot broadcast media file.
Fig. 2 is the flow chart of buffer queue management embodiment of the method for the present invention.
Fig. 3 is the composition structural representation of buffer queue management device embodiment of the present invention.
Embodiment
For problems of the prior art, propose the buffer queue management scheme after a kind of improvement in the present invention, can cache hit rate be improved.
For make technical scheme of the present invention clearly, understand, to develop simultaneously embodiment referring to accompanying drawing, scheme of the present invention be described in further detail.
Fig. 2 is the flow chart of buffer queue management embodiment of the method for the present invention.As shown in Figure 2, comprise the following steps:
Step 21: for each media file, is divided into two or more file section respectively.
In this step, each media file is divided into two or more file section by the mode that can increase progressively according to duration respectively.Because for user, when its program request after a certain media file, the beginning part of this media file usually first can be watched; if feel plain; then exit viewing, if feel good-looking, then continue viewing; and the time of user's viewing is longer; illustrate that the complete possibility finishing watching this media file of user is larger, therefore, when dividing each media file; the mode that can increase progressively according to duration, thus improve cache hit rate better.
In addition, system can be each file section and each media file safeguards an access log respectively, for recording each file section, and each media file (arbitrary file section wherein accessed, then think this media file accessed) accessed when is accessed etc. when respectively respectively.
Specifically, for each media file, determine that the segmentation factor-alpha of its correspondence and section sequence number are the file section of 1 first respectively, i.e. the duration L of first section (or being called base segment), α be less than or equal to 1 positive number, namely the span of α is 0 < α≤1; Afterwards, be the 1+ α mode doubly of the duration of last file section according to the duration of a rear file section, each media file is divided into two or more file section respectively.
Namely have:
the n section of expression sequence number.
Distinguishingly, for latter two file section of each media file, possibly cannot meet above-mentioned relation formula, namely after having divided second-to-last file section, remaining duration by the 1+ α of the duration of inadequate second-to-last file section doubly, in this case, can directly using remaining duration as last 1 file section.
The duration L of first section of each media file can identical also can be different, the concrete value of L can be decided according to the actual requirements.
Below for arbitrary media file i, the concrete value of α is further described.
If R
i≤ B
s-p, then
If R
i> B
s-p, then
B
s-prepresent the bandwidth from video server to proxy server, R
ithe code check (code check of each media file is all known) of presentation medium file i, Popularity
ithe popularity of presentation medium file i, ASL
ithe average length of session of presentation medium file i, f () represents any predetermined formula, as long as meet α and the Popularity finally calculated
ibe inversely proportional to, with ASL
ibe directly proportional.
In addition, above-mentioned Popularity
iand ASL
icalculating relate to following parameter:
1) T0: predetermined start moment;
2) Ti1: the moment that media file i is first accessed;
3) Tr: current time;
4) Ti:Max{T0, Ti1}, namely in T0 and Ti1 closer to one of Tr;
5) N: the number of times that in this time period, media file i is accessed from Tr to T0;
6)
access duration when media file i jth is time accessed;
Correspondingly,
In scheme of the present invention, periodically can determine the value of α, namely every scheduled duration, as 1 week, namely a file section be re-started to each media file and divide, to improve cache hit rate better.Suppose each media file was repartitioned in 0: 0: 0 on Monday weekly, so above-mentioned T0 then can refer to 0: 0: 0 of the Monday in last week, if media file i joins in system in a certain moment before 0: 0: 0 of the Monday in last week, so the Ti1 of its correspondence may be less than T0, if joining in system afterwards, the Ti1 of its correspondence is then necessarily being greater than T0.
Step 22: according to hot broadcast degree, determines the preferred value of each file section respectively, and file section preferred value being in front M position is stored in the buffer area of proxy server, and M is positive integer.
Namely according to the order that preferred value is descending, each file section is sorted, the file section being in front M position after sequence is stored in the buffer area of proxy server.
Compared to the existing mode whole media file deposited in the buffer, only hot broadcast file section is left in buffer area in mode of the present invention, thus improve cache hit rate.
Follow-up, when not being stored in the file section z in buffer area when user's request access one, file section z can be redefined and leave the preferred value of each file section in buffer area in, and when exist in buffer area preferred value lower than file section z and not accessed file section time, replace the file section of described preferred value lower than file section z and in not accessed file section with file section z, this file section be replaced is generally the file section that in not accessed file section, preferred value is minimum.
In the present embodiment, for each file section x, its preferred value can be calculated in such a way respectively:
Calculate
represent the preferred value of file section x, Object_Priority represents the number of times that in from current time to it last this time period in predetermined start moment, belonging to file section x, media file is accessed, Segment_Priority represent from current time to divide obtain file section x this time period in moment in the accessed number of times of file section x, Position_Priority is relevant with the section sequence number of file section x, the value of section sequence number more close to 1, Position_Priority is larger.
Suppose each media file was repartitioned in 0: 0: 0 on Monday weekly, and suppose that T0 is 0: 0: 0 of the Monday in last week, although step 22 performs after step 21, but the time of difference period can ignore, so, in step 22 when calculating formula (5), implication represented by Object_Priority wherein and value are all identical with the N in step 21, in addition, the value of Segment_Priority will be 0, and be not stored in the file section z in buffer area when user's request access one after, when needs calculating formula (5), because " current time " changes than step 22, therefore the implication represented by Object_Priority is by different from the N in step 21, value also may be different, the value of Segment_Priority may be also no longer 0.
In addition, in step 22, certain space can be reserved in buffer area, namely buffer area is not taken completely, so mainly consider a certain file section that ought follow-uply need to replace with file section z in buffer area, when being assumed to be file section m, if the size of file section z is greater than file section m, so may cause not having enough spaces to carry out the problem of storing documents section z.
From step 22, when after scheduled duration, return and perform step 21.
Have again, in actual applications, if continuous continual Media Stream distribution can not be carried out to user, playback jitter will be there will be, such as, after user has accessed a certain file section left in buffer area, request continues to access next file section belonging to same media file with this file section, and next file section does not leave in buffer area, so then need to read from hard disk, thus cause Media Stream to distribute appearance interruption.
For this problem, propose a kind of prefetch mechanisms in scheme of the present invention, specific implementation comprises:
As arbitrary file section y in user's access cache district, determine whether next file section belonging to same media file with file section y leaves in buffer area, if so, does not then deal with; If not, then redefine the preferred value of each file section in buffer area, and looking ahead opportunity of determining, replace the minimum and not accessed file section of preferred value in buffer area with next file section belonging to same media file with file section y.
Suppose that the section sequence number of file section y is n, Seg
n+1represent that the section sequence number belonging to same media file with file section y is the file section of n+1, i.e. the duration of next file section, so, next file section is sent to the time T needed for proxy server from video server
s-p=Seg
n+1/ B
s-p; Again during the X moment of hypothesis in total duration of media file belonging to arrival file section y, next file section of looking ahead, so X must meet:
Seg
krepresent that the section sequence number belonging to same media file with file section y is the duration of the file section of k, R
irepresent the code check of media file belonging to file section y.
Can release according to formula (6):
When X gets maximum (next file section of must looking ahead, otherwise Media Stream will be caused to be interrupted; Not too early looking ahead, is replaced by too early to avoid existing file section in buffer area), namely
time, next file section of looking ahead, and replace the minimum and not accessed file section of preferred value in buffer area with next file section.
Due to 1+ α times that the duration belonging to a rear file section of same media file is the duration of last file section, and X is bound to be greater than 0, so can release based on formula (7):
In addition,
must 0 be greater than, and B
s-pbe greater than 0, so (1+ α) B
s-p-α R
imust 0 be greater than, namely have:
Through type (9) can obtain: (R
i-B
s-p) * α < B
s-p; (10)
If R
i≤ B
s-p, α can value arbitrarily so in principle, but considers the popularity of media file and average length of session, then in steps described in 21
if R
i> B
s-p, then α must meet
Formula (8) is utilized to release further, when user has access to file section y's
during part, need next file section of looking ahead, this is the same with the essence of the X mentioned before, and just one represents with the form in moment, and one represents with the form of percentage.
Based on above-mentioned introduction, Fig. 3 is the composition structural representation of buffer queue management device embodiment of the present invention.As shown in Figure 3, comprising:
First processing unit 31, for for each media file, is divided into two or more file section respectively;
Second processing unit 32, for according to hot broadcast degree, determines the preferred value of each file section respectively, and file section preferred value being in front M position is stored in the buffer area of proxy server, and M is positive integer;
In addition, when not being stored in the file section z in buffer area when user's request access one, redefine file section z and leave the preferred value of each file section in buffer area in, and when exist in buffer area preferred value lower than file section z and not accessed file section time, replace the file section of described preferred value lower than file section z and in not accessed file section with file section z.Certainly, optimum is replace the minimum file section of preferred value.
Wherein, can specifically comprise in the first processing unit 31 (for simplifying accompanying drawing, not shown):
First process subelement, for for each media file, determines the segmentation factor-alpha of its correspondence and section sequence number to be the duration L of the file section of 1, α is the positive number being less than or equal to 1 respectively;
If R
i≤ B
s-p, then
If R
i> B
s-p, then
I represents arbitrary media file, B
s-prepresent the bandwidth from video server to proxy server, R
ithe code check of presentation medium file i, Popularity
ithe popularity of presentation medium file i, ASL
ithe average length of session of presentation medium file i, f () represents any predetermined formula;
n represents the number of times that in from current time Tr to it last this time period of predetermined start moment T0, media file i is accessed, and Ti represents one closer to Tr in the moment Ti1 that T0 and media file i is accessed first;
access duration when presentation medium file i jth is time accessed;
Second process subelement, for being the 1+ α mode doubly of the duration of last file section according to the duration of a rear file section, is divided into two or more file section respectively by each media file.
Second processing unit 32 can be further used for, and after scheduled duration, notifies that the first processing unit 31 repeats self function.
In addition, specifically, the second processing unit 32, for each file section x, calculates Object_Priority+Segment_Priority+Position_Priority respectively, using the preferred value of result of calculation as file section x; Wherein, Object_Priority represents the number of times that in from current time to it last this time period in predetermined start moment, belonging to file section x, media file is accessed, Segment_Priority represent from current time to divide obtain file section x this time period in moment in the accessed number of times of file section x, Position_Priority is relevant with the section sequence number of file section x, the value of section sequence number more close to 1, Position_Priority is larger.
Also can comprise further in Fig. 3 shown device:
3rd processing unit 33, for as arbitrary file section y in user's access cache district, determines whether next file section belonging to same media file with file section y leaves in buffer area, if so, does not then deal with; If not, then redefine the preferred value of each file section in buffer area, and the X moment in total duration of media file belonging to file section y, replace the minimum and not accessed file section of preferred value in buffer area with next file section belonging to same media file with file section y;
n represents the section sequence number of file section y, Seg
krepresent that the section sequence number belonging to same media file with file section y is the duration of the file section of k, Seg
n+1represent that the section sequence number belonging to same media file with file section y is the duration of the file section of n+1, B
s-prepresent the bandwidth from video server to proxy server, R
irepresent the code check of media file belonging to file section y.
The specific works flow process of Fig. 3 shown device embodiment please refer to the respective description in embodiment of the method shown in Fig. 2.
In addition, also disclose a kind of demand stream media system in the present invention, comprise Fig. 3 shown device, specific implementation, referring to foregoing description, does not repeat them here.
In a word, adopt technical scheme of the present invention, cache hit rate can be improved preferably.
The foregoing is only preferred embodiment of the present invention, not in order to limit the present invention, within the spirit and principles in the present invention all, any amendment made, equivalent replacement, improvement etc., all should be included within the scope of protection of the invention.
Claims (12)
1. a buffer queue management method, is characterized in that, comprising:
A, for each media file, be divided into two or more file section respectively;
B, according to hot broadcast degree, determine the preferred value of each file section respectively, file section preferred value being in front M position is stored in the buffer area of proxy server, and M is positive integer;
After described step B, comprise further:
When not being stored in the file section z in buffer area when user's request access one, redefine file section z and leave the preferred value of each file section in buffer area in, and when exist in buffer area preferred value lower than file section z and not accessed file section time, replace the file section of described preferred value lower than file section z and in not accessed file section with file section z;
After described step B, comprise further:
As arbitrary file section y in user's access cache district, determine whether next file section belonging to same media file with file section y leaves in buffer area, if so, does not then deal with;
If not, then redefine the preferred value of each file section in buffer area, and looking ahead opportunity of determining, replace the minimum and not accessed file section of preferred value in buffer area with next file section belonging to same media file with file section y;
Wherein, the determination mode of looking ahead described in opportunity comprises:
Calculate
Wherein, n represents the section sequence number of file section y, Seg
krepresent that the section sequence number belonging to same media file with file section y is the duration of the file section of k, Seg
n+1represent that the section sequence number belonging to same media file with file section y is the duration of the file section of n+1, B
s-prepresent the bandwidth from video server to proxy server, R
irepresent the code check of media file belonging to file section y;
Using the X moment in total duration of media file belonging to file section y as the opportunity of looking ahead.
2. method according to claim 1, is characterized in that, described steps A comprises:
For each media file, the mode increased progressively according to duration is respectively divided into two or more file section.
3. method according to claim 2, is characterized in that, after described step B, comprises further: after scheduled duration, returns execution steps A.
4. method according to claim 3, is characterized in that, described for each media file, and the mode increased progressively according to duration is respectively divided into two or more file section and comprises:
For each media file, determine the segmentation factor-alpha of its correspondence and section sequence number to be respectively the duration L of the file section of 1, α be the positive number being less than or equal to 1;
According to the 1+ α mode doubly that the duration of a rear file section is the duration of last file section, each media file is divided into two or more file section respectively.
5. method according to claim 4, is characterized in that, described for each media file, determines that the α of its correspondence comprises respectively:
If R
i≤ B
s-p, then
If R
i> B
s-p, then
I represents arbitrary media file, B
s-prepresent the bandwidth from video server to proxy server, R
ithe code check of presentation medium file i, Popularity
ithe popularity of presentation medium file i, ASL
ithe average length of session of presentation medium file i, f () represents any predetermined formula.
6. method according to claim 5, is characterized in that,
Described
n represents the number of times that in from current time Tr to it last this time period of predetermined start moment T0, media file i is accessed, and Ti represents one closer to Tr in the moment Ti1 that T0 and media file i is accessed first;
Described
access duration when presentation medium file i jth is time accessed.
7. method according to claim 1, is characterized in that, describedly determines that the preferred value of each file section comprises: for each file section x, carry out following process respectively:
Calculate
represent the preferred value of file section x, Object_Priority represents the number of times that in from current time to it last this time period in predetermined start moment, belonging to file section x, media file is accessed, Segment_Priority represent from current time to divide obtain file section x this time period in moment in the accessed number of times of file section x, Position_Priority is relevant with the section sequence number of file section x, the value of section sequence number more close to 1, Position_Priority is larger.
8. a buffer queue management device, is characterized in that, comprising:
First processing unit, for for each media file, is divided into two or more file section respectively;
Second processing unit, for according to hot broadcast degree, determines the preferred value of each file section respectively, and file section preferred value being in front M position is stored in the buffer area of proxy server, and M is positive integer;
Described second processing unit is further used for, when not being stored in the file section z in buffer area when user's request access one, redefine file section z and leave the preferred value of each file section in buffer area in, and when exist in buffer area preferred value lower than file section z and not accessed file section time, replace the file section of described preferred value lower than file section z and in not accessed file section with file section z;
This device comprises further:
3rd processing unit, for as arbitrary file section y in user's access cache district, determines whether next file section belonging to same media file with file section y leaves in buffer area, if so, does not then deal with; If not, then redefine the preferred value of each file section in buffer area, and looking ahead opportunity of determining, replace the minimum and not accessed file section of preferred value in buffer area with next file section belonging to same media file with file section y;
The X moment in total duration of media file belonging to file section y looks ahead opportunity as described by described 3rd processing unit;
n represents the section sequence number of file section y, Seg
krepresent that the section sequence number belonging to same media file with file section y is the duration of the file section of k, Seg
n+1represent that the section sequence number belonging to same media file with file section y is the duration of the file section of n+1, B
s-prepresent the bandwidth from video server to proxy server, R
irepresent the code check of media file belonging to file section y.
9. device according to claim 8, is characterized in that, described first processing unit comprises:
First process subelement, for for each media file, determines the segmentation factor-alpha of its correspondence and section sequence number to be the duration L of the file section of 1, α is the positive number being less than or equal to 1 respectively;
If R
i≤ B
s-p, then
If R
i> B
s-p, then
I represents arbitrary media file, B
s-prepresent the bandwidth from video server to proxy server, R
ithe code check of presentation medium file i, Popularity
ithe popularity of presentation medium file i, ASL
ithe average length of session of presentation medium file i, f () represents any predetermined formula;
Described
n represents the number of times that in from current time Tr to it last this time period of predetermined start moment T0, media file i is accessed, and Ti represents one closer to Tr in the moment Ti1 that T0 and media file i is accessed first;
Described
access duration when presentation medium file i jth is time accessed;
Second process subelement, for being the 1+ α mode doubly of the duration of last file section according to the duration of a rear file section, is divided into two or more file section respectively by each media file.
10. device according to claim 9, is characterized in that, described second processing unit is further used for, and after scheduled duration, notifies that described first processing unit repeats self function.
Device described in 11. according to Claim 8,9 or 10, it is characterized in that, described second processing unit, for each file section x, calculates Object_Priority+Segment_Priority+Position_Priority respectively, using the preferred value of result of calculation as file section x; Wherein, Object_Priority represents the number of times that in from current time to it last this time period in predetermined start moment, belonging to file section x, media file is accessed, Segmen
tpr iorit show y show from current time to divide obtain file section x this time period in moment in the accessed number of times of file section x, Position_Priority is relevant with the section sequence number of file section x, the value of section sequence number more close to 1, Position_Priority is larger.
12. 1 kinds of demand stream media systems, is characterized in that, comprising: the device according to any one of claim 9 ~ 11.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010618532.3A CN102546716B (en) | 2010-12-23 | 2010-12-23 | A kind of buffer queue management method, device and demand stream media system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010618532.3A CN102546716B (en) | 2010-12-23 | 2010-12-23 | A kind of buffer queue management method, device and demand stream media system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102546716A CN102546716A (en) | 2012-07-04 |
| CN102546716B true CN102546716B (en) | 2015-08-19 |
Family
ID=46352672
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201010618532.3A Expired - Fee Related CN102546716B (en) | 2010-12-23 | 2010-12-23 | A kind of buffer queue management method, device and demand stream media system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102546716B (en) |
Families Citing this family (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10841352B2 (en) | 2012-11-27 | 2020-11-17 | International Business Machines Corporation | Non-chronological buffering of segments of a media file |
| CN103051701B (en) * | 2012-12-17 | 2016-02-17 | 北京网康科技有限公司 | A kind of buffer memory access method and device |
| CN104111900B (en) * | 2013-04-22 | 2017-06-20 | 中国移动通信集团公司 | Data replacement method and device in one kind caching |
| CN103607386B (en) * | 2013-11-15 | 2017-11-10 | 南京云川信息技术有限公司 | A kind of cooperation caching method in P2P Cache systems |
| CN103974084B (en) * | 2014-05-07 | 2017-02-08 | 南京邮电大学 | Streaming media data block caching method, file recommendation method and streaming media server |
| CN105227665B (en) * | 2015-07-20 | 2018-11-30 | 中国科学院计算技术研究所 | A kind of caching replacement method for cache node |
| CN106027642A (en) * | 2016-05-19 | 2016-10-12 | 乐视控股（北京）有限公司 | Method and system for determining number of disks of CDN (Content Delivery Network) node |
| CN109511009B (en) * | 2018-12-07 | 2021-03-30 | 北京交通大学 | Video online cache management method and system |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1996996A (en) * | 2006-12-19 | 2007-07-11 | 北京邮电大学 | The method for stream media file buffer for the mobile stream media proxy server |
| CN101184209A (en) * | 2007-12-12 | 2008-05-21 | 中山大学 | VOD client terminal proxy caching server in digital family |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8909806B2 (en) * | 2009-03-16 | 2014-12-09 | Microsoft Corporation | Delivering cacheable streaming media presentations |
-
2010
- 2010-12-23 CN CN201010618532.3A patent/CN102546716B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1996996A (en) * | 2006-12-19 | 2007-07-11 | 北京邮电大学 | The method for stream media file buffer for the mobile stream media proxy server |
| CN101184209A (en) * | 2007-12-12 | 2008-05-21 | 中山大学 | VOD client terminal proxy caching server in digital family |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102546716A (en) | 2012-07-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102546716B (en) | A kind of buffer queue management method, device and demand stream media system | |
| US6988144B1 (en) | Packet scheduling system and method for multimedia data | |
| US9021537B2 (en) | Pre-buffering audio streams | |
| CN107818056B (en) | Queue management method and device | |
| CN105791431A (en) | On-line distributed monitoring video processing task scheduling method and device | |
| CN107436725A (en) | A kind of data are write, read method, apparatus and distributed objects storage cluster | |
| CN107168654B (en) | A kind of isomery memory allocation method and system based on data object temperature | |
| JP2014526763A5 (en) | ||
| CN104407936B (en) | A kind of data snapshot method and device | |
| CN103370691A (en) | Managing buffer overflow conditions | |
| CN106791930B (en) | Video processing method and device | |
| CN110968279B (en) | Message degradation method and related device | |
| CN102332284A (en) | Multimedia data processing method and processing system suitable for digital media broadcast | |
| CN109587511A (en) | More equipment net cast methods, equipment, system and storage medium | |
| US11385814B2 (en) | Method and device for allocating resource of hard disk in distributed storage system | |
| CN104883478A (en) | Video processing method and device | |
| Huang et al. | Load balancing for clusters of VOD servers | |
| WO2023083064A1 (en) | Video processing method and apparatus, electronic device, and readable storage medium | |
| US20220256215A1 (en) | Systems and methods for adaptive output | |
| CN104881245A (en) | Configuration method and device of storage system | |
| WO2016155256A1 (en) | Method and system for controlling program recording, and management server and hotness counting server | |
| CN111464860B (en) | Cache allocation method for video data | |
| CN110198459B (en) | Method, device, server and storage medium for playing display information | |
| WO2019196258A1 (en) | Method for controlling audio playback and terminal device | |
| Chang et al. | Medic: A memory and disk cache for multimedia clients |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20150819 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |