CN103986760B - The efficient link transmission method of growth form data source formula based on multi-parameter arbitration - Google Patents
The efficient link transmission method of growth form data source formula based on multi-parameter arbitration Download PDFInfo
- Publication number
- CN103986760B CN103986760B CN201410203215.3A CN201410203215A CN103986760B CN 103986760 B CN103986760 B CN 103986760B CN 201410203215 A CN201410203215 A CN 201410203215A CN 103986760 B CN103986760 B CN 103986760B
- Authority
- CN
- China
- Prior art keywords
- data
- server
- transmission
- data source
- source
- 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
- 230000005540 biological transmission Effects 0.000 title claims abstract description 130
- 238000000034 method Methods 0.000 title claims abstract description 19
- 230000015572 biosynthetic process Effects 0.000 claims description 3
- 238000009395 breeding Methods 0.000 description 1
- 230000001488 breeding effect Effects 0.000 description 1
- 238000007796 conventional method Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000007115 recruitment Effects 0.000 description 1
Landscapes
- Computer And Data Communications (AREA)
Abstract
The invention discloses a kind of efficient link transmission method of growth form data source formula based on multi-parameter arbitration, including step：S1：Build a transmission network；S2：The server transmission data into each server group forms a data source to source host respectively；The data source being formed simultaneously server transmission data in one non-data source into the server group at place forms new data source；S3：The server transmission data in each data source non-data source into the server group at place respectively forms next new data source；The server transmission data in source host to a non-data source forms another new data source simultaneously；S4:Step S3 is repeated, until Servers-all all becomes data source.As a result of a kind of efficient link transmission method of growth form data source formula based on multi-parameter arbitration of the present invention, there are multiple data sources to form net structure concurrent transmission, the advantages of greatly improving the efficiency of transmission of data.
Description
Technical field
The present invention relates to a kind of link transmission method more particularly to a kind of growth form data source formulas based on multi-parameter arbitration
Efficient link transmission method.
Background technology
In today of Internet technology rapid development, the internet informations such as common shopping, information, recruitment, enterprise official website,
Its behind is all that multiple servers are supporting work, and these servers are often distributed in the special custodian of different cities needs
Member is managed, and different area network environments is different, and traditional data transmission is not molded fixed high efficiency of transmission algorithm, manages
Reason person is often from a data source to Servers-all sequential delivery, deployment information, once some server node goes wrong
The data transmission of other servers will be influenced, this not only increases the workload of administrative staff but also company can be caused undesirable
It influences.Therefore how efficient transfer data is a current very important topic.Traditional data transmission is all single
Host carrying out data transmission to each server one by one；Data Transmission Content to individual server is also random, without excellent
First grade concept.Traditional data dispositions method mainly has following deficiency:
1st, the prior art does not account for the interference of many kinds of parameters in link transmission, without privilege level concept, if some
Certain section of link transmission rate is very low, can directly affect the data transmission of next server.
2nd, the method that the prior art often uses single data source, data transmission can not be concurrent, causes efficiency of transmission low.
The content of the invention
The defects of it is an object of the invention to overcome the prior art, and a kind of growth form number based on multi-parameter arbitration is provided
According to the efficient link transmission method of source formula, deployment different data can be efficiently transmitted in multigroup server and be passed to other servers
The advantages of sending data, there are multiple data sources to form net structure concurrent transmission, greatly improve the efficiency of transmission of data.
Technical problem solved by the invention is realized using following technical scheme：
A kind of efficient link transmission method of growth form data source formula based on multi-parameter arbitration of the present invention, including step：
S1：A transmission network is built, the transmission network includes a source host and communicated to connect respectively at the source host
A plurality of servers, the server according to transmission data type be divided into a plurality of server groups；
S2：The server transmission data into each server group forms a data source to the source host respectively；
The data source being formed simultaneously server transmission data in one non-data source into the server group at place forms new data
Source；
S3：The server transmission data shape in each data source non-data source into the server group at place respectively
Into next new data source；The server transmission data in the source host to a non-data source forms another new data simultaneously
Source；
S4：Step S3 is repeated, until Servers-all all becomes data source.
Further improvement of the present invention is that the server into each server group passes the source host respectively
Transmission of data forms a data source step and further comprises step：
A, Servers-all is added in one and calculates queue；
B, the time of the source host each server transmission data into the calculating queue is calculated, and to current
It transmits the shortest server priority transmission data of data time and forms a data source；By the server group where the data source
Interior server is removed from the calculating queue；
C, step b is repeated, until an at least data source in each server group.
Further improvement of the present invention is that the source host calculates each server transport number in queue to described
According to time pass through a transmission time formula calculate obtain；The transmission time formula is：
Wherein DataNiTransmission size of data needed for current operation instruction is carried out for current server；Ki services for current group
The average transmission rate of device；piFor the weighted value corresponding to operational order, andN is operational order sum；T is
Source host transmits the required time of data to current server.
Further improvement of the present invention is, the data source of the formation one non-data into the server group at place
The server transmission data in source forms new data source step and further comprises step：
The clothes in data source each non-data source into the server group at place are calculated by the transmission time formula
The time for device transmission data of being engaged in；
Server priority transmission data shortest to current transmission data time form new data source.
Further improvement of the present invention is that in the step S3, the source host passes through the transmission time formula
Server transmission data to a shortest non-data source of transmission data time forms another new data source.
As a result of above technical scheme, make it have following advantageous effect is the present invention：
It is provided the foundation by building a transmission network for data transmission；Source host respectively into each server group one
Server transmission data forms a data source, the service in the data source being formed simultaneously one non-data source into the server group at place
Device transmission data form new data source, realize and lay data source in multiple server groups.Each data source is respectively to institute
Server group in the server transmission data in a non-data source form next new data source, while the source host to
The server transmission data in one non-data source forms another new data source, realizes the breeding of data source in each server group,
And the concurrent transmission of multiserver data.
Description of the drawings
Fig. 1 is that the present invention is based on the transmission networks of the efficient link transmission method of growth form data source formula of multi-parameter arbitration
Structure diagram；
Fig. 2 is that the present invention is based on the flow charts of the efficient link transmission method of growth form data source formula of multi-parameter arbitration.
Specific embodiment
With reference to specific embodiment, the invention will be further described.
Referring to Fig. 1, a kind of efficient link transmission method of growth form data source formula based on multi-parameter arbitration of the present invention,
Including step：
S1：A transmission network is built, transmission network includes a source host 1 and the plural number communicated to connect respectively at source host 1
A server 21, server are divided into a plurality of server groups 2 according to the type of transmission data；
S2：A server 21 transmission data of the source host 1 respectively into each server group 2 form a data source, simultaneously
The server 21 in the data source of formation one non-data source into the server group 2 at place transmits data and forms new data source；
Wherein, a server 21 transmission data of the source host 1 respectively into each server group 2 form a data source step
Specifically include step：
A, Servers-all 21 is added in into a calculating queue；
B, by a transmission time formula calculate source host 1 to calculate each server 21 in queue transmit data when
Between, transmission time formula is：
Wherein DataNiTransmission size of data needed for current operation instruction is carried out for current server；Ki services for current group
The average transmission rate of device；piFor the weighted value corresponding to operational order, andN is operational order sum；T is
Source host transmits the required time of data to current server；
And a data source is formed to 21 prioritised transmission data of the shortest server of current transmission data time；By data source
Server 21 in the server group 2 at place is removed from calculating queue；
C, step b is repeated, until an at least data source in each server group 2.
It is formed in addition, the server 21 in the data source one non-data source into the server group 2 at place formed transmits data
New data source step further comprises step：
Data source server 21 in each non-data source into the server group 2 at place is calculated by transmission time formula to pass
The time of transmission of data；
21 prioritised transmission data of a server shortest to current transmission data time form new data source.
S3：Each data source respectively server 21 from the non-data source to the server group 2 at place transmit data shape
Into next new data source；Source host 1 transmits the shortest non-data source of data time by transmission time formula to one simultaneously
Server 21 transmits data and forms another new data source；
S4：Step S3 is repeated, until Servers-all 21 all becomes data source.
Traditional data transmission is all single host carrying out data transmission to each server one by one；To single
The Data Transmission Content of server is also random, no privilege level concept.The present invention is used simultaneously using short job priority principle
Multi-data source concurrently transmits the pattern of information, and data are transmitted with optimal server 21, preferentially carries out data transmission, transfers
Server 21 as new data source, transmits data to other servers 21, therefore has multiple data in entire transmission process again
Source forms net structure concurrent transmission, substantially increases the efficiency of transmission of data.
For source host 1 when transmitting data to multiple servers 21, the data that each server 21 receives can be identical, also may be used
With difference.Server is divided into different groups, the identical data of every group of transmission by the type according to data are transmitted in server 21.Example
Such as, having server1, server2 ..., serverN is total to N number of server 21, is distributed in different cities.Server A1、A2…AiIt needs
It transmits data A and is denoted as A group servers, server B1、B2…BjTransmission data B is needed to be denoted as B group servers, may also have C, D
Deng group server, wherein secondary i+j+ ...=N).
Source host 1 arrives the average transmission rate of each server 21：ki=last time link average transmission rate * (1- δ)+sheet
Secondary link average transmission rate * δ (unit K b/s).Similarly, the link average transmission rate between two servers 21 is same as above:Chain
Road average transmission rate ki-j=last time link average transmission time * (1- δ)+this link average transmission rate * δ (unit K b/
s).Average transmission time+δ * old link average transmission time (Average Transfer Time)=(1- δ) * are currently average
Transmission time.Wherein δ is predetermined ratio value (for a self-defining value).
The corresponding weighted of each operational order, such as corresponding weight of each operational order is respectively p1, p2, p3 ...
Pn, then p1+p2+p3+ ...+pn=1.
Source host 1 transmits principle：It is preferentially shortest to transmission time in Servers-all group 2 according to transmission time length
21 incoming data of server is converted into data source, then transmits data to Servers-all 21 further according to transmission rate.
Server 21 transmits principle：According to transmission time length, the shortest non-data source server of transmission time into group
21 transmission data.
Such as：User needs to dispose 10 server groups 2, and every group of each 2 numbers of server are 10, in first server group 2
Each 21 efficiency of transmission of server is 1Kb/s, and each server transport efficiency is 2Kb/s in second server group 2, according to the rule
Restrain efficiency of transmission it is incremented by successively to each server transport efficiency in the tenth server group 2 be 10Kb/s.At this time as user uses
Conventional method, i.e.,：Source host 1 need to transmit data 100Kb, required time according to from 2 to the tenth server group 2 of first server group
For (100/1) * 10+ (100/2) * 10+ (100/3) * 10+ ... .+ (100/10) * 10 be about 2928s, from beginning to end only there are one
Data source is in transmission data.And such as method using the present invention, first deployment of server 21 is good only to need 10s, hereafter the number
It can be transmitted according to source in book server group 2, form a large amount of parallel transmission threads, when source host 1 passes for each server group 2
After a defeated data, i.e. data have been transmitted completely in 2 to the 3rd server group 2 of the tenth server group during 292.8s, only surplus
4 servers do not transmit in lower first server group 2 and second server group 2, and remaining 21 data to be transmitted of server exists
End of transmission in 300s, i.e., all data transmission periods are only needed less than 600s, and greatly reducing data compared to existing method passes
The defeated time.
The present invention is described in detail above in association with attached drawing embodiment, those skilled in the art can be according to upper
It states and bright many variations example is made to the present invention.Thus, some details in embodiment should not form limitation of the invention, this
Invention will be using the scope that the appended claims define as protection scope of the present invention.
Claims (4)
1. a kind of efficient link transmission method of growth form data source formula based on multi-parameter arbitration, which is characterized in that including step：
S1：A transmission network is built, what the transmission network was communicated to connect including a source host and respectively with the source host
A plurality of servers, the server are divided into a plurality of server groups according to the type of transmission data；
S2：The server transmission data into each server group forms a data source to the source host respectively, including：
A, Servers-all is added in one and calculates queue；
B, the time of the source host each server transmission data into the calculating queue is calculated, and to current transmission
The shortest server priority transmission data of data time form a data source；It will be in the server group where the data source
Server is removed from the calculating queue；
C, step b is repeated, until an at least data source in each server group；
The data source being formed simultaneously server transmission data in one non-data source into the server group at place forms new
Data source；
S3：The server transmission data in each data source non-data source into the server group at place respectively is formed down
One new data source；The server transmission data in the source host to a non-data source forms another new data source simultaneously；
S4：Step S3 is repeated, until Servers-all all becomes data source.
2. the growth form data source formula efficient link transmission method according to claim 1 based on multi-parameter arbitration, special
Sign is that the time of the source host each server transmission data into the calculating queue is public by a transmission time
Formula, which calculates, to be obtained；The transmission time formula is：
Wherein DataNiTransmission size of data needed for current operation instruction is carried out for current server；Ki is current group server
Average transmission rate；piFor the weighted value corresponding to operational order, andN is operational order sum；T is source master
Machine transmits the required time of data to current server.
3. the growth form data source formula efficient link transmission method according to claim 2 based on multi-parameter arbitration, special
Sign is, the data source of the formation server transmission data in one non-data source into the server group at place is formed newly
Data source step further comprise step：
The server in data source each non-data source into the server group at place is calculated by the transmission time formula
Transmit the time of data；
Server priority transmission data shortest to current transmission data time form new data source.
4. the growth form data source formula efficient link transmission method according to claim 3 based on multi-parameter arbitration, special
Sign is that in the step S3, the source host is shortest non-to a transmission data time by the transmission time formula
The server transmission data of data source forms another new data source.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410203215.3A CN103986760B (en) | 2014-05-14 | 2014-05-14 | The efficient link transmission method of growth form data source formula based on multi-parameter arbitration |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410203215.3A CN103986760B (en) | 2014-05-14 | 2014-05-14 | The efficient link transmission method of growth form data source formula based on multi-parameter arbitration |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103986760A CN103986760A (en) | 2014-08-13 |
| CN103986760B true CN103986760B (en) | 2018-05-22 |
Family
ID=51278583
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410203215.3A Active CN103986760B (en) | 2014-05-14 | 2014-05-14 | The efficient link transmission method of growth form data source formula based on multi-parameter arbitration |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103986760B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102185841A (en) * | 2011-04-25 | 2011-09-14 | 上海爱数软件有限公司 | Classified data transmission method and system |
| CN102387601A (en) * | 2011-10-14 | 2012-03-21 | 北京航空航天大学 | Self-adaptive distribution type cooperative access method and node device |
| CN102404368A (en) * | 2010-09-17 | 2012-04-04 | 财团法人工业技术研究院 | Hybrid peer-to-peer and master-slave data transmission architecture and method |
| CN103546546A (en) * | 2013-09-30 | 2014-01-29 | 蓝盾信息安全技术股份有限公司 | Large-scale cluster file distribution method |
| CN103595552A (en) * | 2013-06-28 | 2014-02-19 | 国家超级计算深圳中心(深圳云计算中心) | Analysis method and analysis system for cluster storage network parallel load |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7945618B2 (en) * | 2003-02-10 | 2011-05-17 | Oren Asher | Peer-to-peer service designer |
-
2014
- 2014-05-14 CN CN201410203215.3A patent/CN103986760B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102404368A (en) * | 2010-09-17 | 2012-04-04 | 财团法人工业技术研究院 | Hybrid peer-to-peer and master-slave data transmission architecture and method |
| CN102185841A (en) * | 2011-04-25 | 2011-09-14 | 上海爱数软件有限公司 | Classified data transmission method and system |
| CN102387601A (en) * | 2011-10-14 | 2012-03-21 | 北京航空航天大学 | Self-adaptive distribution type cooperative access method and node device |
| CN103595552A (en) * | 2013-06-28 | 2014-02-19 | 国家超级计算深圳中心(深圳云计算中心) | Analysis method and analysis system for cluster storage network parallel load |
| CN103546546A (en) * | 2013-09-30 | 2014-01-29 | 蓝盾信息安全技术股份有限公司 | Large-scale cluster file distribution method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103986760A (en) | 2014-08-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104683488B (en) | Streaming computing system and its dispatching method and device | |
| Alicherry et al. | Network aware resource allocation in distributed clouds | |
| CN105103506B (en) | Method and system for allocating bandwidth for non-uniform bandwidth requests in cloud computing networks | |
| Wu et al. | Green data center placement in optical cloud networks | |
| CN104836736B (en) | Efficiency resource allocation and path method for reconfiguration in elastic optical network based on frequency spectrum perception | |
| CN103412635B (en) | Data center's power-economizing method and device | |
| CN101951411A (en) | Cloud scheduling system and method and multistage cloud scheduling system | |
| CN103516529A (en) | Management method, device and system of configuration files | |
| CN106713468B (en) | A kind of distributed type assemblies service system and its method for node synergy | |
| CN108848146A (en) | A kind of method for optimizing scheduling based on time trigger communication service | |
| CN109617810A (en) | Data transmission method and device | |
| CN102932479A (en) | A topology-aware virtual network mapping method based on historical data | |
| CN104302008B (en) | A kind of wireless multi-hop network bandwidth allocation methods of comprehensive time-division and caching accounting | |
| CN109962774A (en) | Quantum cryptography networks key relays dynamic routing method | |
| CN102448120B (en) | Multipath load sharing method and device | |
| CN103986760B (en) | The efficient link transmission method of growth form data source formula based on multi-parameter arbitration | |
| CN102025632A (en) | Label distribution method and system for data packets in MPLS network | |
| CN106651453A (en) | Network platform-oriented automatic promotion method and system, and computing device | |
| CN104283608B (en) | Long-distance passive optical network guard method towards single SRLG fault | |
| CN101771561A (en) | Method for creating label forwarding table, node equipment and system | |
| CN105657671A (en) | Method and equipment for realizing multicast | |
| CN107135283A (en) | A kind of Chief Web Officer short chain configuring management method | |
| Yin et al. | A survivable XT-aware multipath strategy for SDM-EONs | |
| CN104506442A (en) | Multipoint-to-multipoint multicast business optical grooming method for flexible grid optical network | |
| CN109962775A (en) | Quantum cryptography networks key generates control 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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |