CN1874490A - Disk buffering method in use for video on demand system of peer-to-peer network - Google Patents
Disk buffering method in use for video on demand system of peer-to-peer network Download PDFInfo
- Publication number
- CN1874490A CN1874490A CNA200610019526XA CN200610019526A CN1874490A CN 1874490 A CN1874490 A CN 1874490A CN A200610019526X A CNA200610019526X A CN A200610019526XA CN 200610019526 A CN200610019526 A CN 200610019526A CN 1874490 A CN1874490 A CN 1874490A
- Authority
- CN
- China
- Prior art keywords
- disk
- burst
- normal data
- data piece
- peer
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Memory System Of A Hierarchy Structure (AREA)
Abstract
In the invention, each node executes the following steps: 1) initializing the disc space; 2) formatting the disc space; 3) making check to decide if there is data to be buffered; 4) dividing the data to be buffered into normal data blocks; 5) selecting a proper sub-disc; 6) inserting the data to be buffered into the disc buffer queue; 7) deleting the buffer data already existing in the disc; 8) checking the buffer queue for writing into the disc to decide it is full; 11) deciding if the user quits the system.
Description
Technical field
The invention belongs to the streaming media on demand technical field, be specifically related to a kind of disk buffering method that is used for peer-to-peer network (P2P) video on-demand system.
Background technology
The application of stream media technology is a main mode of propagating multimedia messages on the internet always, universal day by day along with broadband networks, and the degree of concern that is subjected to of video-on-demand service also just day by day improves.
Traditional video request program mechanism leaves a large amount of order video flow datas for the treatment of on the video server of one group of centralized management in, and video server is responsible for responding the order request of each client.Under this client server system pattern, video server has been born whole work.When a broadcasting user constantly increased, video server reached its capacity limit the most at last.For the enhanced system ability, way commonly used is to increase more video server.In enhanced system server-side processes ability, the network bandwidth also needs to improve accordingly.Higher based on the modern in fact valency of the system of this scheme, and the program request demand that also is difficult to satisfied unlimited increase by the limited increase of the video server quantity and the network bandwidth.Therefore find a technology that is suitable for VOD system extremely urgent.
Peer-to-peer network is that of rising in recent years utilizes terminal desktop PC computing capability and terminal bandwidth to carry out the new technology of file-sharing between the user, and it has plurality of advantages such as the flexibility of use, extensibility, robustness, load balancing.Therefore streaming media on demand, live universal a kind of good technical basis that provides are provided.Make based on the stream media ordering method of peer-to-peer network and can both share existing data between the node greatly and need not focus on server end and obtain data, thereby the burden that has alleviated streaming media server and network has reduced cost.
In recent years, along with the development of P2P technology, some stream media systems based on P2P have appearred also.In the stream media system based on P2P, all nodes are reciprocity on function, not only can be client computer but also can be server, and a certain amount of media data of each nodal cache uses for other node in the native system.These system's major parts are based on tree-like network configuration, P2VOD (T.Do for example, K.A.Hua, and M.Tantaoui. " P2VoD:providing fault tolerantvideo-on-demand streaming in peer-to-peer environment ", in Proc.of IEEE ICC ' 04, Paris, France, Jun.2004.) and P2Cast (Y.Guo, K.Suh, J.Kurose, and D.Towsley. " P2Cast:Peer-to-peer Patching Schemefor VoD Service ", in Proc.of the 12th World Wide Web Conference (WWW ' 03), Budapest, Hungary, May 2003.).The media data of the node in these systems all is to carry out buffer memory in internal memory.The data that are buffered in the internal memory can guarantee the continuity that the user plays, and also can respond the request of data of other user nodes simultaneously fast.But because there is a large amount of " unexpected winner " programs fewer in number of watching in the dispersiveness that the user watches behavior.For the user who watches these programs, because memory size is limited, can not the buffer memory more data, so be difficult to watch the user of same program to obtain media data there from other, thereby make more request forward streaming media server to, increase load of server, limited the autgmentability of this system.
Summary of the invention
The objective of the invention is to overcome the deficiency of peer-to-peer network streaming media on demand buffer data size, a kind of disk buffering method that is used for the peer-to-peer network video on-demand system is provided, this method has solved the problem of the limited initiation of memory size, strengthen the integrity service ability of VOD system, enabling provides service for more user simultaneously.
A kind of disk buffering method that is used for the peer-to-peer network video on-demand system provided by the invention, its step comprises:
(1) user's initialization disk buffering space, the size in named cache space and path on this machine disk;
(2) spatial cache of formatting diskette on average is divided into some bursts with the whole magnetic disk spatial cache, and each burst is a disk burst;
(3) make regular check on and whether have data to be buffered,, then enter step (4) if having; Otherwise forward step (11) to;
(4) media data that will need buffer memory according to equal time length carry out burst, each sheet data is referred to as a normal data piece;
(5) according to the size of a normal data piece that will buffer memory, search whether exist in the disk buffering space one or more continuously and state be idle disk burst, and the space length summation of these bursts is more than or equal to the length of a normal data piece, if search successfully, then the state with this disk burst changes usefulness into, enters step (6); Otherwise change step (7) over to;
The start sequence number of this normal data piece that (6) will buffer memory, the number of pairing disk burst and burst is inserted into writes disk buffering formation end, enters step (8);
(7) according to formula λ=α * N+ β * T, calculate being requested times N and being requested the weighted average of time T last time of all normal data pieces on the existing disk, α wherein, β is a weighted factor, alpha+beta=1,0＜α＜1,0＜β＜1, the normal data piece that the λ value of correspondence is minimum is deleted from disk, and the disk fragmentation state of the deleted normal data piece correspondence of falling is changed to the free time again; Return step (5);
(8) make regular check on whether write the disk buffering formation full,, enter step (9) if full; Otherwise forward step (10) to;
(9) data that will write in the buffer queue are write respectively on the pairing disk burst;
(10) check whether all normal data pieces are all stored and finish, if then enter step (11), otherwise forward step (5) to;
(11) whether the user logs off, if then finish; Otherwise, forward step (3) to
The media data that the present invention utilizes the idle disk space buffer memory of node to play increases the cache contents of each node on the network effectively, makes media resource to be distributed to more widely on the network, increases the resource quantity of system.Owing to watch the node of same program all to be cached with more media data on the network, user node on the network can get access to required data from other nodes as far as possible when request msg, reduced request number of times, thereby alleviated the pressure of streaming media server greatly to streaming media server.Like this, just can effectively solve in the conventional point broadcast system because excessive its service ability upper limit that reaches of streaming media server pressure can not be supported the problem that more users are watched, the hoist point broadcast system can autgmentability so that support more user to use.
Description of drawings
Fig. 1 is the schematic flow sheet of the inventive method;
Fig. 2 is a disk burst schematic diagram;
Fig. 3 is a schematic diagram of writing buffer queue.
Embodiment
Below in conjunction with accompanying drawing and example the inventive method is described in further detail.
As shown in Figure 1, the inventive method may further comprise the steps:
(1) user's initialization disk buffering space, the size in named cache space and path on this machine disk.
Before buffer memory begins, the path and the size of user's operable disk space of appointing system on this machine disk, path and size are by the current behaviour in service decision of this machine of user disk.Disk space size value is usually greater than 100MB.Media data will be cached on the disk of user's specified path, and data cached total amount can not surpass the size of the spatial cache of user's appointment.
(2) spatial cache of formatting diskette on average is divided into some bursts with the whole magnetic disk spatial cache, and each burst is called a disk burst;
The disk burst is identified by fragmentation state usually, and state is not used for idle expression, and state is for being used with representing.Then these burst index being got up, is that unit manages the disk buffering space with one by one burst.For example shown in Figure 2, suppose that the spatial cache size that the user is provided with is 200M, be the size of a burst with 100K, then this spatial cache can be divided into 200 * 1024 ÷ 100=2048 piece bursts.System sets up index to manage to these 2048 bursts.
(3) make regular check on and whether have data to be buffered,, then enter step (4) if having; Otherwise forward step (11) to;
The every interval of program one period regular time just checks whether have data to be buffered, and the cycle of inspection, general value was 1-5 second by the decision of hardware configuration situation.
(4) media data that needs buffer memory was started with from the time, with its according to equal time length carry out burst, the data definition of each sheet is a normal data piece, and wherein the time span of each normal data piece is by the disposal ability decision of computer hardware, and general value is 1-10 second.
(5) according to the size of a normal data piece that will buffer memory, search whether exist in the disk buffering space one or more continuously and state be idle disk burst, and the space length summation of these bursts is more than or equal to the length of a normal data piece, if search successfully, then the state with this disk burst changes usefulness into, enters step (6); Otherwise change step (7) over to.
The start sequence number of this normal data piece that (6) will buffer memory, the number of pairing disk burst and burst is inserted into writes disk buffering formation end, enters step (8);
As shown in Figure 3, writing the disk buffering formation is a structure chained list in the internal memory.The content that each structure in the chained list comprises is normal data piece, the number of the pairing disk burst of normal data piece and the start sequence number of burst.
(7) deletion meet on the disk following standard, the normal data piece of buffer memory, return step (5), the standard of specifically deleting is as follows;
When the data that will delete on the disk, according to formula λ=α * N+ β * T calculate all normal data pieces on the existing disk be requested times N and last time requested time T weighted average, α wherein, β is a weighted factor, weight by N and T determines respectively, and the rare degree of gained normal data piece of λ value representation on network calculated in alpha+beta=1,0＜α＜1,0＜β＜1.The normal data piece that the λ value of correspondence is minimum is deleted from disk, and the disk fragmentation state of the deleted normal data piece correspondence of falling is changed to the free time again.
(8) check whether write the disk buffering formation full,, enter step (9) if full; Otherwise forward step (10) to;
Program is made regular check on the higher limit whether member's number in the disk buffering formation has reached buffer queue of writing in the internal memory.This higher limit is by memory size and the decision of disk read-write speed, general value 60-100.If reached the upper limit, then change step (9) over to, otherwise, forward step (10) to, carry out the buffer memory of next normal data piece.
(9) data that will write in the buffer queue are write respectively on the pairing disk burst;
It is full to write buffer queue, shifts out queue member from the formation head successively, according to the information that writes down in the queue member, the normal data piece is written on its pairing disk burst, till writing buffer queue and being sky;
(10) check whether all normal data pieces are all stored and finish, if then enter step (11), otherwise forward step (5) to;
(11) whether the user logs off, if then finish; Otherwise, forward step (3) to.
Example:
Utilize disk buffering method set forth in the present invention, the laboratory provides 1 video server, the logical PC of 1 index server and 10 Daeporis, and the hardware configuration of PC is as follows:
| Machine name | CPU | Internal memory | Hard disk | The network bandwidth |
| Video server | PIIII 2.0G | 2G | 300G | 100M |
| Index server | PIIII 2.0G | 2G | 40G | 100M |
| PC 1-10 | PIIII 1.7G | 256M | 40G | 10M |
PC1-10 is called node 1, node 2 ... node 10.Node 3 on PC3, specify c: a.temp be its disk buffering space, its size is appointed as 200M.Program is divided into 2048 with this 200M space average, and then the size of each sheet is 200 * 1024 ÷ 2048=100K.Program has been checked through data after 2 seconds at interval and need be buffered, this is treated that data cached was that base unit carries out burst with one second, 1 normal data piece is arranged, the disk buffering space operating position of node 3 as shown in Figure 4 at this moment, 1-2042 piece disk burst all has been used to buffered media data, this normal data block length is 143KB, then search the disk buffering space, discovery has two continuous disk bursts 2042 and 2043, their space length summation is 200K, length 143K greater than this normal data piece, so 2042 and No. 2043 disk fragmentation state are modified as use, and with this normal data piece, the number 2 of corresponding disk burst and start sequence number 2042 are inserted into as a queue member writes disk buffering formation end.Check afterwards and write already present member's number in the buffer queue, if reach higher limit 60, then shift out queue member one by one from the formation head successively, according to the information that writes down in the queue member, time slot is written on its pairing disk burst, till writing buffer queue and being sky, judge whether that then all normal data pieces all dispose, and carry out metadata cache next time.
Claims (1)
1, a kind of disk buffering method that is used for the peer-to-peer network video on-demand system, its step comprises:
(1) user's initialization disk buffering space, the size in named cache space and path on this machine disk;
(2) spatial cache of formatting diskette on average is divided into some bursts with the whole magnetic disk spatial cache, and each burst is a disk burst;
(3) make regular check on and whether have data to be buffered,, then enter step (4) if having; Otherwise forward step (11) to;
(4) media data that will need buffer memory according to equal time length carry out burst, each sheet data is referred to as a normal data piece;
(5) according to the size of a normal data piece that will buffer memory, search whether exist in the disk buffering space one or more continuously and state be idle disk burst, and the space length summation of these bursts is more than or equal to the length of a normal data piece, if search successfully, then the state with this disk burst changes usefulness into, enters step (6); Otherwise change step (7) over to;
The start sequence number of this normal data piece that (6) will buffer memory, the number of pairing disk burst and burst is inserted into writes disk buffering formation end, enters step (8);
(7) according to formula λ=α * N+ β * T, calculate being requested times N and being requested the weighted average of time T last time of all normal data pieces on the existing disk, α wherein, β is a weighted factor, alpha+beta=1,0＜α＜1,0＜β＜1, the normal data piece that the λ value of correspondence is minimum is deleted from disk, and the disk fragmentation state of the deleted normal data piece correspondence of falling is changed to the free time again; Return step (5);
(8) make regular check on whether write the disk buffering formation full,, enter step (9) if full; Otherwise forward step (10) to;
(9) data that will write in the buffer queue are write respectively on the pairing disk burst;
(10) check whether all normal data pieces are all stored and finish, if then enter step (11), otherwise forward step (5) to;
(11) whether the user logs off, if then finish; Otherwise, forward step (3) to.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB200610019526XA CN100477787C (en) | 2006-06-30 | 2006-06-30 | Disk buffering method in use for video on demand system of peer-to-peer network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB200610019526XA CN100477787C (en) | 2006-06-30 | 2006-06-30 | Disk buffering method in use for video on demand system of peer-to-peer network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1874490A true CN1874490A (en) | 2006-12-06 |
| CN100477787C CN100477787C (en) | 2009-04-08 |
Family
ID=37484712
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB200610019526XA Expired - Fee Related CN100477787C (en) | 2006-06-30 | 2006-06-30 | Disk buffering method in use for video on demand system of peer-to-peer network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100477787C (en) |
Cited By (20)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100568957C (en) * | 2007-10-17 | 2009-12-09 | 华中科技大学 | A kind of video frequency request program caching method based on the p2p technology |
| CN101635734A (en) * | 2008-07-22 | 2010-01-27 | 上海聚力传媒技术有限公司 | Method and device for storing and managing downloaded data on non-volatile storage medium |
| WO2011026353A1 (en) * | 2009-09-02 | 2011-03-10 | 中兴通讯股份有限公司 | Route switching device and data cashing method thereof |
| CN101551781B (en) * | 2009-05-22 | 2011-03-30 | 中国科学院计算技术研究所 | Method of magnetic disc cache replacement in P2P video on demand system |
| CN102054031A (en) * | 2010-12-22 | 2011-05-11 | 上海锐起信息技术有限公司 | Method for realizing network disc local write cache control in disk-free system |
| CN102222094A (en) * | 2011-06-08 | 2011-10-19 | 上海聚力传媒技术有限公司 | Equipment and method for eliminating resource files based on resource utilization rate |
| CN102256163A (en) * | 2011-08-10 | 2011-11-23 | 中山大学深圳研究院 | Video-on-demand system based on P2P (Peer-To-Peer) |
| CN101094183B (en) * | 2007-07-25 | 2011-12-07 | 杭州华三通信技术有限公司 | Buffer memory management method and device |
| CN102638412A (en) * | 2012-05-04 | 2012-08-15 | 杭州华三通信技术有限公司 | Cache management method and device |
| CN102663086A (en) * | 2012-04-09 | 2012-09-12 | 华中科技大学 | Method for retrieving data block indexes |
| CN103051975A (en) * | 2012-12-31 | 2013-04-17 | 乐视网信息技术（北京）股份有限公司 | P2P (peer to peer) cache data elimination method |
| CN103051977A (en) * | 2013-01-11 | 2013-04-17 | 乐视网信息技术（北京）股份有限公司 | Method for processing p2p (peer-to-peer) cache data |
| CN103150385A (en) * | 2013-03-15 | 2013-06-12 | 杭州智屏软件有限公司 | Real-time video recording caching technology based on memory |
| CN103152620A (en) * | 2013-02-27 | 2013-06-12 | 四三九九网络股份有限公司 | Method and system for dynamically loading different on-line videos |
| CN104238960A (en) * | 2014-08-28 | 2014-12-24 | 华为技术有限公司 | Hard disk formatting method, block data storage method based on hard disk and block data storage device based on hard disk |
| CN104298467A (en) * | 2013-07-17 | 2015-01-21 | 合一网络技术(北京)有限公司 | p2p (peer to peer) cache file management method and device |
| CN104717569A (en) * | 2013-12-13 | 2015-06-17 | 乐视网信息技术（北京）股份有限公司 | Data elimination method and device |
| CN109800089A (en) * | 2019-01-24 | 2019-05-24 | 湖南国科微电子股份有限公司 | A kind of buffer resource distribution method, module and electronic equipment |
| CN111385643A (en) * | 2020-03-20 | 2020-07-07 | 北京字节跳动网络技术有限公司 | Method and device for storing data, electronic equipment and storage medium |
| CN111858399A (en) * | 2019-04-30 | 2020-10-30 | 贵州白山云科技股份有限公司 | Data transmission method and device, computer readable storage medium and computer equipment |
-
2006
- 2006-06-30 CN CNB200610019526XA patent/CN100477787C/en not_active Expired - Fee Related
Cited By (30)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101094183B (en) * | 2007-07-25 | 2011-12-07 | 杭州华三通信技术有限公司 | Buffer memory management method and device |
| CN100568957C (en) * | 2007-10-17 | 2009-12-09 | 华中科技大学 | A kind of video frequency request program caching method based on the p2p technology |
| CN101635734A (en) * | 2008-07-22 | 2010-01-27 | 上海聚力传媒技术有限公司 | Method and device for storing and managing downloaded data on non-volatile storage medium |
| CN101551781B (en) * | 2009-05-22 | 2011-03-30 | 中国科学院计算技术研究所 | Method of magnetic disc cache replacement in P2P video on demand system |
| WO2011026353A1 (en) * | 2009-09-02 | 2011-03-10 | 中兴通讯股份有限公司 | Route switching device and data cashing method thereof |
| US9025608B2 (en) | 2009-09-02 | 2015-05-05 | Zte Corporation | Route switching device and data cashing method thereof |
| CN101645846B (en) * | 2009-09-02 | 2011-10-26 | 中兴通讯股份有限公司 | Route exchange equipment and data cache method thereof |
| CN102054031A (en) * | 2010-12-22 | 2011-05-11 | 上海锐起信息技术有限公司 | Method for realizing network disc local write cache control in disk-free system |
| CN102222094A (en) * | 2011-06-08 | 2011-10-19 | 上海聚力传媒技术有限公司 | Equipment and method for eliminating resource files based on resource utilization rate |
| CN102256163A (en) * | 2011-08-10 | 2011-11-23 | 中山大学深圳研究院 | Video-on-demand system based on P2P (Peer-To-Peer) |
| CN102256163B (en) * | 2011-08-10 | 2013-06-05 | 中山大学深圳研究院 | Video-on-demand system based on P2P (Peer-To-Peer) |
| CN102663086A (en) * | 2012-04-09 | 2012-09-12 | 华中科技大学 | Method for retrieving data block indexes |
| CN102663086B (en) * | 2012-04-09 | 2014-05-07 | 华中科技大学 | Method for retrieving data block indexes |
| CN102638412A (en) * | 2012-05-04 | 2012-08-15 | 杭州华三通信技术有限公司 | Cache management method and device |
| CN102638412B (en) * | 2012-05-04 | 2015-01-14 | 杭州华三通信技术有限公司 | Cache management method and device |
| CN103051975A (en) * | 2012-12-31 | 2013-04-17 | 乐视网信息技术（北京）股份有限公司 | P2P (peer to peer) cache data elimination method |
| CN103051977A (en) * | 2013-01-11 | 2013-04-17 | 乐视网信息技术（北京）股份有限公司 | Method for processing p2p (peer-to-peer) cache data |
| CN103152620A (en) * | 2013-02-27 | 2013-06-12 | 四三九九网络股份有限公司 | Method and system for dynamically loading different on-line videos |
| CN103152620B (en) * | 2013-02-27 | 2016-05-11 | 四三九九网络股份有限公司 | The method and system of the different Online Videos of dynamic load |
| CN103150385A (en) * | 2013-03-15 | 2013-06-12 | 杭州智屏软件有限公司 | Real-time video recording caching technology based on memory |
| CN104298467A (en) * | 2013-07-17 | 2015-01-21 | 合一网络技术(北京)有限公司 | p2p (peer to peer) cache file management method and device |
| CN104298467B (en) * | 2013-07-17 | 2018-12-14 | 合一网络技术(北京)有限公司 | A kind of p2p cache file management method and apparatus |
| CN104717569A (en) * | 2013-12-13 | 2015-06-17 | 乐视网信息技术（北京）股份有限公司 | Data elimination method and device |
| CN104238960A (en) * | 2014-08-28 | 2014-12-24 | 华为技术有限公司 | Hard disk formatting method, block data storage method based on hard disk and block data storage device based on hard disk |
| CN104238960B (en) * | 2014-08-28 | 2017-11-24 | 华为技术有限公司 | Formatting hard disk method and data block storage method and device based on hard disk |
| CN109800089A (en) * | 2019-01-24 | 2019-05-24 | 湖南国科微电子股份有限公司 | A kind of buffer resource distribution method, module and electronic equipment |
| CN111858399A (en) * | 2019-04-30 | 2020-10-30 | 贵州白山云科技股份有限公司 | Data transmission method and device, computer readable storage medium and computer equipment |
| CN111858399B (en) * | 2019-04-30 | 2023-11-24 | 贵州白山云科技股份有限公司 | Data transmission method, device, computer readable storage medium and computer equipment |
| CN111385643A (en) * | 2020-03-20 | 2020-07-07 | 北京字节跳动网络技术有限公司 | Method and device for storing data, electronic equipment and storage medium |
| CN111385643B (en) * | 2020-03-20 | 2022-04-05 | 北京字节跳动网络技术有限公司 | Method and device for storing data, electronic equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN100477787C (en) | 2009-04-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100477787C (en) | Disk buffering method in use for video on demand system of peer-to-peer network | |
| JP4663718B2 (en) | Distributed storage architecture based on block map caching and VFS stackable file system modules | |
| Gemmell et al. | Multimedia storage servers: A tutorial | |
| Chae et al. | Silo, rainbow, and caching token: Schemes for scalable, fault tolerant stream caching | |
| Ozden et al. | Disk striping in video server environments | |
| JP5140666B2 (en) | Peer-to-peer content on demand with performance in mind | |
| Chervenak et al. | Choosing the best storage system for video service | |
| US7836107B2 (en) | Disk seek optimized file system | |
| CN100568957C (en) | A kind of video frequency request program caching method based on the p2p technology | |
| JP5208446B2 (en) | Network data storage system | |
| US20070288638A1 (en) | Methods and distributed systems for data location and delivery | |
| MXPA06006332A (en) | Virtual file system. | |
| CN102521279A (en) | Playing method, playing system and player of streaming media files | |
| TW201234194A (en) | Data stream management system for accessing mass data | |
| CN110648178A (en) | Method for increasing kafka consumption capacity | |
| CN100471260C (en) | Network organization method of overlapped multichannels in video on demand system of peer-to-peer network | |
| CN102256163A (en) | Video-on-demand system based on P2P (Peer-To-Peer) | |
| CN101330594B (en) | Method for storing VOD medium of equity network and media demanding system thereof | |
| CN101079053A (en) | ContextFS based file management method | |
| CN109168023B (en) | Method for caching scalable video stream | |
| CN101557407B (en) | Transmission and storage method of program-ordering data of high definition media P2P | |
| CN102497359A (en) | Thin client streaming media-based service system running method | |
| Al-wesabi et al. | Data stream management system for video on demand hybrid storage server | |
| Qiang et al. | A Hyper-converged video management system based on object storage | |
| Teng et al. | RJDSS: a storage system for released judicial data |
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 | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20090408 Termination date: 20110630 |