CN103260090B - A kind of for the video-frequency band scheduling in P2P three-dimensional flow media system and transmission method - Google Patents
A kind of for the video-frequency band scheduling in P2P three-dimensional flow media system and transmission method Download PDFInfo
- Publication number
- CN103260090B CN103260090B CN201310149934.7A CN201310149934A CN103260090B CN 103260090 B CN103260090 B CN 103260090B CN 201310149934 A CN201310149934 A CN 201310149934A CN 103260090 B CN103260090 B CN 103260090B
- Authority
- CN
- China
- Prior art keywords
- video
- frequency band
- node
- dispatching
- local
- 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
- Compression Or Coding Systems Of Tv Signals (AREA)
- Two-Way Televisions, Distribution Of Moving Picture Or The Like (AREA)
Abstract
The invention discloses a kind of for the video-frequency band dispatching method in P2P three-dimensional flow media system and transmission method, belong to P2P three-dimensional flow field of media.Dispatching method of the present invention for: based on the viewpoint belonging to current video section, play the moment, by high priority to low priority, the priority of the associated video section of following existence is successively set: the same broadcasting moment, the video-frequency band of next even number viewpoint; In same viewpoint, the next video-frequency band playing the moment; If the viewpoint belonging to current video section is even number viewpoint, in the same broadcasting moment, the video-frequency band of upper and lower odd-viewpoint, and top priority is higher than below; Wherein, if above-mentioned associated video section is in video-frequency band dispatching sequence, then skip; Then to described associated video section, by by high prioritization on earth, enter successively in video-frequency band dispatching sequence.Based on above-mentioned dispatching method, propose transmission method of the present invention.Application of the present invention, can promote the playing efficiency of video, and P2P three-dimensional flow media system throughput.
Description
Technical field
The invention belongs to P2P three-dimensional flow media, particularly relate to a kind of for the video-frequency band dispatching method in P2P three-dimensional flow media system, and the P2P three-dimensional flow media transmission method of coding Network Based.
Background technology
Along with the development of three-dimensional (3D) technology and user are to the demand of high-quality sensory effects, video technique is necessarily changed from plane display to stereo display in the developing direction in future.Compared with two-dimensional video, three-dimensional video-frequency adds the depth information of vision, enhances the sense of reality of vision.Such as, and along with the development of computer, communication and network technology, the application prospect of three-dimensional video-frequency is more and more extensive, Digital Television, long-distance education, video conference, the various aspects such as remote industrial control.
In order to improve video scene authenticity further, binocular tri-dimensional video system being expanded, forming multi-view video system.Multi-view point video refers to the one group of vision signal obtained from different viewing angles Same Scene by multiple video cameras of different points of view, is a kind of effective three-dimensional video-frequency method for expressing, can more vivo reconstruction of scenes, provides third dimension and interactive function.Compare with conventional video, the data volume of multi-view point video linearly increases along with the number increase of video camera.Googol has become the bottleneck of its extensive use of restriction according to amount, and for this reason, the joint video team (JVT, jointvideoteam) of ITU-T and MPEG proposes the concept of multiple view video coding (MVC, MultiviewVideoCoding).MVC is mainly devoted to the Efficient Compression coding of multi-view point video, and be a key technology in the future video communications field, international video standard organizes the research be just devoted to MVC, and it can be used as the H.264/AVC the 4th increasing to repair case.
In single-view video coding standard, inter prediction is the effective means removing video sequence time redundancy.In order to improve the accuracy of inter prediction, H.264/AVC introduce multiple reference images Predicting Technique.Under H.264/AVC coding framework, the most direct mode of redundancy between viewpoint of removing uses the decoded picture in other viewpoints to carry out displacement estimation and inter prediction as with reference to image when encoding present image, and this method is called interview prediction.How design time prediction and interview prediction are the problems that MVC predict needs to solve with correlation between operational use time and viewpoint.Current, propose the multiple predict being applicable to MVC, the JVT predict adopted into MVC standard is the predict based on graduation B frame (HBP), can be described as JMVC predict, as shown in Figure 1,8 viewpoints are shown in figure, GOP (GroupofPictures, image sets) length be 8 multi-view point video predict block diagram, horizontal direction arrow represents time prediction relation, and vertical direction arrow represents interview prediction relation, wherein, S0 ~ S7 represents different viewpoints, and S0 is basic viewpoint, and other are not substantially viewpoint; T0 ~ T8 represents the frame of different time; Capital I, B, P represent this frame and can use as the reference frame of other frame, and lowercase b represents this frame can not be used as reference frame use, and the label in each frame lower right corner represents different time horizons (from 0 to 4).General GOP selects 8,12 or 15, utilizes every IDR frame to refresh.The last frame of each GOP becomes key frame (anchorpicture), it can be I, B and P frame, key frame is the most important frame of each video sequence, other frame that can not be different on the reference time, but can with reference to the key frame in the different points of view of same time.
Along with the rapid growth of Internet video demand and flow, P2P (PeertoPeer, peer-to-peer network) technology relies on it in streaming media, have low cost, advantage that extensibility is strong, and P2P stream media technology is widely used.
There are some about the scheme of P2P3Dstreaming (Streaming Media) system at present.Wherein, following two kinds of modes are related generally to about to the scheduling of segment (video-frequency band):
The first is a left side of recovering needed for 3D effect, right two-path video stream is bound together, transmit after synthesizing one section of video flowing, wherein the scheduling strategy of segment (video-frequency band) adopts: the segment the closer to broadcast point more first transmits.The essence of this scheduling scheme is just similar to the segment transmission of the common P2P Streaming Media of super large data volume in fact.In this scheme, left, right two-path video stream is bound together and transmits, and this just causes once go out active, then cannot recovering video; In addition on the one hand, the program does not consider viewpoint translation, can only recover the 3-D effect at a visual angle, spectators therefore can not be made to realize enjoyment that abundant visual angle effect brings and enjoyment.
Its two be consider left, right two-path video stream, two video-frequency bands (segment) binding of same broadcasting moment images of left and right eyes is got up abbreviation PU (PlaybackUnit, broadcast unit), sorts according to the weight of certain rule to these PU.The weight of each PU is comprehensively determined the smoothness of video and quality influence degree by video-frequency band.Weight again based on these PU carries out prioritization, the work of prioritization is all same before segment starts scheduling to be undertaken by server (content server), be distributed on each Peer (node) after sequence, the priority determined based on server carries out the scheduling of segment.In this scenario, the sequence of segment weight is unified in server place and carries out, and increases the weight of the burden of server, and only single consideration is to the scheduling of 3D video-frequency band, and some technology being applicable to P2Pstreaming transmission are not taken into account, such as, network code.
Network code is suggested in information theory, and is recently more and more becoming the most promising means improving P2P network performance.In simple terms, network code is exactly allow the nodes of only responsible forwarding work in the past, data flow through self time, encoding operation is carried out to it.Have research to point out, in the network environment of reality, the numerical computations on the galois field of limited size for network code oneself through being enough.By network code is introduced among Data dissemination, except time of initial buffer before can reducing to play, improve the quality of viewing, the more important thing is, in the large (network bandwidth instability of network dynamic, user add exit frequent) when, system can obtain good stability.For the stream media system of P2P, network code has help to its performance boost, and under the network condition especially just having met user's needs reluctantly at service bandwidth, effect is more obvious.R2 (RandompushwithRandomNetworkCoding, random network code) system proposes a series of design principle for P2P live streaming media agreement, the benefit utilizing network code to bring substantially.
There is the system schema of the P2Pstreaming of some codings Network Based at present.This scheme carries out the scheduling of segment for the P2P Streaming Media based on SVC (can layered video coding), and in transmitting procedure, merged network code, gets good effect.In this scheme, according to weight, prioritization is not carried out to video-frequency band, the strategy of the scheduling of segment is just carried out for the P2P Streaming Media employing SVC, and do not consider the encoding characteristics of MVC, be not a general system schema being applicable to all P2P Streaming Medias.
Therefore, carry out the research of the P2P3D stream media system scheme of coding Network Based energetically, be expected to obtain new breakthrough in internet video Stream Media Application field, for realizing more reliably, more stable, the better P2P3D stream media system of performance lays the foundation.
Summary of the invention
Goal of the invention of the present invention is: provide a kind of promote playing efficiency for the video-frequency band dispatching method in P2P three-dimensional flow media system.
Of the present invention a kind of for the video-frequency band dispatching method in P2P three-dimensional flow media system, comprise the following steps:
Step a: based on the viewpoint belonging to current video section, play the moment, by high priority to low priority, the priority of the associated video section of following existence is successively set:
(1) in the same broadcasting moment, the video-frequency band of next even number viewpoint; Wherein, base view is specified to be first even number viewpoint;
(2) in same viewpoint, the next one of current video section plays the video-frequency band in moment;
(3) if the viewpoint belonging to current video section is even number viewpoint, in the same broadcasting moment, neighbouring video-frequency band, and the priority of the video-frequency band of top is higher than the video-frequency band of below;
Wherein, if described associated video section is in video-frequency band dispatching sequence, then priority is not arranged to described associated video section;
Step b: to the associated video section having priority in step a, by by high prioritization on earth, enters in video-frequency band dispatching sequence successively.
Compared with existing video-frequency band scheduling strategy, the present invention is the dispatching sequence determining video-frequency band based on MVC encoding characteristics, and when transmitting, its Loss Rate is low, starts time delay little, effectively promote the playing efficiency of P2P3Dstreaming during broadcasting; And the conversion that can realize between multiple viewpoint, can allow user obtain the three-dimensional stereo effect of more free more horn of plenty.3Dstreaming can better be applicable to.
Based on the video-frequency band dispatching method that the present invention proposes, the invention allows for a kind of P2P three-dimensional flow media transmission method of coding Network Based, to improve the throughput of existing P2P3Dstreaming system.
A P2P three-dimensional flow media transmission method for coding Network Based, comprises the following steps:
Step 1: the client node of request video content, obtains corresponding neighboring node list by index server;
Step 2: described client node, according to dispatching method of the present invention, carries out scheduling to the video-frequency band involved by current sliding window mouth, obtains video-frequency band dispatching sequence, and in described video-frequency band dispatching sequence, video-frequency band is had to this locality and identify;
Client node, based on described local video section dispatching sequence, current sliding window message breath, sends video request information to neighbor node;
Step 3: the node receiving video request information, according to dispatching method of the present invention, based on described client node current sliding window mouth involved by local video section carry out scheduling, obtain local video section dispatching sequence, and in this video-frequency band dispatching sequence, video-frequency band is had to this locality and identify;
Client node and local video-frequency band dispatching sequence are compared, carries out network code to being only the video-frequency band that this locality has in both successively, and send to client node.
Or complete transmission by the following step:
Step 1: the client node of request video content, obtains corresponding neighboring node list by index server;
Step 2: described client node sends video-frequency band order request information to neighbor node, and described request information ceases with the current sliding window message of client node;
Step 3: the node receiving step 2 described request, detects the neighboring node list of local maintenance, judges whether current neighbours number is greater than the higher limit of local node, if so, then abandons described request; Otherwise, dispatching method according to claim 1, scheduling is carried out to the local video section involved by the current sliding window mouth based on client node, obtain the video-frequency band dispatching sequence of local video section, and this locality is had after video-frequency band identifies in this video-frequency band dispatching sequence, send to described client node;
Step 4: after client node receives the video-frequency band dispatching sequence described in step 3, dispatching method according to claim 1, scheduling is carried out to the local video section involved by described current sliding window mouth, obtain local video section dispatching sequence, and in this video-frequency band dispatching sequence, video-frequency band is had to this locality and identify;
The video-frequency band dispatching sequence received and local video-frequency band dispatching sequence compare by client node, will be only video-frequency band that sending node has as request video-frequency band in two video-frequency band dispatching sequences, and to described node transmission request information;
Step 5: node carries out network code to the request video-frequency band described in step 4, and sends to client node.
Compared with the transmission method in existing P2P3Dstreaming system, existing network code incorporates in the transmitting procedure based on the P2P3Dstreaming of MVC coding by the present invention, reduces the startup time delay of video playback, improves the throughput of P2P system.Meanwhile, do not focusing on server by the scheduling of video-frequency band, but adopting distributed, directly completing the scheduling to institute's transmission of video section by each node, effectively reducing the computing overhead at server place, thus the performance of whole system is got a promotion.
In sum, owing to have employed technique scheme, the invention has the beneficial effects as follows: under the prerequisite that the video-losing rate of 3Dstreaming is low, playing efficiency is high, and the conversion that can realize between multiple viewpoint, user can be allowed to obtain the three-dimensional stereo effect of more free more horn of plenty; Meanwhile, improve the throughput of existing P2P3Dstreaming system.
Accompanying drawing explanation
Examples of the present invention will be described by way of reference to the accompanying drawings, wherein:
Fig. 1 is existing JMVC predict schematic diagram;
Fig. 2 is in embodiment, P2P3Dstreaming system architecture diagram of the present invention;
Fig. 3 is in embodiment, to the stepwise schematic views of video flowing;
Fig. 4 is in embodiment, the priority level initializing schematic diagram of video-frequency band;
Fig. 5 is in embodiment, under a sliding window, and frequency range dispatching sequence schematic diagram;
Fig. 6 is in embodiment 1, video-frequency band transfer process figure;
Fig. 7 is in embodiment 2, video-frequency band transfer process figure.
Embodiment
All features disclosed in this specification, or the step in disclosed all methods or process, except mutually exclusive feature and/or step, all can combine by any way.
Arbitrary feature disclosed in this specification (comprising any accessory claim, summary and accompanying drawing), unless specifically stated otherwise, all can be replaced by other equivalences or the alternative features with similar object.That is, unless specifically stated otherwise, each feature is an example in a series of equivalence or similar characteristics.
Distributed structure/architecture is adopted, as shown in Figure 2 based on P2P3D stream media system of the present invention.In the architecture, each client node can ask video content to multiple node (Peer) simultaneously, also can provide video content for multiple node (Peer) simultaneously, thus form the overlay network framework of a kind of netted (mesh) on the whole.Client node obtains information of neighbor nodes by Tracker (central index server).In this framework, the major function of Tracker comprises: 1) client node logs on Tracker, and Tracker preserves relevant information for it; 2) for the client node of request video content returns applicable neighboring node list; 3) according to the dynamic change situation of client node, return new neighboring node list in good time.The major function of the content server (seeder) in this framework carries out MVC coding and burst to original video content, and seeder also accepts the request of Peer as the ordinary node in system and provides service.Compared with the P2P stream media system of traditional distributed structure/architecture, based on P2P3D stream media system of the present invention at Peer end except common function, add following two new logic modules.
(1) network code module, for carrying out network encoding and decoding to video-frequency band (segment).Existing network code is adopted, such as random network code in this module.The Code And Decode process of random network code is respectively:
Cataloged procedure: original document is divided into n block (n>1), (B
1, B
2... B
n), each data block B
isize is all fixing kbytes (if kbytes fills 0 not).When a node (comprising source node) receives the video request of other node, in finite field, choose code coefficient composition coding vector independently, randomly
after (m≤n), Stochastic choice m (b from the data block received
1, b
2... b
m) data block of encoded mistake.If at source node, then select whole n data block, according to formula
carry out network code and produce a new block codedblock, obviously the size of this block is still kbytes.
Decode procedure: when receiving the linear independence encoding block D=(D that total amount is n
1, D
2... D
n), start decode procedure.First the n carried separately in n the encoding block received is maintained the coefficient vector matrix A that number vector extracts composition n × n, n the coefficient that each line display encoding block namely in matrix A is corresponding, then by calculating B=A
-1x
tdecode and recover original data block B=(B
1, B
2... B
n).
(2) scheduler module: scheduler module provides the function of video being carried out to scheduling.A kind of dispatching method for p2p3Dstreaming newly adopting the present invention to propose in this module.This dispatching method sorts to segment according to MVC encoding characteristics, to be better applicable to 3Dstreaming, obtains better playing efficiency.Dispatching method of the present invention is implemented as follows:
See Fig. 3, one section is had by the video flowing of 8 viewpoints (S0 ~ S7) in figure, the video flowing of each viewpoint is subdivided into multistage (segment) again respectively again, the reproduction time of a corresponding unit of section, comprise an integer GOP, GOP is the upper least unit that can independently decode of frame-layer time, and node carries out transmission selection and dispatches in units of section.In figure, represent with LSpq and belong to p the segment of viewpoint on q unit interval, as LS01 represents the segment of the 0th viewpoint first unit interval.
By carefully studying the encoding characteristics of MVC.We can draw really there is correlation and dependence between segment, as shown in Figure 4, we can draw according to these characteristics the prioritization being applicable to MVC, about establish a capital and follow identical scheduling rule between Peer, and without the need to doing unified calculation process at server place.The scheduler module of Peer, first based on the viewpoint belonging to current segment (i.e. the current segment carrying out processing), broadcasting moment, by high priority to low priority, successively arranges the priority of the association segment of following existence:
(1), the video-frequency band of next even number viewpoint; Wherein, specify base view to be first even number viewpoint, and adjacent with base view first viewpoint is as odd-viewpoint;
(2) in same viewpoint, the next one of current video section plays the video-frequency band in moment;
(3) if the viewpoint belonging to current video section is even number viewpoint, in the same broadcasting moment, neighbouring video-frequency band, and the priority of the video-frequency band of top is higher than the video-frequency band of below;
Association segment described in above-mentioned (1) (2) (3), if in video-frequency band dispatching sequence, has not then put priority to this association segment;
And then to the above-mentioned association segment being provided with priority, by by high prioritization on earth, enter successively in video-frequency band dispatching sequence.
See Fig. 4, take LS21 in scheming as the segment of current broadcasting, illustrate and the priority of its association segment is arranged:
(1) in the same broadcasting moment, there is the segmentLS41 of next even number viewpoint in LS21, then the priority of LS41 is the highest, and such as priority is set to 1;
(2) at same viewpoint (S2), there is the next segmentLS22 playing the moment, then the priority of LS22 is only second to the priority of LS41, and priority is set to 2;
(3) LS21 belongs to even number viewpoint, the priority of neighbouring segmentLS11, LS31 of being existed is set to 3,4.
See Fig. 5, for a current sliding window mouth of video request node, rule is set according to above-mentioned priority, segment dispatching sequence involved under obtaining this sliding window:
Current segment is LS01, and in the same broadcasting moment, because it does not exist upper adjacent segment, then its association segment is: LS21, LS02, LS11, and dispatching sequence is now LS01-LS21-LS02-LS11;
Then process LS21, its association segment is: LS22, LS11, because LS11 is in dispatching sequence, then enter in dispatching sequence by LS22, obtains the dispatching sequence after upgrading: LS01-LS21-LS02-LS11-LS22;
Then process LS02, its association segment is: LS22, LS03, LS12, because LS22 is in dispatching sequence, then enter dispatching sequence by LS03, LS12 successively, obtains the dispatching sequence after upgrading: LS01-LS21-LS02-LS11-LS22-LS03-LS12;
The like, the transmission sequence to each video-frequency band involved under the sliding window shown in Fig. 5 can be obtained: LS01-LS21-LS02-LS11-LS22-LS03-LS12-LS23-LS04-LS13-LS24.
In the P2P3Dstreaming system of coding Network Based, the transmission means utilizing dispatching method of the present invention to carry out video-frequency band can be:
Step 1: client node Client please obtains corresponding neighboring node list Peerlist by index server;
Step 2: the scheduler module of described Client, video-frequency band involved by current sliding window mouth in MVC video flowing (sliding window such as shown in Fig. 5) carries out scheduling, (each field of bitmap is used for recording the presence or absence of segment to obtain an one dimension bitmap bitmap, 1 represents that Client has, 0 represent Client without), then by with described bitmap, current sliding window message breath video request information send to neighbor node;
Step 3: receive the bitmap node Peer described in step 2, by its scheduler module, based on Client current sliding window mouth (obtaining from received video request information) involved by local video section carry out scheduling, obtain the bitmap of Peer under current sliding window mouth; And then compare with the bitmap of the Client received, by its coding/decoding module successively in two bitmaip, (namely in two bitmaip, Client does not have the distinctive video-frequency band of Peer, the video-frequency band that Peer has) encode, and send to Client.
In the P2P3Dstreamin system of coding Network Based, the transmission means utilizing dispatching method of the present invention to carry out video-frequency band also can be:
Step 1:Client obtains corresponding Peerlist by index server;
Step 2:Client initiates to connect to the several neighbor nodes in Peerlist at random, and request bitmap, ceases with current sliding window message in this solicited message;
Step 3: the Peer receiving request, detects the neighboring node list of local maintenance, judges whether current neighbours number is greater than the higher limit of local node, if so, then abandons described request; Otherwise, by its scheduler module, based on Client current sliding window mouth involved by local video section sort, obtain the bitmap of corresponding Peer, and described bitmap sent to Client;
After step 4:Client receives the bitmap of step 3, by its scheduler module, sort based on the local video section involved by its current sliding window mouth, obtain the bitmap of corresponding Client; Then two bitmap being compared, asking to be only in two bitmap to sending the Peer of bitmap the video-frequency band (namely in two bitmap, Client does not have, the video-frequency band that Peer has) that described Peer has;
Step 5: described Peer carries out network code by its coding connection module to asked video-frequency band, and sends to Client.
In above-mentioned transmission means, represent that the dispatching sequence of video-frequency band can the realization of reduction procedure further with bitmap, represent that the dispatching sequence of video-frequency band of the present invention equally also can realize transmission method of the present invention by other modes.
Embodiment 1
Realize the transmission method of the P2P3Dstreaming of coding Network Based of the present invention in push mode, the program can save the time and expense of turning node request bitmap (bitmap).See Fig. 6, concrete realization flow is as follows:
S101:Client logs on Tracker, request Peerlist;
S102:Tracker returns required Peerlist to Client;
First S103: after receiving Peerlist, Client (can represent with the buffermap of a multidimensional all video-frequency bands that current sliding window mouth comprises, such as, 9 video-frequency bands shown in Fig. 5 to the segment involved by oneself current sliding window mouth.And at buffermap, the existing segment in this locality is identified, as 1 indicates, 0 indicate without, wherein, concerning content server, time initial, its buffermap is 1 entirely) sort according to scheduling of the present invention rule after obtain the bitmap of one dimension, and in grid of reference coding, divide the existing mode of bitmap priority area, carry out front and back Region dividing to this bitmap, forefoot area is called priority area, with further start quickly, increase network throughput.Based on experience value, in conjunction with the size (such as arranging 40% of bitmap total length for priority area) of actual conditions setting priority area, Client is sequencing sequence and the bitmap of zoning issues neighbor node.Send neighbor node be chosen as prior art, if the several neighbor node of Client Stochastic choice from Peerlist is as Peer;
After S104:Peer receives bitmap, the multidimensional buffermap of this locality according to the bitmap obtaining one dimension after identical scheduling rule compositor, contrast with the bitmap of Client, if Peer has the segment of Client needs (in two bitmap, Client does not have, the segment that Peer has) and uploading bandwidth has redundancy, first sends the video-frequency band corresponding to priority area of bitmap to Client, sends the video-frequency band corresponding to remaining area afterwards again.
Because incorporated network code, Peer has been divided into n block a segment, produces one group of random coefficient matrix, carries out random coded to this n block, generates an encodedblock, and sends this encodedblock and coefficient matrix to Client;
S105: after Client receives multiple encodedblock, produces one group of random coefficient, carries out being transmitted to it to the Client carrying out its request after random coded produces another one encodedblock to it;
When Client collects n the encodedblock from same segment, Client can decode this segment;
S106: after Client collects a segment, upgrade the bitmap of oneself, and send oneself up-to-date bitmap to neighbours;
S107:Peer according to the new bitmap from Client, then carries out random push.
Embodiment 2
The transmission method that the present invention is based on the P2P3Dstreaming of network code can also realize by the mode of pull, to adapt to different demand occasions.See Fig. 7, concrete performing step is as follows:
S201:Client logs on Tracker, request Peerlist;
S202:Tracker returns required Peerlist to Client;
After S203:Client receives Peerlist, initiatively initiate connection request bitmap to Peer;
After S204:Peer receives the bitmap request from Client, first check the neighbor list oneself safeguarded, at most can the number of maintenance of neighbor if the number of current maintenance of neighbor is no more than oneself, then according to after scheduling rule compositor, the bitmap of oneself is sent to Client; Can the maximum of maintenance of neighbor number if Peer has reached, then abandon this bitmap and ask;
Described bitmap and the bitmap of oneself compares, asks to Peer the segment that in two bitmap, Peer is exclusive after receiving the bitmap of Peer reply by S205:Client;
The segment that S206:Peer receives from Client asks, then determine whether reply, if the uploading bandwidth of Peer has redundancy, then accept request, send the segment asked to Client according to the situation of self;
Because incorporated network code, Peer has been divided into n block a segment, produces one group of random coefficient matrix, carries out random coded to this n block, generates an encodedblock, and sends this encodedblock and coefficient matrix to Client;
S207:Client collects n the encodedblock from same segment just can solve this segment;
S208:Client collects the rear of a segment and sends acknowledge message---have message to Peer, and continues other segment of request;
After S209:Peer receives have message, no longer send this segment.
The present invention is not limited to aforesaid embodiment.The present invention expands to any new feature of disclosing in this manual or any combination newly, and the step of the arbitrary new method disclosed or process or any combination newly.
Claims (6)
1., for the video-frequency band dispatching method in P2P three-dimensional flow media system, it is characterized in that, comprise the following steps:
Step a: based on the viewpoint belonging to current video section, play the moment, by high priority to low priority, the priority of the associated video section of following existence is successively set:
(1) in the same broadcasting moment, the video-frequency band of next even number viewpoint; Wherein, base view is specified to be first even number viewpoint;
(2) in same viewpoint, the next one of current video section plays the video-frequency band in moment;
(3) if the viewpoint belonging to current video section is even number viewpoint, in the same broadcasting moment, neighbouring video-frequency band, and the priority of the video-frequency band of top is higher than the video-frequency band of below;
Wherein, if described associated video section is in video-frequency band dispatching sequence, then priority is not arranged to described associated video section;
Step b: to the associated video section having priority in step a, by by high prioritization on earth, enters in video-frequency band dispatching sequence successively.
2. a P2P three-dimensional flow media transmission method for coding Network Based, is characterized in that, comprise the following steps:
Step 1: the client node of request video content, obtains corresponding neighboring node list by index server;
Step 2: described client node dispatching method according to claim 1, carries out scheduling to the video-frequency band involved by current sliding window mouth, obtains video-frequency band dispatching sequence, and in described video-frequency band dispatching sequence, has video-frequency band to this locality identify;
Client node, based on described local video section dispatching sequence, current sliding window message breath, sends video request information to neighbor node;
Step 3: the node receiving video request information, dispatching method according to claim 1, scheduling is carried out to the local video section involved by the current sliding window mouth based on client node, obtain local video section dispatching sequence, and in this video-frequency band dispatching sequence, video-frequency band is had to this locality and identify;
Client node and local video-frequency band dispatching sequence are compared by described node, carry out network code successively, and send to client node being only the video-frequency band that this locality has in both.
3. transmission method as claimed in claim 2, it is characterized in that, described video-frequency band dispatching sequence is represented by the bitmap bitmap of one dimension, in described bitmap, by the local existing video-frequency band of 1 mark, by the local video-frequency band do not had of 0 mark.
4. transmission method as claimed in claim 3, is characterized in that, in described step 2, after the fixed length front area of described bitmap is also divided into priority area by client node, then send to neighbor node;
Then in step 3, node is first sent in the video-frequency band of priority area, then is sent in the video-frequency band in non-preferential region.
5. a P2P three-dimensional flow media transmission method for coding Network Based, is characterized in that, comprise the following steps:
Step 1: the client node of request video content, obtains corresponding neighboring node list by index server;
Step 2: described client node sends video-frequency band order request information to neighbor node, and described request information ceases with the current sliding window message of client node;
Step 3: the node receiving step 2 described request, detects the neighboring node list of local maintenance, judges whether current neighbours number is greater than the higher limit of local node, if so, then abandons described request; Otherwise, dispatching method according to claim 1, scheduling is carried out to the local video section involved by the current sliding window mouth based on client node, obtain the video-frequency band dispatching sequence of local video section, and this locality is had after video-frequency band identifies in this video-frequency band dispatching sequence, send to described client node;
Step 4: after client node receives the video-frequency band dispatching sequence described in step 3, dispatching method according to claim 1, scheduling is carried out to the local video section involved by described current sliding window mouth, obtain local video section dispatching sequence, and in this video-frequency band dispatching sequence, video-frequency band is had to this locality and identify;
The video-frequency band dispatching sequence received and local video-frequency band dispatching sequence compare by client node, will be only video-frequency band that sending node has as request video-frequency band in two video-frequency band dispatching sequences, and to described node transmission request information;
Step 5: node carries out network code to the request video-frequency band described in step 4, and sends to client node.
6. transmission method as claimed in claim 5, it is characterized in that, described video-frequency band dispatching sequence is represented by the bitmap bitmap of one dimension, in described bitmap, by the local existing video-frequency band of 1 mark, by the local video-frequency band do not had of 0 mark.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201310149934.7A CN103260090B (en) | 2013-04-26 | 2013-04-26 | A kind of for the video-frequency band scheduling in P2P three-dimensional flow media system and transmission method |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201310149934.7A CN103260090B (en) | 2013-04-26 | 2013-04-26 | A kind of for the video-frequency band scheduling in P2P three-dimensional flow media system and transmission method |
Publications (2)
Publication Number | Publication Date |
---|---|
CN103260090A CN103260090A (en) | 2013-08-21 |
CN103260090B true CN103260090B (en) | 2016-03-30 |
Family
ID=48963742
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201310149934.7A Expired - Fee Related CN103260090B (en) | 2013-04-26 | 2013-04-26 | A kind of for the video-frequency band scheduling in P2P three-dimensional flow media system and transmission method |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN103260090B (en) |
Families Citing this family (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN105528346B (en) * | 2014-09-28 | 2019-03-08 | 阿里巴巴集团控股有限公司 | The method and device of media content information is provided |
CN104360902A (en) * | 2014-11-13 | 2015-02-18 | 武汉理工大学 | Sliding window-based multi-priority metadata task scheduling method |
CN105681931B (en) * | 2016-01-12 | 2018-12-28 | 清华大学 | A kind of video data package transmission method and system based on wireless network |
Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102067592A (en) * | 2008-06-17 | 2011-05-18 | 思科技术公司 | Time-shifted transport of multi-latticed video for resiliency from burst-error effects |
CN102292995A (en) * | 2009-01-20 | 2011-12-21 | 皇家飞利浦电子股份有限公司 | Transferring of 3d image data |
CN102394089A (en) * | 2010-06-23 | 2012-03-28 | 索尼公司 | Information processing device, information processing method, and program |
Family Cites Families (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US9106668B2 (en) * | 2008-06-24 | 2015-08-11 | Azureus Software, Inc. | Distributed peer location in peer-to-peer file transfers |
-
2013
- 2013-04-26 CN CN201310149934.7A patent/CN103260090B/en not_active Expired - Fee Related
Patent Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102067592A (en) * | 2008-06-17 | 2011-05-18 | 思科技术公司 | Time-shifted transport of multi-latticed video for resiliency from burst-error effects |
CN102292995A (en) * | 2009-01-20 | 2011-12-21 | 皇家飞利浦电子股份有限公司 | Transferring of 3d image data |
CN102394089A (en) * | 2010-06-23 | 2012-03-28 | 索尼公司 | Information processing device, information processing method, and program |
Also Published As
Publication number | Publication date |
---|---|
CN103260090A (en) | 2013-08-21 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US20090190662A1 (en) | Method and apparatus for encoding and decoding multiview video | |
CN105791882B (en) | Method for video coding and device | |
CN101390396B (en) | Method and apparatus for encoding and decoding multi-view video to provide uniform picture quality | |
US10021418B2 (en) | Method and apparatus of candidate generation for single sample mode in video coding | |
JP5199124B2 (en) | Multi-view video processing | |
US8462196B2 (en) | Method and apparatus for generating block-based stereoscopic image format and method and apparatus for reconstructing stereoscopic images from block-based stereoscopic image format | |
CN101023681B (en) | Method of decoding multiview video flow and decoding device | |
CN101980537B (en) | Object and fractal-based binocular three-dimensional video compression coding and decoding method | |
EP2538674A1 (en) | Apparatus for universal coding for multi-view video | |
CN109417642A (en) | Image bit stream generation method and equipment for high resolution image stream | |
US20070183495A1 (en) | Multi-view video encoding apparatus and method | |
CN101243692B (en) | Method and apparatus for encoding multiview video | |
KR100738867B1 (en) | Method for Coding and Inter-view Balanced Disparity Estimation in Multiview Animation Coding/Decoding System | |
CN103037214A (en) | Video compression method | |
JP2010515400A (en) | Multi-view video encoding and decoding method and apparatus using global difference vector | |
CN101346998A (en) | Video encoding method, decoding method, device thereof, program thereof, and storage medium contains the program | |
Lim et al. | A multiview sequence CODEC with view scalability | |
CN102918846A (en) | Multiview video encoding method, multiview video decoding method, multiview video encoding apparatus, multiview video decoding apparatus, and program | |
CN104065965A (en) | Video processing device, video processing method, video processing system, and video reproduction device and video reproduction method | |
CN102438147B (en) | Intra-frame synchronous stereo video multi-reference frame mode inter-view predictive coding and decoding method | |
CN103814572A (en) | Frame-compatible full resolution stereoscopic 3D compression and decompression | |
JP2008034892A (en) | Multi-viewpoint image encoder | |
CN103260090B (en) | A kind of for the video-frequency band scheduling in P2P three-dimensional flow media system and transmission method | |
CN101568038B (en) | Multi-viewpoint error resilient coding scheme based on disparity/movement joint estimation | |
KR101386651B1 (en) | Multi-View video encoding and decoding method and apparatus thereof |
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: 20160330 Termination date: 20210426 |
|
CF01 | Termination of patent right due to non-payment of annual fee |