CN102821316A - Improved video on demand (VOD) transmission method based on peer-to-peer computing core algorithm - Google Patents
Improved video on demand (VOD) transmission method based on peer-to-peer computing core algorithm Download PDFInfo
- Publication number
- CN102821316A CN102821316A CN2012101479902A CN201210147990A CN102821316A CN 102821316 A CN102821316 A CN 102821316A CN 2012101479902 A CN2012101479902 A CN 2012101479902A CN 201210147990 A CN201210147990 A CN 201210147990A CN 102821316 A CN102821316 A CN 102821316A
- Authority
- CN
- China
- Prior art keywords
- node
- server
- tabulation
- improved
- seed
- 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.)
- Pending
Links
Images
Landscapes
- Information Transfer Between Computers (AREA)
Abstract
Disclosed is an improved VOD transmission method based on a peer-to-peer computing core algorithm. An adopted topological structure comprises a torrent file producing server, an electronic program guide (EPG), an improved tracker, a streaming media server and an improved BitTorrent client. According to the method, a piece selection algorithm and a node selection algorithm in the BitTorrent protocol are improved, a self-adaptive sliding window mechanism is introduced, efficient file distribution capacity of the BitTorrent protocol is fully used, and requirements of the VOD for timeliness can be satisfied simultaneously, not only the problems of single point of failure of the server and bottleneck of server connection are solved, but also the load pressure of the server can be reduced.
Description
Technical field
The present invention is a kind of based on the improved video on-demand system transmission method of reciprocity computation core algorithm; The equity of using is calculated agreement and is the BitTorrent agreement; It improves fragment selection algorithm and node selection algorithm among the BitTorrent; Introduce self adaptation slip windowing mechanism and select request to limit,, belong to the peer-to-peer network application to satisfy the requirement of video request program to real-time to burst.
Background technology
Video on demand techniques is a kind of important use technology of distributed flow media.Video request program also is called as VOD, and full name is Video on Demand, and promptly on demand video flowing is play.Video on demand techniques is the cutting edge technology that current streaming media communication is used, and is the new technology that correlation techniques such as the information that faces the future, communication combine.Simultaneously, video request program is again a business, and its general reference utilizes interactive network that audiovideo is carried out real-time Transmission, to realize an interactive multimedia applied business of services such as VOD, information inquiry, TV shopping, long-distance education.
Conventional flow media system on the internet generally is based on C/S model, generally includes one or more server and plurality of client end.Under C/S model, stream media system capacity (client terminal quantity of service simultaneously) is mainly by the network output bandwidth decision of server end, and the disposal ability of server, memory size, I/O speed also have influence on the capacity of system sometimes.Under C/S model, because the bandwidth that the MPTS medium take is big, longer duration, and the available network bandwidth of server end is limited, so even use high-grade server, its power system capacity is a hundreds of client only, does not have economic scale property.In addition, because the uncertainty of the Internet, if client distance service device is far away, then indexs such as the delay in the Streaming Media transmission course, shake, bandwidth, packet loss will be more uncertain also.Server is that each client sends a streaming medium content separately, so the consumption of Internet resources is also very huge.So under the condition of current resource-constrained, how to satisfy ever-increasing user's request, and when guaranteeing service quality, reduce the cost of serving of Streaming Media, be called the important topic in the stream media technology research.The P2P technology of rise in recent years can utilize each node in the Internet to carry out equity calculating, and the idling-resource on making full use of internet allows two direct exchange messages of client, has therefore received extensive concern.The P2P technology is applied to streaming media service, for the settlement server end network bandwidth and server capabilities limits problem provide a kind of new thinking.Under this background, produced based on the video on demand techniques of P2P.
BitTorrent is a kind of file-sharing of P2P efficiently download tool; Tracker server through a center; The BitTorrent client is obtained the node listing of current downloading task, the download of collaborative each file fragmentation of completion of equity fully between each node then.File fragmentation is shared and has been improved download efficiency, need not the participation of any other server simultaneously.
The fragment selection algorithm that adopts in the BitTorrent agreement is: local minimum burst is preferential, and promptly each peer node all preferentially selects those minimum in neighbor node segments to go to download, and those segments more relatively in system, the download of putting behind.
The node selection algorithm that adopts in the BitTorrent agreement is: under the situation that keeps the seed proportion near the ratio of the seed of the overall situation, the picked at random nodal information returns to requesting node.
Summary of the invention
Technical problem:The objective of the invention is through fragment selection algorithm and node selection algorithm in the BitTorrent agreement are improved, introduce a kind of self adaptation slip windowing mechanism simultaneously and satisfy the requirement of video request program real-time.Than the conventional video VOD system, it not only can carry out the data transmission efficiently, guarantees the fluency of video request program, and can reduce system load, cuts operating costs.
Technical scheme:Of the present inventionly a kind ofly adopt improved BitTorrent client and improved index server Tracker to promote the streaming media resource file transfer speed based on the improved video ordering transmission method of reciprocity computation core algorithm, algorithm relates to seed file and makes server, electronic playbill server EPG, improved index server Tracker, streaming media server and improved BitTorrent client modules; The transmission course of whole video program request is following:
Step .11: the files in stream media that seed file making server will be issued is made into seed file, and is right
After seed file is sent to electronic playbill server EPG;
Step 12: electronic playbill server EPG downloads seed file, makes according to seed information simultaneously
Sub-programme;
Step 13: the video request program client can be asked from trend electronic playbill server EPG after startup
Sub-programme; Whether electronic playbill server EPG belongs to the registered user according to this user's Information Authentication; If the user will send electronic program list to this user through checking electronic playbill server EPG, on the user client program request program guide will appear then;
Step 14: want the program seen according to program request menu user program request, afterwards to electronic playbill server EPG
The request seed file, then electronic playbill server EPG sends seed file to the user;
Step 15: after the user receives seed file, get into downloading process at once, at first through improved
BitTorrent client and improved index server Tracker connect, and obtain information of neighbor nodes;
Step 16: improved BitTorrent client adopts sliding window through the information of these neighbor nodes
The download stream media file of mechanism partial order is play while downloading, and also for other neighbor nodes upload service is provided simultaneously; Client downloads becomes kind of a child node after accomplishing, and plants child node and uploads for other node provides through improved fragment selection algorithm.
Improved BitTorrent client adopts improved fragment selection algorithm, can solve the even distribution of file fragmentation, and it is following to improve step:
Step 21: for the even distribution of burst in network, that abolishes seed uploads strategy, no longer basis
Speed of download provides to be uploaded;
Step 22: in downloading completion node Seed, a tabulation is set, all fragment numbers are all put during initialization
In tabulation, after fragment is uploaded by client node, then delete this fragment number from tabulation;
Step 23: use the preferential mode of downloading of minimum burst when Seed asks burst when downloading node,
If downloading slicing is in tabulation, Seed sends slicing files and gives the download node, and with burst number deletion from tabulation; If do not exist, Seed sends to through the bit field of downloading node and downloads node and do not have and the burst of fragment number in tabulation, then with the deletion from tabulation of this burst, if abovely either way do not meet, then blocks this node;
Step 24: after the fragment number in the tabulation is all by deletion, i.e. when tabulation is empty, carry out initialization again,
Again adding tabulation to all fragment numbers supplies node to download.
Improved index server Tracker adopts improved node selection algorithm, can make full use of the last transfer efficiency of node, and it is following to improve step:
Communicating by letter between step 31. expanding node and the tracking server lets Tracker can know the following of node
The progress of carrying;
Step 32. is set up one at the Tracker server side to each seed file and is arranged according to download progress
Ascending order tabulation;
When step 33. was issued as seed file, Seed at first joined in the tabulation with node, and with it
Download progress is changed to 1;
When step 34. is communicated by letter with Tracker as peer node; If this node is newly added node then according to download progress it is inserted into the corresponding position of tabulation; If peer node is in tabulation; Tabulation position before the deletion then, and will be inserted in the tabulation again according to the node progress and go;
Step 35. is searched 40 with the minimum node of node progress gap according to node location;
Step 36. is returned neighbor node and is tabulated to requesting node.
Adopt the download stream media file of sliding window mechanism partial order in the step 16, make that near the burst the broadcast point can preferentially obtain downloading; In running; When having new file fragmentation to ask, earlier whether the file fragmentation in the urgent window of inspection is by whole requests or has downloaded, as if not having at every turn; Then ask the burst in the sliding window earlier; If having asked then from non-sliding window, to get file fragmentation asks, along with moving of broadcast point, sliding window is also made corresponding slip; And the size of this sliding window can according to decoding speed and playout-delay is adaptive in playing process adjusts, and has both satisfied the requirement of video request program to real-time, has made full use of BitTorrent efficiency of transmission efficiently again.
Beneficial effect:The inventive method has proposed based on the improved video ordering transmission method of BitTorrent core algorithm, is intended to combine BitTorrent file distributing mechanism efficiently, and it is overweight to solve in the video on-demand system streaming media server load pressure, the problem that efficient is not high.The technical method that this invention proposes not is simply enumerating of prior art, but according to the characteristics of prior art, extracts through continuous practice, through various mechanism are effectively combined, realizes the transmission system of P2P video request program efficiently.Provide bright specifically below.
Data siloIf: have only server A to have resource S in the network; So when server A is delayed machine or damage for some reason; Resource S can't visited or obtain to all nodes in the network all, and up to server A operate as normal again, this state of server A just is called " data silo ".Data silo has seriously influenced the stability and the flexibility of system, and the minority node in the network just can have influence on the performance of the overall situation.Data silo is very common in traditional music demand system; All resources of some broadcasting user are all from media server; In case media server breaks down; All some broadcasting users just can't obtain media resource, and a kind of solution is that a plurality of subsequent use media servers are set, but this can bring great cost expense.And in our video request program transmission system based on BitTorrent, the resource of some broadcasting user might not come from media services, and can break away from media server fully many times, like this with regard to the problem of having broken away from data silo.
Load balancing: be meant each processing unit of system balanced share services request.The load that is about in the network is distributed on a plurality of servers or the node, thereby has effectively avoided in the network part server or node load is overweight, makes all nodes on average share the load in the network, guarantees the more effective operation of network.Load-balancing technique in traditional multimedia order programme system; Usually just all media servers in the system are carried out load balancing; Let all media servers that approaching load capacity is arranged; Avoid the minority media server can't bear the heavy load, and some is not effectively used, as sharing the load-balancing technique in the formula multimedia order programme system.In the P2P music demand system; Load-balancing technique is to utilize client node to share the load of media server; Alleviate the load of media server; This load-balancing technique is with respect to the load-balancing technique in traditional multimedia order programme system, and its effect is more extensive, also more thoroughly with effective.
Improved BitTorrent core algorithm:What the fragment selection algorithm in the BitTorrent agreement adopted is the local minimum preference strategy of burst copy amount; This strategy can not make the burst quantity uniformity approach optimum; The present invention adopts improved kind of child node to upload strategy this strategy is improved, the experiment proof burst quantity uniformity, speed of download, average download time than traditional strategy and the strategy before improving bigger improvement has been arranged.The Tracker node selection algorithm is similar to a kind of random selection strategy, and the algorithm existence is uncertain, randomness is more intense, possibly need very long search time just can find the proper service supplier.To this problem, the present invention adopts improved node selection algorithm, helps node in the shortest time, to find appropriate nodes.Improve back algorithm speed of download through the experiment proof and be significantly improved, and in the end the stage model speed of download does not significantly reduce yet.
Description of drawings
Fig. 1 improves back kind child node to upload flow chart,,
Fig. 2 is the node selection algorithm flow chart after improving,
Fig. 3 is based on the flow chart of the video request program transmission of BitTorrent,
Fig. 4 is the particular flow sheet of system in running.
Embodiment
Method of the present invention is stressed the core algorithm among the BitTorrent is improved, and introduces self adaptation slip windowing mechanism to satisfy the requirement of video request program to real-time.
. improved fragment selection algorithm
That in the BitTorrent system, adopt is local file sheet preference strategy (Local Rarest First); Just node only need be known the distribution of file sheet in its neighbor node (generally being 50 nodes) of shared file, its with its all neighbor nodes in carry out minimum blocks of files preference strategy.Can reduce system load like this, and keep the even distribution of blocks of files in the part.But there are some problems in BitTorrent aspect the fragment selection strategy: because local minimum preferentially only based on local message, the local minimum overall situation of not representing is minimum, so there is blindness to a certain extent in being chosen in of blocks of files.
Fragment selection algorithm after the improvement is: upload strategy through improving seed, by uploading the indirect equilibrium degree that influences the file fragmentation distribution of strategy.
Traditional seed is uploaded strategy: after all bursts of client node are all downloaded completion; It will change kind of a child node into if it does not have the horse back deviated from network; Because planting child node can be again from other node file in download burst; It will not re-use the node selection strategy and select node to upload, and provide and will upload but select to obtain the most several nodes of fast speed of download from this node, can utilize as much as possible like this and upload bandwidth.
The present invention proposes the fragment selection algorithm after a kind of the improvement, and algorithm thought is as shown in Figure 1, and its flow process is:
1. for the even distribution of burst in network, abolish the strategy of uploading of seed, no longer according to downloading speed
Degree provides to be uploaded.
2. the fragment selection algorithm of downloading node is not made change, first burst at random before promptly also keeping,
Minimum preferential, strict priority, final stage pattern.
3. a tabulation is set in Seed, and all fragment numbers all are placed in the tabulation during initialization, when the fragment quilt
After the Seed node is uploaded, then delete this fragment number from tabulation.
When download node use minimum during preferentially to Seed request burst, if downloading slicing in tabulation,
Seed sends slicing files and gives the download node, and with burst number deletion from tabulation.If do not exist, Seed can send to through the bitfield territory of downloading node and download node and download node and do not have and the burst of fragment number in tabulation, then with the deletion from tabulation of this burst, if abovely either way do not meet, then blocks this node.
5. after the fragment number in the tabulation is all by deletion, i.e. when tabulation is empty, carry out initialization again, institute
Having fragment number to add tabulation again supplies node to download.
. improved node selection algorithm
In order to make full use of the bandwidth of uploading of neighbor node, the neighbor node of node preferably comprises the required file fragmentation of node.And the way of a kind of picked at random neighbor node of traditional T racker algorithm use, this has influenced the download efficiency of node to a certain extent, is unfavorable for that file fragmentation distributes efficiently.The final stage that this situation is downloaded at node is particularly evident; Because the burst quantity in that the final node of downloading is required is fewer; Have the fewer node of burst as neighbor node if choose; The probability that often obtains burst can be very low, and also the speed of download of stage node has tangible reduction with regard to having caused in the end.
The present invention proposes a kind of improved node selection algorithm, and algorithm thought is as shown in Figure 2, and its flow process is:
1. communicating by letter between expansion peer node and the Tracker lets Tracker can know the download progress of node.
2. at the Tracker server side each torrent file is set up a liter of arranging according to download progress
Sequence table.
3. when seed file is issued, the Seed node is at first joined in the tabulation, and its download is advanced
Degree is changed to 1.
4. when peer node is communicated by letter with Tracker; If peer node is newly added node then according to download progress it is inserted into the corresponding position of tabulation; If peer node in tabulation, tabulation position before the deletion then, and will be inserted in the tabulation again according to the node progress and go.
5. search 40 with the minimum node of node progress gap according to node location.
6. returning neighbor node tabulates to requesting node.
. self adaptation slip windowing mechanism
Sliding window is safeguarded a window that receives buffering about media data; This window will move forward according to the state variation of player consumption data and peer node reception data; In case being positioned at the data of sliding window is consumed by player; Then sliding window will move forward, to obtain the media data that the player follow-up play needs.Be positioned at the data of sliding window will be according to urgency level according to priority orders ground from server or other partner node request.
We can know from the discussion of front; Sliding window is big more, and the speed of then obtaining emergency data is fast more, simultaneously since in the sliding window each burst all to a plurality of peer node requests (to reach and guarantee to obtain rapidly burst); Undoubtedly with the redundancy of burst request and response in the increase system; And sliding window is more little, and relatively, being positioned at the outer request of data ratio of sliding window will increase.Be positioned at the outer data of sliding window for those; Part except the back setting " anchor point " that we taked; What we still adopted is " minimum person is preferential " strategy of BitTorrent; The redundancy of system will diminish relatively, can reduce system load effectively, but may not satisfy player so in time to being about to the demand of played data.This depends primarily on the variation of the speed that the player buffered data receives and consume, and when inbound pacing greater than depletion rate the time, obviously buffering can satisfy the speed that player consumes; At this time should sliding window be reduced, reducing system load, and sliding window will be used for guaranteeing that (we know that " minimum person is preferential " is for the balance sysmte load for the request of the emergency data that player that " minimum person is preferential " strategy do not have to download is required; Always duplicate less burst in the download cluster at first, the mode of this unordered download can not satisfy the needs of player played in order), when inbound pacing the time less than depletion rate; Because the consumption of player buffered data is very fast; In order to reduce the time that the user plays wait, we should increase sliding window, to obtain the needed data of player as early as possible; Therefore; In order dynamically to reflect the variation of data in the sliding window, to reach better balance sysmte load, we propose a kind of sliding window scheme of self adaptation size.
We can clearly realize that from above-mentioned argumentation, and the size of sliding window is a vital parameter that influences systematic function.We think that the size of sliding window should be corresponding with broadcast startup stand-by period
; Client should be filled full sliding window buffering in this play waiting time; Then begin media stream; When playing; Constantly continue to fill this buffering, with the continuity that guarantees to play.About the best size of sliding window, according to test statistics, the size of sliding window should the static media data that is set to cushion 300s like this.(wherein
representes the playout-delay of player, the time interval promptly beginning to play from the client-requested program to player according to
; The size of
expression burst; Be used to be kept at the least unit of the media data of peer node, size is the 256K byte; The decoding speed of
presentation medium file) sliding window size computing formula; Prerequisite is all to suppose that speed that burst obtains is always at least more than or equal to the decoding speed of player Streaming Media; This is in practical application; For vast ADSL user and stream medium data, has great unrealistic property especially with high-quality QoS assurance.The numerical procedure that the initial size of our sliding window is taked equally; The fluctuation of obtaining in view of the BitTorrent burst simultaneously; And the aforementioned sliding window of discussing is to the influence of entire system performance, and the speed that our self adaptation size sliding window will obtain according to burst is oneself's adjustment size dynamically.
One, architecture
The purpose of system design is in order to realize new system; If but new system is excessive with original system difference; Will cause the costly of system upgrade, particularly for large-scale network system, the great upgrading of system can bring suitable cost and time cost.Therefore, to take into full account the original system framework in design during based on the video on-demand system of BitTorrent, to realize two kinds of simple upgrades between the system.Can find out that from traditional video on-demand system its problem is mainly derived from the bottleneck of media server, and does not have serious problem for other parts in the network.Come simply equally loaded between each media server according to present general shared formula video on-demand system; Can't thoroughly solve the bottleneck of media server; And with the mode of P2P with the load balancing of server to each node, could thoroughly realize the thorough solution of media server bottleneck problem.
Fig. 3 has provided the general frame based on the BitTorrent video on-demand system, and this structure is a source with existing ripe extensive video on-demand system, considers the characteristic of P2P simultaneously.Not only realized video on-demand system, guaranteed the performance and the extensibility of system simultaneously based on BitTorrent.
As can be seen from Figure 3, on general frame, it is very similar with traditional video on-demand system, and this has guaranteed that also the change meeting to system upgrade the time is smaller.And the main change of whole system with the client node end, simultaneously the function of server also can change to some extent, it no longer just simply returns the information of media server, also will return the information of neighbor node.For the change of client node, mainly be aimed at the client of moving on the client node, also simple many relatively in escalation process.
Two, embodiment
Shown in Fig. 4, the idiographic flow of system in running is:
1, seed file is made server and is made the files in stream media that will issue, then seed file is sent
The EPG server.
2, the EPG server is downloaded seed file, makes electronic program list according to seed information simultaneously.
3, video request program client can be from trend EPG server requests electronic program list, EPG after startup
Whether server belongs to the registered user according to this user's Information Authentication, if the user will send electronic program list to this user through checking EPG server, the program request program guide will occur on the user client then.
4, can program request want the program seen according to program request menu user, afterwards to EPG server requests kind Ziwen
Part, then the EPG server sends seed file to the user.
5,, the user gets into downloading process after receiving seed file at once, and at first improved on client
BitTorrent client and Tracker server connect, and obtain information of neighbor nodes according to the Tracker algorithm after improving.
6, client is through the information of these neighbor nodes, according to the BitTorrent client part after improving
Orderly download stream media file is play while downloading, and simultaneously also for other neighbor nodes provide upload service, the user just can see that request program finishes until file so at once.
Introduce the realization of self adaptation slip window below.
At first provide as giving a definition:
: initial sliding window size (desirable sliding window size), big I is calculated by following formula
Then our computing formula of definition
is following:
Wherein N is the burst number of node institute demand file;
,
are the frequency of adjustment sliding window size.
In the time of as
; When being initial,
.
Therefore the sliding window algorithm of self adaptation size can be easy to do following realization:
We know
by the front is the burst number; Suppose the video file of a 512MB; Then
; And
is the minimum value of sliding window; In theory; The words of downloading in order; When piecemeal acquisition speed during greater than the buffering area depletion rate;
can level off to 0; It promptly is the existence that does not need sliding window; But say as our front and to discuss; Because the characteristic of the unordered download of BT; We must keep sliding window is certain size; Through test, we find that working as decoding speed is 4Mbps, when playout-delay is 5s;
value is 10 ~ 20 for best, and
value 15% ~ 20% be the best.
Claims (4)
1. one kind based on the improved video ordering transmission method of reciprocity computation core algorithm; It is characterized in that adopting improved BitTorrent client and improved index server Tracker to promote the streaming media resource file transfer speed, the topological structure of employing comprises seed file making server, electronic playbill server EPG, improved index server Tracker, streaming media server and improved BitTorrent client; The transmission course of whole video program request is following:
Step .11: the files in stream media that seed file making server will be issued is made into seed file, and is right
After seed file is sent to electronic playbill server EPG;
Step 12: electronic playbill server EPG downloads seed file, makes according to seed information simultaneously
Sub-programme;
Step 13: the video request program client can be asked from trend electronic playbill server EPG after startup
Sub-programme; Whether electronic playbill server EPG belongs to the registered user according to this user's Information Authentication; If the user will send electronic program list to this user through checking electronic playbill server EPG, on the user client program request program guide will appear then;
Step 14: want the program seen according to program request menu user program request, afterwards to electronic playbill server EPG
The request seed file, then electronic playbill server EPG sends seed file to the user;
Step 15: after the user receives seed file, get into downloading process at once, at first through improved
BitTorrent client and improved index server Tracker connect, and obtain information of neighbor nodes;
Step 16: improved BitTorrent client adopts sliding window through the information of these neighbor nodes
The download stream media file of mechanism partial order is play while downloading, and also for other neighbor nodes upload service is provided simultaneously; Client downloads becomes kind of a child node after accomplishing, and plants child node and uploads for other node provides through improved fragment selection algorithm.
2. it is characterized in that improved BitTorrent client according to right 1 is described based on the improved video ordering transmission method of reciprocity computation core algorithm, adopt improved fragment selection algorithm, can solve the even distribution of file fragmentation, it is following to improve step:
Step 21: for the even distribution of burst in network, that abolishes seed uploads strategy, no longer basis
Speed of download provides to be uploaded;
Step 22: in downloading completion node Seed, a tabulation is set, all fragment numbers are all put during initialization
In tabulation, after fragment is uploaded by client node, then delete this fragment number from tabulation;
Step 23: use the preferential mode of downloading of minimum burst when Seed asks burst when downloading node,
If downloading slicing is in tabulation, Seed sends slicing files and gives the download node, and with burst number deletion from tabulation; If do not exist, Seed sends to through the bit field of downloading node and downloads node and do not have and the burst of fragment number in tabulation, then with the deletion from tabulation of this burst, if abovely either way do not meet, then blocks this node;
Step 24: after the fragment number in the tabulation is all by deletion, i.e. when tabulation is empty, carry out initialization again,
Again adding tabulation to all fragment numbers supplies node to download.
3. it is characterized in that improved index server Tracker according to right 1 is described based on the improved video ordering transmission method of reciprocity computation core algorithm, adopt improved node selection algorithm, can make full use of the last transfer efficiency of node, it is following to improve step:
Communicating by letter between step 31. expanding node and the tracking server lets Tracker can know the following of node
The progress of carrying;
Step 32. is set up one at the Tracker server side to each seed file and is arranged according to download progress
Ascending order tabulation;
When step 33. was issued as seed file, Seed at first joined in the tabulation with node, and with it
Download progress is changed to 1;
When step 34. is communicated by letter with Tracker as peer node; If this node is newly added node then according to download progress it is inserted into the corresponding position of tabulation; If peer node is in tabulation; Tabulation position before the deletion then, and will be inserted in the tabulation again according to the node progress and go;
Step 35. is searched 40 with the minimum node of node progress gap according to node location;
Step 36. is returned neighbor node and is tabulated to requesting node.
4. described based on the improved video ordering transmission method of reciprocity computation core algorithm, its spy according to right 1
Levy the download stream media file that is to adopt in the step 16 the sliding window mechanism partial order, make that near the burst the broadcast point can preferentially obtain downloading; In running; When having new file fragmentation to ask, earlier whether the file fragmentation in the urgent window of inspection is by whole requests or has downloaded, as if not having at every turn; Then ask the burst in the sliding window earlier; If having asked then from non-sliding window, to get file fragmentation asks, along with moving of broadcast point, sliding window is also made corresponding slip; And the size of this sliding window can according to decoding speed and playout-delay is adaptive in playing process adjusts, and has both satisfied the requirement of video request program to real-time, has made full use of BitTorrent efficiency of transmission efficiently again.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2012101479902A CN102821316A (en) | 2012-05-14 | 2012-05-14 | Improved video on demand (VOD) transmission method based on peer-to-peer computing core algorithm |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2012101479902A CN102821316A (en) | 2012-05-14 | 2012-05-14 | Improved video on demand (VOD) transmission method based on peer-to-peer computing core algorithm |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102821316A true CN102821316A (en) | 2012-12-12 |
Family
ID=47305132
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2012101479902A Pending CN102821316A (en) | 2012-05-14 | 2012-05-14 | Improved video on demand (VOD) transmission method based on peer-to-peer computing core algorithm |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102821316A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103442256A (en) * | 2013-08-30 | 2013-12-11 | Tcl集团股份有限公司 | Electronic program menu implementation method and system based on HTML5 |
| CN110430285A (en) * | 2019-08-27 | 2019-11-08 | 佛山职业技术学院 | A kind of playback method of Baffle Box of Bluetooth and its online audio file |
| CN111190915A (en) * | 2020-01-02 | 2020-05-22 | 腾讯科技（深圳）有限公司 | Method for determining road tool identifier or role identifier, server and storage medium |
| CN116566973A (en) * | 2023-06-20 | 2023-08-08 | 北京中宏立达科技发展有限公司 | File transmission system based on peer-to-peer network |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101478564A (en) * | 2008-12-31 | 2009-07-08 | 西安交通大学 | Adaptive hierarchical transmission structure design method for P2P stream media network |
| CN101534204A (en) * | 2008-03-10 | 2009-09-16 | 中国网通集团宽带业务应用国家工程实验室有限公司 | Streaming media information distribution system and method thereof and user end |
| CN101867777A (en) * | 2010-04-20 | 2010-10-20 | 南京邮电大学 | Video ordering transmission method based on peer-to-peer computing set-top box |
-
2012
- 2012-05-14 CN CN2012101479902A patent/CN102821316A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101534204A (en) * | 2008-03-10 | 2009-09-16 | 中国网通集团宽带业务应用国家工程实验室有限公司 | Streaming media information distribution system and method thereof and user end |
| CN101478564A (en) * | 2008-12-31 | 2009-07-08 | 西安交通大学 | Adaptive hierarchical transmission structure design method for P2P stream media network |
| CN101867777A (en) * | 2010-04-20 | 2010-10-20 | 南京邮电大学 | Video ordering transmission method based on peer-to-peer computing set-top box |
Non-Patent Citations (1)
| Title |
|---|
| 裴双迎: "基于Bit Torrent的核心算法分析与改进", 《中国优秀硕士学位论文全文数据库》, 7 December 2011 (2011-12-07) * |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103442256A (en) * | 2013-08-30 | 2013-12-11 | Tcl集团股份有限公司 | Electronic program menu implementation method and system based on HTML5 |
| CN103442256B (en) * | 2013-08-30 | 2017-08-04 | Tcl集团股份有限公司 | A kind of method and system that electric program menu is realized based on HTML5 |
| CN110430285A (en) * | 2019-08-27 | 2019-11-08 | 佛山职业技术学院 | A kind of playback method of Baffle Box of Bluetooth and its online audio file |
| CN111190915A (en) * | 2020-01-02 | 2020-05-22 | 腾讯科技（深圳）有限公司 | Method for determining road tool identifier or role identifier, server and storage medium |
| CN111190915B (en) * | 2020-01-02 | 2023-05-16 | 腾讯科技（深圳）有限公司 | Prop identification or role identification determining method, server and storage medium |
| CN116566973A (en) * | 2023-06-20 | 2023-08-08 | 北京中宏立达科技发展有限公司 | File transmission system based on peer-to-peer network |
| CN116566973B (en) * | 2023-06-20 | 2023-11-07 | 北京中宏立达科技发展有限公司 | File transmission system based on peer-to-peer network |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8850497B2 (en) | Efficiently distributing video content using a combination of a peer-to-peer network and a content distribution network | |
| US9432452B2 (en) | Systems and methods for dynamic networked peer-to-peer content distribution | |
| CN101237429B (en) | Stream media living broadcasting system, method and device based on content distribution network | |
| CN103634692A (en) | CDN (content distribution network) and P2P (peer-to-peer) based hybrid stream media video-on-demand system | |
| US20120143986A1 (en) | Systems and methods for downloading by different processes | |
| CN101640699A (en) | P2P streaming media system and streaming media downloading method thereof | |
| CN113453038B (en) | Effectiveness optimal collaborative cache management method under CDN-P2P hybrid architecture | |
| CN102394899B (en) | On-demand system and method for improving file downloading speed | |
| US20160381127A1 (en) | Systems and methods for dynamic networked peer-to-peer content distribution | |
| Kumar et al. | Edge assisted DASH video caching mechanism for multi-access edge computing | |
| CN102821316A (en) | Improved video on demand (VOD) transmission method based on peer-to-peer computing core algorithm | |
| CN102780710A (en) | Node scheduling method based on content distribution network | |
| Wang et al. | PLVER: Joint stable allocation and content replication for edge-assisted live video delivery | |
| Nguyen et al. | An adaptive streaming method of 360 videos over HTTP/2 protocol | |
| Liang et al. | ipass: Incentivized peer-assisted system for asynchronous streaming | |
| CN110166834B (en) | Data playing method, device and storage medium | |
| Jiang et al. | A replica placement algorithm for hybrid CDN-P2P architecture | |
| CN104105009A (en) | Digital multimedia broadcast control optimizing method | |
| WO2016165596A1 (en) | Multimedia file control method and system | |
| Dakshayini et al. | Client-to-client streaming scheme for vod applications | |
| Kao et al. | I2CC: Interleaving two-level cache with network coding in peer-to-peer VoD system | |
| WO2012158161A1 (en) | Efficiently distributing video content using a combination of a peer-to-peer network and a content distribution network | |
| CN107241376B (en) | Load balancing method, system and device and topology simplifying method thereof | |
| Grégoire et al. | On scheduling live media streaming in the cloud—a study | |
| Mate et al. | Offloading video servers: P2P and/or caches? |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20121212 |