CN101420457A - Method, apparatus for downloading data fragmentation by peer, and peer therefor - Google Patents

Method, apparatus for downloading data fragmentation by peer, and peer therefor Download PDF

Info

Publication number
CN101420457A
CN101420457A CNA2008102196410A CN200810219641A CN101420457A CN 101420457 A CN101420457 A CN 101420457A CN A2008102196410 A CNA2008102196410 A CN A2008102196410A CN 200810219641 A CN200810219641 A CN 200810219641A CN 101420457 A CN101420457 A CN 101420457A
Authority
CN
China
Prior art keywords
peer
data
data fragmentation
current
neighbours
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
Application number
CNA2008102196410A
Other languages
Chinese (zh)
Other versions
CN101420457B (en
Inventor
王伟
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Tencent Technology Shenzhen Co Ltd
Original Assignee
Tencent Technology Shenzhen Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Tencent Technology Shenzhen Co Ltd filed Critical Tencent Technology Shenzhen Co Ltd
Priority to CN2008102196410A priority Critical patent/CN101420457B/en
Publication of CN101420457A publication Critical patent/CN101420457A/en
Application granted granted Critical
Publication of CN101420457B publication Critical patent/CN101420457B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Information Transfer Between Computers (AREA)

Abstract

The invention discloses a method for downloading data fragments by a peer, a device and the peer. At the first, the data fragments starting from a current playing position are divided into more than one aggregate according to time sequence, and the data segments needing download are determined by sequential selection of a first aggregate which starts from the current playing position and is positioned at the time sequence, if the first aggregate has the data fragments, the data fragments are selected to meet a real-time requirement, otherwise, a current peer is proved to have all data fragments contained in the aggregate and be capable of meeting the real-time requirement, and then the data fragments needing download are determined in a next aggregate in a least-number priority manner so as to meet a shared data maximization requirement, and after the data fragments needing download are determined, request information of downloading the data fragments is sent to a neighbor terminal, thus meeting the real-time requirement while meeting the shared data maximization requirement, which enhances the experience of a user.

Description

The method of peer-to-peer downloading data fragmentation, device and peer-to-peer
Technical field
The present invention relates to the computer network communication technology field, particularly a kind of method, device and peer-to-peer that is applied to the peer-to-peer downloading data fragmentation in the P2P VOD system.
Background technology
Growing along with network technology, network application universal day by day, the demand of shared data is also remarkable day by day between the user, sharing of for example simple data file, sharing or the like of the data file of some sowing time, realize in the prior art that the mode that data file is shared between the peer-to-peer is to need downloaded files to be divided into a plurality of isometric data fragmentations, each peer-to-peer is held download from neighbours respectively, and it does not have, and the data fragmentation that has at neighbours end, the mode of this data sharing, data transmission procedure is to carry out at peer-to-peer and its neighbours end, and can download from server, reduced dependence to server.
In the mode that this equity is downloaded, each peer-to-peer need be known oneself and have which data fragmentation, and need hold from neighbours and download which data fragmentation, a kind of implementation of the prior art is, each peer-to-peer is set up the sign bitmap of oneself respectively, the file name that comprises file in this sign bitmap, the numbering of the data fragmentation of this document, and the identification information of the data fragmentation of each numbering, this identification information is used for identifying this peer-to-peer and whether has had this data fragmentation, after peer-to-peer is set up the sign bitmap of oneself, should identify bitmap and hold transmission to its neighbours, thereby, peer-to-peer can have the sign bitmap of oneself and the sign bitmap of each neighbour each neighbour end of holding transmission, peer-to-peer can be known needs according to the sign bitmap of himself and hold which data fragmentation of download from neighbours, can know and to download which data fragmentation from this neighbours' end according to the sign bitmap of each neighbours' end, or which neighbour certain data fragmentation can hold download from.
When peer-to-peer is held downloading data fragmentation from neighbours, at first need to select to hold from neighbours and download which data fragmentation, promptly need to carry out a process of selecting data fragmentation, hold transmission to hold the solicited message of downloading this data fragmentation to neighbours then from these neighbours.Owing to be to select earlier to hold the transmission solicited message to neighbours again after the data fragmentation, and be to download the data fragmentation of current selection to neighbours' request of holding, therefore, selection mode to the data burst can exert an influence to the performance in the subsequent process, for example the degree of shared data, the real-time performance in the VOD system or the like between each peer-to-peer in the downloading process.
Wherein a kind of mode of selecting data fragmentation of the prior art is to adopt the selective sequential mode, promptly select according to the sequencing of each data fragmentation in former data file, only under the situation that this current peer-to-peer of all data fragmentations before the current data burst that is positioned on the sequencing has all had, this peer-to-peer is just selected this current data fragmentation, after this current data fragmentation is downloaded and is finished, select next data fragmentation again with this current data fragmentation next-door neighbour, the mode of this selection data fragmentation, owing to be to select in strict accordance with sequencing, therefore, in VOD system, for example during multimedia file such as program request playing video file, can satisfy the demand of real-time and fluency, but owing to be to select in strict accordance with sequencing, each peer-to-peer is easier to have identical data fragmentation, thereby making needs the probability of the other side's data fragmentation to reduce the maximization of shared data between can't realizing holding and holding.
The mode of another kind of selection data fragmentation of the prior art is to adopt minimum optimal way, that the minimum data fragmentation of umber that is had in all neighbours' ends of promptly preferential selection, under the situation that adopts this mode, because the not available data fragmentation of each peer-to-peer may be different, thereby for the said sequence selection mode, need the probability of the other side's data fragmentation to increase, satisfied the maximization requirement of shared data when holding and holding, and after the minimum optimal way of process, feasible number with peer-to-peer of this identical data burst increases, the umber that correspondingly also makes each data fragmentation be occupied in peer-to-peer and each neighbour end also increases, speed of download also can correspondingly increase, yet, adopt this mode, for example in the P2P VOD system during free online multimedium file, because the minimum data fragmentation of the determined umber of peer-to-peer may not be to be arranged in file to play sequencing order data fragmentation the preceding to a great extent, therefore after current data fragmentation finishes playing, next data fragmentation is not downloaded from neighbours' end probably as yet, thereby the program request time-delay appears, the slack phenomenon of playing process can not requirement of real time.
Summary of the invention
At above-mentioned problems of the prior art, the object of the present invention is to provide a kind of method, device and peer-to-peer of peer-to-peer downloading data fragmentation, when satisfying real-time, to take into account the requirement of maximization shared data.
For achieving the above object, the present invention by the following technical solutions:
A kind of method of peer-to-peer downloading data fragmentation comprises step:
To be divided into more than one set from the data fragmentation that current play position begins according to time sequencing;
The sign bitmap of each neighbours' end of more current peer-to-peer and this current peer-to-peer;
When having the data fragmentation that described current peer-to-peer does not have and have during initial set closed originally in described neighbours' end, adopt the selective sequential mode from described initial sets, to determine needs data downloaded burst according to each described sign bitmap, described initial sets is to begin, be positioned at first set on the time sequencing from described current play position, and the described data downloaded burst that needs is not have and the data fragmentation that has at described neighbours end at described current peer-to-peer;
When described current peer-to-peer has had all data fragmentation in the described initial sets, adopt the next one set of minimum mode of priority on being arranged in time sequencing to determine described needs data downloaded burst according to each described sign bitmap, described next set is from being positioned at the set that second set beginning, described neighbours end on the time sequencing has the data fragmentation that described current peer-to-peer do not have;
Hold transmission download request information to described neighbours, described download request information comprises the described identifying information that needs the data downloaded burst.
A kind of device of peer-to-peer downloading data fragmentation comprises:
Module is divided in set, is used for will being divided into more than one set from the data fragmentation that current play position begins according to time sequencing;
Divide the chip select module that module is connected with described set, the sign bitmap that is used for each neighbours' end of more current peer-to-peer and this current peer-to-peer, determine needs data downloaded burst according to each described sign bitmap from described each set, the described data downloaded burst that needs is not have and the data fragmentation that has at described neighbours' end at described current peer-to-peer;
Described chip select module comprises:
Divide the order chip select module that module is connected with described set, be used for adopting the selective sequential mode to determine described needs data downloaded burst from initial sets according to each described sign bitmap, described initial sets is to begin, be positioned at first set on the time sequencing from described current play position;
The minimum preferential chip select module that is connected with described order chip select module, be used for adopting minimum mode of priority to determine described needs data downloaded burst from the next one set that is positioned on the time sequencing according to each described sign bitmap, described next set is from being arranged in second set beginning on the time sequencing, having the set of the data fragmentation that described current peer-to-peer do not have at described neighbours' end.
A kind of peer-to-peer comprises the device of downloading data fragmentation, and this device comprises:
Module is divided in set, is used for will being divided into more than one set from the data fragmentation that current play position begins according to time sequencing;
Divide the chip select module that module is connected with described set, the sign bitmap that is used for each neighbours' end of more current peer-to-peer and this current peer-to-peer, determine needs data downloaded burst according to each described sign bitmap from described each set, the described data downloaded burst that needs is not have and the data fragmentation that has at described neighbours' end at described current peer-to-peer;
Described chip select module comprises:
Divide the order chip select module that module is connected with described set, be used for adopting the selective sequential mode to determine described needs data downloaded burst from initial sets according to each described sign bitmap, described initial sets is to begin, be positioned at first set on the time sequencing from described current play position;
The minimum preferential chip select module that is connected with described order chip select module, be used for adopting minimum mode of priority to determine described needs data downloaded burst from the next one set that is positioned on the time sequencing according to each described sign bitmap, described next set is from being arranged in second set beginning on the time sequencing, having the set of the data fragmentation that described current peer-to-peer do not have at described neighbours' end.
Scheme according to the invention described above, it is when downloading data fragmentation, at first be to be divided into more than one set from the data fragmentation that current play position begins according to time sequencing, and current play position begun, first set that is positioned on the time sequencing adopts the mode of selective sequential need to determine the data downloaded burst, need the data downloaded burst if choose one in can gathering this first, then selected this data fragmentation, with requirement of real time, in gathering, can't choose a needs data downloaded burst this first, illustrate that then this current peer-to-peer has had all data fragmentations that comprised in this set, can satisfy the requirement of real-time, at this moment, then can be according to minimum mode of priority, from next one set, determine and to hold download from neighbours, and the minimum data fragmentation of umber that in all neighbours' ends, occupies, to satisfy the requirement of maximization shared data, having determined will be after neighbours holds the data downloaded burst, hold the solicited message that sends downloading data fragmentation to neighbours, thereby, use the present invention program, when satisfying the real-time demand, can also take into account the maximized requirement of data sharing, strengthen user's experience.
Description of drawings
Fig. 1 is the schematic flow sheet of the specific embodiment of peer-to-peer downloading data fragmentation method of the present invention;
Fig. 2 is the principle schematic of the set of dividing data burst of the present invention;
Fig. 3 is the principle schematic of selective sequential mode;
Fig. 4 is the principle schematic of minimum mode of priority;
Fig. 5 is the structural representation of the specific embodiment of peer-to-peer downloading data fragmentation device of the present invention.
Embodiment
According to as previously mentioned, in the mode of end-to-end data sharing, can send the sign bitmap mutually between each peer-to-peer, oneself had which data fragmentation and oneself still do not had which data fragmentation to identify, therefore, each peer-to-peer can know that all which data fragmentation its neighbours end has had, and just can hold the sign bitmap that sent and the sign bitmap of oneself to select according to each neighbour during chip select.
Referring to shown in Figure 1, be the schematic flow sheet that peer-to-peer of the present invention is selected the method specific embodiment of data fragmentation, it comprises step:
Step S101: according to time sequencing will be that the data fragmentation of starting point is divided into more than one set from current play position, enter step S102;
Step S102: selection mode need to select the data downloaded burst from first set that begins, is arranged in above-mentioned time sequencing from current play position in order, this needs the data downloaded burst is not have and the data fragmentation that has in certain or some neighbours end at other at current peer-to-peer, enters step S103;
Step S103: judge according to the said sequence selection mode whether from above-mentioned first set, chosen the data fragmentation that this current peer-to-peer does not have and have in other certain or some neighbours hold, if, then directly enter step S108, the chip select process finishes, if not, illustrate that then this current peer-to-peer has had all data fragmentations of being comprised in this first set, therefore, enters step S104;
Step S104: enter from above-mentioned current play position and begin, be positioned at second set on the time sequencing, enter step S105;
Step S105: from this set, select to need the data downloaded burst according to minimum mode of priority, enter step S106;
Step S106: judge whether from this set, choose data fragmentation according to above-mentioned minimum mode of priority, if, then directly enter step S108, the chip select process finishes, if not, illustrate that then this current peer-to-peer has had all data fragmentations that comprised in this set, therefore, enters step S107;
Step S107: enter the next one that begins, is positioned on the time sequencing from current play position and gather, return step S105 then;
Step S108: judge that the chip select process finishes, and enters step S109;
Step S109: hold transmission download request information to neighbours, comprise the identifying information that needs the data downloaded burst that this is selected in this download request information.
Method according to the invention described above, it is when carrying out chip select, for from current play position, be positioned at first set on the time sequencing, it is the data fragmentation that the preferential mode of employing order selects this current peer-to-peer not have, promptly according to the preferential chosen position of the residing hereof priority time sequencing of each data fragmentation data fragmentation the preceding, to satisfy the requirement of real-time, guarantee the real-time fluencies of playing such as multimedia file, in gathering, can't find such data fragmentation this first, illustrate that then this current broadcast end has had all data fragmentations that are positioned at this set, can satisfy the requirement of real-time, thereby can adopt the next one set (this moment for be positioned at second set time sequencing on) of minimum mode of priority on being arranged in time sequencing need to select the data downloaded burst, to take into account the demand of maximization shared data simultaneously, if in this second set, also can't find such data fragmentation, illustrate that then this current broadcast end has had all bursts that are arranged in this second set, therefore, can forward the next one set (this moment is for being positioned at the 3rd set on the time sequencing) that is arranged on the time sequencing to selects, by that analogy, up to finding a needs data downloaded burst, unless this current peer-to-peer of the data fragmentation of this document all has, after having selected data fragmentation, then can hold the request of transmission to download the solicited message of this data fragmentation to neighbours with this data fragmentation.
According to as mentioned above, method of the present invention is when determining to need the data downloaded burst, be actually for beginning from current play position, first set that is positioned on the time sequencing adopts the selective sequential mode need to select the data downloaded burst, with requirement of real time, if choose a needs data downloaded burst in can't gathering from this first, illustrate that then this current peer-to-peer of data fragmentation of being comprised all has in this first set, can satisfy the requirement of real-time, therefore, second set on the time sequencing, just can select according to minimum mode of priority, hold download from this set, to select needs from neighbours, and the minimum data fragmentation of umber that in all neighbours' ends, occupies, be to be to begin on the above-mentioned next collective entity from second set that is positioned on the time sequencing, first this current peer-to-peer occurred and has not had certain data fragmentation in this set, and in certain or some neighbours end, have a set of this data fragmentation, to satisfy the requirement of maximization shared data, therefore, can in requirement of real time, take into account the maximized requirement of data sharing, strengthen user's experience.
According to as mentioned above, because each peer-to-peer all can know which data fragmentation these neighbours' ends have had according to the sign bitmap that each neighbours' end is sent, therefore, above-mentioned will be that the data fragmentation of starting point is when being divided into a plurality of set from current play position, just can identify bitmap according to these divides, concrete dividing mode can be the division that these sign bitmaps are relatively gathered afterwards mutually again, for example comparing which data fragmentation that is positioned on the sequencing earlier is that this current peer-to-peer has, which data fragmentation is that this current peer-to-peer does not have as yet, divide at this comparative result again, also can be respectively these sign bitmaps to be compared each set respectively after being divided into set earlier again, different modes can be arranged according to the difference of application choice.
In addition, in the invention described above method specific embodiment, be at first from first set, to adopt the selective sequential mode to select, in gathering, can't choose when needing the data downloaded burst this first, adopt minimum mode of priority to select again, up to finding a needs data downloaded burst from the next one set on the time sequencing.In fact, also can be, after dividing set, current peer-to-peer is according to the sign bitmap of himself, judge it and which set to begin to occur the data fragmentation that it does not still have from, if its first the set in just have the data fragmentation that does not still have, then directly adopt the selective sequential mode to determine the current data downloaded burst that needs; If having the set of the data fragmentation that does not still have is the set that is positioned at other positions, then compare with the sign bitmap of each neighbour end again, and adopting minimum mode of priority to determine the current data downloaded burst that needs, difference as required can adopt different processing modes.
Wherein, in the method for the invention described above, when selecting according to minimum mode of priority, if having the data fragmentation of minimum umber has more than 2 or 2, then can select one of them data fragmentation at random arbitrarily, perhaps also can be in these several several data fragmentations with identical minimum umber, to select to arrange data fragmentation the preceding according to time sequencing, with take into account simultaneously current play position move after to the demand of real-time, perhaps also can be the selection mode that adopts other, different selection modes can be arranged according to the difference of application choice or needs.
Referring to shown in Figure 2, it is the principle schematic of the set of dividing data burst among the present invention program, during division, can divide the data burst according to the number of default set and the length of each set, be with after current play position begins in the diagram, two set on the sequencing describe, in the diagram, the data fragmentation that on behalf of this peer-to-peer, the burst at the bottom of the black had, the data fragmentation that on behalf of this peer-to-peer, the burst at the white end do not have, it in supposing to illustrate division to the data fragmentation of current peer-to-peer, so, as shown in the figure, in first set after current play position begins, still the data fragmentation (showing in the diagram it is data fragmentation) that has this current peer-to-peer not have with white end, therefore, select to be positioned at first data fragmentation on the time sequencing in these data fragmentations that adopt the selective sequential mode never to have, promptly the data fragmentation at first white end on the sequencing in the diagram holds the request of transmission to download the request of this data fragmentation to neighbours after selecting again.
Scheme according to the inventive method, it is to beginning from current play position, be positioned at the purpose of first set employing selective sequential on the time sequencing, be in order to satisfy the demand of real-time, and each set is thereafter adopted the purpose of minimum mode of priority, be in order to satisfy the demand of maximization shared data simultaneously, therefore, the length of first set that begins from current play position is selected to satisfy the length that real-time is play demand as required, and for each data fragmentation after first set, can be to be divided into a set, promptly be actually from current play position and begin to be divided into two set, also can be that each data fragmentation after first set is divided into a plurality of set, wherein, the length of these a plurality of set that begin from current play position can be the same or different.
Wherein, consider the mobility of real-time broadcast, after playing, current play position will from certain data fragmentation the preceding move to certain after data fragmentation, i.e. first set that begins from current play position is to move in real time, if all data fragmentation integral body after first set is divided into a set, because at second set is to adopt minimum mode of priority to select, in each neighbours' end, occupy the minimum data fragmentation of umber and be likely the position that is positioned at after leaning on the time sequencing, therefore, in this selection course, be arranged in second set, the data fragmentation that is positioned at forward position on the time sequencing may be not selected, therefore be not downloaded yet, thereby, after current play position moves, may there be such a case, be after current play position moves, moving this current peer-to-peer of data fragmentation that new adding play position moves first set afterwards in second set before by play position does not have, thereby need use the selective sequential mode instead and select data fragmentation, the maximization that data are shared exerts an influence, therefore, in the preferred case, each data fragmentation after first set that begins from current play position can be divided at least two set, and set with first set next-door neighbour, promptly begin from current play position, be positioned at second set on the time order and function order, be set at a relatively short length as required, it can be even a shortest set of length in each set, in this case, if this current peer-to-peer of each data fragmentation in first set all possesses, when adopting minimum mode of priority to select data fragmentation, be to select in proper order according to the time order and function of each set, thereby make after current play position moves, increase at the probability that this current peer-to-peer has had from the new data fragmentation that adds first new set of former second set, to take into account the demand of real-time and maximization shared data simultaneously.
Referring to shown in Figure 3, be the principle schematic of said sequence selection mode.
Suppose that the data fragmentation 677,678 in the set does not all possess at current peer-to-peer (being the request end shown in Fig. 3), and the two sequencing hereof be No. 677 data fragmentation positions preceding, No. 678 data fragmentation positions after, therefore, this current peer-to-peer need be downloaded these two data bursts from its neighbours' end, according to the order principle of priority, it selects to be positioned at first data fragmentation on the time sequencing earlier, be No. 677 data fragmentations shown in Fig. 3, promptly can hold the request of transmission to download the solicited message of these No. 677 data fragmentations after selecting to neighbours.
Referring to shown in Figure 4, be the principle schematic of above-mentioned minimum mode of priority.
As shown in the figure, suppose the data fragmentation 677 in the set, 678 all do not possess at current peer-to-peer (being the request end shown in Fig. 4), therefore, this current peer-to-peer need be downloaded these data fragmentations from its neighbours' end, according to minimum priority principle, owing to all have in No. 677 data three neighbours' ends therein, promptly in neighbours' end of this current peer-to-peer, have three parts of No. 677 data fragmentations, and No. 678 data fragmentations only have in therein neighbours' end, promptly in neighbours' end of this current peer-to-peer, have only a No. 678 data fragmentations, therefore, its preferential selection occupies the minimum data fragmentation of umber, be No. 678 data fragmentations shown in Fig. 4, promptly can hold the request of transmission to download the solicited message of these No. 678 data fragmentations after selecting to neighbours.
Referring to shown in Figure 5, be the structural representation that peer-to-peer of the present invention is selected the device of data fragmentation, it comprises:
Module 501 is divided in set, is used for will being divided into more than one set from the data fragmentation that current play position begins according to time sequencing;
Divide the chip select module 502 that module 501 is connected with described set, the sign bitmap that is used for each neighbours' end of more current peer-to-peer and this current peer-to-peer, determine needs data downloaded burst according to each described sign bitmap from described each set, the described data downloaded burst that needs is the data fragmentation that does not have and have at certain or some neighbours' ends at described current peer-to-peer;
Wherein, this chip select module 502 specifically comprises:
Order chip select module 5021 is used for adopting the selective sequential mode to determine needs data downloaded burst from initial sets according to each described sign bitmap, and described initial sets is to begin, be positioned at first set on the time sequencing from described current play position;
The minimum preferential chip select module 5022 that is connected with described order chip select module 5021, be used for adopting minimum mode of priority to determine described needs data downloaded burst from the next one set that is positioned on the time sequencing according to each described sign bitmap, described next set is from being arranged in second set beginning on the time sequencing, having the set of the data fragmentation that described current peer-to-peer do not have at described neighbours' end.
Select the device of data fragmentation according to the peer-to-peer of the invention described above, after the data fragmentation of set division 501 pairs of current peer-to-peers of module and each neighbour end thereof is divided into more than one set, order chip select module 5021 adopts first set on time sequencing of selective sequential mode needs to determine the data downloaded burst, this needs the data downloaded burst is the data fragmentation that described current peer-to-peer does not have and has at certain or some neighbours end, first set on time sequencing, adopt the progressive download mode need to determine the data downloaded burst, can preferentially satisfy the demand of real-time;
If this order chip select module 5021 has been chosen such data fragmentation, then chip select module 502 is directly incited somebody to action order chip select module 5021 established data bursts as its selected data fragmentation;
If this order chip select module 5021 can't be chosen such data fragmentation, then illustrate had in this current peer-to-peer be positioned at this first the set all data fragmentations, therefore, by determining that described current peer-to-peer needs the data downloaded burst the next one set of the minimum minimum mode of priority of preferential chip select module 5022 employings on time sequencing, this next one set is from second the set beginning that is positioned on the time sequencing, have and the set of the data fragmentation that current peer-to-peer does not have at certain or some neighbours' ends, with under the situation of requirement of real time, can take into account the maximized realization of data sharing simultaneously, at this moment, the data fragmentation that chip select module 502 is selected minimum preferential chip select module 5022 is as its selected data fragmentation.
Peer-to-peer of the present invention is selected the set of the device dividing data burst of data fragmentation, the concrete mode of selection data fragmentation, can will not give unnecessary details in detail at this described in above-mentioned method.
Method and apparatus according to the invention described above, the present invention also provides a kind of peer-to-peer, it comprises the device of the peer-to-peer selection data fragmentation of the invention described above, adopt above-mentioned peer-to-peer to select the selection of the method realization data fragmentation of data fragmentation, when realizing the real-time demand, to take into account the maximized demand of data sharing.
Above-described embodiment of the present invention does not constitute the qualification to protection range of the present invention.Any modification of being done within the spirit and principles in the present invention, be equal to and replace and improvement etc., all should be included within the claim protection range of the present invention.

Claims (11)

1, a kind of method of peer-to-peer downloading data fragmentation is characterized in that, comprises step:
To be divided into more than one set from the data fragmentation that current play position begins according to time sequencing;
The sign bitmap of each neighbours' end of more current peer-to-peer and this current peer-to-peer;
When having the data fragmentation that described current peer-to-peer does not have and have during initial set closed originally in described neighbours' end, adopt the selective sequential mode from described initial sets, to determine needs data downloaded burst according to each described sign bitmap, described initial sets is to begin, be positioned at first set on the time sequencing from described current play position, and the described data downloaded burst that needs is not have and the data fragmentation that has at described neighbours end at described current peer-to-peer;
When described current peer-to-peer has had all data fragmentation in the described initial sets, adopt the next one set of minimum mode of priority on being arranged in time sequencing to determine described needs data downloaded burst according to each described sign bitmap, described next set is from being positioned at the set that second set beginning, described neighbours end on the time sequencing has the data fragmentation that described current peer-to-peer do not have;
Hold transmission download request information to described neighbours, described download request information comprises the described identifying information that needs the data downloaded burst.
2, the method for peer-to-peer downloading data fragmentation according to claim 1 is characterized in that, in each described set, the length of described second set is the shortest.
3, the method for peer-to-peer downloading data fragmentation according to claim 1 is characterized in that, described minimum mode of priority specifically comprises:
The minimum data fragmentation of umber of selecting current peer-to-peer described in the described next set not have and in all described neighbours' ends, occupy.
4, the method for peer-to-peer downloading data fragmentation according to claim 3 is characterized in that, also comprises:
When the data fragmentation of described minimum number has two when above, from the minimum data fragmentation of those umbers, select a data burst arbitrarily or from the minimum data fragmentation of those umbers select time go up the most preceding data fragmentation in position in proper order.
According to the method for any described peer-to-peer downloading data fragmentation of claim 1 to 4, it is characterized in that 5, described peer-to-peer is positioned at the P2P VOD system.
6, a kind of device of peer-to-peer downloading data fragmentation is characterized in that, comprising:
Module is divided in set, is used for will being divided into more than one set from the data fragmentation that current play position begins according to time sequencing;
Divide the chip select module that module is connected with described set, the sign bitmap that is used for each neighbours' end of more current peer-to-peer and this current peer-to-peer, determine needs data downloaded burst according to each described sign bitmap from each described set, the described data downloaded burst that needs is not have and the data fragmentation that has at described neighbours' end at described current peer-to-peer;
Described chip select module comprises:
Divide the order chip select module that module is connected with described set, be used for adopting the selective sequential mode to determine described needs data downloaded burst from initial sets according to each described sign bitmap, described initial sets is to begin, be positioned at first set on the time sequencing from described current play position;
The minimum preferential chip select module that is connected with described order chip select module, be used for adopting minimum mode of priority to determine described needs data downloaded burst from the next one set that is arranged in time sequencing according to each described sign bitmap, described next set is from being arranged in second set beginning on the time sequencing, having the set of the data fragmentation that described current peer-to-peer do not have at described neighbours' end.
7, the device of peer-to-peer downloading data fragmentation according to claim 6 is characterized in that, in each described set, the length of described second set is the shortest.
According to the device of claim 6 or 7 described peer-to-peer downloading data fragmentations, it is characterized in that 8, described peer-to-peer is positioned at the P2P VOD system.
9, a kind of peer-to-peer comprises the device of downloading data fragmentation it is characterized in that this device comprises:
Module is divided in set, is used for will being divided into more than one set from the data fragmentation that current play position begins according to time sequencing;
Divide the chip select module that module is connected with described set, the sign bitmap that is used for each neighbours' end of more current peer-to-peer and this current peer-to-peer, determine needs data downloaded burst according to each described sign bitmap from described each set, the described data downloaded burst that needs is not have and the data fragmentation that has at described neighbours' end at described current peer-to-peer;
Described chip select module comprises:
Divide the order chip select module that module is connected with described set, be used for adopting the selective sequential mode to determine described needs data downloaded burst from initial sets according to each described sign bitmap, described initial sets is to begin, be positioned at first set on the time sequencing from described current play position;
The minimum preferential chip select module that is connected with described order chip select module, be used for adopting minimum mode of priority to determine described needs data downloaded burst from the next one set that is positioned on the time sequencing according to each described sign bitmap, described next set is from being arranged in second set beginning on the time sequencing, having the set of the data fragmentation that described current peer-to-peer do not have at described neighbours' end.
10, peer-to-peer according to claim 9 is characterized in that, in each described set, the length of described second set is the shortest.
11, according to claim 9 or 10 described peer-to-peers, it is characterized in that described peer-to-peer is positioned at the P2P VOD system.
CN2008102196410A 2008-12-03 2008-12-03 Method, apparatus for downloading data fragmentation by peer, and peer therefor Active CN101420457B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN2008102196410A CN101420457B (en) 2008-12-03 2008-12-03 Method, apparatus for downloading data fragmentation by peer, and peer therefor

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN2008102196410A CN101420457B (en) 2008-12-03 2008-12-03 Method, apparatus for downloading data fragmentation by peer, and peer therefor

Publications (2)

Publication Number Publication Date
CN101420457A true CN101420457A (en) 2009-04-29
CN101420457B CN101420457B (en) 2011-10-05

Family

ID=40631058

Family Applications (1)

Application Number Title Priority Date Filing Date
CN2008102196410A Active CN101420457B (en) 2008-12-03 2008-12-03 Method, apparatus for downloading data fragmentation by peer, and peer therefor

Country Status (1)

Country Link
CN (1) CN101420457B (en)

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102035836A (en) * 2010-12-13 2011-04-27 北京交通大学 Coding method and system of buffer message in peer-to-peer (P2P) stream media system
CN103188279A (en) * 2011-12-27 2013-07-03 中国电信股份有限公司 Method and device for downloading file from neighbor nodes through peer-to-peer network
CN103402229A (en) * 2013-07-25 2013-11-20 中国科学院信息工程研究所 Data downloading method and data downloading system
CN104919449A (en) * 2012-10-23 2015-09-16 微软技术许可有限责任公司 Multiple buffering orders for digital content item
CN105468764A (en) * 2015-12-02 2016-04-06 广州华多网络科技有限公司 Data processing method and apparatus and cluster service system
CN105871990A (en) * 2015-12-14 2016-08-17 乐视云计算有限公司 Download data scheduling method and device
WO2017063189A1 (en) * 2015-10-16 2017-04-20 Qualcomm Incorporated Deadline signaling for streaming of media data
CN109525622A (en) * 2017-09-19 2019-03-26 阿里巴巴集团控股有限公司 The generation method of fragment resource ID, resource sharing method, device and electronic equipment
CN111343225A (en) * 2018-12-19 2020-06-26 北京奇虎科技有限公司 File processing method and device

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101227590B (en) * 2007-01-19 2013-03-06 北京风行在线技术有限公司 P2P protocol-based media file order program control method and apparatus
CN101141459B (en) * 2007-10-25 2010-04-14 南京远古科技有限公司 Method of implementing data transmission or stream media transmission using combination of HTTP and P2P
CN101170371B (en) * 2007-11-30 2010-12-29 中兴通讯股份有限公司 A client data request optimization method and system in P2P order

Cited By (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102035836A (en) * 2010-12-13 2011-04-27 北京交通大学 Coding method and system of buffer message in peer-to-peer (P2P) stream media system
CN103188279A (en) * 2011-12-27 2013-07-03 中国电信股份有限公司 Method and device for downloading file from neighbor nodes through peer-to-peer network
CN103188279B (en) * 2011-12-27 2016-06-01 中国电信股份有限公司 By the method and apparatus that peer-to-peer network downloads file from multiple neighbor nodes
CN104919449A (en) * 2012-10-23 2015-09-16 微软技术许可有限责任公司 Multiple buffering orders for digital content item
CN104919449B (en) * 2012-10-23 2018-03-20 微软技术许可有限责任公司 A variety of buffering order for digital content items
CN103402229B (en) * 2013-07-25 2016-04-13 中国科学院信息工程研究所 A kind of data download method and system
CN103402229A (en) * 2013-07-25 2013-11-20 中国科学院信息工程研究所 Data downloading method and data downloading system
WO2017063189A1 (en) * 2015-10-16 2017-04-20 Qualcomm Incorporated Deadline signaling for streaming of media data
CN105468764A (en) * 2015-12-02 2016-04-06 广州华多网络科技有限公司 Data processing method and apparatus and cluster service system
CN105468764B (en) * 2015-12-02 2019-07-02 广州欢聚时代信息科技有限公司 A kind of data processing method, device and cluster service system
CN105871990A (en) * 2015-12-14 2016-08-17 乐视云计算有限公司 Download data scheduling method and device
CN109525622A (en) * 2017-09-19 2019-03-26 阿里巴巴集团控股有限公司 The generation method of fragment resource ID, resource sharing method, device and electronic equipment
CN109525622B (en) * 2017-09-19 2021-11-26 阿里巴巴集团控股有限公司 Fragment resource ID generation method, resource sharing method, device and electronic equipment
CN111343225A (en) * 2018-12-19 2020-06-26 北京奇虎科技有限公司 File processing method and device
CN111343225B (en) * 2018-12-19 2024-04-09 三六零科技集团有限公司 File processing method and device

Also Published As

Publication number Publication date
CN101420457B (en) 2011-10-05

Similar Documents

Publication Publication Date Title
CN101420457B (en) Method, apparatus for downloading data fragmentation by peer, and peer therefor
CN102065112B (en) Peer-to-peer (P2P) network system and method and related device for establishing the same
KR101421040B1 (en) System and method for controlling peer-to-peer connections
US8068512B2 (en) Efficient utilization of cache servers in mobile communication system
CN110474846B (en) Method and device for block propagation in block chain
EP2493191B1 (en) Method, device and system for realizing hierarchically requesting content in http streaming system
CN106303588A (en) Video recommendation method, client and server
CN101588287B (en) Method, device and system for scheduling and downloading peer-to-peer network data
EP3923549A1 (en) Data downloading method and related apparatus
CN105792021A (en) Method and device for transmitting video stream
CN107566321B (en) File sending method, device and system
CN106850720A (en) Method for upgrading software, apparatus and system
TW200818817A (en) Apparatus and method for supporting broadcast/multicast IP packets through a simplified sockets interface
CN101753603A (en) Method, server and system for providing media content in P2P system
US20140156809A1 (en) Data downloading method, terminal, server, and system
CN111556344A (en) Method, device, equipment and system for downloading video stream
Belblidia et al. Epics: Fair opportunistic multi-content dissemination
KR20120108138A (en) Circular buffer and method for multimedia streaming service based peer-to-peer
CN110602515A (en) Data processing method based on block chain, server and storage medium
CN110366047A (en) A kind of video sharing method and device and computer readable storage medium
JP5189822B2 (en) Method for optimizing transmission of DVB-IP service information by partitioning into multiple multicast streams
CN115002098A (en) File publishing method based on local area network autonomous discovery and election, computer device and computer readable storage medium
CN113423078A (en) Application program network fragment selection method, application server and PCF
CN110049360A (en) Cross-platform contents controlling method, device, terminal, server and storage medium
KR101082980B1 (en) System and method for transmitting and receiving contents using shared channel

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