CN103179145B - Based on the data transmission method of cloud computing, system and implicit content server - Google Patents
Based on the data transmission method of cloud computing, system and implicit content server Download PDFInfo
- Publication number
- CN103179145B CN103179145B CN201110427908.7A CN201110427908A CN103179145B CN 103179145 B CN103179145 B CN 103179145B CN 201110427908 A CN201110427908 A CN 201110427908A CN 103179145 B CN103179145 B CN 103179145B
- Authority
- CN
- China
- Prior art keywords
- file
- ordinary node
- content server
- data block
- implicit content
- 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.)
- Active
Links
Landscapes
- Information Transfer Between Computers (AREA)
Abstract
The invention discloses a kind of data transmission method based on cloud computing, system and implicit content server.Wherein, the method comprises the situation that implicit content server receives the owned file of each ordinary node of each ordinary node periodic report in network; The resources index of each data block of each file is calculated according to the situation of the owned file of each ordinary node; According to resources index, message bit pattern corresponding for K blocks of data before the most rare for each file is set to ordinary node visible, message bit pattern corresponding for remaining data block is set to ordinary node invisible, wherein, according to the current bandwidth behaviour in service of implicit content server be the file bandwidth occupation rate thresholding periodically dynamic conditioning K value of each file configuration; The message bit pattern of each file in implicit content server is issued to respectively each ordinary node in network, to make each ordinary node according to the message bit pattern issued to implicit content server requested data block.
Description
Technical field
The present invention relates to net application technology field, especially, relate to a kind of data transmission method based on cloud computing, system and implicit content server.
Background technology
Due to cloud computing peer-to-peer network and CDN (ContentDeliveryNetwork, content distributing network) in the limited bandwidth resources of server, therefore the speed of contents distribution is constrained, and do not have certain mechanism to be distinguished rare data and hot data at present, really rare content may be caused like this not supplemented in time, and hot content is more more than needed, cause the distribution serious unbalance of resource in system.
Summary of the invention
The technical problem that the present invention will solve is to provide a kind of data transmission method based on cloud computing, system and implicit content server, preferentially can ensure the download of most scarce resource.
According to an aspect of the present invention, propose a kind of data transmission method based on cloud computing, comprise implicit content server and receive the situation of each ordinary node in network by the owned file of each ordinary node of LIST SERVER periodic report; Each file F in network is calculated according to the situation of the owned file of each ordinary node
ieach data block D
ijresources index R
ij, resources index R
ijcharacterize each file F
ieach data block D
ijdegree of scarcity, wherein, i be greater than 0 integer, represent the sequence number of file, j be greater than 0 integer, represent the sequence number of data block in each file; To file F each in network
ieach data block D
ijresources index R
ijsort, by each file F
ithe most rare front K
iit is visible that the message bit pattern that blocks of data is corresponding is set to ordinary node, by each file F
iin message bit pattern corresponding to remaining data block to be set to ordinary node invisible, wherein, according to the current bandwidth behaviour in service of implicit content server be each file F
ithe file bandwidth occupation rate thresholding U of configuration
iperiodically dynamic conditioning K
ivalue; By each file F in implicit content server
imessage bit pattern be issued to each ordinary node in network respectively, to make each ordinary node according to the message bit pattern issued to implicit content server requested data block.
According to a further aspect in the invention, also proposed a kind of implicit content server, comprise receiving element, for receiving the situation of each ordinary node in network by the owned file of each ordinary node of LIST SERVER periodic report; Resources index computing unit, is connected with receiving element, for calculating each file F in network according to the situation of the owned file of each ordinary node
ieach data block D
ijresources index R
ij, resources index R
ijcharacterize each file F
ieach data block D
ijdegree of scarcity, wherein, i be greater than 0 integer, represent the sequence number of file, j be greater than 0 integer, represent the sequence number of data block in each file; Parameter adjustment unit, for according to the current bandwidth behaviour in service of implicit content server be each file F
ithe file bandwidth occupation rate thresholding U of configuration
iperiodically dynamic conditioning K
ivalue; Sequencing unit, is connected with parameter adjustment unit with resources index computing unit, for file F each in network
ieach data block D
ijresources index R
ijsort, by each file F
ithe most rare front K
iit is visible that the message bit pattern that blocks of data is corresponding is set to ordinary node, by each file F
iin message bit pattern corresponding to remaining data block to be set to ordinary node invisible; Message bit pattern issues unit, is connected with sequencing unit, for by each file F in implicit content server
imessage bit pattern be issued to each ordinary node in network respectively, to make each ordinary node according to the message bit pattern issued to implicit content server requested data block.
According to another aspect of the invention, also proposed a kind of data transmission system based on cloud computing, comprise multiple ordinary node, LIST SERVER and implicit content server, wherein, each ordinary node, for periodically himself gathering around documentary situation to LIST SERVER report, and the message bit pattern issued according to implicit content server is to implicit content server requested data block; LIST SERVER, is connected with implicit content server with each ordinary node, for the documentary situation of himself gathering around of each ordinary node report received is reported implicit content server.
Data transmission method based on cloud computing provided by the invention, system and implicit content server, by introducing implicit content server in systems in which, implicit content server has the data of all files content, but is only disclosed by partial data and provide data transport service.The file that implicit content server collects ordinary node by LIST SERVER has situation, and the degree of scarcity of each file data blocks in Calculation and analysis system, thus according to the message bit pattern that degree of scarcity adjustment sends to each ordinary node, make more rare data visible to ordinary node, and hot data is visible to ordinary node part, thus make rare data be able to prioritised transmission, improve the validity of rare data in system.The present invention can according in each file of implicit content server load state dynamic conditioning by the most rare blocks of files number preferentially downloaded, while guarantee implicit content server load overhead, the bandwidth resources making implicit content server limited can serve more file session, improve the data transmission performance of implicit content server to ordinary node.
Accompanying drawing explanation
Accompanying drawing described herein is used to provide a further understanding of the present invention, forms a application's part.In the accompanying drawings:
Fig. 1 is the schematic flow sheet of an embodiment of the data transmission method that the present invention is based on cloud computing.
Fig. 2 is the schematic flow sheet of another embodiment of the data transmission method that the present invention is based on cloud computing.
Fig. 3 is that the network that the present invention applies forms schematic diagram.
Fig. 4 is message bit pattern and the rare degree schematic diagram of data of implicit content server in the present invention.
Fig. 5 is the K value configuration schematic diagram of a data block in the present invention.
Fig. 6 is the treatment mechanism schematic diagram of message bit pattern of the present invention.
Fig. 7 is the structural representation of an embodiment of implicit content server of the present invention.
Fig. 8 is the structural representation of an embodiment of the data transmission system that the present invention is based on cloud computing.
Embodiment
With reference to the accompanying drawings the present invention is described more fully, exemplary embodiment of the present invention is wherein described.Exemplary embodiment of the present invention and explanation thereof for explaining the present invention, but do not form inappropriate limitation of the present invention.
Illustrative to the description only actually of at least one exemplary embodiment below, never as any restriction to the present invention and application or use.
Fig. 1 is the schematic flow sheet of an embodiment of the data transmission method that the present invention is based on cloud computing.
As shown in Figure 1, this embodiment can comprise the following steps:
S102, implicit content server receives the situation of each ordinary node in network by the owned file of each ordinary node of LIST SERVER periodic report, and wherein, this network can be cloud computing peer-to-peer network or CDN;
S104, calculates each file F in network according to the situation of the owned file of each ordinary node
ieach data block D
ijresources index R
ij, resources index R
ijcharacterize each file F
ieach data block D
ijdegree of scarcity, wherein, i be greater than 0 integer, represent the sequence number of file, j be greater than 0 integer, represent the sequence number of data block in each file;
Particularly, each file F in network
ieach data block D
ijresources index R
ijcan by having this each data block D
ijordinary node number and have this each file F
ithe ordinary node number of part or all of data block is determined;
S106, to file F each in network
ieach data block D
ijresources index R
ijsort, by each file F
ithe most rare front K
iit is visible that the message bit pattern that blocks of data is corresponding is set to ordinary node, by each file F
iin message bit pattern corresponding to remaining data block to be set to ordinary node invisible, wherein, according to the current bandwidth behaviour in service of implicit content server be each file F
ithe file bandwidth occupation rate thresholding U of configuration
iperiodically dynamic conditioning K
ivalue;
S108, by each file F in implicit content server
imessage bit pattern be issued to each ordinary node in network respectively, to make each ordinary node according to the message bit pattern issued to implicit content server requested data block.
This embodiment introduces implicit content server, and implicit content server adjusts the observability of data content for each ordinary node adaptively according to the degree of scarcity of content-data in system, rare data validity in raising system.
Wherein, in step s 106, according to the current bandwidth behaviour in service of implicit content server be each file F
ithe file bandwidth occupation rate thresholding U of configuration
iperiodically dynamic conditioning K
ithe step of value can comprise:
The current bandwidth occupation rate of implicit content server is calculated every setting-up time T;
The current bandwidth occupation rate of implicit content server and the server bandwidth occupation rate upper limit are compared;
If be greater than the server bandwidth occupation rate upper limit, then judge each file F
icurrent bandwidth occupation rate whether exceed file bandwidth occupation rate thresholding U for it configures
iif have at least a file to exceed file bandwidth occupation rate thresholding for it configures, then the current bandwidth occupation rate exceeding the highest file of ratio is reduced most its file bandwidth occupation rate thresholding configured, if the utilized bandwidth of All Files does not all exceed the file bandwidth occupation rate thresholding for it configures, then to each file F
ik
ivalue sorts, and reduces K successively according to order from high to low
ivalue, until the current bandwidth occupation rate of implicit content server is not higher than the server bandwidth occupation rate upper limit.Like this can according in each file of load state dynamic conditioning of implicit content server by the most rare blocks of files number preferentially downloaded, while Deterministic service device load overhead, the bandwidth resources making implicit content server limited can serve more file session, improve the data transmission performance of implicit content server to common peer node.
In some cases, ordinary node is at K
ithe end of phase on weekly duty adds network, and according to the message bit pattern requested data block that this cycle concealed content server issues, but when this request reaches implicit content server, due to a new K
iphase on weekly duty starts, cause the message bit pattern in adjacent two cycles different, may occur that the data block of ordinary node in the end request of last cycle is sightless in this cycle, this situation exists in a network in a large number, in order to solve this problem, each ordinary node in network is after the message bit pattern receiving implicit content server transmission, the message bit pattern that the message bit pattern received and each ordinary node store is compared respectively, according to comparative result to implicit content server requested data block, then the message bit pattern that this receives is stored in each ordinary node, the comparison of adjacent twice information is carried out when receiving new message bit pattern again in order to next time.
Further, implicit content server is when receiving data block request, according to the message bit pattern that implicit content server issues, if the data block of asking is in visible state to each ordinary node, then the transmission of data blocks of this request is directly given the ordinary node of the request of initiation by implicit content server, if the data block of asking is in invisible mode to each ordinary node, then implicit content server transmits this data block by probability P to the ordinary node of initiating request, wherein, the resources index of probability P and institute's requested data block is inversely proportional to.The ratio of implicit content server to each ordinary node transmission data can be controlled like this, thus improve the data transmission performance of each ordinary node with rational server load expense.
Fig. 2 is the schematic flow sheet of another embodiment of the data transmission method that the present invention is based on cloud computing.
As shown in Figure 2, this embodiment can comprise the following steps:
S202, ordinary node adds network, periodically reports its content had to LIST SERVER, and wherein, LIST SERVER provides content indexing and locating function;
S204, LIST SERVER is periodically to the content that each ordinary node in implicit content server reporting ent has, and implicit content server provides storage and the distribution of content-data, does not possess locating function;
S206, implicit content server is gathered around documentary situation according to each ordinary node obtained from LIST SERVER and is calculated each file F
ieach data block D
ijresources index R
ij, wherein, resources index R
ijbe the one tolerance of degree of scarcity, data block is more rare, and resources index is lower, particularly, and data block D
ijresources index R
ijvalue can be obtained by the ordinary node number that has this data block in the file mode divided by the ordinary node number having the part or all of data of this file;
S208, in implicit content server, respectively to each file F
ieach data block D
ijresources index carry out from low to high sequence, although implicit content server has the data of all files content, but in order to make the most rare data block preferentially be downloaded, by K before the most rare when implicit content server sends implicit expression message bit pattern to ordinary node
ithe corresponding bit map location of blocks of data block is set to 1, these data blocks are made to be that each ordinary node is visible, show that implicit content server can provide the download service of these data blocks, and bit map location corresponding to other data blocks in this file is set to 0, make these data blocks not for each ordinary node is visible, show that implicit content server can not provide the download service of these data blocks;
Wherein, K
ivalue is not changeless, but dynamically update, it and can be each file F according to the current bandwidth behaviour in service of implicit content server
ithe file bandwidth occupation rate thresholding U of configuration
iperiodically dynamically update, suppose: the bandwidth occupancy rate upper limit of implicit content server is 80%, the file bandwidth occupation rate thresholding configured for each file is 15%, can be adjusted particularly by following manner:
(1) if the current bandwidth occupation rate of the implicit content server calculated is 85%, be greater than 80% of the upper limit, then calculate the current bandwidth occupation rate of each file, suppose that the current bandwidth occupation rate of first file and second file is respectively 25% and 20%, be greater than the file bandwidth occupation rate thresholding 15% for it distributes, then the current bandwidth occupation rate of first file is reduced to 15%, after one-period T, continue the current bandwidth occupation rate calculating implicit content server, if lower than the bandwidth occupancy rate upper limit of implicit content server, then keep current K
ivalue, otherwise, continue the current bandwidth occupation rate calculating each file, still adjust the bandwidth occupancy ratio exceeded for the highest file of its file bandwidth occupation rate of distributing and (K of this file such as, can be reduced
ivalue, wherein, this K
ivalue can be the average K of history in setting-up time section
ivalue), until meet the bandwidth occupancy rate upper limit requirement of implicit content server,
(2) if the current bandwidth occupation rate of the implicit content server calculated is 85%, be greater than 80% of the upper limit, then calculate the current bandwidth occupation rate of each file, suppose that the current bandwidth occupation rate of first file and second file is respectively 25% and 20%, be greater than the file bandwidth occupation rate thresholding 15% for it distributes, then (K of these two files such as, can be reduced in same ratio or according to the bandwidth occupancy rate that setting ratio reduces by first file and second file respectively
ivalue, wherein, this K
ivalue can be the average K of history in setting-up time section
ivalue), until meet the bandwidth occupancy rate upper limit requirement of implicit content server;
(3) if the current bandwidth occupation rate of the implicit content server calculated is 85%, be greater than 80% of the upper limit, then calculate the current bandwidth occupation rate of each file, find the file bandwidth occupation rate thresholding all do not exceeded for it distributes, then to the K of each file
ivalue sorts, and reduces K successively according to order from high to low
ivalue (such as, first reduces K
ibe worth the K value of the highest file), until the current bandwidth occupation rate of implicit content server is not higher than the server bandwidth occupation rate upper limit, wherein, this K
ivalue can be the average K of history in setting-up time section
ivalue;
(4) if the current bandwidth occupation rate of the implicit content server calculated is greater than the upper limit of setting, then calculate the current bandwidth occupation rate of each file, find the file bandwidth occupation rate thresholding all do not exceeded for it distributes, then to the K of each file
ivalue all reduces according to same ratio, until the current bandwidth occupation rate of implicit content server is not higher than the server bandwidth occupation rate upper limit, wherein, and this K
ivalue can be the average K of history in setting-up time section
ivalue;
(5) if the current bandwidth occupation rate of the implicit content server calculated is less than the server bandwidth occupation rate lower limit (such as, 20%) of setting, then to the K of each file
ibe worth according to the sequence of ascending order, increase K
ibe worth the K value of minimum file, until the current bandwidth occupation rate of implicit content server is higher than server bandwidth occupation rate lower limit, wherein, this K
ivalue can be the average K of history in setting-up time section
ivalue;
(6) if the current bandwidth occupation rate of the implicit content server calculated is less than the server bandwidth occupation rate lower limit (such as, 20%) of setting, then to the K of each file
ibe worth according to the sequence of ascending order, increase the K of each file by same ratio
ivalue, until the current bandwidth occupation rate of implicit content server is higher than server bandwidth occupation rate lower limit, wherein, this K
ivalue can be the average K of history in setting-up time section
ivalue;
The K of each file of above-mentioned dynamic conditioning
ithe mode of value can serve multiple file session efficiently, and changeless K
ivalue does not consider running situation, and over-burden very likely to cause server;
S210, implicit content server periodically calculates the resources index of each data block, after each cycle, the message bit pattern that it sends may change, now the new message bit pattern received from implicit content server and the local last time message bit pattern of storing are carried out step-by-step or operation by ordinary node, this message bit pattern message bit pattern of the implicit content server causing ordinary node to have and implicit content server itself had is inconsistent, there will be the situation that ordinary node is shown as sightless data block on implicit content server request implicit expression bitmap, in order to solve this problem, following data transmission mechanism can be adopted to ensure the prioritised transmission of rare data block, rare data are visible to ordinary node, hot data is visible to ordinary node part, when a certain data block of ordinary node request, the data transmission mechanism of implicit servers is as follows:
(1) if the implicit expression message bit pattern display implicit content server in implicit content server has this data block (that is, this data block is visible to ordinary node), then this data block is transmitted to ordinary node;
(2) if (namely the implicit expression message bit pattern display in implicit content server does not have this data block, this data block is invisible to ordinary node), in the message bit pattern that namely this situation to issue in implicit content server last time, this data block is visible, and this data block is invisible in this message bit pattern issued, then transmit this data block with probability P to ordinary node, wherein, the value of probability P is relevant to the resources index of this data block, such as, the value of P can for this data block the minimum value of the resources index of all data blocks hereof divided by the resources index of this data block, thus resources index is less, the value of P is larger, namely, this resource is more rare, it is larger that it downloads probability.This data transmission mechanism can ensure the transmission of rare data effectively, can transmit not too rare data with less probability simultaneously.
Next, the embodiment in Fig. 2 is described in detail:
(1) as shown in Figure 3, introduce implicit content server in a network, form the system be made up of general content server, ordinary node, LIST SERVER and implicit content server, wherein, implicit content server has the data of all files content, but only partial data is set to visible state, to provide data transport service;
(2) ordinary node periodically reports its file situation had to LIST SERVER, that is, the data block information of each file that has of ordinary node, as shown in Figure 4, in bitmap, the corresponding state of each data block: if 1, then show that this data block is visible to ordinary node; If 0, then represent that this data block is invisible to ordinary node;
(3) implicit content server gathers around according to the ordinary node that LIST SERVER provides the resources index that documentary situation calculates each data block, the circular of resources index is as follows: for file i, can by the resources index of the data block j of following formula calculation document i: h
ij=s
ij/ n
i, wherein, s
ijfor having the ordinary node number of the data block j of file i, n
ifor having the ordinary node number of the part or all of data block of file i;
(4) implicit content server carries out from low to high according to the resources index of each data block calculated to resources index ascending sort, when sending message bit pattern to ordinary node, only by K before the most rare for file i
ithe corresponding bit map location of blocks of data block is set to 1, as shown in Figure 4;
(5) implicit content server writes sorted data in a table, two items are had: data block numbering and resources index in table, and arrange from low to high according to resources index, as shown in Figure 4, the data block resource index that can be numbered 0 is as seen from the figure 0.01, the most rare, the data block degree of scarcity being numbered 2,1,9,4,11 takes second place successively, in fact implicit content server has all data block information of file i, but when sending implicit expression message bit pattern to ordinary node, only choose wherein the most rare K
iindividual data block, in write implicit expression bitmap, tells ordinary node its only " having " this K
iindividual data block, K selected in Fig. 4
ivalue is 6, chooses 6 the most rare data blocks, that is, data block 0,2,1,9,4,11, and in the bitmap that file i is corresponding, data block 0,2,1,9,4,11 correspondence position is set to 1 from table, represents and has these data blocks;
(6) as shown in Figure 5, K
ivalue is not changeless, but dynamically upgrades, K
ithe update scheme of value can be that the current bandwidth that T takies situation and each file according to the current bandwidth of implicit content server at set intervals takies situation dynamic conditioning K
ivalue, and in the T time adjusted K
ivalue remains unchanged, and in addition, can also configure K by manual type
ivalue, thus multiple file session can be served efficiently, and changeless K
ivalue does not consider running situation, and over-burden very likely to cause server;
(7) after ordinary node receives the message bit pattern of implicit content server, the message bit pattern received and the message bit pattern of the local implicit content server stored can be carried out step-by-step or operation, as shown in Figure 6, such operation can cause a kind of appearance of situation, namely, the implicit expression bitmap that ordinary node has just issued to implicit content server request implicit content server shows the data block do not had, and in order to solve this problem, implicit content server can adopt following data transmission mechanism:
If show in the data block implicit content server bitmap of ordinary node request, then response transmission; If no, then with certain probability P response transmission, the value of probability P is relevant to the resources index of data block j:
wherein, i represents file sequence number, and l is data block sequence number, gets the integer being greater than 0, min (h
il) represent the minimum value of the resources index of all data blocks in the file i of data block j place, h
jfor the resources index of data block j, the resources index of data block is higher, and probability P is lower, and this data transmission mechanism can ensure the transmission of rare data effectively, can transmit not too rare data with less probability simultaneously.
One of ordinary skill in the art will appreciate that, realize the whole of said method embodiment to have been come by the hardware that program command is relevant with part steps, aforesaid program can be stored in a computing equipment read/write memory medium, this program is when performing, perform and comprise the step of said method embodiment, and aforesaid storage medium can comprise ROM, RAM, magnetic disc and CD etc. various can be program code stored medium.
Fig. 7 is the structural representation of an embodiment of implicit content server of the present invention.
As shown in Figure 7, the implicit content server 700 of this embodiment can comprise:
Receiving element 702, for receiving the situation of each ordinary node in network by the owned file of each ordinary node of LIST SERVER periodic report;
Resources index computing unit 704, is connected with receiving element, for calculating each file F in network according to the situation of the owned file of each ordinary node
ieach data block D
ijresources index R
ij, resources index R
ijcharacterize each file F
ieach data block D
ijdegree of scarcity, wherein, each file F in network
ieach data block D
ijresources index R
ijby having this each data block D
ijordinary node number and have this each file F
ithe ordinary node number of part or all of data block is determined, i be greater than 0 integer, represent the sequence number of file, j be greater than 0 integer, represent the sequence number of data block in each file;
Parameter adjustment unit 706, for according to the current bandwidth behaviour in service of implicit content server be each file F
ithe file bandwidth occupation rate thresholding U of configuration
iperiodically dynamic conditioning K
ivalue;
Sequencing unit 708, is connected with parameter adjustment unit with resources index computing unit, for file F each in network
ieach data block D
ijresources index R
ijsort, by each file F
ithe most rare front K
iit is visible that the message bit pattern that blocks of data is corresponding is set to ordinary node, by each file F
iin message bit pattern corresponding to remaining data block to be set to ordinary node invisible;
Message bit pattern issues unit 710, is connected with sequencing unit, for by each file F in implicit content server
imessage bit pattern be issued to each ordinary node in network respectively, to make each ordinary node according to the message bit pattern issued to implicit content server requested data block.
The implicit content server of this embodiment can according to the degree of scarcity of data block in the system periodically dynamic conditioning message bit pattern that send to ordinary node, make rare data visible to ordinary node, and hot data is visible to ordinary node part, make rare data be able to prioritised transmission, thus improve the validity of rare data in system.
Particularly, parameter adjustment unit can be realized by following subelement:
Bandwidth occupancy rate computation subunit, for calculating the current bandwidth occupation rate of implicit content server every setting-up time T;
Occupation rate compares subelement, is connected with bandwidth occupancy rate computation subunit, for the current bandwidth occupation rate of implicit content server and the server bandwidth occupation rate upper limit being compared;
Adjustment subelement, compares subelement with occupation rate and is connected, if for being greater than the server bandwidth occupation rate upper limit, then judge each file F
icurrent bandwidth occupation rate whether exceed file bandwidth occupation rate thresholding U for it configures
iif have at least a file to exceed file bandwidth occupation rate thresholding for it configures, then the current bandwidth occupation rate exceeding the highest file of ratio is reduced most its file bandwidth occupation rate thresholding configured, if the utilized bandwidth of All Files does not all exceed the file bandwidth occupation rate thresholding for it configures, then to each file F
ik
ivalue sorts, and reduces K successively according to order from high to low
ivalue, until the current bandwidth occupation rate of implicit content server is not higher than the server bandwidth occupation rate upper limit.
Fig. 8 is the structural representation of an embodiment of the data transmission system that the present invention is based on cloud computing.
As shown in Figure 8, the system 800 of this embodiment can comprise multiple ordinary node 802, LIST SERVER 804 and implicit content server 806, wherein,
Each ordinary node, for periodically himself gathering around documentary situation to LIST SERVER report, and the message bit pattern issued according to implicit content server is to implicit content server requested data block;
LIST SERVER, is connected with implicit content server with each ordinary node, for the documentary situation of himself gathering around of each ordinary node report received is reported implicit content server.
Wherein, each ordinary node can also be used for the message bit pattern received and the message bit pattern that himself stores to compare, and according to comparative result to implicit content server requested data block, and is stored in each ordinary node by the message bit pattern received.
Implicit content server is also for according to the message bit pattern that issues, directly the transmission of data blocks of this request is given the ordinary node of the request of initiation when asked data block is in visible state to each ordinary node, this data block is transmitted by probability P to the ordinary node of initiating request when asked data block is in invisible mode to each ordinary node, wherein, the resources index of probability P and institute's requested data block is inversely proportional to.
In this specification, each embodiment all adopts the mode of going forward one by one to describe, and what each embodiment stressed is the difference with other embodiments, and part identical with similar between each embodiment can cross-reference.For device embodiment, due to itself and embodiment of the method basic simlarity, so description is fairly simple, relevant part can see the explanation of embodiment of the method part.
The above embodiment of the present invention possesses following beneficial effect:
(1) make implicit content server preferentially provide the download of rare data block, improve the validity of rare data, improve the data transmission performance of ordinary node;
(2) under same server bandwidth condition, because implicit content server has file all data blocks, but to ordinary node only open and providing unit divided data block, the resource consumed on each file tails off, so can serve more file session;
(3) in cloud computing peer-to-peer network and CDN, server can according to the data block number of loading condition dynamic conditioning to the visible each file of ordinary node, and the server of such utilized bandwidth poor-performing also can provide reasonable service.
Although be described in detail specific embodiments more of the present invention by example, it should be appreciated by those skilled in the art, above example is only to be described, instead of in order to limit the scope of the invention.It should be appreciated by those skilled in the art, can without departing from the scope and spirit of the present invention, above embodiment be modified.Scope of the present invention is limited by claims.
Claims (13)
1. based on a data transmission method for cloud computing, it is characterized in that, comprising:
Implicit content server receives the situation of each ordinary node in network by the owned file of each ordinary node of LIST SERVER periodic report;
Each file F in network is calculated according to the situation of the owned file of each ordinary node
ieach data block D
ijresources index R
ij, described resources index R
ijcharacterize each file F
ieach data block D
ijdegree of scarcity, wherein, i be greater than 0 integer, represent the sequence number of file, j be greater than 0 integer, represent the sequence number of data block in each file;
To file F each in network
ieach data block D
ijresources index R
ijsort, by each file F
ithe most rare front K
iit is visible that the message bit pattern that blocks of data is corresponding is set to ordinary node, by each file F
iin message bit pattern corresponding to remaining data block to be set to ordinary node invisible, wherein, according to the current bandwidth behaviour in service of described implicit content server be each file F
ithe file bandwidth occupation rate thresholding U of configuration
iperiodically dynamic conditioning K
ivalue;
By each file F in implicit content server
imessage bit pattern be issued to each ordinary node in network respectively, to make each ordinary node according to the message bit pattern issued to described implicit content server requested data block.
2. the data transmission method based on cloud computing according to claim 1, is characterized in that, each file F in described network
ieach data block D
ijresources index R
ijby s
ijand n
iratio determine, wherein, s
ijfor having this each data block D
ijordinary node number, n
ifor having file F
ithe ordinary node number sum of part or all of data block.
3. the data transmission method based on cloud computing according to claim 1, is characterized in that, according to the current bandwidth behaviour in service of described implicit content server be each file F
ithe file bandwidth occupation rate thresholding U of configuration
iperiodically dynamic conditioning K
ithe step of value comprises:
The current bandwidth occupation rate of described implicit content server is calculated every setting-up time T;
The current bandwidth occupation rate of described implicit content server and the server bandwidth occupation rate upper limit are compared;
If be greater than the described server bandwidth occupation rate upper limit, then judge each file F
icurrent bandwidth occupation rate whether exceed file bandwidth occupation rate thresholding U for it configures
iif have at least a file to exceed file bandwidth occupation rate thresholding for it configures, then the current bandwidth occupation rate exceeding the highest file of ratio is reduced most its file bandwidth occupation rate thresholding configured, if the utilized bandwidth of All Files does not all exceed the file bandwidth occupation rate thresholding for it configures, then to each file F
ik
ivalue sorts, and reduces K successively according to order from high to low
ivalue, until the current bandwidth occupation rate of described implicit content server is not higher than the described server bandwidth occupation rate upper limit.
4. the data transmission method based on cloud computing according to claim 1, is characterized in that, described each ordinary node comprises according to the step of the message bit pattern issued to described implicit content server requested data block:
Each ordinary node in network is after the message bit pattern receiving the transmission of described implicit content server, the message bit pattern that the message bit pattern received and each ordinary node store is compared respectively, according to comparative result to described implicit content server requested data block;
The message bit pattern received is stored in each ordinary node.
5. the data transmission method based on cloud computing according to claim 1 or 4, is characterized in that, described method also comprises:
According to the message bit pattern that described implicit content server issues, if the data block of asking is in visible state to each ordinary node, then the transmission of data blocks of this request is directly given the ordinary node of the request of initiation by described implicit content server;
According to the message bit pattern that described implicit content server issues, if the data block of asking is in invisible mode to each ordinary node, then described implicit content server transmits this data block by probability P to the ordinary node of initiating request.
6. the data transmission method based on cloud computing according to claim 5, is characterized in that, the resources index of described probability P and institute's requested data block is inversely proportional to.
7. an implicit content server, is characterized in that, comprising:
Receiving element, for receiving the situation of each ordinary node in network by the owned file of each ordinary node of LIST SERVER periodic report;
Resources index computing unit, is connected with described receiving element, for calculating each file F in network according to the situation of the owned file of each ordinary node
ieach data block D
ijresources index R
ij, described resources index R
ijcharacterize each file F
ieach data block D
ijdegree of scarcity, wherein, i be greater than 0 integer, represent the sequence number of file, j be greater than 0 integer, represent the sequence number of data block in each file;
Parameter adjustment unit, for according to the current bandwidth behaviour in service of described implicit content server be each file F
ithe file bandwidth occupation rate thresholding U of configuration
iperiodically dynamic conditioning K
ivalue;
Sequencing unit, is connected with described parameter adjustment unit with described resources index computing unit, for file F each in network
ieach data block D
ijresources index R
ijsort, by each file F
ithe most rare front K
iit is visible that the message bit pattern that blocks of data is corresponding is set to ordinary node, by each file F
iin message bit pattern corresponding to remaining data block to be set to ordinary node invisible;
Message bit pattern issues unit, is connected with described sequencing unit, for by each file F in implicit content server
imessage bit pattern be issued to each ordinary node in network respectively, to make each ordinary node according to the message bit pattern issued to described implicit content server requested data block.
8. implicit content server according to claim 7, is characterized in that, each file F in described network
ieach data block D
ijresources index R
ijby s
ijand n
iratio determine, wherein, s
ijfor having this each data block D
ijordinary node number, n
ifor having the ordinary node number sum of the part or all of data block of file Fi.
9. implicit content server according to claim 7, is characterized in that, described parameter adjustment unit comprises:
Bandwidth occupancy rate computation subunit, for calculating the current bandwidth occupation rate of described implicit content server every setting-up time T;
Occupation rate compares subelement, is connected with described bandwidth occupancy rate computation subunit, for the current bandwidth occupation rate of described implicit content server and the server bandwidth occupation rate upper limit being compared;
Adjustment subelement, compares subelement with described occupation rate and is connected, if for being greater than the described server bandwidth occupation rate upper limit, then judge each file F
icurrent bandwidth occupation rate whether exceed file bandwidth occupation rate thresholding U for it configures
iif have at least a file to exceed file bandwidth occupation rate thresholding for it configures, then the current bandwidth occupation rate exceeding the highest file of ratio is reduced most its file bandwidth occupation rate thresholding configured, if the utilized bandwidth of All Files does not all exceed the file bandwidth occupation rate thresholding for it configures, then to each file F
ik
ivalue sorts, and reduces K successively according to order from high to low
ivalue, until the current bandwidth occupation rate of described implicit content server is not higher than the described server bandwidth occupation rate upper limit.
10. based on a data transmission system for cloud computing, it is characterized in that, comprise the implicit content server according to any one of multiple ordinary node, LIST SERVER and claim 7-9, wherein,
Each ordinary node, for periodically himself gathering around documentary situation to the report of described LIST SERVER, and the message bit pattern issued according to described implicit content server is to described implicit content server requested data block;
Described LIST SERVER, is connected with described implicit content server with described each ordinary node, for the documentary situation of himself gathering around of each ordinary node report received is reported described implicit content server.
11. data transmission systems based on cloud computing according to claim 10, it is characterized in that, described each ordinary node is also for comparing the message bit pattern received and the message bit pattern that himself stores, according to comparative result to described implicit content server requested data block, and the message bit pattern received is stored in each ordinary node.
12. data transmission systems based on cloud computing according to claim 10 or 11, it is characterized in that, described implicit content server is also for according to the message bit pattern that issues, directly the transmission of data blocks of this request is given the ordinary node of the request of initiation when asked data block is in visible state to each ordinary node, transmit this data block by probability P to the ordinary node of initiating request when asked data block is in invisible mode to each ordinary node.
13. data transmission systems based on cloud computing according to claim 12, is characterized in that, the resources index of described probability P and institute's requested data block is inversely proportional to.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110427908.7A CN103179145B (en) | 2011-12-20 | 2011-12-20 | Based on the data transmission method of cloud computing, system and implicit content server |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110427908.7A CN103179145B (en) | 2011-12-20 | 2011-12-20 | Based on the data transmission method of cloud computing, system and implicit content server |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103179145A CN103179145A (en) | 2013-06-26 |
| CN103179145B true CN103179145B (en) | 2016-04-06 |
Family
ID=48638768
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110427908.7A Active CN103179145B (en) | 2011-12-20 | 2011-12-20 | Based on the data transmission method of cloud computing, system and implicit content server |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103179145B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105721889A (en) * | 2015-05-15 | 2016-06-29 | 乐视云计算有限公司 | P2P data download method and device |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2001052497A2 (en) * | 1999-12-20 | 2001-07-19 | Fastforward Networks, Inc. | A content distribution system for operation over an internetwork including content peering arrangements |
| CN101841556A (en) * | 2010-02-23 | 2010-09-22 | 中国科学院计算技术研究所 | Method and system for placing resources replication in CDN-P2P (Content Distribution Network-Peer-to-Peer) network |
| CN101997890A (en) * | 2009-08-28 | 2011-03-30 | 中国移动通信集团公司 | P2P stream media downloading method, system and device |
-
2011
- 2011-12-20 CN CN201110427908.7A patent/CN103179145B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2001052497A2 (en) * | 1999-12-20 | 2001-07-19 | Fastforward Networks, Inc. | A content distribution system for operation over an internetwork including content peering arrangements |
| CN101997890A (en) * | 2009-08-28 | 2011-03-30 | 中国移动通信集团公司 | P2P stream media downloading method, system and device |
| CN101841556A (en) * | 2010-02-23 | 2010-09-22 | 中国科学院计算技术研究所 | Method and system for placing resources replication in CDN-P2P (Content Distribution Network-Peer-to-Peer) network |
Non-Patent Citations (3)
| Title |
|---|
| 一种可控P2P文件下载算法;庞涛;黄海;龙斌;武娟;《电信科学》;20100915;全文 * |
| 一种可控对等网络流媒体直播系统;武娟，龙斌，庞涛，黄海;《电信科学》;20100115;全文 * |
| 基于P2P的流媒体直播技术研究与展望;彭凯;武娟;杨宗凯;唐宏;《计算机科学》;20090115;第36卷(第1期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103179145A (en) | 2013-06-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101729412B (en) | Distributed level cluster method and system of geographic information service | |
| CN103873507A (en) | Data block uploading and storing system and method | |
| CN103188279B (en) | By the method and apparatus that peer-to-peer network downloads file from multiple neighbor nodes | |
| CN101309460B (en) | Method and apparatus for resource distribution between multiple users | |
| CN103763343A (en) | Method and device for processing service access | |
| CN104243405A (en) | Request processing method, device and system | |
| CN103986766A (en) | Self-adaptation load balancing job task scheduling method and device | |
| CN101841480A (en) | Multilink message sending method, equipment and system | |
| CN102209262B (en) | Method, device and system for scheduling contents | |
| CN102056306A (en) | Method and device for allocating uplink shared channel resources and communication system | |
| CN108924203B (en) | Data copy self-adaptive distribution method, distributed computing system and related equipment | |
| CN108055701A (en) | A kind of resource regulating method and base station | |
| CN101729582B (en) | Management method of distributed storage, device and system thereof | |
| CN104283963A (en) | Distributed and collaborative type CDN load balancing method | |
| CN103179145B (en) | Based on the data transmission method of cloud computing, system and implicit content server | |
| CN105827455A (en) | Method and apparatus for modifying resource model | |
| CN106713512B (en) | Efficient data transmission method and system for dynamically balancing network bandwidth of Internet of things | |
| CN106856459A (en) | A kind of method for dispatching message and device | |
| CN105404554A (en) | Method and apparatus for Storm flow computing framework | |
| CN101958934B (en) | Electronic program guide incremental content synchronization method, device and system | |
| CN103685369B (en) | For the method for multifile distribution, multifile cache control server and system | |
| CN102388585A (en) | Network optimization flow control method, device and system | |
| CN105357317A (en) | Data uploading method and system based on multi-client polling queuing | |
| CN103905341A (en) | Resource scheduling method, resource scheduling device and resource scheduling system | |
| CN103546516A (en) | Method and device for generating network maps and cost maps of aggregation layer |
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 |