CN102638704B - Performance perceived peering content on-demand - Google Patents
Performance perceived peering content on-demand Download PDFInfo
- Publication number
- CN102638704B CN102638704B CN201210083885.7A CN201210083885A CN102638704B CN 102638704 B CN102638704 B CN 102638704B CN 201210083885 A CN201210083885 A CN 201210083885A CN 102638704 B CN102638704 B CN 102638704B
- Authority
- CN
- China
- Prior art keywords
- sub
- video
- editing
- peer
- 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.)
- Expired - Fee Related
Links
Landscapes
- Information Transfer Between Computers (AREA)
- Two-Way Televisions, Distribution Of Moving Picture Or The Like (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 divisional application that the application is the applying date is on 06 27th, 2006, application number is 200680055164.8, denomination of invention is the patent application of " the peer content program request of performance aware ".
Technical field
The present invention relates to Peer-To-Peer (peer-to-peer networking), and relate to particularly and utilize peer-to-peer network to provide video-on-demand service, this peer-to-peer network provides equity point (peer) video to download (each equity point downloading data/video by peer-to-peer network) when considering systematic function.
Background technology
Traditionally, used client-server service model to provide streaming service (streaming service).User end to server sends request, if the then server request service that has enough resources to be client and having enough bandwidth along on the path between server and client side, then server by content flow to client.
Bandwidth limited in the network of the calculating limited due to server place and storage resources and connection server and client, in client-server streaming service, extensibility is a problem.Recently, peer to peer technology (peer-to-peer technique) is introduced streaming service.Each equity point is implemented as the ability with client and server, and by one's own initiative by VPN Content cache and be other each equity point services, contributes to alleviating the live load the bandwidth demand that distributes on network that apply on the server.Research shows, peer to peer technology significantly improves the system expandability, makes system can be much more user service.
Significant effort has been made for solving the scalability problem existed in the streaming media service utilizing Peer-To-Peer.These effort can be classified as two classes: especially, the video streaming that reciprocity live stream transmission and equity store or video request program.Although two kinds of services make great efforts to utilize peer to peer technology to support a large number of users, simultaneously for user provides good viewing quality, they are also faced with different technological challenges.In the transmission of reciprocity live stream, challenge is: initial delay is minimized and the extensibility of not sacrificial system.In reciprocity video-on-demand service, challenge is to allow async user to share.
Each reciprocity flow transmission scheme also distinguishes they self by different data dissemination techniques (dissemination).Two kinds of data distributing methods-are especially developed, based on the covering method of (overlay) and the method for data-driven.In the method based on covering, each equity point forms grid or tree structure, wherein between each equity point, forms set membership.Sub-equity point is from his father's peer receives data.On the contrary, the set membership that each equity point in the method for data-driven is not fixed.Each equity point finds the data of disappearance, and no matter somewhere available data of just fetching disappearance.Although equity in early days widely uses the method based on covering in attempting, the method for data-driven becomes increased popularity, because it efficiently solves fluctuation (churn) and asymmetric bandwidth problem.
Although the effort of most prior art present good extensibility and compared with traditional client-server service model the user of the larger quantity of support, but prior art hits it hard in itself (best effort), and studies the support to performance requirements not yet fully.
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.Equity is downloaded and is integrated with in traditional client-server video-on-demand service model by the present invention.Equity is downloaded and is carried main data transfer load, thus significantly reduces the live load applied on the server.Therefore, its most of resource is devoted to provide emergency data to meet performance requirement by server.Improve the performance sensed at client place.Consider performance requirement, design reciprocity download algorithm.
Whenever what video-on-demand service allowed user to expect at them selects and viewing video content on network.Present invention resides in video request program and the segmentation equity video sharing model that content is shared in middle permission is set.Performance issue is solved by the merging peer-data download algorithm of performance aware and the supplementary flow transmission of server-aided, the peer-data download algorithm of performance aware and the supplementary flow transmission of server-aided realize the performance similar to the performance that traditional client-server service model provides jointly, but support more users/request.
The method that method and system of the present invention drives for usage data and real-time scheduling is integrated with peer-data distribution procedure to improve the reciprocity video-on-demand service that user watches impression.Should note: systematic function (particularly, user receives asked video immediately) means that the entirety viewing that improve user is experienced and improves overall video quality.System performance aware data of the present invention is shared and supplementary server flows transmits the viewing quality that improve client/user side.
Describing a kind of for providing the method for video-on-demand service, comprising: receive the video sub-clip before flow transmission; Determine the video sub-clip required for a group; Locate a video sub-clip in the video sub-clip required for this group; And download the video sub-clip of locating.Describing a kind of for providing the system of video request program, comprising equity point, server and tracker.Tracker can to coexist a position with server.Equity point comprises the device for receiving the video sub-clip before flow transmission; For determining the device of video sub-clip of a group; For locating the device of a video sub-clip in the video sub-clip of this group; And for downloading the device of located video sub-clip.
Describe a kind of method that server provides video request program, described method comprises: receive the request to video content elements; Perform and permit controlling; Described video content elements is segmented into the sub-editing of multiple video on demand content; Calculate the quantity wanting the sub-editing of the video on demand content before flow transmission; And described in flow transmission before the sub-editing of video on demand content.
Accompanying drawing explanation
When read in conjunction with the accompanying drawings, the present invention will be understood best from detailed description below.The concise and to the point each figure described below accompanying drawing comprises, wherein in each figure, identical label represents similar element:
Fig. 1 is the schematic diagram according to peer-to-peer network of the present invention.
Fig. 2 illustrates the figure according to peer-to-peer network of the present invention.
Fig. 3 controls from the allowance of server side the flow chart that (admission control) process.
Fig. 4 and Fig. 5 describes the flow chart from the allowance control treatment of user/client-side.
Embodiment
The user of video-on-demand service watches the different piece of video in any given moment.Can share between each user to make content and the inner capacities transmitted by peer-to-peer network is maximized, supposing that each user has the whole copy of content play and/or the memory capacity of part copy high-speed cache.When the memory capacity of the quick increase of video playback device, this is rational hypothesis.It should be noted that video playback device to receive any equipment with playback (storage or fact) video, include but not limited to computer, laptop computer, personal digital assistant (PDA) 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 network that is wireless connections.
In the segmented peer-to-peer video-on-demand method and apparatus of the present invention, video clipping is divided into the fragment of the multiple equal lengths represented with " sub-editing ".Playback duration when sub-editing starts is defined as the time limit of this sub-editing.Sub-editing (leading sub-clips) is above streamed to video playback device, makes user to get started playback.Meanwhile, between each user, set up peer-to-peer network, take out the data of sub-editing subsequently so that pre-.According to system performance aware scheme of the present invention, before the time limit of sub-editing, the data of sub-editing must be taken out in advance.Once the playback of sub-editing starts, just the equity of this sub-editing is not allowed to download, because newly downloaded data may be out of date.In order to better systematic function, the supplementary flow transmission from original server is initiated from this point.Following description supplements flow transmission.
Example is used to illustrate the request service of segmentation of the present invention equity video request program how for entering.In this example, suppose that user can by whole copy high-speed caches of video.Even if only by a part of high-speed cache of video copy, identical technology is also suitable for.Also suppose server only by the first sub-assembled stream transmission, and utilize the data of the sub-editing after peer-to-peer network download.To present and describe the algorithm of quantity of the sub-editing calculating flow transmission below.
Referring now to Fig. 1, client/user 1 is at time t
1request/requirement is made to the video from server.Sub-editing 1 (the first video sub-clip) is spread and is passed to client 1 by server at once, makes client 1 promptly can start playback.Meanwhile, attempt location in a peer-to-peer network have/high-speed cache has the equity point of sub-editing 2.Now, having only in peer-to-peer network/high-speed cache has the equity point of sub-editing 2 to be servers, and this server can show as an equity point.(at least) client and server is the member of peer-to-peer network.At time t
2, client 1 just in the sub-editing 1 of playback, and downloads (but not flow transmission) sub-editing 2 from server.Client/user 2 makes request/requirement to the same video from server, and gets started the sub-editing 1 of playback, and this sub-editing 1 is transferred to client 2 by from server flows.Server and client side 1 both starts sub-editing 2 to download (but not flow transmission) to client 2.Now, server, client 1 and client 2 are each equity point in peer-to-peer network.At time t
3, client 3 makes request/requirement to the same video from server, and gets started the sub-editing 1 of playback, and this sub-editing 1 is transmitted from server flows.Up to the present, client 1 is just in the sub-editing 3 of playback and just at the data/video of download sub-clip 4.Client 2 is playing sub-editing 2 and just in download sub-clip 3.Now, (at least) server, client 1, client 2 and client 3 are members of peer-to-peer network.Client 3 can 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 downloads the data of taking out the sub-editing after current sub-editing of playing in advance.To time t
5, client 1 has completed its video playback and has logged off.Client 2 is just in the sub-editing that playback is last, and client 3 is just in the sub-editing 4 of playback and just in download sub-clip 5.For download sub-clip 5, server and the second client are each equity point in peer-to-peer network.Finally, client 2 also logs off after completing video playback.Client 3 watches/the sub-editing of playback 5 and backed off after random system will be terminated in sub-editing 5.
Fig. 2 illustrates the figure according to peer-to-peer network of the present invention.Server 205 has whole copies of video, and can the sub-editing of streamed video or be used as an equity point, and by sub-clip downloads to each equity point 210 of other in peer-to-peer network.Once the video from server 205 is asked/required to equity point 210, it just adds peer-to-peer network, then can from other each equity point 210 download sub-editing subsequently and/or by sub-clip downloads to other each equity point 210.Sub-editing is only from server 205 flow transmission.The usual equity point 210 being passed to and asking/require video that only sub-editing above spread from server 205, and remaining sub-editing is downloaded from server 205 or other equity point 210.But, if downloading rate is not enough to make this equity point receive downloaded sub-editing before the time limit, then sub-editing subsequently may be transferred to this equity point from server flows.Tracker 215 can be embodied as the entity of separation or can be implemented as a part for server 205.If tracker 215 is embodied as the entity of separation, then between server 205 and tracker 215, there is signaling, when each equity point in peer-to-peer network adds and exits peer-to-peer network, this tracker 215 keeps following the tracks of them.The state of tracker also keep which equity point followed the tracks of in peer-to-peer network to have sub-editing that what can download and each equity point (equity point whether has the sub-editing that can be used for being downloaded by another equity point and each equity point needs to download which sub-editing).Once an equity point has received sub-editing, then this sub-editing has just been considered to other each equity point of can be used for being downloaded to this sub-editing of needs by this equity point.The flowline with four-headed arrow indicates sub-clip downloads.The flowline with single arrow indicates sub-assembled stream to transmit (only server can flow transmission).Broken/dotted line flowline indication signaling.
Fig. 3 is the flow chart of the allowance control treatment from server side.New request/the requirement to video is made to server.When new request arrives server, call and permit control treatment 305, and this allowance control treatment 305 carries out allowance control treatment based on collected statistics.If permit this request 310, then calculating 315 should from the quantity of the sub-editing before the direct flow transmission of server.The quantity of (above) sub-editing of flow transmission is represented as N.Server starts 320 the client/user sub-assembled stream being above transferred to request, and 325, value N is turned back to the user/client of request.If there is no grant requests/requirement, then in the quantity of 330 initialization/replacements sub-editing above.
Fig. 4 describes the flow chart from the allowance control treatment of user/client-side.At user/client-side, once client receives response from server, just carry out checking to determine whether request/requirement is allowed by the value (quantity of the sub-editing before client will be transferred to from server flows) of testing N 405.If the value of N is greater than 0, then ask/require to be allowed, and user starts 410 the N number of sub-editing receiving flow transmission.It should be noted that arranging N=-1 at server side and test N > 0 at user/client-side is a kind of possible implementation.Request is permitted test and can such as be realized by mark or any other suitable means.415, current sub-editing N
cbe set to N+1 (next son editing-download sub-editing).Then test is performed to determine whether there is more sub-editings that will download 420.If request/require is not allowed or user has received all sub-editing of video, then process terminates.Meanwhile, 425, have in the peer-to-peer network of location/high-speed cache has the equity point of (N+1) individual sub-editing, and starts individual to (N+1) sub-editing to upload to the equity point needing the individual sub-editing of this (N+1).If determine 430 the time limit d (measuring relative to current time t) also not reaching download, then download 435 and continue.If determine to reach time limit d (measuring relative to current time t) 430, then prepare the data vector (missing data vector) of disappearance 440.In fact, in the time limit more maybe when determining the data vector just preparing this disappearance when can not complete download before time limit d.If download can not be completed before the deadline, then carry out testing to determine whether to need supplementary flow transmission 445.Supplementary flow transmission will be described in more detail below.Meanwhile, 455, current sub-clip counter is increased progressively.If need supplementary flow transmission to guarantee to meet systematic function (sub-editing arrives user before the deadline), then call supplementary flow transmission 450.When reaching the time limit d of the individual sub-editing of download (N+1), user starts the individual sub-editing of playback (N+1), and locate in peer-to-peer network have/high-speed cache have after the equity point of sub-editing, and start video sub-clip download process.
Next, the calculating of the sub-editing quantity will transmitted by server flows is described.
Together with ask/requiring, client/user is also to the downlink bandwidth estimated by server instruction.Think, user may have better understanding to its oneself downlink bandwidth.When server starts video streaming, flow transmission and equity are downloaded and are both consumed downlink bandwidth.Suppose that server is to user i flow transmission n
iindividual sub-editing, at n
itime limit (that is, the L*n of individual sub-editing
i) must (n be downloaded before
i+ 1) copy of individual sub-editing, wherein, L is the duration of a sub-editing.By r
playbackbe expressed as the playback rate of video, and r
downlinkbe expressed as the downlink bandwidth of user, (r
downlink-r
playback) n
il>=Lr
playback." n
i" must be integer (the sub-editing that only flow transmission is complete), therefore
(equation 1)
Described above is segmentation equity video-on-demand service of the present invention, equity download to be integrated with traditional server/customer end video-on-demand service.Equity is downloaded and is carried most of data/video transmission load, therefore significantly reduces the live load that server applies.Be download contrary by maximized for overall system throughput traditional peer file with target, equity of the present invention is downloaded and is considered systematic function (sub-editing arrives user before its time limit) and the time limit meeting sub-editing as possible.The equity of the single sub-editing of following description is downloaded.Then describe the equity how coordinating multiple sub-editing download in case realize immediately by data/delivery of video to all users.
The equity that usage data of the present invention drives is downloaded with commutator clip data between each user.Sub-editing of the present invention is divided into the block of equal sizes, and user concurrent ground downloads each piece from multiple user.Each piece is divided into sub-block by further son, to make it possible to pipeline request to reduce signaling consumption.With every sub-editing accordingly, there is the center element being called as sub-tracker, the user that its equity to the editing of current participation particular child is downloaded keeps following the tracks of.Sub-tracker periodically and when user adds or leave sub-editing peer-to-peer network receives renewal from user.
Each equity point in peer-to-peer network is divided into two classes: seed and download person.Seed be have sub-editing whole/part copy and be willing to purpose other people serve/go up the user of carrier editing.Seed does not download the sub-clip data that they (seed) is just uploading to other equity point, this is because they (seed) has had these data.Download person is still just willing to purpose simultaneously at downloading data other people serves the user of the block that they have had.When a new user starts to download a sub-clip, user contacts corresponding sub-tracker obtaining and currently has sub-editing (or part of sub-editing) in a peer-to-peer network and be ready to upload the user list (seed and download person both) of this sub-editing.Then new user attempts connecting with the user in list, and then the user in these lists becomes its neighbours.
Each equity point runs distributed algorithm to determine that separately this equity point is by data, services/upload to which user.In order to the chance making maximum (maximum quantity) user receive sub-clip data before its respective expiration of time limit maximizes, in selection process, consider some questions.
Suppose to have selected the user receiving data from neighbours' (equity point), and some pieces that these neighbours can select these neighbours to download.Neighbours/equity point adopts local minimum preferential (local rarest first-LRF) strategy when selecting to download which block.This equity point is loaded in the minimum block copied in its neighbours under attempting selection.Target is that the diversity (diversity) of content in system is maximized, that is, the quantity making each piece to copy is equal as far as possible.This makes system pause unlikely because of being difficult to find rare block.When user has had all data that neighbours have, another user of neighbor choice is with to its service/downloading data.
Traditional peer-to-peer network is designed to distribute Single document.In the present invention, video clipping is divided into multiple sub-editing, wherein uses peer-to-peer network distribution every sub-editing.Therefore, in the solution of the present invention method, user can add multiple peer-to-peer network simultaneously.Such as, in FIG, client 3 is at time t
4playing sub-editing 2.Client 3 has completed download sub-clip 2, and in download sub-clip 3.Therefore client 3 adds three peer-to-peer networks of sub-editing 1,2 and 3 respectively.Client 3 is the seeds in the peer-to-peer network of sub-editing 1, is the seed in the peer-to-peer network of (another) sub-editing 2, and is the download person in the peer-to-peer network of another sub-editing 3.For sub-editing 3, client 1 and client 2 are seeds of client 3.At time t
4, client 2 is just in download sub-clip 4, and client 1 is the seed of the sub-editing 4 of client 2.Finally, at time t
4, client 1 is just in download sub-clip 5, and for sub-editing 5, original server is only the seed of client 1.Client 3 can not be that client 1 and 2 is served.
Of the present invention for providing in the peer-to-peer network of the performance aware of video-on-demand service, user can add multiple peer-to-peer network (for every sub-editing, user can add different peer-to-peer networks).But the sum uploaded should be little number, to avoid connecting by having a large amount of open TCP the performance degradation caused.Thus problem becomes the equity point of uploading how selecting to cross over multiple peer-to-peer network makes it possible to overall performance and maximize, that is, the chance making all users fetch content/sub-editing before its respective time limit maximizes.Here is the key factor list being considered to influential system performance:
1. how urgent the time limit have.Time limit is tighter, and download person should obtain higher priority.
2. download and whether carry out according to plan? all users should be impartial to.The time that download should spend from downloading and starting in systems in which with each equity point carries out pro rata.
3. be there how much potential seed can be used? suppose that user leaves immediately after completing peer video playback, different time for the sub-editing of difference can seed amount be different.Such as, in FIG, for client 4, the seed amount of sub-editing 2 is greater than the seed amount of sub-editing 3.This is because the seed of sub-editing 3 must also be the seed of sub-editing 2.But the seed of sub-editing 2 can not be the seed of sub-editing 3, because this seed may leave system after completing playback.Usually, if client arrival process is the Poisson distribution with average arrival rate λ, then available seed number is determined by equation below:
(equation 2), wherein
represent the average seed number of sub-editing i, L
videorepresent video length, and L represents sub-editing length.
4. high upload speed improved system throughput, is therefore preferred.
S represents the size of sub-editing, and t represents current time.If
the time that user j starts to download a kth sub-editing, and
it is the amount of the content of fetching to time t.In addition, if
it is the time limit of a kth sub-editing of user j.Finally, define
it is the downloading process designator of a kth sub-editing of client j.Therefore,
(equation 3).
value reflection downloading process.That is,
whether designation data/video download is carried out according to plan.
that (by sub-clip deadlines) fetches sub-editing and required downloading rate in order on time.
the time be through, and
it is the downloading rate up to the present reached.Downloading process designator is required downloading rate and the ratio of the downloading rate realized.If
then download and ideally carry out according to plan.If
then download and lag behind plan, and if
then download and be ahead of plan.
Present discussion is for determining that equity point should send the tolerance (metric) of data to which neighbour.If
represent for kth sub-editing, equity point i be equity point j serve/download data to equity point j upload weight.
value larger, equity point i more may be chosen as equity point j and serve.If
for:
(equation 4).Molecule is r
ij, it is the upload speed/speed from equity point i to j.Intuitively, more greatly/higher upload speed more improves overall system throughput.Here, larger upload rate is better.This is equivalent to above-mentioned factor 4.
Three are had in the denominator of equation (4).As in equation (3) define,
process indicator, and
little value instruction equity point j lags behind plan.Therefore, j high priority should be given according to above-mentioned factor 2.
value be time to the time limit.According to factor 1,
value less, the time limit is tighter.Priority should be given to the request with the tightest time limit.Finally, at time t, all sub-editing of equity point i
it is all seed.But the request of different sub-editing has the seed of varying number, as shown in equation (2).Should ask to give priority to the user of the seed with minimum number.Elapsed time is longer, and the available seed of this request is more, and this demonstrates last (according to factor 3) in denominator.
As mentioned above, although great care solves performance issue (sub-editing arrives user immediately), when equity downloads the time limit stopped, (or time limit more slightly before) some data still may lack.How present description uses the data of server incoming flow transmission deletion to improve peer video playback performance further.This is called as supplementary flow transmission here.Along with the time limit is close, equity point client prepares the data vector V of disappearance
missing, the data vector V of this disappearance
missinguse such as first of " 1 " the mark to indicate receive block and use second mark of such as " 0 " to carry out the bitmap that still lacks of indicator collet.The data vector of disappearance is sent to server (signaling) together with the time limit that this sub-editing arrives user.Along with the time limit is close, server starts the data that flow transmission goes out disappearance, makes the data/video immediately can filling disappearance for peer video playback.
Network in charge of the present invention three things, (i) is that initial/sub-editing service is above to support rapid playback (passing through flow transmission); (ii) provide supplementary flow transmission to improve the viewing quality (guaranteeing that sub-editing arrives user before every sub-clip deadlines) of user, and (iii) is as the seed in peer-data/video download.Task 1 and 2 has the priority higher than task 3.
Be appreciated that the present invention can realize with hardware, software, firmware, application specific processor or its various forms combined.Preferably, the present invention is implemented as the combination of hardware and software.In addition, software is preferably embodied as the application program visibly embodied on program storage device.Application program can upload to comprise any suitable framework machine on and by its perform.Preferably, this machine realizes having on the computer platform as 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 process described herein and function can be parts (or its combination) for the part of microinstruction code or the application program performed via operating system.In addition, other the ancillary equipment various of such as additional data storage device and printing device can be connected to this computer platform.
It is also understood that, because some the composition system components described in the accompanying drawings and method step are preferably with software simulating, the actual connection between system component (or treatment step) can depend on programming mode of the present invention and different.Provide instruction here, those of ordinary skill in the art can expect these and similar realization or configuration of the present invention.
Claims (3)
1. server provides a method for video request program in a peer-to-peer network, and described method comprises:
Receive the request to video content elements from equity point;
Perform and permit controlling;
Described video content elements is segmented into multiple video sub-clip;
Calculate the quantity of the video sub-clip wanted before flow transmission;
Video sub-clip before described in flow transmission is to described equity point; And
If by exceeding the time limit being clipped to described equity point for downloading remaining video, then supplement the block of the sub-editing of remaining video described in 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 CN102638704A (en) | 2012-08-15 |
| CN102638704B true 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) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| TWI528798B (en) * | 2012-10-11 | 2016-04-01 | 緯創資通股份有限公司 | Streaming data downloading method and computer readable recording medium thereof |
| CN108574882B (en) * | 2017-03-08 | 2019-11-12 | 华为技术有限公司 | A kind of video transmission method and device |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20020161898A1 (en) * | 2000-12-20 | 2002-10-31 | Scott Hartop | Streaming of data |
| US20050055718A1 (en) * | 2003-09-05 | 2005-03-10 | Stone Christopher J. | Peer-to-peer architecture for sharing video on demand content |
| CN1625112A (en) * | 2003-10-06 | 2005-06-08 | 株式会社日立制作所 | Method and apparatus for alert distribution and archive sharing |
-
2006
- 2006-06-27 CN CN201210083885.7A patent/CN102638704B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20020161898A1 (en) * | 2000-12-20 | 2002-10-31 | Scott Hartop | Streaming of data |
| US20050055718A1 (en) * | 2003-09-05 | 2005-03-10 | Stone Christopher J. | Peer-to-peer architecture for sharing video on demand content |
| CN1625112A (en) * | 2003-10-06 | 2005-06-08 | 株式会社日立制作所 | Method and apparatus for alert distribution and archive sharing |
Non-Patent Citations (2)
| Title |
|---|
| dPAM:A Distributed Prefetching Protocol for Scalable Asynchronous Multicast in P2P Systems;Abhishek Sharma;《Infocom 2005. 24th annual joint conference of the IEEE computer and communications societies》;20050301;第2卷;第1139-1142页 * |
| Peer-to-Peer Multimedia Streaming and Caching Service;Won J. Jeon;《Multimedia and EXPO,2002. ICME "02. Proceedings. 2002 IEEE International Conference》;20020826;第2卷;第57－59页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102638704A (en) | 2012-08-15 |
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 | |
| Wang et al. | Joint online transcoding and geo-distributed delivery for dynamic adaptive streaming | |
| US9444863B2 (en) | Manager for DASH media streaming | |
| Choe et al. | Improving VoD server efficiency with bittorrent | |
| US8943215B2 (en) | Distributed smooth streaming utilizing dynamic manifests | |
| US20090119734A1 (en) | Distributed Cache Algorithms and System for Time-Shifted, and Live, Peer-to-Peer Video Streaming | |
| Liang et al. | Incentivized peer-assisted streaming for on-demand services | |
| JP2010517365A (en) | Quality-of-service peer-to-peer video on demand supported by prefix caching | |
| CN101715650A (en) | Set-top box peer-assisted video-on-demand | |
| CN101406060A (en) | Time-delay video downloading service by using P2P content distribution network | |
| CN102510395A (en) | Flash video scheduling method based on peer to server peer (P2SP) | |
| Roverso et al. | Smoothcache 2.0: Cdn-quality adaptive http live streaming on peer-to-peer overlays | |
| CN101605242B (en) | Method, device and system for realizing video-on-demand service | |
| CN102638704B (en) | Performance perceived peering content on-demand | |
| Guo et al. | Ponder: Performance aware p2p video-on-demand service | |
| CN102158767B (en) | Scalable-coding-based peer to peer live media streaming system | |
| Dyaberi et al. | Storage optimization for a peer-to-peer video-on-demand network | |
| Liang et al. | ipass: Incentivized peer-assisted system for asynchronous streaming | |
| He et al. | Modeling and analysis of multi-channel P2P VoD systems | |
| JP4203528B1 (en) | Video data acquisition method, video data acquisition system, video reception device, and video distribution device | |
| Tian et al. | A novel caching mechanism for peer-to-peer based media-on-demand streaming | |
| Zhang et al. | Multi-task downloading for p2p-vod: An empirical perspective | |
| Febiansyah et al. | Peer-assisted adaptation in periodic broadcasting of videos for heterogeneous clients | |
| Wang et al. | Joint Online Processing and Geo-Distributed Delivery for Dynamic Social 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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20150617 Termination date: 20160627 |