CN102201965A - Data transmission method - Google Patents
Data transmission method Download PDFInfo
- Publication number
- CN102201965A CN102201965A CN2010101324226A CN201010132422A CN102201965A CN 102201965 A CN102201965 A CN 102201965A CN 2010101324226 A CN2010101324226 A CN 2010101324226A CN 201010132422 A CN201010132422 A CN 201010132422A CN 102201965 A CN102201965 A CN 102201965A
- Authority
- CN
- China
- Prior art keywords
- node
- data
- transmitted
- child
- brotgher
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Abstract
The invention discloses a data transmission method. A data transmission source node and at least one data destination node are involved in the method, wherein a tree connection relationship is established between the data source node and the data destination node; the data destination node is a descendant node of the data source node; the data source node is used for sending the data to be transmitted to one of all child nodes of the data source node; the data destination node is used for receiving the data to be transmitted; if the data destination node has a child node, the data destination node sends the data to be transmitted to one of all child nodes of the data destination node; and if the data destination node has a brother node which does not obtain the data to be transmitted, the data destination node sends the data to be transmitted to one of all brother nodes. By adopting the technical scheme in the invention, uniform control can be implemented on the data transmission of the entire network on a single device, the intra-network bandwidth is effectively used, and the inter-network bandwidth is saved.
Description
Technical field
The present invention relates to technical field of data transmission, particularly relate to a kind of data transmission method.
Background technology
Along with the development of Internet technology, can realize resource-sharing by transfer of data between any two equipment in the network.In actual applications, we run into situation about the data on the equipment need be duplicated to multiple devices through regular meeting, and in the prior art, method commonly used is to pursue the platform copy data by data source place equipment to target device.This method is troublesome poeration not only, and each reproduction process all needs to take the bandwidth between source device and the current goal equipment.Particularly when target device and source device are in different segment and target device and all are in mutually same network segment, this clone method obviously is unfavorable for bandwidth resources between the net of saves valuable.
P2P (peer-to-peer, point-to-point) technology is a kind of popular data transfer mode at present, in P2P, each target device is when receiving data, also received data can be offered other target devices, the bandwidth usage between this target device that just will leave unused originally gets up.If the P2P technology is applied to above-mentioned scene, effectively utilizing bandwidth in the net between the target device, thereby reduce the volume of transmitted data on the bandwidth between net, reach the purpose of saving bandwidth resources between net.
In realizing process of the present invention, the inventor finds that there are the following problems at least in the prior art: in present P2P uses, each equipment can be controlled self transmission and reception (comprising speed, target device quantity etc.), but the transmission mechanism of P2P makes us can't realize the unified control to whole network data transmission on certain equipment.When volume of transmitted data is big, cause network storm probably, cause network paralysis.
And our application scenarios described above, its transfer of data is to be initiated by source device, variation according to transmitted data amount and target device quantity, need go up at source device (or some target devices) whole network data transmission is unified control, and other target devices can only be used for passive reception data, this demand be the P2P technology can't realize.
Summary of the invention
In view of this, the invention provides a kind of data transmission method, this method comprises:
(1) node carries out the reception of data to be transmitted;
(2) if receive the present node of described transmission data child node is arranged, then described present node is sent to a child node in all described child nodes with described data to be transmitted; With,
(3) if receive the present node of described transmission data the brotgher of node that did not also obtain described data to be transmitted is arranged, then described present node is sent to the brotgher of node in all described brotghers of node with described data to be transmitted;
(4) the estimated value L=[l of calculating switching node bottleneck number of links
0, l
1... l
D]
T, l wherein
jEqual the number of the bottleneck link of j time slot for past circulation round trip delay time;
(5) determine the position of D+2 closed-loop pole, thereby determine proper polynomial coefficient vector F=(f
0, f
1... f
D+2]
T
(6) according to formula G (L)=[M (L)]
-1F comes computing controller parameter G,
F=(f wherein
1+ 2, f
2-1 ... f
3, f
4..., f
D+1, f
D+2, 0)
T
Wherein, described node is set up tree-like annexation, and specific implementation is:
Be in the node of the same network segment, establish a connection with same father node, child node keeps the annexation with father node by periodically sending log-on message to father node.
In the above technical scheme, data between all devices are one-way transmission, if with the root node of source device as tree structure, a data channel is then only arranged between source device and the target device, by control, just can realize the transfer of data of whole network is unified control to this data channel transmission.
In addition, in a plurality of child nodes of a father node, have only one to be to obtain data from father node, other child nodes obtain data from the last brotgher of node of oneself successively, like this, as long as the equipment of the same network segment is made as the brotgher of node mutually, just can effectively utilize bandwidth in the net, save bandwidth between net.
Description of drawings
Fig. 1 is a kind of structural representation of chained record transmission system provided by the present invention;
Fig. 2 is the another kind of structural representation of chained record transmission system provided by the present invention;
Fig. 3 is for realizing the flow chart of the inventive method;
Fig. 4 is the structural representation of embodiment of the invention chained record transmission node;
Fig. 5 is the another kind of structural representation of embodiment of the invention chained record transmission node;
Fig. 6 is the third structural representation of embodiment of the invention chained record transmission node.
Embodiment
Technical scheme provided by the present invention, be called LCP (the LinkCopy chain type is duplicated) technology, at first chained record transmission system provided by the present invention is described below, chained record transmission system provided by the present invention, comprise a data source node and at least one datum target node, data source nodes and datum target node are set up tree-like annexation, and the datum target node is younger generation's node of data source nodes.
Embodiment one:
Figure 1 shows that a kind of structural representation of chained record transmission system provided by the present invention, wherein, 101 is data source nodes, 111-114 is the datum target node, the annexation of being set up between the internodal fine rule representation node among the figure, as can be seen: this system is two-layer tree structure, source node 101 is in the position of father node in tree structure, and destination node 111～114 all is 101 child node, because 111～114 have identical father node 101, the therefore brotgher of node each other each other between 111～114.
Internodal thick arrow line shows the transfer of data situation in this system among Fig. 1, as can be seen:
Embodiment two:
Figure 2 shows that the another kind of structural representation of chained record transmission system provided by the present invention, be with Fig. 1 difference, this system is a tree height of three, source node 201 is in the position of father node in tree structure, 211～115 is 201 child node, the brotgher of node each other each other between 215～115; 212a, 212b are 212 child node, and 212a and 212b be the brotgher of node each other each other; 214a is 214 child node.
By the thick arrow line among Fig. 2 as can be seen, have the destination node of child node, after receiving data,, also data can be sent to the child node of oneself except meeting is sent to the data that received the brotgher of node of oneself.For example, 212 data can be sent to the brotgher of node 213 of oneself and the child node 212a of oneself; And 214 meetings be sent to the brotgher of node 215 of oneself and the child node 214a of oneself with data.
Comprehensive embodiment one and embodiment two as can be seen, in the chained record transmission system, each node
Performed data transmission mechanism can be summarized as flow process shown in Figure 3, specifically comprises:
S301, present node obtains data to be transmitted;
Wherein, if present node is a data source nodes, what obtained so is initial data to be transmitted;
If present node is a destination node, so described acquisition data to be transmitted is embodied in and receives the data to be transmitted that other nodes sent.
S302, present node is sent to a child node with described data to be transmitted; With, described data to be transmitted is sent to a brotgher of node, this brotgher of node did not obtain described data to be transmitted.
As seen, present node obtains after the data, data can be continued to send to two nodes, if do not meet the node of above-mentioned condition, then can not carry out corresponding transmission action.Under such transmission mechanism, data will traverse on all destination nodes after source node sends automatically, and can not occur the transmission that repeats of data between the destination node.
Need to prove; embodiment one and embodiment two have introduced tree structures two-layer and three layers respectively; what those skilled in the art were easy to expect is; other forms of tree-structured system for adopting data transmission mechanism provided by the present invention also all should be included within protection scope of the present invention.
Foundation for tree-like annexation, generally we can make the destination node that is in the same network segment, establish a connection with a father node, for example in Fig. 2, node 211～115 is in same segment A, node 212a, 212b are in same network segment B, node 214a and are in network segment C, like this, when data are transmitted between net, only can take a data channel, and most data are one-way transmissions between the brotgher of node, have effectively utilized the data transfer bandwidth in the net.
Owing to have only a data channel between father node and the child node, therefore,, just can realize unified control to the transfer of data of whole network as long as this data channel is controlled.For example, for the data channel between source node 201 and the destination node 211, we can be in the reportedly defeated speed of 201 or 211 upper domination numbers.
Because father node need be managed the relevant information of child node, workload is relatively large, so we are typically chosen in control transmission speed on the child node.Specifically, can on 211, control from the speed of 201 reception data, because 211 is first and unique destination node that is obtained data by source node, therefore, between the brotgher of node afterwards or father and son's data between nodes transmission rate, obviously can not surpass the speed that this limited, thereby realize unified control the transfer of data of whole network.
What those skilled in the art were easy to expect is, also can control the speed that sends data to 212 on 211, (if 211 child node is arranged, can also control the speed to child node transmission data on 211).
Further, on each destination node can to the data receiving velocity, backward stepbrother's node data transmission rate, control to the data transmission rate of child node, thereby realize finer management to network.
Embodiment three:
In preferred version of the present invention, be that certain did not also obtain the brotgher of node of data with data are sent to oneself in order to guarantee a certain destination node, can optimize above-mentioned data transmission mechanism as follows:
In the source node side, data to be transmitted is sent to first and the child node that oneself establishes a connection;
In the destination node side, receive data to be transmitted; The data to be transmitted that is received is sent to first and the child node that oneself establishes a connection; With, the data to be transmitted that is received is sent to after own, the node that first establishes a connection with own father node, back description for convenience, we are called the follow-up brotgher of node with this node.
Specifically, in setting up the process of tree-like annexation, node x can be by registering to node y, and y establishes a connection with node, becomes the child node of node y.Afterwards, node x (for example 1 second) at regular intervals can send log-on message to node y, with the annexation of maintenance with node y.
Father node can be understood the connection situation of child node at any time by the log-on message of periodic test child node.
On the one hand, when father node has data to send or to transmit, know which child node will receive them; On the other hand, in case when being checked through child node the number of times of registration not reaching certain quantity continuously, father node will remove it from the child node tabulation, the step of going forward side by side is put in order transmission policy.
With the system that Fig. 2 was provided is example, suppose node 211～215th, register to node 201 by the order of its numeral number, node 212a～212b registers to node 212 by the order of its alpha code, then according to the transmission mechanism of above-mentioned optimization, can determine:
In like manner can determine the transmission rule of other destination nodes, repeat no more here.
If certain node failure, its father node can be learnt this situation, and adjust accordingly by the log-on message of periodic test child node so:
If node 211 lost efficacy, node 201 can be deleted 211 information in the child node tabulation of oneself, and at this moment, first child nodes to 201 registrations have just become 212;
If node 212 lost efficacy, the information that node 201 can deletion 212 in own child node tabulation, and the node 211 that this advisory was registered before 212, at this moment for 211, the follow-up brotgher of node has just become 213;
Situation in the time of in like manner can learning other node failures, in a word, from the whole angle of network, node failure, be equivalent to set up new tree-like annexation in fact (if there is new node to add network, also be similar situation), each node still carries out Data Receiving and transmission according to original transmission mechanism, the object that just " child node that first and oneself establish a connection " and " the follow-up brotgher of node " that changes referred to.
In the transmission mechanism of optimizing, all be that the brotgher of node by previous registration passes over the data of one deck, this with regard to specific implementation the principle of " a certain destination node data are sent to oneself certain also do not obtain the brotgher of node of data ".And, come the transmission direction of specified data according to the registration order of node, also help management more to transfer of data.
Referring to shown in Figure 6, described chained record transmission node can further include:
Rate controlled unit 430 is used for the Data Receiving speed to described receiving element 410, and/or the data transmission rate of described transmitting element 420 is controlled.
If described receiving element is to receive the data to be transmitted that other nodes sent, then described chained record transmission node may further include:
Data check unit 440 is used to check whether the data to be transmitted that described receiving element 410 received is complete, and if not, then the request msg sending node resends the data division that is lacked.
The above only is the specific embodiment of the present invention; should be pointed out that for those skilled in the art, under the prerequisite that does not break away from the principle of the invention; can also make some improvements and modifications, these improvements and modifications also should be considered as protection scope of the present invention.
Claims (2)
1. a data transmission method is characterized in that, this method comprises:
(1) node carries out the reception of data to be transmitted;
(2) if receive the present node of described transmission data child node is arranged, then described present node is sent to a child node in all described child nodes with described data to be transmitted; With,
(3) if receive the present node of described transmission data the brotgher of node that did not also obtain described data to be transmitted is arranged, then described present node is sent to the brotgher of node in all described brotghers of node with described data to be transmitted;
(4) the estimated value L=[l of calculating switching node bottleneck number of links
0, l
1... l
D]
T, l wherein
jEqual the number of the bottleneck link of j time slot for past circulation round trip delay time;
(5) determine the position of D+2 closed-loop pole, thereby determine proper polynomial coefficient vector F=(f
0, f
1... f
D+2]
T
(6) according to formula G (L)=[M (L)]
-1F comes computing controller parameter G,
F=(f wherein
1+ 2, f
2-1 ... f
3, f
4..., f
D+1, f
D+2, 0)
T
2. method according to claim 1, it is characterized in that, described node is set up tree-like annexation, specific implementation is: the node that is in the same network segment, establish a connection with same father node, child node keeps the annexation with father node by periodically sending log-on message to father node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010101324226A CN102201965A (en) | 2010-03-24 | 2010-03-24 | Data transmission method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010101324226A CN102201965A (en) | 2010-03-24 | 2010-03-24 | Data transmission method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102201965A true CN102201965A (en) | 2011-09-28 |
Family
ID=44662370
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2010101324226A Pending CN102201965A (en) | 2010-03-24 | 2010-03-24 | Data transmission method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102201965A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104468483A (en) * | 2013-09-22 | 2015-03-25 | 腾讯科技（深圳）有限公司 | Data transmission method and system, control device and node device |
| CN107291533A (en) * | 2016-03-31 | 2017-10-24 | 阿里巴巴集团控股有限公司 | Determine method, the device of upstream node bottleneck degree and system bottleneck degree |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101082812A (en) * | 2006-06-01 | 2007-12-05 | 模拟装置公司 | Self-compensation closed-loop adaptive control system |
| CN101414949A (en) * | 2008-11-28 | 2009-04-22 | 阿里巴巴集团控股有限公司 | Chain data transmission method, node and system |
-
2010
- 2010-03-24 CN CN2010101324226A patent/CN102201965A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101082812A (en) * | 2006-06-01 | 2007-12-05 | 模拟装置公司 | Self-compensation closed-loop adaptive control system |
| CN101414949A (en) * | 2008-11-28 | 2009-04-22 | 阿里巴巴集团控股有限公司 | Chain data transmission method, node and system |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104468483A (en) * | 2013-09-22 | 2015-03-25 | 腾讯科技（深圳）有限公司 | Data transmission method and system, control device and node device |
| CN104468483B (en) * | 2013-09-22 | 2019-01-22 | 腾讯科技（深圳）有限公司 | Data transmission method and system, control device and node apparatus |
| CN107291533A (en) * | 2016-03-31 | 2017-10-24 | 阿里巴巴集团控股有限公司 | Determine method, the device of upstream node bottleneck degree and system bottleneck degree |
| CN107291533B (en) * | 2016-03-31 | 2020-10-30 | 阿里巴巴集团控股有限公司 | Method and device for determining upstream node bottleneck degree and system bottleneck degree |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101414949B (en) | Chain data transmission method, node and system | |
| CN107005475B (en) | System and method for joint optimization of source selection and traffic engineering | |
| CN111406396A (en) | Computer-implemented systems and methods for data propagation and communication in a network, such as a blockchain network | |
| KR102565577B1 (en) | Optimization of network parameters to enable network coding | |
| CN109861925B (en) | Data transmission method, related device and network | |
| CN102281193A (en) | Method and fiber channel (FC) equipment for realizing message forwarding in fiber channel network | |
| WO2019204987A1 (en) | Information transmission method controlled by cloud, robot, and group robot system | |
| CN111541689B (en) | Network transmission method suitable for PBFT (basic packet transport function) type consensus protocol | |
| CN104639437A (en) | Forwarding method and apparatus of broadcast messages in stack system | |
| CN102724064A (en) | Method for building network application simulation system | |
| CN104767664A (en) | Ring communication network slave node increasing and decreasing method, device and system | |
| CN101233726A (en) | Local area network management | |
| US7941531B2 (en) | Age biased distributed collision resolution without clocks | |
| CN111491020B (en) | Data processing method, data processing device, computer equipment and storage medium | |
| CN102201965A (en) | Data transmission method | |
| US20170206132A1 (en) | Hybrid storage system using p2p and data transmission method using same | |
| KR20100104832A (en) | Intermediate node device, method for controlling the intermediate node device, and network system | |
| CN101355512B (en) | Data transmission system, method and transmission control server | |
| Magubane et al. | Performance evaluation of ETXPC-RPL routing algorithm in IoT Network | |
| KR101707196B1 (en) | Wireless sensor node in wireless sensor network and clustering method using the same | |
| CN111405489A (en) | Multicast tree construction method applied to wireless network | |
| CN113316177B (en) | Decision communication system and decision communication method for intelligent group | |
| CN117240851B (en) | Data distribution method, device, equipment and storage medium | |
| Stais et al. | Error and congestion control for wireless sensor networks | |
| JP6060723B2 (en) | COMMUNICATION SYSTEM, TRANSMITTER, AND COMMUNICATION 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 | ||
| C12 | Rejection of a patent application after its publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20110928 |