CN102307218A - Stream media data request transmission method for multimedia telephone peer-to-peer (P2P) video-on-demand - Google Patents
Stream media data request transmission method for multimedia telephone peer-to-peer (P2P) video-on-demand Download PDFInfo
- Publication number
- CN102307218A CN102307218A CN201110063443A CN201110063443A CN102307218A CN 102307218 A CN102307218 A CN 102307218A CN 201110063443 A CN201110063443 A CN 201110063443A CN 201110063443 A CN201110063443 A CN 201110063443A CN 102307218 A CN102307218 A CN 102307218A
- Authority
- CN
- China
- Prior art keywords
- data
- back end
- request
- node
- transmission method
- 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
- 230000005540 biological transmission Effects 0.000 title claims abstract description 74
- 238000000034 method Methods 0.000 title claims abstract description 38
- 230000009467 reduction Effects 0.000 claims abstract description 5
- 238000005457 optimization Methods 0.000 claims description 5
- 230000008569 process Effects 0.000 claims description 5
- 238000012546 transfer Methods 0.000 claims description 5
- 241001269238 Data Species 0.000 claims description 4
- 230000007812 deficiency Effects 0.000 claims description 3
- 238000012360 testing method Methods 0.000 claims description 2
- GUGNSJAORJLKGP-UHFFFAOYSA-K sodium 8-methoxypyrene-1,3,6-trisulfonate Chemical compound [Na+].[Na+].[Na+].C1=C2C(OC)=CC(S([O-])(=O)=O)=C(C=C3)C2=C2C3=C(S([O-])(=O)=O)C=C(S([O-])(=O)=O)C2=C1 GUGNSJAORJLKGP-UHFFFAOYSA-K 0.000 claims 1
- 230000007246 mechanism Effects 0.000 abstract description 3
- 230000004044 response Effects 0.000 abstract description 2
- 230000002950 deficient Effects 0.000 abstract 1
- 238000005516 engineering process Methods 0.000 description 5
- 238000011084 recovery Methods 0.000 description 3
- 230000003139 buffering effect Effects 0.000 description 2
- 230000008859 change Effects 0.000 description 2
- 230000001934 delay Effects 0.000 description 2
- 239000000203 mixture Substances 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 239000012636 effector Substances 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000007689 inspection Methods 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 230000001902 propagating effect Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000012216 screening Methods 0.000 description 1
- 238000009331 sowing Methods 0.000 description 1
Images
Landscapes
- Telephonic Communication Services (AREA)
- Information Transfer Between Computers (AREA)
- Two-Way Televisions, Distribution Of Moving Picture Or The Like (AREA)
Abstract
The invention relates to a stream media data request transmission method for multimedia telephone peer-to-peer (P2P) video-on-demand. A combination of one or more of a node marking mechanism, a safety zone compensation strategy and a data request scheduling strategy is adopted, wherein the node marking mechanism marks corresponding nodes according to a response of P2P data nodes to a data request and acquires data from a high-quality P2P data node; the safety zone compensation strategy pre-detects a data insufficient situation in a buffer zone and supplies sufficient buffer data to data reduction playback by quickly downloading deficient data blocks to a content delivery network (CDN) server; and the data request scheduling strategy schedules a data transmission rate and a data block requesting sequence among data transmission channels established between a user node and the various P2P data nodes so as to acquire a minimum data transmission delay. By adopting the stream media data request transmission method, even a stream media data quantity is larger, continuous and smooth playback of stream media can be realized; and the stream media data request transmission method is economic and convenient and has a wide application prospect.
Description
Technical field
The present invention relates to a kind of streaming media on demand technology, be specifically related to a kind of stream medium data request transmission method of the P2P program request of on mediaphone, adopting, belong to P2P network flow-medium technical field.
Background technology
Along with Development of Multimedia Technology; Mediaphone is progressively getting into average family; Mediaphone has comprised the existing function of general intelligence telephone set; Generally have network interface; Can accomplish functions such as website browsing, information interaction, media play, realize that on mediaphone streaming media on demand is one of main value-added service application of mediaphone.
Along with the application of Streaming Media is more and more universal, more and more higher to the bandwidth resources requirement, and require service time also more and more longer, traditional server/client (S/C) can not satisfy the requirement of enhanced scalability and high availability.In recent years, the research community and industry to propose a variety of solutions, the more important are content distribution network (Content Delivery Network CDN) and IP broadcast (IP Multicast), however, a common feature of these solutions is the need for specialized hardware support: for example CDN need to deploy multiple CDN servers worldwide through collaborative work between servers, distribution of multimedia data, but with the growing demand of users, we need to continue to increase the number of servers, the workload is constantly increase, and it is difficult to ensure smooth playback of multimedia data; while IP broadcast is need to modify the current Internet routing mechanism, widely deployed to support the broadcast function router.So not only costly, and be difficult to be widely used.
Adopting the P2P transmission technology is a kind of comparatively feasible solution; The P2P transmission technology has broken through traditional customer end/server mode; Stress " equity " between the node; Make the service ability of P2P system can natural increase with growth of requirement; Extensibility with " inherent " can solve the problem of server overload and resource bottleneck in the traditional client/server structure.
The P2P node is the basic composition part of P2P network; Because the internodal upload bandwidth of P2P has nothing in common with each other; How to carry out request of data and how control data transmission; Determined transmission of flow media data speed; Affect the multimedia data playback quality; For the Streaming Media application demand that meets the demands and improve day by day, need a kind of smooth request of data transfer control method of playing of P2P point broadcasting flow-medium Continuous Flow that can guarantee efficiently.
Summary of the invention
To achieve these goals; The invention provides a kind of stream medium data request transmission method of more economic mediaphone P2P program request; This method can guarantee on multimedia telephone terminal, to carry out continuous, the smooth playing of P2P point Streaming Media sowing time, and easy to implement and popularization.
Main technical schemes of the present invention is:
The stream medium data request transmission method of a kind of mediaphone P2P program request is marked to the P2P back end through setting up the node scoring, obtains data from the P2P back end of high-quality.
Said node scoring adopts the combination of following any one marking mode or two kinds of marking modes to mark; With the high node of score value is the high-quality node: (1) user node sends request of data to the P2P back end; If data integrity returns; Then give this node bonus point; If data are returned imperfect or do not returned, subtract branch then for this node; (2) user node sends request of data to the P2P back end, if data are returned and do not exceeded the scheduled time, then gives this node bonus point, if data are returned and exceeded the said scheduled time or do not had data to return, subtracts branch then for this node and perhaps gives minimum branch.
Said node scoring can also comprise regular check P2P back end quality and number of nodes, for the node quality, if find that P2P back end inferior is then with new P2P back end replacement P2P back end inferior; For number of nodes, if the quantity of said P2P back end can not satisfy the needs of transfer of data, then the P2P back end that please look for novelty to index server.
The stream medium data request transmission method of said mediaphone P2P program request also preferably adopts the safety zone compensation policy when data download; Detect the not enough situation of buffer data in advance; Through to the quick-downloading data block that lacks of CDN content server, playing for reduction of data provides enough buffered datas.
In the concrete operations of said safety zone compensation policy; Safety zone of preferred definition is as the benchmark of judging that buffer data is whether enough; It is the dynamic data set that a certain amount of consecutive data block of arranging by playing sequence of starting point is formed with current broadcast point that said safety zone is one; The size of said safety zone is confirmed according to the stream medium data code check; If buffer data lacks the application data in the said safety zone, then be judged as data deficiencies.
The particular content of said safety zone compensation policy is: after request program begins; Earlier obtain the pairing total data in said safety zone from the CDN content server; Begin play stream media data then; And begin to obtain data from the P2P back end; When buffer data is not enough to cover said safety zone; Obtain data fast from the CDN content server, can cover said safety zone until buffer data.
The stream medium data request transmission method of said mediaphone P2P program request also preferably include adopt the request of data scheduling strategy between the data transmission channel of setting up between said user node and each P2P back end schedule data transmission speed and data block request order with acquisition minimal data transmission delay.
The particular content of said request of data scheduling strategy can be: said user node is according to the nodal information of each P2P back end; Minimum data transmission delay to obtain said user node can be play continuously is an optimization aim; Calculate the data block transmission sequence that each P2P back end is distributed; Said user node notifies each P2P back end corresponding multi-medium data sequence respectively, said each P2P back end according to the data sequence of being asked to said user node transport stream media data.
The invention has the beneficial effects as follows:
(1) through adopting the node scoring; Make user node in time also grasp quality and the quantity situation and the situation of change thereof of P2P back end fully; To select high-quality node wherein, the data transmission channel of abandoning node inferior and safeguarding fair amount more accurately and efficiently, help improving the transmission rate and the transmission quality of Streaming Media.
(2) owing to adopt the safety zone compensation policy; Promptly carry out buffered data planning; Detect the not enough situation of buffer data in advance; In time find in time to report to the police; And in time to the quick-downloading data block that lacks of CDN content server; Thereby realized the intellectuality compensation of data, the assurance on the data volume is provided for realizing that smooth reduction is play.
(3) owing to be employed in the data dispatch strategy between a plurality of data transmission channels; Be optimization aim promptly with the minimum data transmission delay that obtains said user node can be play continuously; Calculate the order of transmission of the data block of listing each P2P back end side by side; The different transmission delays that cause of transmission sequence have been reduced to greatest extent with playing sequence because of data block in each back end upload bandwidth difference, a plurality of data transmission channels; Avoid lacking data and cause the not smooth and data redundancy download of picture, further guaranteed the low delay smooth playing of Streaming Media.
Description of drawings
Fig. 1 is node scoring screening process figure of the present invention;
Fig. 2 is order program data downloading process figure of the present invention.
Embodiment
For method of the present invention is described; At first introduce applied network of the present invention and composition thereof; Corresponding network is a P2P program request transmission of flow media data network; Order program data is to be unit of transfer with the data block; Order program data is divided into different data blocks; With the form of serial number it is numbered again, in the P2P network, transmit data, and data are reduced broadcast through the mode of data block numbering.This network is made up of following module: 1) index server (Index Server): be the effector of P2P program request network, manage based on the node under the program request file; 2) CDN content server (CDN Content Server): be the supplier of P2P data source of stream media, the stream medium data of propagating in the program request network is provided by the CDN content server at first; 3) P2P node (P2P Node): the basic role in the P2P network; Each is participated in node and has two kinds of identity of server and client side concurrently; Also service is provided in the resource on utilizing other nodes for other nodes; From whole P2P program request network; Multimedia telephone terminal of the present invention also belongs to the P2P node; Method of the present invention is described for ease; Multimedia telephone terminal with the program request flow-medium performance is called user node hereinafter, provides other nodes of service to be called the P2P back end with can be it.
The invention provides the stream medium data request transmission method of a kind of mediaphone P2P program request, in Streaming Media request and transmission course, adopted one or more the combination in node scoring, safety zone compensation policy and the request of data scheduling strategy.
Said node scoring is promptly marked to corresponding P2P back end to data request responding situation according to the P2P back end, obtains data from the P2P back end of Network Transmission attribute high-quality.
Preferably the Network Transmission attribute with the P2P back end is the index of high-quality or node inferior as estimating the P2P back end; The score value standard can artificially be confirmed; As best result being made as 20 minutes; Minimum being divided into 0 fen; The response speed of high more this node of representative of mark is fast more; Quality is good more, and the Network Transmission attribute is excellent more.
As shown in Figure 1; When user node R starting point broadcasting flow-medium program; Earlier land registration to index server; And the P2P back end tabulation (referring to the Step1 of Fig. 1) of inquiry institute request program; Preserve the P2P back end tabulation N1 that said index server returns then; N2; ...; Ni (i is a natural number); And give initial score to the P2P back end that is adopted according to the node scoring; Preferably give identical initial score; As give initial branch and be 10 fens, also can give initial score to each P2P back end in the said P2P back end tabulation.
Step2 referring to Fig. 1; User node can be marked according to the combination of following any one marking mode or two kinds of marking modes; With the high node of score value is the high-quality node: (1) user node sends request of data to the P2P back end; If data integrity returns; Then give this node bonus point; If data are returned imperfect or do not returned, subtract branch or give minimum branch then for this node; (2) user node sends request of data to the P2P back end, if data are returned and do not exceeded the scheduled time, then gives this node bonus point, if data are returned and exceeded the said scheduled time or do not had data to return, subtracts branch then for this node and perhaps gives minimum branch.
About the choice criteria of said high-quality node, both can be that the node of selecting score value to be higher than set point is the high-quality node, also can be according to the transmission needs, selecting score value the highest relative part of nodes is the high-quality node.
Said node scoring can also comprise regular check P2P back end quality and number of nodes.About the node quality examination; If find P2P back end inferior; Like the minimum P2P back end of the minimum relatively or absolute score value of mark; Then with new P2P back end replacement P2P back end (like the Step3 of Fig. 1) inferior; In time abandon P2P back end inferior; Regular check can be carried out to P2P back end timing heartbeat through user node, and each inspection all carries out taking turns marking, then according to the definite node that possibly be replaced of the appraisal result of epicycle; Check about number of nodes; If the quantity of said P2P back end can not satisfy the needs of transfer of data; As as described in the data volume of the received consecutive data block of user node less than the data volume of the data block of required broadcast, then the P2P back end that please look for novelty to index server (like the Step4 of Fig. 1).
Said safety zone compensation policy is promptly realized the data security regional planning, detects the not enough situation of buffer data in advance, through to the quick-downloading data block that lacks of CDN content server, thereby provides enough buffered datas to play to realize smooth reduction of data.
Said safety zone compensation policy can be realized the not enough security alarm of data buffering, accomplishes the data intelligence compensation.As shown in Figure 2; For guaranteeing enough buffered datas; Define a safety zone as the benchmark of judging that buffer data is whether enough; It is the dynamic data set that a certain amount of consecutive data block of arranging by playing sequence of starting point is formed with current broadcast point that said safety zone is one, and the size of said safety zone is preferably confirmed according to the stream medium data code check.Along with the carrying out of playing, the pairing consecutive data block in said safety zone is dynamic change.
If buffer data lacks the application data in the said safety zone, then be judged as data deficiencies.
The particular content of said safety zone compensation policy is: after request program begins; Earlier obtain the pairing total data in said safety zone from CDN content server (being the supplier in multi-medium data source); Promptly possess the primary data of some, thereby guarantee to start apace broadcast.Begin play stream media data then; And begin to obtain data from the P2P back end; When buffer data is not enough to cover said safety zone; When promptly also lacking shown in Figure 2 urgent download area relative data with respect to buffering area; Obtain data fast from the CDN content server; Can cover said safety zone until buffer data, promptly get access to said urgent download area relative total data.So circulation is till request program plays.
When preferably the speed of downloading when the P2P data is less than the code check of Streaming Media, judge that then buffer data is not enough to cover said safety zone.
Said request of data scheduling strategy; Promptly, make said user node can play the flow-medium performance of institute's program request continuously with the minimal data transmission delay through schedule data transmission speed and data block request order between each data transmission channel of setting up between user node and each P2P back end.
Said user node receives a plurality of P2P back end usually simultaneously and is its data that provide; Promptly have a plurality of different data transmission channels simultaneously; And the upload bandwidth between these P2P back end has nothing in common with each other; And the transmission sequence of data block is different with playing sequence in above-mentioned a plurality of data transmission channel, has therefore produced various possible transmission delays.
The particular content of said request of data scheduling strategy is: said user node is according to the nodal information of each P2P back end; Minimum data transmission delay to obtain said user node can be play continuously is an optimization aim; Calculate the data block transmission sequence that each P2P back end is distributed; Said user node notifies each P2P back end corresponding multi-medium data sequence respectively, said each P2P back end according to the data sequence of being asked to said user node transport stream media data.
Hereinafter combine formula to further specify the specific algorithm of said request of data scheduling strategy; At first represent said user node with R; With S1, S2 ..., Si (i is a natural number) representes each said P2P back end; Represent current order program data piece with D; And definition Bu (Si) for P2P back end Si altogether upload bandwidth, definition Bu (Si, R) for the time of running Si to the transmission rate of R; Wherein Bu (Si, R)≤Bu (Si).
The formalized description of said algorithm is: user node R according to Bu (Si, the distribution of value determination data piece R), and dynamically adjust Bu (Si, value R) is specially:
At first, through speed measuring module, test Si to the transmission rate Bu of the Si of R (Si, R), as Bu (Si, initial value R).
Then, select Si, the current data downloaded piece D that wants is distributed to Si, concrete grammar is: take out the current data downloaded piece D that wants, (Si, the corresponding Si of value descending R) selects the Si on making number one, and data block D is distributed to this Si according to Bu.After the task is assigned to Si, Si can continue to provide services to the ability to reduce the R, so to update Bu (Si, R) value, update method for the use of
value as Bu (Si, R) the new value, and then update after Bu (Si, R) the value of the input data block allocation under a sorting process before selecting the next one as the target selection data block allocation basis, to elect the next one in the first row of Si.
For example, in the first row of the current round of P2P data node is S3, then assign tasks to S3, the later, S3 can continue to provide services to the ability of R to be reduced, so you want to update Bu (S3, R) value, update methods for the use of
value as Bu (S3, R) of the new value, and then the updated Bu (S3, R) into the next round of sorting the values , and so on, the above formula,
Size (D) is the byte number of D;
Size (Header) is the byte number in the packet header of P2P packet;
T (D) is that the deadline is downloaded in the expection of D;
T is for beginning download time.
Bu (Si, preferably, can also adjust according to the actual download situation of data block D except that needs upgrade by value R).When the block after the download is complete, the first recovery Bu (Si, R) values, the alleged recovery Bu (Si, R) refers to the value of the current Bu (Si, R) the new value, increasing due to download data block D while reducing the transmission rate
node in the P2P data only the data block D Si download task, the equivalent to the initial value and the value after this recovery adjusted specific adjustment method can be one of the following two methods:
(a) if before the deadline is downloaded in the expection of D, D downloads from Si and accomplishes, and illustrates that Si can provide the enough big bandwidth of uploading to R, makes full use of the bandwidth of uploading of Si during for download later on, attempts increasing Bu (Si, value R).Owing to do not know the definite value of uploading bandwidth that Si can provide to R, so cannot increase too much, take the strategy of finely tuning, increase Bu (Si, value R) by a small margin; If D does not in time download and obtains, illustrate so Bu (Si, actual value R) is littler than the value of previous guess, (Si, value R) increases or the amount that reduces can be confirmed according to experience need to reduce Bu.
(b) can also be calculated Bu (Si, R) of the current actual value:
and use the current actual value as Bu (Si, R) the new value, and then sorted according to the new value to assign tasks to determine the next one to which P2P data nodes.Provide the P2P back end of less service ability should not distribute too many task to R, (Si, value R) is adjusted to its Bu preferably to adopt method (b).In this case, can directly be that ((Si, value R) is again with the actual value assignment and need not to recover Bu earlier for Si, R) assignment for Bu with the actual value.
Use above-mentioned request of data dispatching algorithm; On user node R; After calculating data that each P2P back end distributed and send sequence according to the nodal information in the set of movable P2P back end; User node R notifies the P2P back end corresponding media data sequence respectively, and the corresponding sequence number of P2P back end basis is to user node R transport stream media data.Owing to be to be that the optimization aim established data is sent sequence to obtain the minimal data transmission delay; Therefore each P2P back end sends data according to the order of this data transmission sequence defined to user node R; Can obtain minimum transmission delay; Data have been avoided lacking; Also avoided the data redundancy download; Even when the stream medium data amount is big, also can more accurately, intactly download required data, further guarantee the smooth playing of Streaming Media.
Adopt said node scoring, safety zone compensation policy and request of data scheduling strategy simultaneously, can reach best stream medium data request laser propagation effect.After landing successfully to index server; Before the beginning request msg; Earlier obtain primary data fast from the CDN content server according to the safety zone compensation policy; Thereby guarantee to start apace broadcast; Request program begins to play then; And begin to P2P node request msg; Begun the node scoring simultaneously; And according to each appraisal result of taking turns adjust at any time request of data next time towards the P2P back end; Always obtain data from the P2P back end of high-quality with assurance, the Network Transmission quality provides basic guarantee in order to keep preferably.When while playing during from P2P back end request msg; According to the request of data scheduling strategy; Schedule data transmission speed and data block order between the data transmission channel of in the target data node queue of each request msg, being set up are with the minimal propagation delay that realizes playing continuously.In downloading the process of playing on the limit,, realized timely, the intelligent compensation of buffered data in case when finding that buffered data is not enough, just obtain data fast to the CDN content server.
Certainly, realize that a most important condition of broadcasting flow-medium smooth playing is to guarantee that the network download bandwidth of said user node must be greater than or equal to the code check in order program data source.
Claims (11)
1. the stream medium data request transmission method of mediaphone P2P program request is characterized in that through setting up the node scoring P2P back end being marked, and obtains data from the P2P back end of high-quality.
2. the stream medium data request transmission method of mediaphone P2P as claimed in claim 1 program request; It is characterized in that said node scoring adopts the combination of following any one marking mode or two kinds of marking modes to mark, is the high-quality node with the high node of score value:
(1) user node sends request of data to the P2P back end, if data integrity returns, then gives this node bonus point, if data are returned imperfect or do not returned, subtracts branch then for this node;
(2) user node sends request of data to the P2P back end, if data are returned and do not exceeded the scheduled time, then gives this node bonus point, if data are returned and exceeded the said scheduled time or do not had data to return, subtracts branch then for this node and perhaps gives minimum branch.
3. the stream medium data request transmission method of mediaphone P2P as claimed in claim 2 program request; It is characterized in that said node scoring also comprises regular check P2P back end quality and number of nodes, if find that P2P back end inferior is then with new P2P back end replacement P2P back end inferior; If the quantity of said P2P back end can not satisfy the needs of transfer of data, then the P2P back end that please look for novelty to index server.
4. the stream medium data request transmission method of mediaphone P2P as claimed in claim 3 program request; When it is characterized in that program request begins; Said user node is inquired about the P2P back end tabulation of institute's request program earlier to said index server; Preserve the P2P back end tabulation that said index server returns then, and give equal initial score the P2P back end that is adopted.
5. like the stream medium data request transmission method of claim 1,2,3 or 4 described mediaphone P2P program requests; Adopt the safety zone compensation policy when it is characterized in that data download; Detect the not enough situation of buffer data in advance; Through to the quick-downloading data block that lacks of CDN content server, playing for reduction of data provides enough buffered datas.
6. the stream medium data request transmission method of mediaphone P2P as claimed in claim 5 program request; It is characterized in that defining a safety zone as the benchmark of judging that buffer data is whether enough; It is the dynamic data set that a certain amount of consecutive data block of arranging by playing sequence of starting point is formed with current broadcast point that said safety zone is one; The size of said safety zone is confirmed according to the stream medium data code check; If buffer data lacks and in the said safety zone data should be arranged, then be judged as data deficiencies.
7. the stream medium data request transmission method of mediaphone P2P as claimed in claim 6 program request; The particular content that it is characterized in that said safety zone compensation policy is: after request program begins; Earlier obtain the pairing total data in said safety zone from the CDN content server; Begin play stream media data then; And begin to obtain data from the P2P back end; When buffer data is not enough to cover said safety zone; Obtain data fast from the CDN content server, can cover said safety zone until buffer data.
8. the stream medium data request transmission method of mediaphone P2P as claimed in claim 7 program request, the speed that it is characterized in that downloading when the P2P data judge that then buffer data is not enough to cover said safety zone during less than the code check of Streaming Media.
9. the stream medium data request transmission method of mediaphone P2P as claimed in claim 8 program request; It is characterized in that adopting the request of data scheduling strategy between the data transmission channel of setting up between said user node and each P2P back end schedule data transmission speed and data block request order to obtain the minimal data transmission delay; Its particular content is: said user node is according to the nodal information of each P2P back end; Minimum data transmission delay to obtain said user node can be play continuously is an optimization aim; Calculate the data block transmission sequence that each P2P back end is distributed; Said user node notifies each P2P back end corresponding multi-medium data sequence respectively, said each P2P back end according to the data sequence of being asked to said user node MPTS media data.
10. the stream medium data request transmission method of mediaphone P2P as claimed in claim 9 program request is characterized in that definite process of said data block transmission sequence is:
(1) through speed measuring module, tests transmission rate Bu (Si, R) the initial value of each P2P back end Si to user node R;
(2) in accordance with Bu (Si, R) values in descending order corresponding Si, elected in the first row on the Si, sends the data block D tasks assigned to Si, tasks are assigned to Si after updating its Bu ( Si, R) value, update methods for the use of
value as Bu (Si, R) of the new value, and then the updated Bu (Si, R) into the next round of sorting the values and by Select sort results performed under a P2P data node sending tasks, and so on, in the above formula Size (D) is the number of bytes D, Size (Header) for the P2P packet header bytes, T ( D) is expected to download completion time of D, T is the time to start the download.
As claimed in claim 10, wherein the P2P multimedia phones demand streaming media data request transmission method, wherein when the data block is downloaded, according to the actual download of the data block D be adjusted, the specific mode is restored first Bu (Si, R) value, then the value of this adjustment, adjustment method is as follows (a), (b) in one of two ways: (a) if the D time prior to the expected downloaded from Si download D completed, increasing Bu (Si, R) value, if D does not promptly downloaded, reducing Bu (Si, R) values ; (b) calculate the Bu (Si, R) of the current actual value
and as Bu (Si, R) adjusting the new values.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110063443.1A CN102307218B (en) | 2011-03-15 | 2011-03-15 | Stream media data request transmission method for multimedia telephone peer-to-peer (P2P) video-on-demand |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110063443.1A CN102307218B (en) | 2011-03-15 | 2011-03-15 | Stream media data request transmission method for multimedia telephone peer-to-peer (P2P) video-on-demand |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102307218A true CN102307218A (en) | 2012-01-04 |
| CN102307218B CN102307218B (en) | 2014-04-16 |
Family
ID=45381022
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110063443.1A Expired - Fee Related CN102307218B (en) | 2011-03-15 | 2011-03-15 | Stream media data request transmission method for multimedia telephone peer-to-peer (P2P) video-on-demand |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102307218B (en) |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105847437A (en) * | 2016-05-26 | 2016-08-10 | 北京科技大学 | Data transmission method |
| CN105872764A (en) * | 2015-12-21 | 2016-08-17 | 乐视云计算有限公司 | Data downloading method and device based on P2P (Peer-to-Peer) network |
| WO2016209174A1 (en) * | 2015-06-26 | 2016-12-29 | Onwards Media Group Pte. Ltd. | Method and apparatus for streaming media |
| CN108174306A (en) * | 2017-12-28 | 2018-06-15 | 北京安云世纪科技有限公司 | A kind of multi-medium data loading method and terminal |
| CN109151041A (en) * | 2018-09-06 | 2019-01-04 | 网宿科技股份有限公司 | A kind of method of adjustment and device monitoring node |
| CN109218133A (en) * | 2018-09-27 | 2019-01-15 | 深圳市网心科技有限公司 | Network speed testing system, method, apparatus and computer readable storage medium |
| CN109495568A (en) * | 2018-11-19 | 2019-03-19 | 北京金山云网络技术有限公司 | A kind of data capture method, data acquisition facility, server and storage medium |
| CN110545450A (en) * | 2019-09-09 | 2019-12-06 | 深圳市网心科技有限公司 | Node distribution method, system, electronic equipment and storage medium |
| US11785075B2 (en) | 2021-02-20 | 2023-10-10 | Wangsu Science & Technology Co., Ltd. | Method for requesting resources and terminal |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060190615A1 (en) * | 2005-01-21 | 2006-08-24 | Panwar Shivendra S | On demand peer-to-peer video streaming with multiple description coding |
| US20090034434A1 (en) * | 2007-07-31 | 2009-02-05 | The Hong Kong University Of Science And Technology | Interior-Node-Disjoint Multi-Tree Topology Formation |
| CN101588468A (en) * | 2008-05-20 | 2009-11-25 | 华为技术有限公司 | A kind of media playing method, device and system based on P2P |
| CN101959054A (en) * | 2009-07-14 | 2011-01-26 | 中国电信股份有限公司 | Integrated P2P (Peer-To-Peer) VOD (Video-On-Demand) system and partner node selecting method |
-
2011
- 2011-03-15 CN CN201110063443.1A patent/CN102307218B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060190615A1 (en) * | 2005-01-21 | 2006-08-24 | Panwar Shivendra S | On demand peer-to-peer video streaming with multiple description coding |
| US20090034434A1 (en) * | 2007-07-31 | 2009-02-05 | The Hong Kong University Of Science And Technology | Interior-Node-Disjoint Multi-Tree Topology Formation |
| CN101588468A (en) * | 2008-05-20 | 2009-11-25 | 华为技术有限公司 | A kind of media playing method, device and system based on P2P |
| CN101959054A (en) * | 2009-07-14 | 2011-01-26 | 中国电信股份有限公司 | Integrated P2P (Peer-To-Peer) VOD (Video-On-Demand) system and partner node selecting method |
Non-Patent Citations (1)
| Title |
|---|
| 刘唐 等: "基于分组评分的改进的Chord搜索算法", 《计算机工程》, vol. 35, no. 11, 5 June 2009 (2009-06-05) * |
Cited By (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2016209174A1 (en) * | 2015-06-26 | 2016-12-29 | Onwards Media Group Pte. Ltd. | Method and apparatus for streaming media |
| CN105872764A (en) * | 2015-12-21 | 2016-08-17 | 乐视云计算有限公司 | Data downloading method and device based on P2P (Peer-to-Peer) network |
| CN105847437A (en) * | 2016-05-26 | 2016-08-10 | 北京科技大学 | Data transmission method |
| CN108174306B (en) * | 2017-12-28 | 2021-03-30 | 北京安云世纪科技有限公司 | Multimedia data loading method and terminal |
| CN108174306A (en) * | 2017-12-28 | 2018-06-15 | 北京安云世纪科技有限公司 | A kind of multi-medium data loading method and terminal |
| CN109151041A (en) * | 2018-09-06 | 2019-01-04 | 网宿科技股份有限公司 | A kind of method of adjustment and device monitoring node |
| CN109151041B (en) * | 2018-09-06 | 2021-02-26 | 网宿科技股份有限公司 | Method and device for adjusting monitoring node |
| CN109218133A (en) * | 2018-09-27 | 2019-01-15 | 深圳市网心科技有限公司 | Network speed testing system, method, apparatus and computer readable storage medium |
| CN109218133B (en) * | 2018-09-27 | 2022-04-01 | 深圳市网心科技有限公司 | Network speed testing system, method, device and computer readable storage medium |
| CN109495568A (en) * | 2018-11-19 | 2019-03-19 | 北京金山云网络技术有限公司 | A kind of data capture method, data acquisition facility, server and storage medium |
| CN109495568B (en) * | 2018-11-19 | 2021-06-18 | 北京金山云网络技术有限公司 | Data acquisition method, data acquisition device, server and storage medium |
| CN110545450A (en) * | 2019-09-09 | 2019-12-06 | 深圳市网心科技有限公司 | Node distribution method, system, electronic equipment and storage medium |
| US11785075B2 (en) | 2021-02-20 | 2023-10-10 | Wangsu Science & Technology Co., Ltd. | Method for requesting resources and terminal |
| EP4075691B1 (en) * | 2021-02-20 | 2024-05-01 | Wangsu Science & Technology Co., Ltd. | Resource requesting method and terminal |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102307218B (en) | 2014-04-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102307218B (en) | Stream media data request transmission method for multimedia telephone peer-to-peer (P2P) video-on-demand | |
| Mol et al. | Give-to-get: free-riding resilient video-on-demand in p2p systems | |
| US9769255B2 (en) | Continuous scheduling for peer-to-peer streaming | |
| US10484440B2 (en) | Content distribution system and method | |
| US10084883B2 (en) | Content distribution system and method | |
| US9674245B2 (en) | Content distribution system and method | |
| US11848990B2 (en) | Method and system for distributing and storing content using local clouds and network clouds | |
| EP3014891B1 (en) | Content distribution system and method | |
| Wang et al. | PLVER: Joint stable allocation and content replication for edge-assisted live video delivery | |
| Claeys et al. | An announcement-based caching approach for video-on-demand streaming | |
| Qin et al. | Optimizing routing and server selection in intelligent SDN-based CDN | |
| Hwang et al. | Joint-family: Adaptive bitrate video-on-demand streaming over peer-to-peer networks with realistic abandonment patterns | |
| AT&T | ||
| Huang et al. | An upload bandwidth allocation algorithm in data scheduling of P2P VoD system | |
| Kandavanam et al. | PaCRA: A path-aware content replication approach to support QoS guaranteed video on demand service in metropolitan IPTV networks | |
| US10356482B2 (en) | Content distribution system and method | |
| Okada et al. | A Color-Based Cooperative Caching Strategy for Time-Shifted Live Video Streaming | |
| CN106713316B (en) | Method for acquiring streaming media service transmission resource requirement based on receiving buffer | |
| Hwang et al. | Abandonment and its impact on P2P VoD streaming | |
| WO2023064516A1 (en) | Method and system for distributing and storing content using local clouds and network clouds | |
| Erman et al. | Evaluation of swarm video streaming | |
| Kamiyama et al. | Limiting pre-distribution and clustering users on multicast pre-distribution VoD | |
| Fu et al. | Design and implementation of a service oriented architecture for peer-assisted video-on-demand | |
| Liu et al. | Price-Sensitive Application Adaptation in Deadline-Based Networks. |
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 | ||
| ASS | Succession or assignment of patent right |
Owner name: GUANGZHOU DIANRAN VIDEO TECHNOLOGY CO., LTD. Free format text: FORMER OWNER: CHEN JIANGUO Effective date: 20150610 Free format text: FORMER OWNER: GUANGZHOU FANWANG VIDEO TECHNOLOGY CO., LTD. Effective date: 20150610 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20150610 Address after: Dashadi Whampoa District of Guangzhou City, Guangdong province 510700 Road No. 403 room A818 Patentee after: Guangzhou Kindle Video Technology Co.,Ltd. Address before: 1601 room 510110, Jiangwan commercial center, 298 Yanjiang Road, Yuexiu District, Guangdong, Guangzhou Patentee before: Chen Jianguo Patentee before: Gaungzhou Pan-net Video Technology Co.,Ltd. |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20161214 Address after: 510110 Guangdong Road, Guangzhou, Yuexiu District, No. 298, Jiangwan commercial center, room 3911 Patentee after: Chen Jianguo Address before: Dashadi Whampoa District of Guangzhou City, Guangdong province 510700 Road No. 403 room A818 Patentee before: Guangzhou Kindle Video Technology Co.,Ltd. |
|
| TR01 | Transfer of patent right |
Effective date of registration: 20210507 Address after: 510000 401, Peony Pavilion, pearl garden, 193 Dongxiao Road, Haizhu District, Guangzhou City, Guangdong Province Patentee after: Chen Kai Address before: Room 3911, Jiangwan business center, 298 Yanjiang Middle Road, Yuexiu District, Guangzhou, Guangdong 510110 Patentee before: Chen Jianguo |
|
| TR01 | Transfer of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20140416 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |