CN101150506A - Content acquisition method, device and content transmission system - Google Patents
Content acquisition method, device and content transmission system Download PDFInfo
- Publication number
- CN101150506A CN101150506A CNA2007101404799A CN200710140479A CN101150506A CN 101150506 A CN101150506 A CN 101150506A CN A2007101404799 A CNA2007101404799 A CN A2007101404799A CN 200710140479 A CN200710140479 A CN 200710140479A CN 101150506 A CN101150506 A CN 101150506A
- Authority
- CN
- China
- Prior art keywords
- data
- content
- service node
- source nodes
- data burst
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Abstract
The invention discloses a content acquiring method, an apparatus and a content transmission system, which is characterized in that each content data requested to be downloaded in one round is partitioned to the available service nodes; an available service node is selected as the data source node of the content data partition and the selected data source nodes are different from each other; the number of data channels to be used for acquiring data partitions is determined according to the number of selected data source nodes, and downloading of each round of data partitions is completed through the data channels of the number; thereby the number of data channels requested to be opened needs to be equal to that of the data source nodes when data partitions are downloaded, which allows every data channel to transmit data partitions, in other words, those resources connected to a data channel can be fully utilized in order to improve the bandwidth utilization of downlink.
Description
Technical field
The present invention relates to the communications field, relate in particular to the technology of content delivery.
Background technology
Along with the whole world of the Internet is popularized, increasing people use terminal to initiate network to connect, and its connected mode is just promptly by being mainly to develop to the direction based on broadband access with the dial-up access.Wherein, become the main flow of present broadband access for the access way with asymmetric rate channel characteristics of representative with ADSL (Asymmetric Digital Subscriber Loop, ADSL (Asymmetric Digital Subscriber Line)).
ADSL adopts DMT (Discrete Multi-Tone, Discrete multi-tone) modulation technique and FDM (Frequency Division Multiplexing, frequency division multiplexing) technology, the link channel that total frequency band range is divided into three non-overlapping copies on frequency spectrum: voice link, up data link and downlink data link are used for transmitting voice, uplink communication data and downlink communication data respectively.Wherein, the message transmission rate on up data link and the downlink data link is not reciprocity, and the message transmission rate of down link is often much larger than up link.Generally for ADSL, the ratio of descending/uplink rate approximates 8.
On the other hand, along with the Internet and Development of Multimedia Technology, also more and more be subjected to liking of people such as audio and video stream media services such as VOD (Video On Demand, video request program), Web TVs.In the face of the user of the quick audio and video stream media related service that increases, tradition always becomes based on the server in the C/S framework and can't bear the heavy load, and it is not enough that the bandwidth on the backbone network circuit also always seems.
In order to address the above problem, the prior art one relevant with the present invention proposed the parallel content block division method of downloading of a kind of employing, the basic step of this method is: (1) terminal is obtained and is downloaded content corresponding download descriptor, comprises a plurality of download content source information of downloading content and the data volume of downloading content in the Download Descriptor; (2) terminal will be downloaded content and be divided into a plurality of download content pieces according to the information in the Download Descriptor; (3) terminal to server sends the download request of described a plurality of download content pieces respectively, and downloads described a plurality of download content piece; (4) after terminal is obtained described a plurality of download content piece, it is assembled into complete download content.
In video on demand/live broadcast is used, very high to the real-time requirement of video playback, promptly require the video data burst to download in strict accordance with sequencing, be that arrangement is orderly and in above-mentioned technology, do not offer some clarification on parallel data downloaded piecemeal.In addition, in parallel concrete each step process of downloading, about selecting which server as parallel data downloaded source node, and how these data source nodes are distributed, are organized together, all do not set forth, this will cause the prior art one adaptive video program request well/application such as live grade.
In order to address this problem, the prior art two relevant with the present invention provides the streaming medium content transmission technology based on P2P (Peer toPeer, point-to-point) thought.In this technology, each participates in the node of content delivery and both downloaded needed content-data as client computer from other node, and serving as server again provides data transport service for other node.Direct swap data not only can alleviate the load of central server like this, and can improve the QoS service quality of each node in the network between the node.
Based on the structure principle chart of the content delivery network of P2P as shown in Figure 1, comprise Tracker (tracking server) and a plurality of node.Wherein, the Tracker server is in charge of network shared resource, safeguards a dynamic informational table of nodes, and provides functions such as resource lookup, location for all nodes, itself does not participate in the content-data transmission.
Node P1 at first sends log-on message to the Tracker server, states currently will ask video content C; Behind the informational table of nodes of Tracker server by its maintenance of inquiry, can know the available service node of content C, be node P2～P5 among the figure; The Tracker server sends feedback information to node P1 then, and the address of these available service node and the content-data burst about C that these available service node comprised are informed to node P1; Afterwards, node P1 connects with regard to direct and these service nodes, and the order request transmission content-data burst that service node comprised.At this moment, for content C, node P1 is a requesting node, and node P2～P5 is a service node.
In the prior art scheme, during content-data burst that requesting node request service node is comprised, adopt based on the fixing P2P content parallel transmission algorithm of sliding window value.The particular content transmission course is: at first the whole contents data are carried out burst, promptly be divided into the identical a plurality of continuous data bursts of size, and determine that every the wheel needs data downloaded burst quantity, determine fixing sliding window value according to every needs data downloaded burst quantity of taking turns; Begin according to sequencing circulation downloading data fragmentation from first data fragmentation afterwards, and whenever carrying out taking turns data downloads, all open a plurality of data channel simultaneously, the sliding window value that the number of passage equals to fix, each data channel can be used for downloading a data burst separately; And the like, until being downloaded, last data fragmentation finishes.
Owing to fix according to every determined sliding window value of needs data downloaded burst quantity of taking turns, so whenever carrying out taking turns data downloads a plurality of data channel numbers of opening simultaneously and also fixes, when the current service node number that can be used for parallel transmission the time less than the sliding window value, in advance in all data channel of Kai Qiing, there are not enough data fragmentations to be used for downloading, this can cause the resource free time in some passage or waste, and influences the bandwidth availability ratio of down link; When the current service node number that can be used for parallel transmission greater than the sliding window value time, the passage number of Kai Qiing is not enough in advance, and every like this data downloaded burst quantity of taking turns can reduce, thereby can influence the efficient of the parallel downloading data fragmentation of P2P.
Summary of the invention
Embodiments of the invention provide a kind of content acquisition method, device and content transmission system, and it can improve data downloading speed, save the total time that data are downloaded, thereby can improve the bandwidth availability ratio of down link.
Embodiments of the invention are achieved through the following technical solutions:
Embodiments of the invention provide a kind of content acquisition method, and it comprises:
According to the polymerizability attribute of each service node, determine the available service node at each the content-data burst place that need in one takes turns, download to the content data fragmentation;
In the available service node at each content-data burst place, select an available service node respectively,, and make each data source nodes of being determined inequality as the data source nodes of described content-data burst;
Determine to obtain the employed data channel quantity of data fragmentation according to determined data source nodes quantity; By described quantity data passage, ask described data source nodes to transmit described content-data burst, and, get access to the content-data burst according to the feedback of described data source nodes.
Embodiments of the invention also provide a kind of content deriving means, and it comprises:
The service node determining unit is used for determining the available service node at each the content-data burst place that need download according to the polymerizability attribute of each service node to the content data fragmentation in one takes turns;
The data source nodes determining unit, be used for respectively available service node at each content-data burst place, select an available service node,, and make each data source nodes of being determined inequality as the data source nodes of described content-data burst;
The content acquiring unit is used for determining to obtain the employed data channel quantity of data fragmentation according to determined data source nodes quantity; By described quantity data passage, ask described data source nodes to transmit described content-data burst, and, get access to the content-data burst according to the feedback of described data source nodes.
Embodiments of the invention also provide a kind of content transmission system, comprise a plurality of nodes, one of them node is as the requesting node of content-data burst, other node is as the service node of content-data burst, described service node, according to the request of described request node, the feedback content data fragmentation is given the described request node, wherein, the described request node comprises:
The content deriving means is used for determining the available service node at each the content-data burst place that need download according to the polymerizability attribute of each service node to the content data fragmentation in one takes turns; In the available service node at each content-data burst place, select an available service node respectively,, and make each data source nodes of being determined inequality as the data source nodes of described content-data burst; Determine to obtain the employed data channel quantity of data fragmentation according to determined data source nodes quantity, by described quantity data passage, ask described data source nodes to transmit described content-data burst, and, get access to the content-data burst according to the feedback of described data source nodes.
The specific embodiments that is provided by the embodiment of the invention described above as can be seen, owing to the data source nodes of being determined for each content-data burst that need download in one takes turns is inequality, and determine to obtain the employed data channel quantity of data fragmentation according to determined data source nodes quantity, finish every download of taking turns data fragmentation by described quantity data passage, so when carrying out the data fragmentation download, can make each data channel that the data fragmentation transmission is all arranged, be that resource in each data channel can be fully utilized, thereby can improve the bandwidth availability ratio of down link.
Description of drawings
The structure principle chart of the P2P content delivery network that Fig. 1 provides for prior art;
The flow chart that Fig. 2 provides for first embodiment of the invention;
Fig. 3 is a flow chart of determining the data source nodes of each data fragmentation in the second embodiment of the invention;
The schematic diagram of situation is transmitted in the stationary window polymerization that Fig. 4 provides for the embodiment of the invention;
The schematic diagram of situation is transmitted in the variable window polymerization that Fig. 5 provides for the embodiment of the invention.
Embodiment
First embodiment of the invention provides a kind of content acquisition method, this method is based on the parallel processing of prior art, and the fixing thought of sliding window or variable sliding window, in the P2P network environment that adopts asymmetric speed connected modes such as ADSL, the Data Dynamic of current available a plurality of transmission service nodes is condensed together, provide data transport service to a requesting node simultaneously.Its implementing procedure comprises following process as shown in Figure 2:
Step S201, requesting node is divided into a plurality of equal-sized data fragmentations with the video content of being asked.
The neglecting different application greatly of data fragmentation and deciding is as desirable 256k byte.The sequence number of data fragmentation can be arranged as c1～cM.
Step S202, requesting node calculates every quantity of taking turns the synchronous downloaded contents data fragmentation of needs according to the ratio of descending/up available bandwidth and the number of all service nodes; The sequencing in content according to this quantity and content-data burst need to determine the downloaded contents data fragmentation in every the wheel.
The ratio of requesting node calculates descending/up available bandwidth, R=maximum downstream rate/maximum upstream rate.For example in the ADSL of reality network, the typical value of R equals 8.And requesting node is added up the quantity of all nodes in its present node of safeguarding tabulation, is designated as S.The size of R and S is relatively got wherein the smaller as every maximum quantity N that takes turns the data fragmentation of required synchronous download or inquiry, promptly N=Min (R, S).
Step S203, requesting node obtain service node to need the polymerizability attribute of downloaded contents data fragmentation when front-wheel.
Whether include current certain required content-data burst on certain service node of polymerizability attribute representation.When requesting node obtains the polymerizability attribute of service node, can send identical data fragmentation query requests to each service node in the service node tabulation of oneself safeguarding, wherein carry the content-data burst information that needs inquiry, to inquire whether comprise certain data fragmentation on certain service node; After service node receives Query Information, judge whether self comprises this data fragmentation, in this way,,, then feed back " NO " information as not then to requesting node feedback " YES " information; Requesting node obtains each service node to working as the front-wheel polymerizability attribute of downloaded contents data fragmentation synchronously according to the content-data burst information that service node returns, and promptly whether this service node has these data fragmentations.
When requesting node sent the data fragmentation query requests to all service nodes, the data fragmentation information content that can inquire about simultaneously at most was every maximum quantity N that takes turns institute's data query burst, and the inquiry sequence number is from the current next one of having downloaded the data fragmentation of finishing.For example, the current download finished [18] individual data burst, inquires about sequence number so and is [19]～[19+N-1].
Step S204, requesting node as polymerization judgment condition attribute, according to described polymerization judgment condition, is respectively each the content-data burst that need download when front-wheel with the polymerizability attribute that obtains, determines available service node.
Step S205 in the available service node at each content-data burst place, selects an available service node respectively, as the data source nodes of described content-data burst, and makes each data source nodes of being determined inequality.
Step S205 specific implementation, can adopt following method:
Be in the determined available service node of each content-data burst respectively, select the data source nodes of a service node at random as this content-data burst, judge whether the selected service node that goes out is identical with the service node that goes out for other content-data burst is selected, if it is identical, then in determined other available service node of this content-data burst, reselect the data source nodes of a service node as this content-data burst, and the like, up to selecting the service node that can be used as data source nodes, and make as each service node of data source nodes inequality for all the elements data fragmentation that need download when front-wheel; Export polymerization scale-value n at last.This polymerization scale-value n is used for representing the different service node numbers of the most effective polymerization, or, current can be in real time the number of downloaded contents data fragmentation synchronously.Obviously, n satisfies inequality: n＜=N.
Step S206, requesting node determines to obtain the employed data channel quantity of data fragmentation according to determined data source nodes quantity, by described quantity data passage,, send and the corresponding data transfer request of data fragmentation to service node as data source nodes.
Requesting node is according to the selected service node quantity as data source nodes that goes out, be polymerization scale-value n, the data channel quantity of opening for transmitted data slice, as the data channel quantity of opening is n, or the data channel quantity of opening is less than n, utilize described data channel simultaneously to n service node, send and n the corresponding data transfer request of data burst (corresponding 1 the data burst of each service node) as data source nodes.
If requesting node and selected go out as having existed data channel quantity between the service node of data source nodes more than n, then can from these data channel, select and be used for the data channel of transmitted data slice and get final product according to determined data source nodes quantity, the selected data channel quantity that goes out can be n, also can be less than n, other non-selected data channel can be distributed to other resource.
Step S207 according to the feedback of data source nodes to described data transfer request, obtains corresponding data fragmentation.
After n the service node as data source nodes receives data transfer request, at once to requesting node feedback data burst; Requesting node obtains corresponding data fragmentation according to the feedback of described data source nodes.
After step S208, requesting node are received the content-data burst, put in order according to the priority of data fragmentation sequence number, they are combined focuses on.
Step S209, requesting node judge whether all data fragmentations are all downloaded and finish that in this way, then execution in step S210 promptly finishes this process; As not, then turn back to S203 step continuation next round.
Second embodiment of the invention provides another kind of content acquisition method, and the difference part of itself and first embodiment is:
Among the step S205, select can be used as the available service node of data source nodes no longer at random for each data fragmentation, but according to the cohesive strength attribute of available service node, respectively in the available service node at each content-data burst place, select an available service node, as the data source nodes of described content-data burst, and make each data source nodes of being determined inequality.Specific implementation process comprises as shown in Figure 3:
Step S301 obtains the cohesive strength attribute of the available service node of each content-data burst that need download when front-wheel.
Cohesive strength is represented the transmission rate size of aggregated service node, and rate value is big more, and then cohesive strength is high more, and vice versa.
When requesting node obtains the cohesive strength attribute of service node, can after finishing last round of data transmission procedure, add up the real-time Transmission speed of each service node immediately, and the statistics renewal is kept in the node Speedometer Drive.Like this, requesting node just can directly be selected that node with flank speed value for when needing the downloaded contents data fragmentation to select the node of high cohesive strength in the front-wheel from the node Speedometer Drive.
Step S302, cohesive strength attribute according to service node, first content-data burst from a plurality of content-data bursts that need download when front-wheel begins, and selects the fastest service node of speed in its available service node, as the data source nodes of downloading this data fragmentation.
Step S303 for next content-data burst, according to the cohesive strength attribute of service node, selects the fastest service node of speed in its available service node.
Step S304, be judged as the selected service node that goes out of this next one content-data burst with before for whether the determined data source nodes of other data fragmentation overlaps, if overlap, execution in step S305 then; If do not overlap, execution in step S307 then.
Step S305 judges whether available service node that should the content-data burst traveled through to finish, if, execution in step S308 then; Otherwise, execution in step S306.
Step S306 in the available service node tabulation of this data fragmentation, reselects a speed time fast service node for this data allocations, continues to change over to step S307 then.
Step S307 with the data source nodes of this available service node as this data fragmentation, changes step S308 over to then.
Step S308 judges whether to determine data source nodes for all the elements data fragmentation that need download when front-wheel, in this way, then enters step S309; As not, then return step S303, continue as next content-data burst and select corresponding data source nodes.
Step S309, output can be used as the service node of data source nodes when front-wheel, and with the number of this service node as the polymerization scale-value n that works as the front-wheel correspondence.
Corresponding first embodiment of the invention, third embodiment of the invention provides a kind of content deriving means, and it comprises: service node determining unit, data source nodes determining unit and content acquiring unit.
The service node determining unit is used for determining the available service node at each the content-data burst place that need download according to the polymerizability attribute of each service node to the content data fragmentation in one takes turns; Associated description among concrete disposition and the said method embodiment is similar, is not described in detail here.
This service node determining unit can further include that attribute obtains subelement and service node is determined subelement:
Attribute obtains subelement, is used to obtain the polymerizability attribute of service node to the content data fragmentation; This attribute obtains subelement and specifically is used for sending the data fragmentation query requests to each service node, carries the content-data burst information that needs inquiry in the data fragmentation query requests; According to the content-data burst information that service node returns, obtain the polymerizability attribute of each service node.Associated description among concrete disposition and the said method embodiment is similar, is not described in detail here.
Service node is determined subelement, be used for according to the polymerizability attribute that gets access to, judge whether described service node comprises certain content-data burst that needs are downloaded, when confirming to comprise described content-data burst, determine that then described service node is the available service node at described content-data burst place.Associated description among concrete disposition and the said method embodiment is similar, is not described in detail here.
Above-mentioned data source nodes determining unit, be used for respectively available service node at each content-data burst place, select an available service node,, and make each data source nodes of being determined inequality as the data source nodes of described content-data burst.This data source nodes determining unit may further include: first determines subelement.This first definite subelement, be used for respectively available service node at each content-data burst place, select an available service node at random,, and make each data source nodes of being determined inequality as the data source nodes of described content-data burst.Associated description among concrete disposition and the said method embodiment is similar, is not described in detail here.
The content acquiring unit, be used for determining to obtain the employed data channel quantity of data fragmentation according to determined data source nodes quantity, by described quantity data passage, ask described data source nodes to transmit described content-data burst, and, get access to the content-data burst according to the feedback of described data source nodes.
The foregoing deriving means can further include: the data fragmentation determining unit.This data fragmentation determining unit is used for the ratio according to down link and up link available bandwidth, and the quantity of all service nodes, determines every downloaded contents data fragmentation quantity synchronously of taking turns; The sequencing in content according to this quantity and content-data burst need to determine the downloaded contents data fragmentation in one takes turns.Associated description among concrete disposition and the said method embodiment is similar, is not described in detail here.
The foregoing deriving means can further include attribute determining unit, is used to add up the transmission rate of each service node; According to described statistics, determine the cohesive strength attribute of service node.Associated description among concrete disposition and the said method embodiment is similar, is not described in detail here.
Corresponding second embodiment of the invention, fourth embodiment of the invention provides a kind of content deriving means, and it comprises service node determining unit, data source nodes determining unit and content acquiring unit.The difference part of itself and the 3rd embodiment is that described data source nodes determining unit comprises that no longer further first determines subelement, but comprises that further second determines subelement.The subelement that correlation unit comprised among subelement that remaining unit comprised and the 3rd embodiment and the function of described subelement are identical, are not described in detail here.In addition, this content deriving means can further include the data fragmentation determining unit; This content deriving means can further include attribute determining unit; The function of the correlation unit among this data fragmentation determining unit and attribute determining unit and the 3rd embodiment is identical, is not described in detail here.
Above-mentioned second determines subelement, be used for being used for representing the cohesive strength attribute of transmission rate size according to service node, respectively in the available service node at each content-data burst place, select an available service node, as the data source nodes of described content-data burst, and make each data source nodes of being determined inequality.
Fifth embodiment of the invention also provides a kind of content transmission system, comprise a plurality of nodes, one of them node is as the requesting node of content-data burst, other node is as the service node of content-data burst, described service node is according to the request of described request node, the feedback content data fragmentation is given the described request node, and wherein, the described request node comprises: the content deriving means.
This content deriving means is used for determining the available service node at each the content-data burst place that need download according to the polymerizability attribute of each service node to the content data fragmentation in one takes turns; In the available service node at each content-data burst place, select an available service node respectively,, and make each data source nodes of being determined inequality as the data source nodes of described content-data burst; Determine to obtain the employed data channel quantity of data fragmentation according to determined data source nodes quantity, by described quantity data passage, ask described data source nodes to transmit described content-data burst, and, get access to the content-data burst according to the feedback of described data source nodes.Subelement and function corresponding thereof that the unit that comprises in the structure of this content deriving means, each unit comprise, identical with associated description among above-mentioned the 3rd embodiment or the 4th embodiment, be not described in detail here.
Illustrate in two kinds of situation below by the foregoing description and realize the content process of downloading:
First kind of situation is stationary window polymerization transmission example, as shown in Figure 4.Wherein, determining each polymerization scale-value n in taking turns according to the foregoing description is fixed value, all equals 2; Requesting node is P0, and service node is respectively P1～PN.
In this case, content-data burst downloading process can be described below:
P0 takes turns at each and all opens two download channel simultaneously, and downloads the video data segment from two service nodes respectively:
Carrying out first round data fragmentation when downloading, on passage one, obtain first video data burst, as the c1 among the figure from service node P3; On passage two, obtain second video data burst, as the c2 among the figure from service node P4;
Take turns data fragmentation when downloading carrying out second, P0 obtains the 3rd video data burst from service node P1 on passage one, as the c3 among the figure, obtain the 4th video data burst from P3 again simultaneously on passage two, as the c4 among the figure.
When first round data fragmentation was downloaded, P3 was the service node of first passage correspondence as can be seen; When second took turns the data fragmentation download, P3 was on the service node of passage two correspondences, and this illustrates that same service node can provide the transmission service according to the decision situation when front-wheel in different service node formations.Doing the service node formation that can satisfy in each is taken turns so all is global optimum, with take turns in the data downloading process same node the service contrast can only be provided in a fixing node queue from start to finish different, have better flexibility and transmission performance.
When carrying out the download of third round data fragmentation, P0 obtains the 5th video data burst from service node P6 on passage one, as the c5 among the figure; Simultaneously on passage two, obtain the 6th video data burst from P2 again, as the c6 among the figure;
When carrying out the download of four-wheel data fragmentation, P0 obtains the 7th video data burst from service node P5 on passage one, as the c7 among the figure, obtains the 8th video data burst from P8 again simultaneously on passage two, as the c8 among the figure;
The rest may be inferred, and until in the end one taking turns, P0 obtains M-1 video data burst from service node P2 on passage one, as the cM-1 among the figure, obtains M video data burst from PN again simultaneously on passage two, as the cM among the figure.
Shown in Figure 4 is the situation of 2 polymerizations, if be generalized to the situation of multiple spot dynamic aggregation, only need take turns the data channel that opens to a plurality of service nodes at each, utilizes the parallel downloading data fragmentation of described data channel to get final product.Second kind of situation provided variable window polymerization transmission example, as shown in Figure 5.Wherein, definite polymerization scale-value n in each is taken turns is variable according to the first embodiment of the invention and second embodiment, and for example, determining the service node that can be used as data source nodes in the first round is P1, P5, P7, polymerization this moment scale-value n=3; Second to determine the service node that can be used as data source nodes in taking turns be P2, P3, polymerization this moment scale-value n=2; Determining the service node that can be used as data source nodes in the third round is P4, P1, P3, P6, polymerization this moment scale-value n=4; Take turns until last that to determine the service node that can be used as data source nodes be P5, P2, P7, polymerization this moment scale-value n=3.
Carrying out first round data fragmentation when downloading, the data channel that passes through to P1 is obtained first video data burst, as the c1 among the figure; The data channel that passes through to P5 is simultaneously obtained second video data burst, as the c2 among the figure; The data channel that passes through to P7 is simultaneously obtained the 3rd video data burst, as the c3 among the figure.
The rest may be inferred, and to the last all data fragmentations in taking turns are downloaded and finished.
By as can be seen above-mentioned, determine to obtain the employed data channel quantity of data fragmentation according to determined data source nodes quantity, can download employed data channel and be no more than quantity so that each takes turns data fragmentation like this as the service node of data source nodes, and because the corresponding service node of each data fragmentation as data source nodes, like this can be so that each takes turns data when downloading, data fragmentation is all arranged in each data channel, be that resource in each data channel can be fully utilized, therefore improve the bandwidth availability ratio of down link.
In addition, in the embodiment of the invention, when obtaining the employed data channel quantity of data fragmentation and quantity as the service node of data source nodes equating, can also make and in one takes turns, can be downloaded simultaneously by the data downloaded burst, therefore can improve parallel data downloaded amount.
In addition, the embodiment of the invention is not only applicable to fixedly sliding window mechanism, and can be applicable to variable sliding window mechanism, has as seen strengthened the dynamic flexible technology of parallel download technology.
Obviously, those skilled in the art can carry out various changes and modification to the present invention and not break away from the spirit and scope of the present invention.Like this, if of the present invention these are revised and modification belongs within the scope of claim of the present invention and equivalent technologies thereof, then the present invention also is intended to comprise these changes and modification interior.
Claims (15)
1. a content acquisition method is characterized in that, comprising:
According to the polymerizability attribute of each service node, determine the available service node at each the content-data burst place that need in one takes turns, download to the content data fragmentation;
In the available service node at each content-data burst place, select an available service node respectively,, and make each data source nodes of being determined inequality as the data source nodes of described content-data burst;
Determine to obtain the employed data channel quantity of data fragmentation according to determined data source nodes quantity, by described quantity data passage, ask described data source nodes to transmit described content-data burst, and, get access to the content-data burst according to the feedback of described data source nodes.
2. the method for claim 1 is characterized in that, also comprises:
According to the ratio of down link and up link available bandwidth, and the quantity of all service nodes, determine that every the wheel needs downloaded contents data fragmentation quantity; The sequencing in content according to this quantity and content-data burst need to determine the downloaded contents data fragmentation in one takes turns.
3. method as claimed in claim 1 or 2 is characterized in that, whether described polymerizability attribute representation's service node comprises the attribute that needs the downloaded contents data fragmentation.
4. method as claimed in claim 3 is characterized in that, and is described according to the polymerizability attribute of each service node to the content data fragmentation, determines the available service node at each the content-data burst place that need download in one takes turns, comprising:
Obtain the polymerizability attribute of service node to the content data fragmentation;
According to the polymerizability attribute that gets access to, judge whether described service node comprises certain content-data burst that needs are downloaded, when confirming to comprise described content-data burst, determine that then described service node is the available service node at described content-data burst place.
5. method as claimed in claim 4 is characterized in that, the described polymerizability attribute that obtains service node comprises:
Send the data fragmentation query requests to each service node, wherein carry the content-data burst information that needs inquiry; According to the content-data burst information that service node returns, obtain the polymerizability attribute of each service node to described content-data burst.
6. method as claimed in claim 1 or 2, it is characterized in that, described respectively in the available service node at each content-data burst place, select an available service node, data source nodes as described content-data burst, and make each data source nodes of being determined inequality, comprising:
In the available service node at each content-data burst place, select an available service node at random respectively,, and make each data source nodes of being determined inequality as the data source nodes of described content-data burst;
Perhaps,
According to the cohesive strength attribute that is used for representing the transmission rate size in the service node, respectively in the available service node at each content-data burst place, select an available service node, as the data source nodes of described content-data burst, and make each data source nodes of being determined inequality.
7. method as claimed in claim 6 is characterized in that, also comprises:
Add up the transmission rate of each service node,, determine the cohesive strength attribute of service node according to described statistics.
8. method as claimed in claim 1 or 2 is characterized in that, describedly determines to obtain the employed data channel quantity of data fragmentation according to determined data source nodes quantity, comprising:
Determine to obtain the employed data channel quantity of data fragmentation and be equal to or less than determined data source nodes quantity.
9. a content deriving means is characterized in that, comprising:
The service node determining unit is used for determining the available service node at each the content-data burst place that need download according to the polymerizability attribute of each service node to the content data fragmentation in one takes turns;
The data source nodes determining unit, be used for respectively available service node at each content-data burst place, select an available service node,, and make each data source nodes of being determined inequality as the data source nodes of described content-data burst;
The content acquiring unit is used for determining to obtain the employed data channel quantity of data fragmentation according to determined data source nodes quantity; By described quantity data passage, ask described data source nodes to transmit described content-data burst, and, get access to the content-data burst according to the feedback of described data source nodes.
10. device as claimed in claim 9 is characterized in that, also comprises:
The data fragmentation determining unit is used for the ratio according to down link and up link available bandwidth, and the quantity of all service nodes, determines every downloaded contents data fragmentation synchronously of taking turns; The sequencing in content according to this quantity and content-data burst need to determine the downloaded contents data fragmentation in one takes turns.
11., it is characterized in that described service node determining unit comprises as claim 9 or 10 described devices:
Attribute obtains subelement, is used to obtain the polymerizability attribute of service node to the content data fragmentation;
Service node is determined subelement, be used for according to the polymerizability attribute that gets access to, judge whether described service node comprises certain content-data burst that needs are downloaded, when confirming to comprise described content-data burst, determine that then described service node is the available service node at described content-data burst place.
12. device as claimed in claim 11 is characterized in that, described attribute obtains subelement and specifically is used for sending the data fragmentation query requests to each service node, wherein carries the content-data burst information that needs inquiry; According to the service node feedack, obtain the polymerizability attribute of each service node.
13. device as claimed in claim 11 is characterized in that, described data source nodes determining unit comprises:
First determines subelement, be used for respectively available service node at each content-data burst place, select an available service node at random,, and make each data source nodes of being determined inequality as the data source nodes of described content-data burst;
Perhaps,
Second determines subelement, be used for being used for representing the cohesive strength attribute of transmission rate size according to service node, respectively in the available service node at each content-data burst place, select an available service node, as the data source nodes of described content-data burst, and make each data source nodes of being determined inequality.
14. device as claimed in claim 13 is characterized in that, also comprises:
Attribute determining unit, the transmission rate that is used to add up each service node; According to described statistics, determine the cohesive strength attribute of service node.
15. content transmission system, comprise a plurality of nodes, one of them node is as the requesting node of content-data burst, other node is as the service node of content-data burst, described service node, according to the request of described request node, the feedback content data fragmentation is given the described request node, it is characterized in that the described request node comprises:
The content deriving means is used for determining the available service node at each the content-data burst place that need download according to the polymerizability attribute of each service node to the content data fragmentation in one takes turns; In the available service node at each content-data burst place, select an available service node respectively,, and make each data source nodes of being determined inequality as the data source nodes of described content-data burst; Determine to obtain the employed data channel quantity of data fragmentation according to determined data source nodes quantity; By described quantity data passage, ask described data source nodes to transmit described content-data burst, and, get access to the content-data burst according to the feedback of described data source nodes.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2007101404799A CN101150506B (en) | 2007-08-24 | 2007-08-24 | Content acquisition method, device and content transmission system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2007101404799A CN101150506B (en) | 2007-08-24 | 2007-08-24 | Content acquisition method, device and content transmission system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101150506A true CN101150506A (en) | 2008-03-26 |
| CN101150506B CN101150506B (en) | 2011-07-06 |
Family
ID=39250857
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2007101404799A Active CN101150506B (en) | 2007-08-24 | 2007-08-24 | Content acquisition method, device and content transmission system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101150506B (en) |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102223288A (en) * | 2010-04-15 | 2011-10-19 | 中国移动通信集团公司 | Method, system and device for scheduling resources |
| CN101720005B (en) * | 2009-12-18 | 2012-02-08 | 中兴通讯股份有限公司 | Method and system of channel time-shifting fragment recording |
| CN102347907A (en) * | 2011-11-17 | 2012-02-08 | 网宿科技股份有限公司 | Network scheduling method and system for distinguishing transmitted content |
| CN101437044B (en) * | 2008-11-28 | 2012-05-09 | 中兴通讯股份有限公司 | Method and system for downloading file by point-to-point network technique based on sliced sheet |
| CN103037017A (en) * | 2012-12-31 | 2013-04-10 | 乐视网信息技术（北京）股份有限公司 | Passive P2P data distribution method and node client-side |
| WO2014032559A1 (en) * | 2012-08-28 | 2014-03-06 | 腾讯科技（深圳）有限公司 | Method and device for downloading file |
| CN104144223A (en) * | 2014-08-21 | 2014-11-12 | 北京奇艺世纪科技有限公司 | Data obtaining method and device |
| CN106777171A (en) * | 2016-12-22 | 2017-05-31 | 北京小度互娱科技有限公司 | Method and apparatus for exporting burst media file |
| CN106878442A (en) * | 2011-03-17 | 2017-06-20 | 华为技术有限公司 | The method and apparatus of transmitting data resources |
| WO2019184096A1 (en) * | 2018-03-28 | 2019-10-03 | 网宿科技股份有限公司 | Method and system for downloading data resources |
| CN113643728A (en) * | 2021-08-12 | 2021-11-12 | 荣耀终端有限公司 | Audio recording method, electronic device, medium, and program product |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1324840C (en) * | 2003-06-18 | 2007-07-04 | 中兴通讯股份有限公司 | A method for performing speed limiting on data traffic by network processor |
-
2007
- 2007-08-24 CN CN2007101404799A patent/CN101150506B/en active Active
Cited By (17)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101437044B (en) * | 2008-11-28 | 2012-05-09 | 中兴通讯股份有限公司 | Method and system for downloading file by point-to-point network technique based on sliced sheet |
| CN101720005B (en) * | 2009-12-18 | 2012-02-08 | 中兴通讯股份有限公司 | Method and system of channel time-shifting fragment recording |
| CN102223288A (en) * | 2010-04-15 | 2011-10-19 | 中国移动通信集团公司 | Method, system and device for scheduling resources |
| CN106878442A (en) * | 2011-03-17 | 2017-06-20 | 华为技术有限公司 | The method and apparatus of transmitting data resources |
| CN106878442B (en) * | 2011-03-17 | 2020-12-04 | 华为技术有限公司 | Method and device for transmitting data resources |
| CN102347907A (en) * | 2011-11-17 | 2012-02-08 | 网宿科技股份有限公司 | Network scheduling method and system for distinguishing transmitted content |
| WO2014032559A1 (en) * | 2012-08-28 | 2014-03-06 | 腾讯科技（深圳）有限公司 | Method and device for downloading file |
| CN103634361A (en) * | 2012-08-28 | 2014-03-12 | 腾讯科技（深圳）有限公司 | Method and apparatus for downloading file |
| US10484468B2 (en) | 2012-08-28 | 2019-11-19 | Tencent Technology (Shenzhen) Company Limited | Method and device for downloading file |
| CN103634361B (en) * | 2012-08-28 | 2018-07-20 | 腾讯科技（深圳）有限公司 | The method and apparatus for downloading file |
| CN103037017A (en) * | 2012-12-31 | 2013-04-10 | 乐视网信息技术（北京）股份有限公司 | Passive P2P data distribution method and node client-side |
| CN104144223A (en) * | 2014-08-21 | 2014-11-12 | 北京奇艺世纪科技有限公司 | Data obtaining method and device |
| CN104144223B (en) * | 2014-08-21 | 2018-02-09 | 北京奇艺世纪科技有限公司 | A kind of data capture method and device |
| CN106777171A (en) * | 2016-12-22 | 2017-05-31 | 北京小度互娱科技有限公司 | Method and apparatus for exporting burst media file |
| WO2019184096A1 (en) * | 2018-03-28 | 2019-10-03 | 网宿科技股份有限公司 | Method and system for downloading data resources |
| CN113643728A (en) * | 2021-08-12 | 2021-11-12 | 荣耀终端有限公司 | Audio recording method, electronic device, medium, and program product |
| CN113643728B (en) * | 2021-08-12 | 2023-08-22 | 荣耀终端有限公司 | Audio recording method, electronic equipment, medium and program product |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101150506B (en) | 2011-07-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101150506B (en) | Content acquisition method, device and content transmission system | |
| US8989205B2 (en) | Method and system operable to facilitate signal transport over a network | |
| CN102065112B (en) | Peer-to-peer (P2P) network system and method and related device for establishing the same | |
| US7526564B2 (en) | High quality streaming multimedia | |
| CN101483909B (en) | Reverse power control method based on multi-carrier | |
| CN106416269A (en) | Unicast adaptive bitrate streaming | |
| CN101800731B (en) | Network transmission management server, network transmission management method and network transmission system | |
| EP1788759A1 (en) | Wireless network device and resource allotting method for the same | |
| JP2007529073A (en) | Cache server network and content file delivery scheduling method | |
| CN101640699A (en) | P2P streaming media system and streaming media downloading method thereof | |
| CN101355522A (en) | Control method and system for media server | |
| US20060005224A1 (en) | Technique for cooperative distribution of video content | |
| US7296071B2 (en) | Service transmission in a packet data network | |
| CN102780710A (en) | Node scheduling method based on content distribution network | |
| CN109451517A (en) | A kind of caching placement optimization method based on mobile edge cache network | |
| Wang et al. | Proxy-based distribution of streaming video over unicast/multicast connections | |
| CN114071168A (en) | Mixed-flow direct-broadcast stream scheduling method and device | |
| Yu et al. | Reverse fast broadcasting (RFB) for video-on-demand applications | |
| WO2010033711A1 (en) | System and method for determining a cache arrangement | |
| Kwon | Proxy-assisted scalable periodic broadcasting of videos for heterogeneous clients | |
| CN102006217A (en) | Content delivery bandwidth control method | |
| CN101958929A (en) | 3Tnet-based multistage-agency video-on-demand system and method | |
| CN106455084A (en) | Resource scheduling method and device | |
| Balafoutis et al. | The impact of replacement granularity on video caching | |
| CN104105009A (en) | Digital multimedia broadcast control optimizing method |
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 |