CN102307218B - 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
- CN102307218B CN102307218B CN201110063443.1A CN201110063443A CN102307218B CN 102307218 B CN102307218 B CN 102307218B CN 201110063443 A CN201110063443 A CN 201110063443A CN 102307218 B CN102307218 B CN 102307218B
- Authority
- CN
- China
- Prior art keywords
- data
- back end
- request
- node
- value
- 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
- 230000005540 biological transmission Effects 0.000 title claims abstract description 68
- 238000000034 method Methods 0.000 title claims abstract description 38
- 230000009467 reduction Effects 0.000 claims abstract description 5
- 238000012546 transfer Methods 0.000 claims description 9
- 238000005457 optimization Methods 0.000 claims description 5
- 241001269238 Data Species 0.000 claims description 4
- 230000008569 process Effects 0.000 claims description 4
- 230000007812 deficiency Effects 0.000 claims description 3
- 238000012360 testing method Methods 0.000 claims description 2
- 230000007246 mechanism Effects 0.000 abstract description 3
- 230000004044 response Effects 0.000 abstract description 3
- 230000002950 deficient Effects 0.000 abstract 1
- 238000005516 engineering process Methods 0.000 description 6
- 230000003139 buffering effect Effects 0.000 description 2
- 230000008859 change Effects 0.000 description 2
- 230000001934 delay Effects 0.000 description 2
- 238000007689 inspection Methods 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
- 230000003993 interaction Effects 0.000 description 1
- 230000001902 propagating effect Effects 0.000 description 1
- 238000011084 recovery Methods 0.000 description 1
- 238000012216 screening Methods 0.000 description 1
- 238000009331 sowing Methods 0.000 description 1
Images
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 adopting on mediaphone, belong to P2P Technology of Network Streaming Media field.
Background technology
Development along with multimedia technology, mediaphone is progressively entering average family, mediaphone has comprised the existing function of general intelligence telephone set, generally with network interface, can complete the functions such as website browsing, information interaction, media play, on mediaphone, realizing 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 bandwidth resources requirement, and require service time also more and more longer, traditional server/client (S/C) can not meet the requirement of enhanced scalability and high availability.Recent study circle and industrial quarters have proposed multiple solution, important meaningful distributing network (Content Delivery Network CDN) and IP broadcast (IP Multicast), but, the common feature of these solutions is to have special hardware supports: such as CDN need to dispose in all parts of the world a plurality of CDN servers, by the collaborative work between server, distributing multimedia data, but along with user's demand constantly increases, just need constantly to increase the quantity of server, not only workload constantly increases, and be difficult to guarantee the smooth playing of multi-medium data, and IP broadcast needs to revise the routing mechanism of current Internet especially, widespread deployment is supported the router of broadcast capability.So not only costly, and be difficult to be widely used.
Adopting P2P transmission technology is a kind of comparatively feasible solution, P2P transmission technology has broken through traditional customer end/server mode, emphasize " equity " between node, make the service ability of P2P system can the natural increase with the growth of demand, the extensibility with " inherent ", can solve the problem of server overload and resource bottleneck in traditional client/server structure.
P2P node is the basic composition part of P2P network, because the internodal upload bandwidth of P2P is different, how to carry out request of data and how control data transmission, determined transmission of flow media data speed, affect the play quality of multi-medium data, for the Stream Media Application demand that meets the demands and day by day improve, 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, the method can guarantee to carry out continuous, the smooth playing of P2P point Streaming Media sowing time on multimedia telephone terminal, and easy to implement and popularization.
Main technical schemes of the present invention is:
A stream medium data request transmission method for mediaphone P2P program request, marks to P2P back end by setting up node scoring, from the P2P back end of high-quality, obtains data.
Described node scoring adopts the combination of following any one marking mode or two kinds of marking modes to mark, the node that the score value of take is high is high-quality node: (1) user node sends request of data to P2P back end, if data integrity returns, give this node bonus point, if data are returned imperfect or do not returned, subtract minute to this node; (2) user node sends request of data to P2P back end, if data are returned, does not exceed the scheduled time, gives this node bonus point, if data are returned, has exceeded the described scheduled time or has not had data to return, and subtracts minute to this node or gives minimum minute.
Described node scoring can also comprise regular check P2P back end quality and number of nodes, and for node quality, if find, P2P back end inferior replaces P2P back end inferior with new P2P back end; For number of nodes, if the quantity of described P2P back end can not meet the needs of transfer of data, the P2P back end that please look for novelty to index server.
The stream medium data request transmission method of described mediaphone P2P program request also preferably adopts safety zone compensation policy when downloading data, detect in advance the not enough situation of buffer data, by to the quick-downloading data block lacking of CDN content server, for data reduction, play enough buffered datas are provided.
In the concrete operations of described safety zone compensation policy, safety zone of preferred definition is as the benchmark that judges that whether buffer data is enough, described safety zone is one and take the dynamic data set that a certain amount of consecutive data block was formed of arranging by playing sequence that current broadcast point is starting point, the size of described safety zone is determined according to stream medium data code check, if buffer data lacks the application data in described safety zone, be judged as data deficiencies.
The particular content of described safety zone compensation policy is: after request program starts, first from CDN content server, obtain the corresponding total data in described safety zone, then start play stream media data, and start to obtain data from P2P back end, when buffer data is not enough to cover described safety zone, from CDN content server quick obtaining data, until buffer data can cover described safety zone.
The stream medium data request transmission method of described mediaphone P2P program request also preferably include adopt scheduling data request strategy between the data transmission channel of setting up between described user node and each P2P back end schedule data transmission speed and data block request order to obtain minimum data transfer delay.
The particular content of described scheduling data request strategy can be: described user node is according to the nodal information of each P2P back end, it is optimization aim that the acquisition of take makes the minimum data transmission delay that described user node can be play continuously, calculate the data block transmission sequence that each P2P back end distributes, described user node is notified respectively the multi-medium data sequence that each P2P back end is corresponding, described each P2P back end according to asked data sequence to described user node transport stream media data.
The invention has the beneficial effects as follows:
(1) by adopting node scoring, make user node also grasp fully in time quality and quantity situation and the situation of change thereof of P2P back end, to select more accurately and efficiently high-quality node wherein, the data transmission channel of abandoning node inferior and safeguarding fair amount, be conducive to improve transmission rate and the transmission quality of Streaming Media.
(2) owing to adopting safety zone compensation policy, carry out buffered data planning, detect in advance the not enough situation of buffer data, find in time and alarm, and in time to the quick-downloading data block lacking of CDN content server, thereby realized the intellectuality compensation of data, for realizing smooth reduction broadcasting, provide the assurance in data volume.
(3) due to the data dispatch strategy adopting between a plurality of data transmission channels, it is optimization aim that the acquisition of take makes the minimum data transmission delay that described user node can be play continuously, calculate the order of transmission of the data block of listing side by side each P2P back end, the transmission sequence transmission delays that cause different from playing sequence because of data block in each back end upload bandwidth difference, a plurality of data transmission channels have been reduced to greatest extent, avoid lacking data and cause the not smooth and data redundancy of picture to be downloaded, further guaranteed the low delay smooth playing of Streaming Media.
Accompanying drawing explanation
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, the applied network of paper the present invention and composition thereof, corresponding network is P2P program request transmission of flow media data network, order program data is to take data block as unit of transfer, order program data is divided into different data blocks, form with serial number is numbered it again, and the mode of numbering by data block is transmitted data in P2P network, and data are reduced to broadcasting.This network is comprised of following module: 1) index server (Index Server): be the effector of P2P program request network, the node based under program request file manages; 2) CDN content server (CDN Content Server): be the supplier of P2P data source of stream media, the stream medium data of propagating in program request network is provided by CDN content server at first; 3) P2P node (P2P Node): the basic role in P2P network, each participates in node and has two kinds of identity of server and client side concurrently, in resource on utilizing other nodes also for other nodes provide service, from whole P2P program request network, multimedia telephone terminal of the present invention also belongs to P2P node, method of the present invention for convenience of description, hereinafter the multimedia telephone terminal of program request flow-medium performance is called to user node, by can be it, provides other nodes of service to be called P2P back end.
The invention provides the stream medium data request transmission method of a kind of mediaphone P2P program request, in Streaming Media request and transmitting procedure, adopted one or more the combination in node scoring, safety zone compensation policy and scheduling data request strategy.
Described node scoring, marks to corresponding P2P back end to the response condition of request of data according to P2P back end, from the P2P back end of Internet Transmission attribute high-quality, obtains data.
Preferably take the Internet Transmission attribute of P2P back end as evaluating the index that P2P back end is high-quality or node inferior, score value standard can artificially be determined, as best result being made as to 20 minutes, minimumly be divided into 0 minute, mark is higher represents that the response speed of this node is faster, quality is better, and Internet Transmission attribute is more excellent.
As shown in Figure 1, when user node R starting point broadcasting flow-medium program, first to index server, log in registration, and inquire about the P2P back end list (referring to the Step1 of Fig. 1) of institute's request program, then preserve the P2P back end list N1 that described index server returns, N2, ..., Ni (i is natural number), and to adopted P2P back end, give initial score according to node scoring, preferably give identical initial score, as given, within initial minute, be 10 minutes, also can give initial score to each P2P back end in the list of described P2P back end.
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, the node that the score value of take is high is high-quality node: (1) user node sends request of data to P2P back end, if data integrity returns, give this node bonus point, if data are returned imperfect or do not returned, subtract minute to this node or give minimum minute; (2) user node sends request of data to P2P back end, if data are returned, does not exceed the scheduled time, gives this node bonus point, if data are returned, has exceeded the described scheduled time or has not had data to return, and subtracts minute to this node or gives minimum minute.
About the choice criteria of described high-quality node, can be both that to select score value be high-quality node higher than the node of set point, also can be according to transmission needs, select score value relatively the highest part of nodes be high-quality node.
Described node scoring can also comprise regular check P2P back end quality and number of nodes.About node quality examination, if find P2P back end inferior, the minimum P2P back end of score value as relatively minimum or absolute in mark, with new P2P back end, replace P2P back end inferior (as the Step3 of Fig. 1), abandon in time P2P back end inferior, regular check can be carried out to P2P back end timing heartbeat by user node, and each inspection all carries out taking turns marking, then according to the appraisal result of epicycle, determines the node that may be replaced; About number of nodes inspection, if the quantity of described P2P back end can not meet the needs of transfer of data, as as described in the data volume of the received consecutive data block of user node be less than the data volume of the data block of required broadcasting, the P2P back end that please look for novelty to index server (as the Step4 of Fig. 1).
Described safety zone compensation policy, realizes data security regional planning, detects in advance the not enough situation of buffer data, by the quick-downloading data block lacking of CDN content server, thereby provides enough buffered datas to play to realize smooth data reduction.
Described safety zone compensation policy, can realize the not enough security alarm of data buffering, accomplishes data intelligent compensation.As shown in Figure 2, for guaranteeing enough buffered datas, define a safety zone as the benchmark that judges that whether buffer data is enough, described safety zone is one and take the dynamic data set that a certain amount of consecutive data block was formed of arranging by playing sequence that current broadcast point is starting point, and the size of described safety zone is preferably determined according to stream medium data code check.Along with the carrying out of playing, the corresponding consecutive data block in described safety zone is dynamic change.
If buffer data lacks the application data in described safety zone, be judged as data deficiencies.
The particular content of described safety zone compensation policy is: after request program starts, first from CDN content server (being the supplier in multi-medium data source), obtain the corresponding total data in described safety zone, possess the primary data of some, thereby guarantee to start rapidly broadcasting.Then start play stream media data, and start to obtain data from P2P back end, when buffer data is not enough to cover described safety zone, while also lacking the urgent download region corresponding data shown in Fig. 2 with respect to buffering area, from CDN content server quick obtaining data, until buffer data can cover described safety zone, get the corresponding total data in described urgent download region.So circulation, until request program plays.
When the speed of preferably downloading when P2P data is less than the code check of Streaming Media, judge that buffer data is not enough to cover described safety zone.
Described scheduling data request strategy, by schedule data transmission speed and data block request order between each data transmission channel setting up between user node and each P2P back end, make described user node can play continuously with minimum data transfer delay the flow-medium performance of institute's program request.
Described user node receives a plurality of P2P back end conventionally for its data that provide simultaneously, have a plurality of different data transmission channels simultaneously, and upload bandwidth between these P2P back end is different, and the transmission sequence of data block is different from playing sequence in above-mentioned a plurality of data transmission channel, various possible transmission delays have therefore been produced.
The particular content of described scheduling data request strategy is: described user node is according to the nodal information of each P2P back end, it is optimization aim that the acquisition of take makes the minimum data transmission delay that described user node can be play continuously, calculate the data block transmission sequence that each P2P back end distributes, described user node is notified respectively the multi-medium data sequence that each P2P back end is corresponding, described each P2P back end according to asked data sequence to described user node transport stream media data.
Below in conjunction with formula, further illustrate the specific algorithm of described scheduling data request strategy, first with R, represent described user node, with S1, S2 ..., Si (i is natural number) represents P2P back end described in each, with D, represent current order program data piece, and define Bu (Si) for the uploading bandwidth altogether of P2P back end Si, definition Bu (Si, R) for the time of running Si to the transmission rate of R, Bu (Si, R)≤Bu (Si) wherein.
The formalized description of described algorithm is: user node R is according to the distribution of the value determination data piece of Bu (Si, R), and dynamically adjusts the value of Bu (Si, R), is specially:
First, by speed measuring module, test Si is to the transmission rate Bu (Si, R) of the Si of R, as the initial value of Bu (Si, R).
Then, select Si, the current data block D that will download is distributed to Si, concrete grammar is: take out the current data block D that will download, according to the corresponding Si of value descending of Bu (Si, R), select the Si on making number one, data block D is distributed to this Si.Task is distributed to after Si, and the service ability that Si can continue to offer R will reduce, so will upgrade the value of Bu (Si, R), update method is for using
value as Bu (Si, R) new value, the data block of the value of the Bu (Si, R) after upgrading input next round distributes previous sequencer procedure as the foundation of choosing next round data block distribution target selection, the Si making number one to select next round again.
The P2P back end that for example epicycle makes number one is S3, so assign the task to after S3, afterwards, the service ability that S3 can continue to offer R will reduce, so will upgrade the value of Bu (S3, R), update method is for using
value as the new value of Bu (S3, R), then the value of the Bu (S3, R) after upgrading is dropped into next round sequence, the rest may be inferred, in above formula,
The byte number that Size (D) is D;
Size (Header) is the byte number in the packet header of P2P packet;
The deadline is downloaded in the expection that T (D) is D;
T is for starting download time.
The value of Bu (Si, R), except needs upgrade, preferably, can also be adjusted according to the actual download situation of data block D.After data block is downloaded, first recover the value of Bu (Si, R), the value of alleged recovery Bu (Si, R) refers in the new value of current Bu (Si, R), increases the transmission rate reducing because of downloading data block D
when P2P back end Si only has the downloading task of data block D, be equivalent to return to initial value, the value after then this being recovered is adjusted, and concrete method of adjustment can adopt one of following two kinds of methods:
(a) if before the deadline is downloaded in the expection of D, D has downloaded from Si, illustrates that Si can provide enough large uploading bandwidth to R, makes full use of the uploading bandwidth of Si during for download later, attempts increasing the value of Bu (Si, R).Owing to not knowing the definite value of the uploading bandwidth that Si can provide to R, so cannot increase too much, take the strategy of fine setting, increase by a small margin the value of Bu (Si, R); If D does not in time download and obtains, illustrate that so the actual value of Bu (Si, R) is less than the value of previously guess, need to reduce the value of Bu (Si, R), increase or the amount that reduces can be determined according to experience.
(b) also can calculate the current actual value of Bu (Si, R):
and by this current actual value the new value as Bu (Si, R), and then sort to determine according to this new value which P2P back end is next round assign the task to.To R, provide the P2P back end of less service ability should not distribute too many task, preferably adopt method (b) to adjust the value of its Bu (Si, R).In this case, can directly take actual value as Bu (Si, R) assignment, and without the value of first recovering Bu (Si, R) again with actual value assignment.
Use above-mentioned scheduling data request algorithm, on user node R, according to the nodal information in the set of movable P2P back end, calculating the data that each P2P back end distributes sends after sequence, user node R notifies respectively the media data sequence that P2P back end is corresponding, and the corresponding sequence number of P2P back end basis is to user node R transport stream media data.Owing to being that to obtain minimum data transfer delay be that optimization aim established data sends sequence, therefore the order that each P2P back end sends sequence defined according to these data is to user node R transmission data, can obtain minimum transmission delay, data have been avoided lacking, also avoided data redundancy download, when even stream medium data amount is larger, also can more accurately, intactly download required data, further guaranteed the smooth playing of Streaming Media.
Adopt described node scoring, safety zone compensation policy and scheduling data request strategy simultaneously, can reach best stream medium data request laser propagation effect.After logging in successfully to index server, start before request msg, first according to safety zone compensation policy from CDN content server quick obtaining primary data, thereby guarantee to start rapidly broadcasting, then request program starts to play, and start to P2P node request msg, started node scoring simultaneously, and the appraisal result of taking turns according to each adjust at any time request of data next time towards P2P back end, to guarantee always to obtain data from the P2P back end of high-quality, for keeping good Internet Transmission quality that basic guarantee is provided.When broadcasting limit, limit is during from P2P back end request msg, according to scheduling data request strategy, schedule data transmission speed and data block order between the data transmission channel of setting up in the target data node queue of each request msg, to realize the minimal propagation delay of continuous broadcasting.In downloading the process of playing on limit, once find that buffered data is not enough, just to CDN content server quick obtaining data, realized timely, the intelligent compensation of buffered data.
Certainly, realizing a most important condition for broadcasting flow-medium smooth playing is to guarantee that the network download bandwidth of described user node must be greater than or equal to the code check in order program data source.
Claims (9)
1. the stream medium data request transmission method of mediaphone P2P program request, it is characterized in that by setting up node scoring, P2P back end being marked, from the P2P back end of high-quality, obtain data, and adopt scheduling data request strategy between the data transmission channel of setting up between user node and each P2P back end schedule data transmission speed and data block request order to obtain minimum data transfer delay, the particular content of described scheduling data request strategy is: user node is according to the nodal information of each P2P back end, it is optimization aim that the acquisition of take makes the minimum data transmission delay that described user node can be play continuously, calculate the data block transmission sequence that each P2P back end distributes, described user node is notified respectively the multi-medium data sequence that each P2P back end is corresponding, described each P2P back end according to asked data sequence to described user node transport stream media data, the deterministic process that described data block sends sequence is:
(1) by speed measuring module, test each P2P back end Si to the initial value of the transmission rate Bu (Si, R) of user node R;
(2) according to the corresponding Si of value descending of Bu (Si, R), select the Si on making number one, the transmission task of data block D is distributed to Si, task is distributed to after Si, upgrades the value of its Bu (Si, R), and update method is for using
value as Bu (Si, R) new value, again by the Bu (Si after upgrading, R) value drops into next round sequence, and chooses according to ranking results the P2P back end that next round is carried out transmission task, and the rest may be inferred, the byte number that Size in above formula (D) is D, Size (Header) is the byte number in the packet header of P2P packet, and the deadline is downloaded in the expection that T (D) is D, and T is for starting download time.
2. the stream medium data request transmission method of mediaphone P2P as claimed in claim 1 program request, it is characterized in that described node scoring adopts the combination of following any one marking mode or two kinds of marking modes to mark, the node that the score value of take is high is high-quality node:
(1) user node sends request of data to P2P back end, if data integrity returns, gives this node bonus point, if data are returned imperfect or do not returned, subtracts minute to this node;
(2) user node sends request of data to P2P back end, if data are returned, does not exceed the scheduled time, gives this node bonus point, if data are returned, has exceeded the described scheduled time or has not had data to return, and subtracts minute to this node or gives minimum minute.
3. the stream medium data request transmission method of mediaphone P2P as claimed in claim 2 program request, it is characterized in that described node scoring also comprises regular check P2P back end quality and number of nodes, if find, P2P back end inferior replaces P2P back end inferior with new P2P back end; If the quantity of described P2P back end can not meet the needs of transfer of data, 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, while it is characterized in that program request starts, described user node is first inquired about the P2P back end list of institute's request program to described index server, then preserve the P2P back end list that described index server returns, and give equal initial score to adopted P2P back end.
5. the stream medium data request transmission method of the mediaphone P2P program request as described in claim 1,2,3 or 4, while it is characterized in that downloading data, adopt safety zone compensation policy, detect in advance the not enough situation of buffer data, by to the quick-downloading data block lacking of CDN content server, for data reduction, play enough buffered datas are provided.
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 that judges that whether buffer data is enough, described safety zone is one and take the dynamic data set that a certain amount of consecutive data block was formed of arranging by playing sequence that current broadcast point is starting point, the size of described safety zone is determined according to stream medium data code check, if buffer data lacks and should have data in described safety zone, 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 described safety zone compensation policy is: after request program starts, first from CDN content server, obtain the corresponding total data in described safety zone, then start play stream media data, and start to obtain data from P2P back end, when buffer data is not enough to cover described safety zone, from CDN content server quick obtaining data, until buffer data can cover described safety zone.
8. the stream medium data request transmission method of mediaphone P2P as claimed in claim 7 program request, is characterized in that, when the speed of P2P data download is less than the code check of Streaming Media, judging that buffer data is not enough to cover described safety zone.
9. the stream medium data request transmission method of mediaphone P2P as claimed in claim 8 program request, it is characterized in that in described scheduling data request strategy after data block is downloaded, according to the actual download situation of data block D, adjust, first its concrete mode for recovering Bu (Si, R) value, then this value is adjusted, method of adjustment is to adopt following (a), (b) a kind of in two kinds of methods: if (a) before the deadline is downloaded in the expection of D D from Si, downloaded, increase Bu (Si, R) value, if D does not download and obtains in time, reduce Bu (Si, R) value, (b) calculate the current actual value of Bu (Si, R)
and the new value after adjusting as Bu (Si, R).
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 CN102307218A (en) | 2012-01-04 |
| CN102307218B true 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) |
Families Citing this family (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20160381101A1 (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 |
| CN105847437B (en) * | 2016-05-26 | 2022-12-27 | 北京科技大学 | Data transmission method |
| CN108174306B (en) * | 2017-12-28 | 2021-03-30 | 北京安云世纪科技有限公司 | Multimedia data loading method and terminal |
| CN109151041B (en) * | 2018-09-06 | 2021-02-26 | 网宿科技股份有限公司 | Method and device for adjusting monitoring node |
| CN109218133B (en) * | 2018-09-27 | 2022-04-01 | 深圳市网心科技有限公司 | Network speed testing system, method, device and computer readable storage medium |
| CN109495568B (en) * | 2018-11-19 | 2021-06-18 | 北京金山云网络技术有限公司 | Data acquisition method, data acquisition device, server and storage medium |
| CN110545450B (en) * | 2019-09-09 | 2021-12-03 | 深圳市网心科技有限公司 | Node distribution method, system, electronic equipment and storage medium |
| EP4075691A4 (en) | 2021-02-20 | 2022-11-02 | Wangsu Science & Technology Co., Ltd. | Resource requesting method and terminal |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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 |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7633887B2 (en) * | 2005-01-21 | 2009-12-15 | Panwar Shivendra S | On demand peer-to-peer video streaming with multiple description coding |
| US8279766B2 (en) * | 2007-07-31 | 2012-10-02 | The Hong Kong University Of Science And Technology | Interior-node-disjoint multi-tree topology formation |
-
2011
- 2011-03-15 CN CN201110063443.1A patent/CN102307218B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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 (2)
| Title |
|---|
| 刘唐 等.基于分组评分的改进的Chord搜索算法.《计算机工程》.2009,第35卷(第11期), |
| 基于分组评分的改进的Chord搜索算法;刘唐 等;《计算机工程》;20090605;第35卷(第11期);第92-94页，特别是第2.1小节 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102307218A (en) | 2012-01-04 |
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 | |
| Pianese et al. | PULSE: an adaptive, incentive-based, unstructured P2P live streaming system | |
| Liang et al. | Incentivized peer-assisted streaming for on-demand services | |
| CN106060605B (en) | A kind of live stream adaptive approach and system based on CDN | |
| CN101331739A (en) | Method and device for transmitting contents of an equity network | |
| US10484440B2 (en) | Content distribution system and method | |
| EP2979423B1 (en) | Content distribution system and method | |
| US9674245B2 (en) | Content distribution system and method | |
| WO2011157295A1 (en) | Improved peer-to-peer system | |
| US10284920B2 (en) | Content distribution system and method based on information relating to destination capability and network conditions | |
| Wang et al. | PLVER: Joint stable allocation and content replication for edge-assisted live video delivery | |
| CN103841468A (en) | Real-time streaming media data transmission method | |
| CN102158767A (en) | Scalable-coding-based peer to peer live media streaming system | |
| Zhang et al. | A priority-based adaptive scheme for multi-view live streaming over HTTP | |
| CN102821316A (en) | Improved video on demand (VOD) transmission method based on peer-to-peer computing core algorithm | |
| Hwang et al. | Joint-family: Adaptive bitrate video-on-demand streaming over peer-to-peer networks with realistic abandonment patterns | |
| AT&T | ||
| 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 | |
| Hisada et al. | P2P live streaming system suitable for private contents distribution | |
| US10356482B2 (en) | Content distribution system and method | |
| Okada et al. | A Color-Based Cooperative Caching Strategy for Time-Shifted Live Video Streaming | |
| Hwang et al. | Abandonment and its impact on P2P VoD streaming |
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 |