CN102638704A - Performance perceived peering content on-demand - Google Patents
Performance perceived peering content on-demand Download PDFInfo
- Publication number
- CN102638704A CN102638704A CN2012100838857A CN201210083885A CN102638704A CN 102638704 A CN102638704 A CN 102638704A CN 2012100838857 A CN2012100838857 A CN 2012100838857A CN 201210083885 A CN201210083885 A CN 201210083885A CN 102638704 A CN102638704 A CN 102638704A
- Authority
- CN
- China
- Prior art keywords
- sub
- peer
- video
- montage
- server
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Landscapes
- Two-Way Televisions, Distribution Of Moving Picture Or The Like (AREA)
- Information Transfer Between Computers (AREA)
Abstract
The invention discloses a method for providing video on-demand by a server. The method comprises the following steps of: receiving a request of a video content unit; executing admission control; segmenting the video content unit into a plurality of video on-demand content sub-clips; calculating the number of the previous video on-demand content sub-clips to be streamed; and streaming the previous video on-demand content sub-clips. A method for providing video on-demand service comprises the following steps of: receiving the streamed previous content sub-clips; determining a group of required content sub-clips; positioning one content sub-clip in the group of required content sub-clips; and downloading the positioned content sub-clips. The invention also discloses a system for providing the video on-demand service, which comprises a peering point, a server and a tracker. The tracker and the server can be positioned at the same position.
Description
The application be that on 06 27th, 2006, application number are 200680055164.8 the applying date, denomination of invention divides an application for the patent application of " the peer content program request of performance aware ".
Technical field
The present invention relates to equity networking (peer-to-peer networking); And relate to particularly and utilize peer-to-peer network that video-on-demand service is provided, this peer-to-peer network provides peer (peer) video to download (by each the peer data download/video in the peer-to-peer network) under the situation of taking into account system performance.
Background technology
Traditionally, used the client-server service model that flow transmission service (streaming service) is provided.The user end to server request of sending, if server has enough resources to come for the request service of client and along enough bandwidth are arranged on the path between the server and client side then, then server spreads content and is passed to client.
Because limited bandwidth in the calculating that the server place is limited and the network of storage resources and Connection Service device and client, extensibility is a problem in the service of client-server flow transmission.Recently, peer to peer technology (peer-to-peer technique) is introduced the flow transmission service.Each peer is implemented as the ability with client and server, and through on one's own initiative with VPN Content cache and be that other each peer are served, help to alleviate at the live load that applies on the server and the bandwidth demand that on network, distributes.Research shows that peer to peer technology has greatly improved the system expandability, and the system that makes can be much more user's service.
Made significant effort for solving the scalability problem that in the streaming media service that utilizes the equity networking, exists.These effort can be classified as two types: especially, and reciprocity live stream transmission and transmission of reciprocity video stream stored or video request program.Though two kinds of services make great efforts to utilize peer to peer technology to support a large number of users, for the user provides good viewing quality, they also are faced with the different techniques challenge simultaneously.In the transmission of reciprocity live stream, challenge is: initial delay is minimized and the extensibility of sacrificial system not.In reciprocity video-on-demand service, challenge is to allow the async user to share.
Each reciprocity flow transmission scheme also distinguishes they self through different data distribution technologies (dissemination).Two kinds of data distributing methods-have especially been developed, based on the method that covers (overlay) and the method for data-driven.In based on the method that covers, each peer forms grid or tree structure, wherein between each peer, forms set membership.Sub-peer receives data from his father's peer.On the contrary, each peer in the method for data-driven does not have fixing set membership.No matter somewhere each peer is sought the data of disappearance, and available data of just fetching disappearance.The increased popularity though widely-used method based on covering during equity is in early days attempted, the method for data-driven are becoming is because it has solved fluctuation (churn) and asymmetric bandwidth problem effectively.
Although the effort of most prior art has represented good extensibility and compare the user of the bigger quantity of support with traditional client-server service model; But the prior art scheme hits it hard in itself (best effort), and do not study support as yet fully to performance requirements.
Summary of the invention
The present invention is directed to the reciprocity video-on-demand service (performance aware peer-to-peer video-on-demand service) of performance aware.The present invention downloads equity and integrates with in traditional client-server video-on-demand service model.Equity is downloaded and is carried main data transfer load, thereby has reduced the live load that on server, applies significantly.Therefore, server is devoted to provide emergency data to satisfy performance requirement its most of resources.Improved the performance that senses at the client place.Consider performance requirement, design reciprocity download algorithm.
Video-on-demand service allows the user whenever on network, to select and watch video content in their expectation.Present invention resides in video request program the middle segmentation equity video sharing model that allows content shared is set.Reciprocity data download algorithm and the auxiliary additional flow transmission of server through merging performance aware solve performance issue; The auxiliary additional flow transmission of the reciprocity data download algorithm of performance aware and server is common to realize the similar performance of performance that provides with traditional client-server service model, but support more users/request.
Method and system of the present invention to the method for using data-driven and the real-time scheduling integrated with reciprocity data distribution procedure to improve the reciprocity video-on-demand service that the user watches impression.Should note: systematic function (the instant video of being asked that receives of user particularly) means that the integral body that has improved the user watches impression and improved overall video quality.System performance aware data of the present invention is shared and additional server flows is transmitted the viewing quality that has improved the client/user side.
Described a kind of method that is used to provide video-on-demand service, having comprised: the video sub-clip that receives the front of flow transmission; Confirm one group of needed video sub-clip; Locate this and organize a video sub-clip in the needed video sub-clip; And download the video sub-clip located.Describe a kind of system that is used to provide video request program, comprised peer, server and tracker.Tracker can with the server position that coexists.Peer comprises the device of the video sub-clip of the front that is used to receive flow transmission; Be used for confirming the device of one group of needed video sub-clip; Be used for locating the device that this organizes a video sub-clip of needed video sub-clip; And the device that is used to download the video sub-clip of being located.
Described a kind of server the method for video request program is provided, said method comprises: receive the request to the video content unit; Carry out and permit control; Said video content unit is segmented into the sub-montage of a plurality of video on demand content; Calculate the quantity of the sub-montage of video on demand content of the front of wanting flow transmission; And the sub-montage of the video on demand content of the said front of flow transmission.
Description of drawings
When combining advantages, will understand the present invention best from following detailed.Concise and to the point each figure that describes below accompanying drawing comprises, wherein identical label is represented similar element among each figure:
Fig. 1 is the sketch map according to peer-to-peer network of the present invention.
Fig. 2 is the figure that illustrates according to peer-to-peer network of the present invention.
Fig. 3 is the flow chart of handling from the allowance control (admission control) of server side.
Fig. 4 and Fig. 5 are the flow charts of describing from the allowance control and treatment of user/client-side.
Embodiment
The different piece that the user of video-on-demand service watches video in any given moment.In order to make content can between each user, share and make, suppose that each user has the memory capacity with the whole copy and/or the part copy high-speed cache of the content of having play through the maximization of peer-to-peer network content transmitted amount.This is rational hypothesis under the situation of the memory capacity of the quick increase of video playback device.Should be noted that video playback device is can receive and any equipment of playback (storage or live) video, includes but not limited to computer, laptop computer, PDA(Personal Digital Assistant) and mobile device.Peer-to-peer network is not limited to cable network, also can be wireless or cable network or adopt wired and hybrid networks wireless connections.
In segmentation equity VOD method of the present invention and device, video clipping is divided into the fragment with a plurality of equal lengths of " sub-montage " expression.Playback duration when sub-montage begins is defined as the time limit of this sub-montage.The sub-montage of front (leading sub-clips) is streamed to video playback device, makes the user can get started playback.Simultaneously, between each user, set up peer-to-peer network, so that the data of the sub-montage subsequently of looking ahead out.According to system performance aware scheme of the present invention, the data of the sub-montage of must before the time limit of sub-montage, looking ahead out.In case the playback of sub-montage begins, just do not allow the equity of this sub-montage to download, because newly downloaded data maybe be out of date.For better system performance, initiate from this point from the additional flow transmission of original server.The following description replenished flow transmission.
How usage example is the request service that gets into if illustrating segmentation equity of the present invention video request program.In this example, suppose that the user can be with whole copy high-speed caches of video.Even only with a part of high-speed cache of video copy, identical technology also is suitable for.Also suppose server only with the first sub-assembled stream transmission, and utilize peer-to-peer network to download the data of sub-montage afterwards.To present and describe the algorithm of quantity of the sub-montage of calculated flow transmission below.
Referring now to Fig. 1, client/user 1 is at time t
1Video to from server is made request/requirement.Server spreads sub-montage 1 (first video sub-clip) at once and is passed to client 1, makes client 1 can promptly begin playback.Simultaneously, attempt in peer-to-peer network, locating have/high-speed cache has the peer of sub-montage 2.At this moment, only the peer of sub-montage 2 is arranged is server to having in the peer-to-peer network/high-speed cache, and this server can show as a peer.(at least) client and server is the member of peer-to-peer network.At time t
2, client 1 is just in the sub-montage 1 of playback, and downloads (but not flow transmission) sub-montage 2 from server.2 pairs of same video from server of client/user are made request/requirement, and get started the sub-montage 1 of playback, and this sub-montage 1 is transferred to client 2 from server flows.Server and client side 1 both begins sub-montage 2 is downloaded (but not flow transmission) to client 2.At this moment, server, client 1 and client 2 are each peer in the peer-to-peer network.At time t
3, 3 pairs of same video from server of client are made request/requirement, and get started the sub-montage 1 of playback, and this sub-montage 1 is transmitted from server flows.Up to the present, client 1 is just in the sub-montage 3 of playback and just at the data/video of download sub-clip 4.Client 2 is being play sub-montage 2 and just in download sub-clip 3.At this moment, (at least) server, client 1, client 2 and client 3 are members of peer-to-peer network.Client 3 can be from server, client 1 and client 2 download sub-clip 2.Along with the time continues, peer video playback continues.As shown in Figure 1, at current time t
4, equity is downloaded the data of the sub-montage after current in progress sub-montage of looking ahead out.To time t
5, client 1 has been accomplished its video playback and has been logged off.Client 2 is just in the last sub-montage of playback, and client 3 is just in the sub-montage 4 of playback and just in download sub-clip 5.Be download sub-clip 5, the server and second client are each peer in the peer-to-peer network.At last, client 2 also logs off after accomplishing video playback.Client 3 watching/the sub-montage 5 of playback and will after sub-montage 5 finishes, logging off.
Fig. 2 is the figure that illustrates according to peer-to-peer network of the present invention.Server 205 has whole copies of video, and can the sub-montage of streamed video or as a peer, and with sub-clip downloads other each peer 210 in the peer-to-peer network.In case peer 210 request/requirements are from the video of server 205, it just adds peer-to-peer network, then can from other each peer 210 download subsequently sub-montage and/or with sub-clip downloads to other each peer 210.Sub-montage is only from server 205 flow transmission.The common only sub-montage of front being spread from server 205 is passed to the peer 210 of asking/requiring video, and remaining sub-montage is downloaded from server 205 or other peer 210.Yet this peer received the sub-montage of being downloaded before the time limit if downloading rate is not enough, maybe sub-montage subsequently be transferred to this peer from server flows.Tracker 215 can be embodied as the entity of separation or can be implemented as the part of server 205.If tracker 215 is embodied as the entity of separation, then between server 205 and tracker 215, there is signaling, when each peer in the peer-to-peer network added and withdraws from peer-to-peer network, this tracker 215 kept following the tracks of them.Tracker also keeps following the tracks of which peer in the peer-to-peer network has the sub-montage that what can download and the state (whether a peer has the sub-montage and each peer that can be used for by another peer is downloaded need be downloaded for which sub-montage) of each peer.In case a peer has received sub-montage, then this sub-montage just is considered to can be used for downloading to other each peer that need this sub-montage by this peer.Flowline with four-headed arrow is indicated sub-clip downloads.Flowline with single arrow is indicated sub-assembled stream transmission (only server can flow transmission).Broken/dotted line flowline indication signaling.
Fig. 3 is the flow chart from the allowance control and treatment of server side.Make new request/requirement to server to video.When new request arrives server, call and permit control and treatment 305, and this allowance control and treatment 305 is permitted control and treatment based on collected statistics.Should request if permit 310, then calculating 315 should be from the quantity of the sub-montage of the front of the direct flow transmission of server.The quantity of (front) sub-montage of flow transmission is represented as N.Server 320 begin request that the sub-assembled stream of front is transferred to client/user, and will be worth N 325 and turn back to requesting users/client.If permit request/requirement, then in the quantity of the sub-montage of 330 initialization/replacement front.
Fig. 4 is the flow chart of describing from the allowance control and treatment of user/client-side.At user/client-side,, just check so that confirm through the value (will be transferred to the quantity of sub-montage of the front of client) of test N whether request/requirement is permitted from server flows 405 in case client receives response from server.If the value of N is greater than 0, then request/requirement is permitted, and the user begins to receive N sub-montage of flow transmission 410.Should be noted that N=-1 being set and testing N＞0 at user/client-side at server side is a kind of possible implementation.Request is permitted test and can for example be realized through mark or any other suitable means.415, current sub-montage N
cBe set to N+1 (next son montage-download sub-montage).Carry out test to determine whether to exist the more sub-montages that will download 420 then.If request/requirement is permitted or the user has received all sub-montages of video, then processing finishes.Simultaneously, 425, the location has in the peer-to-peer network/and high-speed cache has the peer of (N+1) individual sub-montage, and begins (N+1) individual sub-montage is uploaded to the peer that needs this (N+1) individual sub-montage.If, then download and continue 435 at 430 definite time limit d (measuring) that also do not reach download with respect to current time t.If confirm to have reached time limit d (measuring), the data vector (missing data vector) that then lacks in 440 preparations with respect to current time t 430.In fact, a bit maybe when confirming before time limit d, to accomplish download, just prepare the data vector of this disappearance before slightly in the time limit.If can not before the time limit, accomplish download, then test to determine whether to need to replenish flow transmission 445.Below additional flow transmission will be described in more detail.Simultaneously, 455 current sub-clip counter is increased progressively.Replenish flow transmission if desired to guarantee satisfying systematic function (sub-montage arrives the user before the time limit), then call additional flow transmission 450.When reaching the time limit d that downloads (N+1) individual sub-montage, the user begins the individual sub-montage of playback (N+1), and have in the peer-to-peer network of location/high-speed cache has the peer of sub-montage afterwards, and beginning video sub-clip download process.
Next, description will be by the sub-montage quantity Calculation of server flows transmission.
With request/requirement, client/user is also to the estimated downlink bandwidth of server indication.Think that the user possibly have better understanding to its oneself downlink bandwidth.When server began the video flowing transmission, flow transmission was downloaded the both with equity and is consumed downlink bandwidth.Suppose that server is to user i flow transmission n
iIndividual sub-montage is at n
iThe time limit of individual sub-montage (that is L*n,
i) must download (n before
i+ 1) copy of individual sub-montage, wherein, L is the duration of a sub-montage.With r
PlaybackBe expressed as the playback rate of video, and r
DownlinkBe expressed as user's downlink bandwidth, (r
Downlink-r
Playback) n
iL>=Lr
Playback" n
i" must be integer (the only complete sub-montage of flow transmission), therefore
(equality 1)
Described above of the present invention, equity downloaded the segmentation equity video-on-demand service integrate with traditional server/customer end video-on-demand service.Equity is downloaded and is carried most of data/video transmission load, has therefore significantly reduced the live load that applies on the server.With target is that the maximized traditional reciprocity file of overall system throughput is downloaded on the contrary, and equity of the present invention is downloaded and considered systematic function (sub-montage arrives the user before its time limit) and the time limit of satisfying sub-montage as possible.Next describing the equity of single sub-montage downloads.Describing equity how to coordinate a plurality of sub-montages then downloads so that realization is given all users with data/delivery of video immediately.
The present invention uses the equity of data-driven to download with commutator clip data between each user.Sub-montage of the present invention is divided into the piece of equal sizes, and user concurrent ground is from each piece of a plurality of user's download.Each piece is divided into sub-piece by further son so that can the streamline transmission requests so that reduce signaling consumption.With each sub-montage accordingly, have the center element be called as sub-tracker, its user that equity of the specific sub-montage of current participation is downloaded keeps following the tracks of.Sub-tracker periodically and when the user adds or leave sub-montage peer-to-peer network receives renewal from the user.
Each peer in the peer-to-peer network is divided into two types: seed and download person.Seed is to have the whole/part copy of sub-montage and the user of other people service/last carrier montage of hope purpose.Seed is not downloaded the sub-clip data that they (seed) just uploading to other peer, and this is because they (seed) had these data.Download person is still just in data download but be willing to purpose simultaneously other people serve the user of the piece that they have had.When new user began download sub-clip, the corresponding sub-tracker of customer contact was to obtain the current user list that in peer-to-peer network, has sub-montage (or part of sub-montage) and be ready to upload this sub-montage (seed and download person both).New user attempt then and tabulate on the user connect, the user in these tabulations becomes its neighbours then.
Each peer operation distributed algorithm is to confirm separately this peer is with which user of data, services/upload to.In order to make maximum (maximum quantity) users before its expiration of time limit separately, receive the chance maximization of sub-clip data, in selecting processing, consider some factors.
Suppose to have selected to receive the user of data from neighbours' (peer), and some of can select these neighbours to download of these neighbours.Neighbours/peer adopts local minimum preferential (local rarest first-LRF) strategy when select downloading which piece.This peer attempts selecting being loaded in down the minimum piece that duplicates among its neighbours.Target is diversity (diversity) maximization that makes content in the system, that is, the quantity that makes each piece duplicate is equal as far as possible.This system that makes pauses because be difficult to find rare piece unlikely.Had under all data conditions that neighbours have the user, neighbours select another user with to its service/data download.
Traditional peer-to-peer network is designed distributes single file.In the present invention, video clipping is divided into a plurality of sub-montages, wherein uses each sub-montage of peer-to-peer network distribution.Therefore, in scheme method of the present invention, the user can add a plurality of peer-to-peer networks simultaneously.For example, in Fig. 1, client 3 is at time t
4Playing sub-montage 2.Client 3 has been accomplished download sub-clip 2, and in download sub-clip 3.Therefore client 3 adds three peer-to-peer networks of sub-montage 1,2 and 3 respectively.Client 3 is the seeds in the peer-to-peer network of sub-montage 1, is the seed in the peer-to-peer network of (another) sub-montage 2, and is the download person in the peer-to-peer network of another sub-montage 3.For sub-montage 3, client 1 is seeds of client 3 with client 2.At time t
4, client 2 is just in download sub-clip 4, and client 1 is the seed of the sub-montage 4 of client 2.At last, at time t
4, client 1 is just in download sub-clip 5, and for sub-montage 5, original server only is the seed of client 1.Client 3 can not be client 1 and 2 services.
At the peer-to-peer network that is used for providing the performance aware of video-on-demand service of the present invention, the user can add a plurality of peer-to-peer networks (for each sub-montage, the user can add different peer-to-peer networks).Yet the sum of uploading should be little number, connects the performance degradation that causes so that avoid by having a large amount of open TCP.Thereby problem becomes the peer of how selecting to cross over a plurality of peer-to-peer networks of uploading makes it possible to the overall performance maximization, that is, make all users before its time limit separately, fetch the chance maximization of content/sub-montage.Be the key factor tabulation that is considered to influence systematic function below:
1. how urgent the time limit have.Time limit is tight more, and download person should obtain high more priority.
2. download and whether carry out according to plan? All users should be impartial to.Download should be carried out from the time that download begins in system, to spend with each peer pro rata.
3. are there how many potential seeds to use? Suppose that the user leaves immediately after accomplishing peer video playback, different time for the different sub montage can with seed amount be different.For example, in Fig. 1, for client 4, the seed amount of sub-montage 2 is greater than the seed amount of sub-montage 3.This is because the seed of sub-montage 3 must also be the seed of sub-montage 2.Yet the seed of sub-montage 2 can not be the seed of sub-montage 3, because this seed possibly leave system after accomplishing playback.Usually, be the Poisson distribution that has average arrival rate λ if client arrives processing, then available seed number is determined by following equality:
(equality 2), wherein
The average seed number of representing sub-montage i, L
VideoThe expression video length, and L representes sub-montage length.
4. high upload speed improves throughput of system, is preferred therefore.
S representes the size of sub-montage, and t representes the current time.The time that if
is user j begins to download k sub-montage, and
is the amount of the content of till time t, being fetched.In addition, establishing
is the time limit of k the sub-montage of user j.At last, definition
is the downloading process designator of k the sub-montage of client j.Therefore,
(equality 3).
The value reflection downloading process of
.That is, whether
designation data/video is downloaded and is carried out according to plan.
is that (by sub-clip deadlines) fetched sub-montage and required downloading rate on time.
is elapsed time, and
is the downloading rate that up to the present reaches.The downloading process designator is the ratio of needed downloading rate and the downloading rate that is realized.if
then download and ideally to carry out according to plan.if
then download and to lag behind plan, if
then download the plan that is ahead of.
Discuss now and be used for the tolerance (metric) that definite peer should be sent data to which neighbour.if
expression served/download data to peer j for k sub-montage, peer i for peer j the weight of uploading.The value of
is big more, and peer i possibly be chosen as peer j service more.Let
as:
(Equation 4).Molecule is r
Ij, it is the upload speed/speed from peer i to j.Say that intuitively bigger/high more upload speed improves overall system throughput more.Here, big more upload rate is good more.This is equivalent to above-mentioned factor 4.
There are three in the denominator of equality (4).As defined in the equality (3);
is process indicator, and
little value indication peer j lags behind plan.Therefore, should give the j high priority according to above-mentioned factor 2.The value of
is the time to the time limit.According to factor 1; The value of
is more little, and the time limit is tight more.Should give priority to having the tightliest request in time limit.At last; At time t, the sub-montage of all of peer i
all is a seed.Yet the request of different sub montage has the seed of varying number, shown in equality (2).Give priority should for user's request of seed with minimum number.Elapsed time is long more, and this asks available seed many more, and this has verified last in the denominator (according to factor 3).
As stated, although especially note to solve performance issue (sub-montage arrives the user immediately), when the time limit that the equity download stops (or the time limit slightly before a bit) some data still possibly lack.How description now uses the data of server incoming flow transmission deletion so that further improve peer video playback performance.This is called as additional flow transmission here.Along with the time limit is approaching, the peer client is prepared the data vector V of disappearance
Missing, the data vector V of this disappearance
MissingThe bitmap that is to use first mark of " 1 " for example to indicate to receive piece and uses second mark of " 0 " for example to come indicator collet still to lack.The data vector of disappearance is sent to server (signaling) with the time limit that this sub-montage arrives the user.Along with the time limit is approaching, server begins the data that flow transmission goes out disappearance, the feasible data/video that can fill disappearance for peer video playback immediately.
Server of the present invention is responsible for three things, and the sub-montage service that (i) is initial/front is to support rapid playback (through flow transmission); (ii) provide and replenish flow transmission with improvement user's viewing quality (guaranteeing that sub-montage arrives the user before each sub-clip deadlines), and the seed in (iii) downloading as reciprocity data/video.Task 1 and 2 has the priority higher than task 3.
Be appreciated that the present invention can realize with the various forms of hardware, software, firmware, application specific processor or its combination.Preferably, the present invention is implemented as the combination of hardware and software.In addition, software preferably is embodied as the application program that on program storage device, visibly embodies.Application program can upload on the machine that comprises any suitable framework and by its execution.Preferably, this machine is realized on the computer platform that has like the hardware of one or more CPU (CPU), random-access memory (ram) and I/O (I/O) interface.Computer platform also comprises operating system and microinstruction code.Various processing described herein and function can be via the part of the microinstruction code of operating system execution or the part (or its combination) of application program.In addition, various other the ancillary equipment such as additional data storage device and PRN device can be connected to this computer platform.
It is also understood that, because some that describe are in the accompanying drawings formed system component and method step is preferably realized with software, so the actual connection between the system component (or treatment step) can depend on programming mode of the present invention and difference.Provide the instruction here, those of ordinary skills can expect of the present invention these with similarly realize or configuration.
Claims (3)
1. a server provides the method for video request program, and said method comprises:
Reception is to the request of video content unit;
Carry out and permit control;
Said video content unit is segmented into the sub-montage of a plurality of video on demand content;
Calculate the quantity of the sub-montage of video on demand content of the front of wanting flow transmission; And
The sub-montage of the video on demand content of the said front of flow transmission.
2. the method for claim 1 also comprises: download remaining video sub-clip.
3. the method for claim 1, wherein said video sub-clip has equal sizes.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210083885.7A CN102638704B (en) | 2006-06-27 | 2006-06-27 | Performance perceived peering content on-demand |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210083885.7A CN102638704B (en) | 2006-06-27 | 2006-06-27 | Performance perceived peering content on-demand |
Related Parent Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2006800551648A Division CN101480050B (en) | 2006-06-27 | 2006-06-27 | Performance aware peer-to-peer video-on-demand |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102638704A true CN102638704A (en) | 2012-08-15 |
| CN102638704B CN102638704B (en) | 2015-06-17 |
Family
ID=46622916
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210083885.7A Expired - Fee Related CN102638704B (en) | 2006-06-27 | 2006-06-27 | Performance perceived peering content on-demand |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102638704B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103731726A (en) * | 2012-10-11 | 2014-04-16 | 纬创资通股份有限公司 | Streaming data downloading method and computer readable storage medium |
| WO2018161790A1 (en) * | 2017-03-08 | 2018-09-13 | 华为技术有限公司 | Video transmission method and device |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| GB0031157D0 (en) * | 2000-12-20 | 2001-01-31 | Ncr Int Inc | Streaming of data |
| US20050055718A1 (en) * | 2003-09-05 | 2005-03-10 | Stone Christopher J. | Peer-to-peer architecture for sharing video on demand content |
| US7467190B2 (en) * | 2003-10-06 | 2008-12-16 | Hitachi, Ltd. | Method and apparatus for alert distribution and archive sharing |
-
2006
- 2006-06-27 CN CN201210083885.7A patent/CN102638704B/en not_active Expired - Fee Related
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103731726A (en) * | 2012-10-11 | 2014-04-16 | 纬创资通股份有限公司 | Streaming data downloading method and computer readable storage medium |
| WO2018161790A1 (en) * | 2017-03-08 | 2018-09-13 | 华为技术有限公司 | Video transmission method and device |
| CN108574882A (en) * | 2017-03-08 | 2018-09-25 | 华为技术有限公司 | A kind of video transmission method and device |
| CN108574882B (en) * | 2017-03-08 | 2019-11-12 | 华为技术有限公司 | A kind of video transmission method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102638704B (en) | 2015-06-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101480050B (en) | Performance aware peer-to-peer video-on-demand | |
| CN101480051B (en) | Support for interactive playback devices for performance aware peer-to-peer video-on-demand service | |
| US7945689B2 (en) | Method and apparatus for transferring files to clients using a peer-to-peer file transfer model and a client-server transfer model | |
| EP3005718B1 (en) | Manager for dash media streaming | |
| Choe et al. | Improving VoD server efficiency with bittorrent | |
| US8966097B1 (en) | Fractional redundant distribution of media content | |
| Wang et al. | Joint online transcoding and geo-distributed delivery for dynamic adaptive streaming | |
| US20090119734A1 (en) | Distributed Cache Algorithms and System for Time-Shifted, and Live, Peer-to-Peer Video Streaming | |
| EP2181539B1 (en) | Methods and apparatus for cooperative file distribution with target data delivery rate | |
| US20100281509A1 (en) | Prefix caching assisted quality of service aware peer-to-peer video on-demand | |
| US20100179973A1 (en) | Systems, methods, and computer programs for delivering content via a communications network | |
| Wang et al. | PLVER: Joint stable allocation and content replication for edge-assisted live video delivery | |
| CN102638704A (en) | Performance perceived peering content on-demand | |
| Tian et al. | A novel caching mechanism for peer-to-peer based media-on-demand streaming | |
| He et al. | Modeling and analysis of multi-channel P2P VoD systems | |
| KR100797389B1 (en) | The cluster based streaming system and method using multiple description coding | |
| Wang et al. | Joint Online Processing and Geo-Distributed Delivery for Dynamic Social Streaming | |
| Ouedraogo et al. | MORA on the Edge: a testbed of Multiple Option Resource Allocation | |
| Wang et al. | Joint online transcoding and geo-distributed delivery for | |
| Shin et al. | P2P transfer of partial stream in multimedia multicast | |
| Poon et al. | First segment partition for video-on-demand broadcasting protocols | |
| Hareesh et al. | Analysis of Fault Tolerance in Peer to Peer Video on Demand System Using V Chaining | |
| Qu et al. | A RF-IPS algorithm for peer-to-peer video-on-demand system | |
| Hareesh et al. | Performance Analysis of Peer to Peer Video on Demand System using V-Chaining Mechanism |
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: 20150617 Termination date: 20160627 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |