CN102447974B - Method for prefetching cooperation data of P2P (peer-to-peer) video-on-demand system - Google Patents
Method for prefetching cooperation data of P2P (peer-to-peer) video-on-demand system Download PDFInfo
- Publication number
- CN102447974B CN102447974B CN201110342410.0A CN201110342410A CN102447974B CN 102447974 B CN102447974 B CN 102447974B CN 201110342410 A CN201110342410 A CN 201110342410A CN 102447974 B CN102447974 B CN 102447974B
- Authority
- CN
- China
- Prior art keywords
- node
- cooperation group
- data
- group
- nodes
- 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
Images
Landscapes
- Two-Way Televisions, Distribution Of Moving Picture Or The Like (AREA)
- Information Transfer Between Computers (AREA)
Abstract
The invention discloses a method for prefetching cooperation data of a P2P (peer-to-peer) video-on-demand system, which comprises the following steps that: when a node is added into the P2P video-on-demand system, a cooperation group in which the node is used as a main node is established or the node is added into an established cooperation group; the main node in the cooperation group determines a data prefetching range of the cooperation group, generates data acquiring tasks and regularly distributes the data acquiring tasks to all nodes in the cooperation group and all the nodes in the cooperation group acquire corresponding data according to the distributed data prefetching range and send acquired data information to the main node. Aiming at the limitation on node caching, the invention discloses a multi-node cooperation prefetching and data sharing method. The amount of the prefetched data is increased as far as possible so as to improve the data hit rate of random search and effectively shorten waiting time that the system responds to the random search operation of a user, thereby ensuring the continuity of playing a video.
Description
Technical field
The application relates to video on demand techniques field, particularly relates to a kind of reciprocity P2P video on-demand system cooperation data prefetching method.
Background technology
Live streaming media and VOD system based on P2P (Peer-to-Peer, equity) video on-demand system technology are with good expansibility, and can realize large-scale Stream Media Application by lower cost.Video on-demand system allows user to select at any time to watch interested video content, and supports the interactive operations such as random search, time-out, fast forwarding and fast rewinding, thereby more popular with users.
Yet, the random search behavior change of user when playing the demand data pattern of continuous broadcasting, and random search behavior has very strong uncertainty.In P2P video on-demand system stream media system, random search behavior meeting has a strong impact on the fluency that user watches video frequently.When user carries out random search operation, there is change in playing progress rate, and neighbor node originally can not meet current new demand data conventionally.In this case, the caching function of node is ineffective.In P2P video on-demand system stream media system, data from source server or other reciprocity node, before new neighbor node list is set up, can only obtain data from source server, thereby increase the pressure of source server.If wait for and set up new neighbor node list, from random search, operate and again play the longer time delay of experience.And no matter from what, come, scene obtains data for meeting broadcasting demand needs regular hour all.
The time delay of bringing in order to reduce random search operation, data store strategy that can design optimization, makes user in this locality, be met as far as possible the needed data block of random search demand.Therefore, how to design buffer memory or storage policy, for shortening response delay, reduction source server load and raising, watch fluency extremely important.
Data pre-fetching mechanism is prognoses system demand data in the future first, then utilizes idling-resource to shift to an earlier date acquisition unit divided data.In P2P video on-demand system, if can look ahead partial data piece be kept at this locality, when user carries out random search operation, the data centralization of first looking ahead in this locality is searched.If prefetch data can meet the needs of random search, can effectively shorten the response time of user's random search operation, alleviate the load of source server simultaneously.Data pre-fetching need solve two key issues, what is got and by whom got.Existing data prefetching method supposes that user's random search opereating specification is limited or have no rule conventionally, thereby employing is sequentially looked ahead or random prefetch policy.In addition, existing method is according to the bandwidth of single node and the quantity of storage capacity decision prefetch data piece.Due to transmittability and the limited storage space of single node, the node low volume data piece of can only looking ahead even cannot be looked ahead, thereby has limited the effect of data pre-fetching.
Summary of the invention
In view of this, the embodiment of the present application provides a kind of P2P video on-demand system cooperation data prefetching method, can be issued to comparatively desirable prefetch data hit rate in the limited buffer memory condition of looking ahead, thereby can effectively shorten the stand-by period of system responses user random search operation, improve the service quality of P2P video on-demand system video request program.
To achieve these goals, the technical scheme that the embodiment of the present application provides is as follows:
A reciprocity P2P video on-demand system cooperation data prefetching method, comprises the following steps:
When a node join is after P2P video on-demand system, this node is set up one and be take its cooperation group that is major node or join in a cooperation group of having set up, described cooperation group comprises a major node and several member's nodes, and the gap of the playing progress rate of the playing progress rate of major node and member's node is in predetermined threshold value;
Major node in described cooperation group is determined the data pre-fetching scope of described cooperation group, and according to the described data pre-fetching scope generated data task of looking ahead, and regularly described data pre-fetching task is distributed to all nodes in described cooperation group;
All nodes in described cooperation group obtain corresponding data according to distributed data pre-fetching task, and obtained data message is sent to major node.
Preferably, when a node join is after P2P video on-demand system, take this node as major node set up a cooperation group or by this node join to what newly add in the cooperation group of having set up, be specially:
When a node join is after P2P video on-demand system, whether this node regularly detects in some cooperation groups;
If not, this node will send the message request of setting up a cooperation group to all neighbor nodes, carry the current playing progress rate of this node in described message request;
This node receives the answer message of all neighbor nodes, and whether judgement is set up the required node data of cooperation group and reached and build group requested number;
If so, set up one and take the cooperation group that this node is major node, and send acknowledge message to the node that is invited to add; If not, this node sends and joins request to all neighbor nodes, described in carry the current playing progress rate of this node in joining request, if described in join request and accepted by some cooperation groups, this node join is in this cooperation group.
Preferably, the major node in described cooperation group determines that the data pre-fetching scope of described cooperation group is specially:
Major node in described cooperation group is according to the cache size of the cooperation group at its place and current play time, utilizes user's random search to carry out the specified data scope of looking ahead apart from probability-distribution function.
Preferably, the major node in described cooperation group is regularly distributed to described data acquisition task all nodes in described cooperation group, is specially:
Major node in described cooperation group is regularly averagely allocated to described data acquisition task all nodes in described cooperation group, or in proportion described data acquisition task is distributed to all nodes in described cooperation group according to the ability of each node in cooperation group.
Preferably, all nodes in described cooperation group obtain corresponding data according to distributed data pre-fetching task, are specially:
All nodes in described cooperation group are carried out its normal data separately and are obtained task;
After described normal data is obtained task and completed, all nodes in described cooperation group judge whether it has unnecessary bandwidth and storage capacity;
If so, all nodes in described cooperation group are carried out the prefetch datas task of looking ahead.
Preferably, the method further comprises:
When the some nodes in described cooperation group carry out random search operation, this node sends request of data to the major node in the cooperation group at its place;
Major node in described cooperation group judges in described cooperation group whether have the data corresponding with described request of data, if so, the node information that has the data corresponding with described request of data is sent to the described node that carries out random search operation;
The described node that carries out random search operation obtains the data corresponding with described request of data from corresponding node according to described node information.
Preferably, the some nodes in described cooperation group carry out random search when operation, before sending request of data, also comprise to the major node in the cooperation group at its place:
The node that carries out random search operation judges in the buffer memory of its node whether have corresponding data, if so, from its inter-node buffer memory, obtains corresponding data; If not, to the major node in the cooperation group at its place, send request of data.
Preferably, the method further comprises:
Major node in described cooperation group periodically sends apply for information to its place group member's node, and receives the response message of member's node;
When described major node, do not receive the response message of node, judge this member's node fails or left this cooperation group;
When described major node receives after the response message of member's node, judge that whether the playing progress rate of this member's node and the playing progress rate of major node surpass predetermined threshold value, if so, delete this member's node in this cooperation group.
Preferably, the method further comprises:
The number of the node described in the major node periodic statistics in described cooperation group in cooperation group;
Major node in described cooperation group judges whether the number of node in described cooperation group is less than the default group requested number of building, and if so, the major node in described cooperation group sends message request to neighbor node, to maintain the stable of number of network nodes in described cooperation group.
From above technical scheme, this P2P video on-demand system cooperation data prefetching method that the embodiment of the present application provides, the method of having taked cooperation to look ahead for the random search behavior in P2P video on-demand system, in cooperation group, by the major node in this cooperation group, carry out the specified data scope of looking ahead, and carry out prefetch data by all nodes in cooperation group, and when prefetch data piece, considered the distribution characteristics of user's random search distance.The method is for the finiteness of node buffer memory, the method that nodes cooperation is looked ahead and shared data has been proposed, increase as much as possible the quantity of prefetch data, and then the data hit rate of raising random search, effectively shorten the stand-by period of system responses user random search operation, thereby guarantee the continuity of video playback.Compared with prior art, the method is supported the interactive operations such as random search, time-out, fast forwarding and fast rewinding, allow user to select at any time to watch interested video content, and can under equivalent network condition, shorten the stand-by period that P2P video on-demand system demand stream media system response user random search operates, significantly improve user's experience.
Accompanying drawing explanation
In order to be illustrated more clearly in the embodiment of the present application or technical scheme of the prior art, to the accompanying drawing of required use in embodiment or description of the Prior Art be briefly described below, the accompanying drawing the following describes is only some embodiment that record in the application, for those of ordinary skills, do not paying under the prerequisite of creative work, can also obtain according to these accompanying drawings other technical scheme and form of presentation.
The schematic flow sheet of the P2P video on-demand system cooperation data prefetching method that Fig. 1 provides for the embodiment of the present application one;
Fig. 2 is the detailed process schematic diagram of S100 in Fig. 1;
Fig. 3 is for this cooperation data prefetching method and existing order that the embodiment of the present application under different playout length conditions provides are looked ahead, the data hit rate of the random search of random forecasting method;
Fig. 4 is for this cooperation data prefetching method and existing order that the embodiment of the present application under the cache size condition of looking ahead in difference provides are looked ahead, the data hit rate of the random search of random forecasting method;
The schematic flow sheet of the P2P video on-demand system cooperation data prefetching method that Fig. 5 provides for the embodiment of the present application two;
The schematic flow sheet of the P2P video on-demand system cooperation data prefetching method that Fig. 6 provides for the embodiment of the present application three;
The schematic flow sheet of the P2P video on-demand system cooperation data prefetching method that Fig. 7 provides for the embodiment of the present application four.
Embodiment
In order to make those skilled in the art person understand better the technical scheme in the application, below in conjunction with the accompanying drawing in the embodiment of the present application, the technical scheme in the embodiment of the present application is clearly and completely described.Obviously, following embodiment is only the application's exemplary embodiment, rather than whole embodiment.Embodiment based in the application, those of ordinary skills are not making all other embodiment that obtain under creative work prerequisite, all should belong to the scope of the application's protection.
The problem existing for solving existing data pre-fetching mechanism, the application discloses a kind of P2P video on-demand system cooperation data prefetching method, the method is predicted data area to be looked ahead exactly according to the distribution characteristics of user's random search distance, for detection range, distribute and there is the statistics of long-tail characteristic, designed a kind of method that nodes cooperation is looked ahead and shared data, utilize the method that the application provides to be issued to comparatively desirable prefetch data hit rate in the limited buffer memory condition of looking ahead, thereby effectively shorten the stand-by period of system responses user random search operation, improve the service quality of P2P video on-demand system video request program.
Embodiment mono-:
The schematic flow sheet of the P2P video on-demand system cooperation data prefetching method that Fig. 1 provides for the embodiment of the present application one.
As shown in Figure 1, the method comprises the following steps:
S100: when a node join is after P2P video on-demand system, this node is set up one and be take its cooperation group that is major node or join in the cooperation group of having set up.
In P2P video on-demand system, the broadcasting of node is asynchronous.Because node buffer memory is limited, playing progress rate differs larger node data buffer storage and does not have crossing part, thereby can not provide mutually data by buffer memory.Such as, the node that is played to video ending has been deleted video primary data already, and the node that has just started to play cannot obtain useful data from the buffer memory of these nodes.Therefore be necessary the identical or close node of playing progress rate to form cooperation group.The available five-tuple of cooperation group represents, i.e. (major node, member's list, current playing progress rate, least member's number, greatest member's number), and wherein: least member's number is builds group requested number.
In a cooperation group, comprise: a major node and some member's nodes, major node is generally the node of initiating to build group, and its effect is that cooperation group is safeguarded, and to the member's node allocating task in cooperation group, plays coordinator's effect; The effect of several member's nodes is that the task of distributing according to major node is carried out data pre-fetching.The gap of the playing progress rate of the playing progress rate of the major node in cooperation group and member's node is in predetermined threshold value, can guarantee that like this playing progress rate of all nodes in cooperation group is a less scope, avoid in node buffer memory, not having crossing part because node playing progress rate differs compared with causing greatly.
In the embodiment of the present application, as shown in Figure 2, this step specifically comprises the following steps:
S101: when a node join is after P2P video on-demand system, whether this node regularly detects in some cooperation groups.
In order to realize cooperation, look ahead, each node, after joining P2P video on-demand system, all needs to detect it and whether is positioned at cooperation group, for follow-up, enter suitable cooperation group and prepares.If current node is not positioned at any one cooperation group, walk S102.
S102: this node will send the message request of setting up a cooperation group to all neighbor nodes.
Here in message request, carry the current playing progress rate of this node, for finding the cooperation group suitable with its playing progress rate.
In addition, each node, when receiving the message request of other node initiation, can only select to accept one of them invitation.
S103: this node receives the answer message of all neighbor nodes, whether judgement is set up the required node data of cooperation group and is reached and build group requested number.
If reached, build group requested number, carry out so S104; If reached, do not build group requested number, carry out S105.
S104: set up one and take the cooperation group that this node is major node, and send acknowledge message to the node that is invited to add.
S105: this node sends and joins request to all neighbor nodes.
In joining request, carry the current playing progress rate of this node, if described in join request and accepted by some cooperation groups, this node just can join in this cooperation group.
S200: the major node in cooperation group is determined the data pre-fetching scope of described cooperation group, and according to the data pre-fetching scope generated data task of looking ahead, and regularly described data pre-fetching task is distributed to all nodes in described cooperation group.
In cooperation group, major node needs first according to the probability distribution of random search scope and current playing progress rate (namely play time), determines the scope of prefetch data, comprising: the starting point of prefetch data and the terminal of prefetch data.In addition, when specified data is looked ahead scope, major node also needs to consider the cache size of the cooperation group at its place.
Although exist to play focus, due to user to video content without intellectual, user's random search distance has long-tail characteristic, and meets Weibull probability density function, Weibull the formula of probability density function is as follows:
Wherein: α is form parameter, β is scale parameter, and x is stochastic variable.
According to user's random search, apart from probability-distribution function, as above-mentioned Weibull distribution probability density function, can obtain quantile x corresponding to different probability value
0(quantile is larger, and corresponding cumulative probability value is higher, and random search hit rate is also corresponding higher).Therefore determine rational quantile x by group leader according to the cache size of cooperation group and play time in the present invention
0value, and then the specified data scope of looking ahead, has determined the starting point of prefetch data and the terminal of prefetch data.
In cooperation group, task distribution is completed by major node, after having determined the starting point of prefetch data and the terminal of prefetch data, major node can regularly distribute to all nodes in cooperation group by data pre-fetching task so that cooperation group in all nodes according to the task of its distribution, carry out data pre-fetching.And dividing timing, major node can, by the mode of mean allocation, also can be pro rata distributed according to the ability of each node in cooperation group.
S300: all nodes in cooperation group obtain corresponding data according to distributed data pre-fetching task, and obtained data message is sent to major node.
The data pre-fetching task that node in cooperation group distributes according to major node is obtained data, when obtaining data, first node completes normal data and obtains task, after normal data is obtained task and is completed, as still have idling-resource, here idling-resource refers to the resources such as bandwidth, node storage capacity, has continued the data pre-fetching task of distribution.
Node in cooperation completes after data pre-fetching task, also obtained prefetch data information can be sent to major node, with the prefetch data that facilitates major node to understand in time in cooperation group, obtains situation.
In addition, in the embodiment of the present application, for the method for better the embodiment of the present application being provided hit rate when the random search describes, in the embodiment of the present application, applicant by emulation experiment by the method and existing order look ahead, random forecasting method contrasts, emphasis has compared the Key Performance Indicator of three kinds of methods: the data hit rate of random search.
Fig. 3 is the data hit rate of P2P video on-demand system random search of three kinds of methods under different playout length conditions.In figure, the node buffer memory of looking ahead is 3 data blocks, and cooperation nodal point number is 4.BSLN order of representation forecasting method, RND represents random forecasting method, and COOP represents the application's cooperation forecasting method, and as seen from the figure, the method that the application provides under this experiment condition can obtain obviously higher random search hit rate.
Fig. 4 is the random search hit rate of P2P video on-demand system three kinds of methods under difference is looked ahead cache size condition.Wherein playout length is 450 data blocks, and cooperation nodal point number is 4.As seen from the figure, the method that the application provides under this experiment condition can obtain obviously higher random search hit rate.Particularly, when the buffer memory of looking ahead is larger, performance advantage of the present invention is more obvious, and its search hit rate approaches 1.
Embodiment bis-:
The schematic flow sheet of the P2P video on-demand system cooperation data prefetching method that Fig. 5 provides for the embodiment of the present application two.
In above-described embodiment one, the task of obtaining that all nodes in cooperation group distribute according to major node has got normal data and prefetch data, when the some nodes in cooperation group carry out random search operation, need to search this prefetch data by major node.So execute in example in the application, the method can also comprise:
S400: when the some nodes in described cooperation group carry out random search operation, this node sends request of data to the major node in the cooperation group at its place.
S500: the major node in cooperation group judges whether there are the data corresponding with described request of data in described cooperation group.
If there are the data corresponding with described request of data in cooperation group, carry out S600.
S600: the node information that has the data corresponding with described request of data is sent to the described node that carries out random search operation.
S700: the described node that carries out random search operation obtains the data corresponding with described request of data from corresponding node according to described node information.
Embodiment tri-:
The schematic flow sheet of the P2P video on-demand system cooperation data prefetching method that Fig. 6 provides for the embodiment of the present application three.
In cooperation group, major node obtains task and searches data except distribute data, also needs whole cooperation group to safeguard.In the embodiment of the present application, the method can also comprise:
S801: the major node in described cooperation group periodically sends apply for information to its place group member's node, and judge whether to receive the response message of member's node;
S802: do not receive the response message of member's node when described major node, judge this member's node fails or left this cooperation group;
S803: when described major node receives after the response message of member's node, judge whether the playing progress rate of this member's node and the playing progress rate of major node surpass predetermined threshold value.
If whether the playing progress rate of the playing progress rate of this node and major node surpasses predetermined threshold value, carry out S804.
S804: this member's node is deleted in this cooperation group.
Embodiment tetra-:
The schematic flow sheet of the P2P video on-demand system cooperation data prefetching method that Fig. 7 provides for the embodiment of the present application four.
In embodiment tetra-, mainly described major node in cooperation group the node in cooperation group has been managed, in addition, the maintenance of cooperation group is also comprised to the node quantity that need to guarantee in cooperation group meets and build group requested number, to guarantee the stability of cooperation group.So in the embodiment of the present application, the method can also comprise:
S901: the number of the node described in the major node periodic statistics in described cooperation group in cooperation group.
S902: the major node in described cooperation group judges whether the number of node in described cooperation group is less than the default group requested number of building.
If the number of node is less than the default group requested number of building in described cooperation group, carry out so S903.
S903: the major node in described cooperation group sends message request to neighbor node, to maintain the stable of number of network nodes in described cooperation group.
The above is only the application's preferred implementation, makes those skilled in the art can understand or realize the application.To the multiple modification of these embodiment, will be apparent to one skilled in the art, General Principle as defined herein can be in the situation that do not depart from the application's spirit or scope, realization in other embodiments.Therefore, the application's claim will be not limited to these embodiment shown in this document, but comprises and meet the maximum magnitude consistent with the disclosed principle of this document and features of novelty.
Claims (9)
1. a reciprocity P2P video on-demand system cooperation data prefetching method, is characterized in that, comprises the following steps:
When a node join is after P2P video on-demand system, this node is set up one and be take its cooperation group that is major node or join in a cooperation group of having set up, described cooperation group comprises a major node and several member's nodes, and the gap of the playing progress rate of the playing progress rate of major node and member's node is in predetermined threshold value;
Major node in described cooperation group is determined the data pre-fetching scope of described cooperation group according to the probability distribution of random search scope and current playing progress rate, and according to the described data pre-fetching scope generated data task of looking ahead, and regularly described data pre-fetching task is distributed to all nodes in described cooperation group;
All nodes in described cooperation group obtain corresponding data according to distributed data pre-fetching task, and obtained data message is sent to major node.
2. method according to claim 1, is characterized in that, when a node join is after P2P video on-demand system, take this node as major node set up a cooperation group or by this node join to what newly add in the cooperation group of having set up, be specially:
When a node join is after P2P video on-demand system, whether this node regularly detects in some cooperation groups;
If not, this node will send the message request of setting up a cooperation group to all neighbor nodes, carry the current playing progress rate of this node in described message request;
This node receives the answer message of all neighbor nodes, and whether judgement is set up the required node data of cooperation group and reached and build group requested number;
If so, set up one and take the cooperation group that this node is major node, and send acknowledge message to the node that is invited to add; If not, this node sends and joins request to all neighbor nodes, described in carry the current playing progress rate of this node in joining request, if described in join request and accepted by some cooperation groups, this node join is in this cooperation group.
3. method according to claim 1, is characterized in that, the major node in described cooperation group determines that the data pre-fetching scope of described cooperation group is specially:
Major node in described cooperation group is according to the cache size of the cooperation group at its place and current play time, utilizes user's random search to carry out the specified data scope of looking ahead apart from probability-distribution function.
4. method according to claim 1, is characterized in that, the major node in described cooperation group is regularly distributed to described data acquisition task all nodes in described cooperation group, is specially:
Major node in described cooperation group is regularly averagely allocated to described data acquisition task all nodes in described cooperation group, or in proportion described data acquisition task is distributed to all nodes in described cooperation group according to the ability of each node in cooperation group.
5. method according to claim 1, is characterized in that, all nodes in described cooperation group obtain corresponding data according to distributed data pre-fetching task, are specially:
All nodes in described cooperation group are carried out its normal data separately and are obtained task;
After described normal data is obtained task and completed, all nodes in described cooperation group judge whether it has unnecessary bandwidth and storage capacity;
If so, all nodes in described cooperation group are carried out the prefetch datas task of looking ahead.
6. method according to claim 1, is characterized in that, further comprises:
When the some nodes in described cooperation group carry out random search operation, this node sends request of data to the major node in the cooperation group at its place;
Major node in described cooperation group judges in described cooperation group whether have the data corresponding with described request of data, if so, the node information that has the data corresponding with described request of data is sent to the described node that carries out random search operation;
The described node that carries out random search operation obtains the data corresponding with described request of data from corresponding node according to described node information.
7. method according to claim 6, is characterized in that, the some nodes in described cooperation group carry out random search when operation, before sending request of data, also comprises to the major node in the cooperation group at its place:
The node that carries out random search operation judges in the buffer memory of its node whether have corresponding data, if so, from its inter-node buffer memory, obtains corresponding data; If not, to the major node in the cooperation group at its place, send request of data.
8. according to the method described in claim 1 or 6, it is characterized in that, further comprise:
Major node in described cooperation group periodically sends apply for information to its place group member's node, and receives the response message of member's node;
When described major node, do not receive the response message of node, judge this member's node fails or left this cooperation group;
When described major node receives after the response message of member's node, judge that whether the playing progress rate of this member's node and the playing progress rate of major node surpass predetermined threshold value, if so, delete this member's node in this cooperation group.
9. according to the method described in claim 1 or 6, it is characterized in that, further comprise:
The number of the node described in the major node periodic statistics in described cooperation group in cooperation group;
Major node in described cooperation group judges whether the number of node in described cooperation group is less than the default group requested number of building, and if so, the major node in described cooperation group sends message request to neighbor node, to maintain the stable of number of network nodes in described cooperation group.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110342410.0A CN102447974B (en) | 2011-11-03 | 2011-11-03 | Method for prefetching cooperation data of P2P (peer-to-peer) video-on-demand system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110342410.0A CN102447974B (en) | 2011-11-03 | 2011-11-03 | Method for prefetching cooperation data of P2P (peer-to-peer) video-on-demand system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102447974A CN102447974A (en) | 2012-05-09 |
| CN102447974B true CN102447974B (en) | 2014-04-09 |
Family
ID=46009983
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110342410.0A Expired - Fee Related CN102447974B (en) | 2011-11-03 | 2011-11-03 | Method for prefetching cooperation data of P2P (peer-to-peer) video-on-demand system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102447974B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104660649A (en) * | 2013-11-25 | 2015-05-27 | 乐视网信息技术（北京）股份有限公司 | Method, terminal and system for terminal transmission data in P2P system |
| CN110248239B (en) * | 2019-06-24 | 2021-07-23 | 北京奇艺世纪科技有限公司 | Video content downloading method and device |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101005606A (en) * | 2006-12-31 | 2007-07-25 | 华为技术有限公司 | Method and device for reducing medium playing delay |
| CN101072359A (en) * | 2007-05-18 | 2007-11-14 | 腾讯科技（深圳）有限公司 | Method, system and user end for realizing network media audio-video synchronization |
| CN101448139A (en) * | 2009-01-08 | 2009-06-03 | 中国科学院计算技术研究所 | A P2P network based digital media program order method |
| CN101626304A (en) * | 2008-07-11 | 2010-01-13 | 宝利微电子系统控股公司 | Method for realizing multimedia instant play under P2P protocol and device thereof |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101631092A (en) * | 2008-07-18 | 2010-01-20 | 株式会社日立制作所 | System and method for distributing data |
-
2011
- 2011-11-03 CN CN201110342410.0A patent/CN102447974B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101005606A (en) * | 2006-12-31 | 2007-07-25 | 华为技术有限公司 | Method and device for reducing medium playing delay |
| CN101072359A (en) * | 2007-05-18 | 2007-11-14 | 腾讯科技（深圳）有限公司 | Method, system and user end for realizing network media audio-video synchronization |
| CN101626304A (en) * | 2008-07-11 | 2010-01-13 | 宝利微电子系统控股公司 | Method for realizing multimedia instant play under P2P protocol and device thereof |
| CN101448139A (en) * | 2009-01-08 | 2009-06-03 | 中国科学院计算技术研究所 | A P2P network based digital media program order method |
Non-Patent Citations (3)
| Title |
|---|
| COOCHING:Cooperative Prefetching Strategy for P2P Video-on-Demand System;Ubaid Abbasi et al.;《Wired-Wirele Multimedia Network and Services Management Lecture Notes in Computer Science》;20091231;第198页，图2 * |
| 基于同步会话管理机制的P2PVoD系统研究与设计;戚敬哲，等;《计算机应用与软件》;20110731;第28卷(第7期);第109页 * |
| 基于用户行为特征的P2P视频点播系统数据预取机制;王娟，等;《小型微型计算机系统》;20101031;第31卷(第10期);第2050页右栏，第2051页右栏 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102447974A (en) | 2012-05-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102202050B (en) | Intended response pre-cached | |
| US8078729B2 (en) | Media streaming with online caching and peer-to-peer forwarding | |
| JP5934636B2 (en) | Streaming data download method and computer-readable recording medium | |
| JP5505009B2 (en) | COMMUNICATION TERMINAL DEVICE, COMPUTER PROGRAM, AND CONTENT SEARCH METHOD | |
| CN101645888B (en) | Data distribution method based on access frequency variable-length logic section | |
| CN101543019A (en) | Contribution aware peer-to-peer live streaming service | |
| CN103370709A (en) | A cache manager for segmented multimedia and corresponding method for cache management | |
| CN109348264B (en) | Video resource sharing method and device, storage medium and electronic equipment | |
| Shen et al. | SocialTube: P2P-assisted video sharing in online social networks | |
| CN104822068A (en) | Streaming media proxy cache replacing method and device | |
| CN105049326A (en) | Social content caching method in edge network area | |
| CN102447974B (en) | Method for prefetching cooperation data of P2P (peer-to-peer) video-on-demand system | |
| Xu et al. | Exploring the policy selection of the P2P VoD system: A simulation-based research | |
| CN102546230B (en) | Overlay-network topological optimization method in P2P (Peer-To-Peer) streaming media system | |
| Pleşca et al. | Multimedia prefetching with optimal Markovian policies | |
| Wu et al. | On incentivizing upload capacity in P2P-VoD systems: Design, analysis and evaluation | |
| CN108881943A (en) | Based on the nodal cache replacement method of superseded index in P2P demand stream media system | |
| Wu et al. | Incentivizing upload capacity in P2P-VoD systems: a game theoretic analysis | |
| CN103179191A (en) | P2P (peer to peer) network control device and P2P network control architecture | |
| Choi et al. | Intelligent Caching for Seamless High-Quality Streaming in Vehicular Networks: A Multi-Agent Reinforcement Learning Approach | |
| Rocha et al. | On client interactive behaviour to design peer selection policies for BitTorrent-like protocols | |
| Xu et al. | Prediction-based prefetching to support VCR-like operations in gossip-based P2P VoD systems | |
| Hu et al. | Towards efficient video chunk dissemination in peer-to-peer live streaming | |
| Wu et al. | Headlight prefetching for mobile media streaming | |
| CN101436946A (en) | Method for scheduling data request in peer-to-peer sharing network |
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: 20140409 Termination date: 20161103 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |