CN103138894A - Method and nodes and data network of data transmission - Google Patents
Method and nodes and data network of data transmission Download PDFInfo
- Publication number
- CN103138894A CN103138894A CN2013100978240A CN201310097824A CN103138894A CN 103138894 A CN103138894 A CN 103138894A CN 2013100978240 A CN2013100978240 A CN 2013100978240A CN 201310097824 A CN201310097824 A CN 201310097824A CN 103138894 A CN103138894 A CN 103138894A
- Authority
- CN
- China
- Prior art keywords
- node
- data
- current
- link
- delay time
- 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
- 230000005540 biological transmission Effects 0.000 title claims abstract description 182
- 238000000034 method Methods 0.000 title claims abstract description 25
- 238000004891 communication Methods 0.000 claims abstract description 61
- 238000001514 detection method Methods 0.000 claims description 12
- 238000012545 processing Methods 0.000 claims description 8
- 238000010586 diagram Methods 0.000 description 11
- 238000004590 computer program Methods 0.000 description 7
- 230000008569 process Effects 0.000 description 5
- 230000006870 function Effects 0.000 description 4
- 238000012986 modification Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 2
- 230000000977 initiatory effect Effects 0.000 description 2
- 238000012546 transfer Methods 0.000 description 2
- 238000011161 development Methods 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000012163 sequencing technique Methods 0.000 description 1
- 230000011664 signaling Effects 0.000 description 1
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a method, nodes and a data network of data transmission. The method, the nodes and the data network of the data transmission are used for improving the speed of data transmission among the nodes. According to the method of the data transmission, a present node acquires unreceived speed information of each node of present data sent by a source node in the data network with communicated nodes; the present bode determines transmission delaying time of each communication link communicated with the present node according to the acquired speed information of each node; and the present node transmits the present data to a first node corresponding to a communication link with the shortest transmission delaying time, so that the first node can transmit the present data until the present data reach a target node.
Description
Technical Field
The present invention relates to the field of internet technologies, and in particular, to a data transmission method, a node, and a data network.
Background
Through the rapid development in recent years, the internet has become an important tool for life, work, and learning in an information-oriented society. With the higher dependence degree on the internet, the higher the requirement on the service quality, however, the difference between the network scale, the number of users and the network resources of each network operation unit of the internet is large, and the problem of interconnection and intercommunication of the internet is gradually revealed and receives much attention.
At present, an interconnected intelligent data network can be established by fusing internet broadband resources of various regions, a distributed software system and an internet sensing technology, and the intelligent data network can realize interconnection among various network operation units and interconnection among various urban areas. In the data network shown in fig. 1, each node is interconnected, for example: the Beijing Internet Data Center (IDC) is respectively communicated with the information Center (Center Provider) in the data network, Shanghai IDC, Wuxi IDC, Tianjing IDC and the like, so that data can be transmitted in any two nodes which are communicated with each other.
In the data network, the nodes are intercommunicated, and the current node can directly send data to any destination node. However, the direct link between two nodes in different regions or different network operation units has a relatively slow transmission speed due to bandwidth or transmission delay, and thus, in the existing data network, the data transmission speed between the nodes can be further increased.
Disclosure of Invention
The invention provides a data transmission method, nodes and a data network, which are used for improving the data transmission speed between the nodes.
The invention provides a data transmission method, which comprises the following steps:
the method comprises the steps that a current node acquires speed information of each node which does not receive current data sent by a source node in a data network with nodes intercommunicated;
the current node determines the transmission delay time of each communication link communicated with the current node according to the acquired speed information of each node;
and the current node transmits the current data to a first node corresponding to the communication link with the minimum transmission delay time, so that the first node transmits the current data until the current data reaches a target node.
In the data network with the nodes intercommunicated, the node to be sent with the current data is the current node, and the current node may be a source node of the initiated current data or any node except the source node and the target node in the data network. Therefore, the communication links communicated with the current node are multiple, the current node only sends the current data to the first node corresponding to the communication link with the minimum transmission delay time by determining the transmission delay time of each communication link, the first node may be a target node or not, if the first node is the target node, the data transmission process is finished, and if the first node is not the target node, the first node continues to transmit the current data until the current data reaches the target node.
It can be seen that, each time the current node performs current data transmission, the current data is only sent to the first node corresponding to the communication link with the minimum transmission delay time, that is, the communication link with the minimum transmission delay time is selected to perform the current data transmission, so that the communication link with the slower transmission speed is avoided being used for data transmission, idle nodes in the data network are utilized to the maximum extent to perform data transmission, the data transmission speed between the nodes is improved, and resources in the data network are reasonably utilized.
In the embodiment of the present invention, the acquiring, by the current node, the speed information of each node that does not receive the current data initiated by the source node in the data network in which the nodes are intercommunicated includes:
the current node sends a detection data packet to each node which does not receive the current data initiated by the source node in the data network;
and the current node acquires the speed information of the corresponding node from the detection feedback data packet fed back by each node.
Therefore, the speed information of each node in the data network can be obtained by detecting the data packet, so that the communication link which is communicated with the current node and has the smallest transmission delay time can be determined, the speed information can be obtained without complex signaling interaction, and the burden of the data network cannot be increased.
The speed information includes: bandwidth information and delay information of the node.
In the present invention, the determining the transmission delay time of each communication link communicated with the current node includes:
determining nodes which are except the target node and have residual bandwidth as transit nodes according to the bandwidth information in the acquired speed information of each node;
obtaining the transmission delay time of each corresponding relay link between the current node and each relay node according to the delay information in the speed information of each relay node;
and obtaining the transmission delay time of the through link between the current node and the target node according to the delay information in the speed information of the target node.
It can be seen that except for the target node, the node with the remaining bandwidth can be a relay node and can form a relay link with the current node, that is, in the data network in which the nodes are intercommunicated, the node which is not communicated with the current node can form a communication link with the current node, and the node with the remaining bandwidth can form a communication link with the current node. Therefore, nodes without bandwidth surplus are eliminated, the times of calculating the transmission delay time of the communication link are reduced, and the occupation of resources is reduced.
In the present invention, the transmitting, by the current node, the current data to the first node corresponding to the communication link with the minimum transmission delay time includes:
determining one relay link with the minimum transmission delay time as a first relay link;
when the transmission delay time of the first relay link is less than that of the through link, determining a node in the first relay link, which is communicated with the current node, as the first node, and sending the current data to the first node by adopting the first relay link;
and when the transmission delay time of the first relay link is greater than or equal to the transmission delay time of the direct link, determining a target node communicated with the current node in the direct link as the first node, and sending the current data to the first node by adopting the direct link.
Therefore, when the transmission delay time of the relay link is less than that of the through link, the relay link is adopted for data transmission, and when the transmission delay time of the relay link is not less than that of the through link, the through link is adopted for data transmission, so that transmission pressure on the through link due to passing through the transfer node is avoided, and transmission resources of a data network are further reasonably used.
The invention provides a node for data transmission, comprising:
the device comprises an acquisition unit, a processing unit and a processing unit, wherein the acquisition unit is used for acquiring the speed information of each node which does not receive the current data initiated by a source node in a data network with nodes intercommunicated;
the determining unit is used for determining the transmission delay time of each communication link communicated with the node according to the acquired speed information of each node;
and a transmission unit, configured to transmit the current data to a first node corresponding to the communication link with the smallest transmission delay time, so that the first node transmits the current data until the current data reaches a target node.
The obtaining unit is specifically configured to send a detection data packet to each node that does not receive current data initiated by the source node in the data network, and obtain speed information of the corresponding node from a detection feedback data packet fed back by each node.
The determining unit is specifically configured to determine, according to bandwidth information in the acquired speed information of each node, a node other than the target node and having the remaining bandwidth as a transit node, and obtain, according to delay information in the speed information of each transit node, transmission delay time of each corresponding relay link between the node and each transit node; and the number of the first and second groups,
and obtaining the transmission delay time of the through link between the node and the target node according to the delay information in the speed information of the target node.
The transmission unit is specifically configured to determine a relay link with the smallest transmission delay time as a first relay link;
when the transmission delay time of the first relay link is less than that of the through link, determining a node in the first relay link, which is communicated with the node, as the first node, and sending the current data to the first node by adopting the first relay link; and the number of the first and second groups,
when the transmission delay time of the first relay link is greater than or equal to the transmission delay time of the direct link, determining a target node in the direct link, which is communicated with the node, as the first node, and sending the current data to the first node by adopting the direct link
As can be seen, a current node in the data network may obtain speed information of each node in the data network that has not received current data initiated by a source node, and determine transmission delay time of each communication link communicated with the current node according to the obtained speed information of each node, so as to select a communication link with the smallest transmission delay time for data transmission, that is, send current data to a first node corresponding to the communication link with the smallest transmission delay time, so that the first node transmits the current data until the current data reaches a target node. Therefore, the nodes in the data network only send the current data to the first node corresponding to the communication link with the minimum transmission delay time, resources in the data network are reasonably utilized, and the data transmission speed between the nodes is improved.
The invention provides a data network for data transmission, comprising: at least three nodes as described above intercommunicate.
The nodes in the data network can select a communication link with the minimum transmission delay time for data transmission, so that the data transmission by adopting the communication link with the slower transmission speed is avoided, the nodes except the target node are reasonably utilized, the resources in the data network are utilized reasonably and maximally, and the data transmission speed between the nodes in the data network is improved.
Additional features and advantages of the invention will be set forth in the description which follows, and in part will be obvious from the description, or may be learned by practice of the invention. The objectives and other advantages of the invention will be realized and attained by the structure particularly pointed out in the written description and claims hereof as well as the appended drawings.
The technical solution of the present invention is further described in detail by the accompanying drawings and embodiments.
Drawings
The accompanying drawings, which are included to provide a further understanding of the invention and are incorporated in and constitute a part of this specification, illustrate embodiments of the invention and together with the description serve to explain the principles of the invention and not to limit the invention. In the drawings:
FIG. 1 is an architecture diagram of a prior art data network with interworking of nodes;
FIG. 2 is a flow chart of data transmission according to one embodiment of the present invention;
FIG. 3 is a flowchart of data transmission according to a second embodiment of the present invention;
FIG. 4 is an architecture diagram of a data network in which nodes communicate with each other according to a third embodiment of the present invention;
FIG. 5 is a flowchart of data transmission according to a third embodiment of the present invention;
fig. 6 is a structural diagram of a node for data transmission in an embodiment of the present invention.
Detailed Description
The preferred embodiments of the present invention will be described in conjunction with the accompanying drawings, and it will be understood that they are described herein for the purpose of illustration and explanation and not limitation.
In the embodiment of the invention, in a data network with intercommunicated nodes, when a current node needs to send data, the speed information of each node which does not receive the data in the data network is obtained, then the transmission delay time of each communication link communicated with the current node is determined according to the obtained speed information of each node, and the data is transmitted to a first node corresponding to one communication link with the minimum transmission delay time, so that the first node can continue to transmit the data until the current data reaches a target node. Therefore, the communication link for data transmission at each time is the communication link with the minimum transmission delay time, the data transmission by adopting the communication link with the slower transmission speed is avoided, and the data transmission speed between the nodes is improved.
The first embodiment is as follows: referring to fig. 2, the process of data transmission includes:
step 201: the current node acquires the speed information of each node which does not receive the current data initiated by the source node in the data network of the node intercommunication.
Each node in the data network is time-phase-interconnected and mutually communicable, and a node needing to send data is a current node, which may be a source node initiating current data or a node other than a target node in the data network.
When the current node transmits data, the speed information of each node which does not receive the current data initiated by the source node in the data network needs to be acquired. The current node is interconnected with any other node in the data network, and in order to avoid repeated sending between the two nodes, the current node only needs to acquire the speed information of each node which does not receive the current data initiated by the source node.
Specifically, the current node may obtain the speed information of each node by sending a probing packet to each node that has not received the current data initiated by the source node, including:
the current node sends a detection data packet to each node which does not receive the current data initiated by the source node in the data network, and acquires the speed information of the corresponding node from the detection feedback data packet fed back by each node.
Wherein the speed information includes: bandwidth information and delay information of the node. For example: bandwidth, usage, delay, etc.
Step 202: and the current node determines the transmission delay time of each communication link communicated with the current node according to the acquired speed information of each node.
Although the current node is interworked with each node in the data network that did not receive the current data originated by the source node, not every node that did not receive the current data originated by the source node can form a communication link with the current node. Among these nodes, only the nodes except the target node and having the bandwidth surplus can form the communication link communicated with the previous node with the current node, and therefore, determining the transmission delay time of each communication link communicated with the current node includes:
determining nodes except the target node and having residual bandwidth as transit nodes according to the bandwidth information in the acquired speed information of each node, and obtaining the transmission delay time of each corresponding relay link between the current node and each transit node according to the delay information in the speed information of each transit node;
and obtaining the transmission delay time of the direct link between the current node and the target node according to the delay information in the speed information of the target node.
Therefore, nodes without bandwidth surplus are eliminated, the number of communication links for calculating the transmission delay time is reduced, and the occupation of resources is reduced.
Step 203: and the current node transmits the current data to a first node corresponding to a communication link with the minimum transmission delay time, so that the first node transmits the current data until the current data reaches a target node.
After the transmission delay time of each communication link is determined by the current node, the current node can be sequenced according to the transmission delay time, the communication link with the minimum transmission delay time is determined as a non-transmission link, and the node corresponding to the transmission link is determined as the first node, so that the current data is sent to the first node through the transmission link.
Specifically, the relay link with the smallest transmission delay time is determined as the first relay link.
And when the transmission delay time of the first relay link is less than that of the straight-through link, determining a node communicated with the current node in the first relay link as the first node, and sending the current data to the first node by adopting the first relay link.
And when the transmission delay time of the first relay link is greater than or equal to the transmission delay time of the through link, determining a target node communicated with the current node in the through link as the first node, and sending the current data to the first node by adopting the through link.
Therefore, whether the relay link or the straight-through link is adopted, the corresponding communication link can be used as a transmission link for data transmission as long as the transmission delay time is shortest, so that the communication link with the shortest transmission delay time is adopted for data transmission every time, and the data transmission speed between the nodes is improved.
In this embodiment, the first node may be an end point of the current data transmission, that is, a target node, or may not be the target node, and therefore, when the first node is not the target node, the current data transmission needs to be continued, and a transmission process of the current data transmission is as above, that is, the first node is already the current node in the transmission process, and a specific process is not described again. And when the first node is the target node, the current data already reaches the end point, and the transmission process is finished.
Example two: in a data network with nodes intercommunicated, a source node initiating current data needs to send the current data to a target node, and the current data can be transmitted through a through link between the source node and the target node, but the through link is not necessarily the fastest link, and the speed of a relay link between the source node and a relay node is the fastest possible, so that the source node can send the current data to the relay node first, then the relay node sends the current data to the target node corresponding to the fastest link communicated with the relay node 1, or the source node can send the current data to the relay node 1 corresponding to the fastest link communicated with the source node first, the relay node 1 sends the current data to the relay node 2 corresponding to the fastest link communicated with the relay node 1, and finally the relay node 2 sends the current data to the target node corresponding to the fastest link communicated with the relay node 2, and so on. That is, each node sends data to the node corresponding to the fastest link, thereby improving the data transmission speed between two nodes of the data network. Referring to fig. 3, a specific data transmission process includes:
step 301: the source node is used as a current node to acquire the speed information of each node which does not receive the current data initiated by the source node in the data network communicated by the nodes.
The method comprises the steps that current data are sent by a source node and serve as one node in a data network with the nodes communicated with each other, the node can acquire speed information of any node in the network, and here, the current data are sent for the first time, so that the speed information of each node except the source node in the data network is acquired.
Specifically, the source node obtains speed information of the corresponding node by sending a sensing packet to each node in the data network.
Step 302: and the current node determines the transmission delay time of each communication link communicated with the current node according to the acquired speed information of each node.
Here, the nodes except the target node and having the remaining bandwidth may be determined as the transit nodes according to the bandwidth information in the speed information of each node, and the transmission delay time of each corresponding relay link between the current node and each transit node may be obtained according to the delay information in the speed information of each transit node;
and obtaining the transmission delay time of the direct link between the current node and the target node according to the delay information in the speed information of the target node.
Step 303: and the current node transmits the current data to a first node corresponding to a communication link with the minimum transmission delay time.
And sequencing the determined transmission delay time of the communication links, and selecting the communication link with the minimum transmission delay time to transmit the current data, wherein the node corresponding to the communication link with the minimum transmission delay time is the first node.
Step 304: it is determined whether the first node is the target node, if yes, the current data transmission is finished, otherwise, step 305 is executed.
Specifically, after receiving the current data, the first node may determine whether the address information is address information of the node according to address information carried in the current data, if so, the current data transmission is finished, and if not, step 305 is executed.
Or, the current node in the previous step determines whether the address information of the first node in the address information field carried in the current data is matched, if so, the current data transmission is finished, and if not, step 305 is executed.
Of course, there may be other existing methods for determining whether the first node is the destination node, and the description will not be repeated.
Step 305: the first node, as the current node, obtains the speed information of each node that has not received the current data initiated by the source node in the data network of the node interworking, and returns to step 302.
Since the first node is not the target node, the first node needs to continue to transmit the current data, and in order to avoid transmitting the current data to the repeated nodes, it is only necessary to acquire the speed information of each node that has not received the current data initiated by the source node in the data network, and the subsequent data transmission process may start from step 302 again until the current data is transmitted to the target node.
It can be seen that, in this embodiment, each time a node sends data to a node corresponding to a fastest link that is connected, and a transfer node with a remaining bandwidth can be utilized to participate in data transmission, so that not only is the data transmission speed between two nodes of a data network improved, but also resources in the data network are reasonably utilized.
Example three: in the process of sending the current data to the destination node, the source node may use one, two, or more transit nodes, but the more transit nodes in use, the easier it is to cause transmission pressure to the transit nodes, so the maximum number of transit nodes in use may be limited according to the information of the scale, performance, etc. of the data network, for example: only two transit nodes can be used at the maximum, or three transit nodes can be used at the maximum.
In this embodiment, a minimum data network is used for description, and as shown in fig. 4, the data network includes three intercommunicating nodes, which are Beijing IDC, Wuxi IDC, and Liaoning IDC, respectively. The Beijing IDC initiates the current data, and needs to be finally sent to Wuxi IDC, and the specific data transmission process is shown in fig. 5 and includes:
step 501: and the Beijing IDC respectively acquires the speed information of Wuxi IDC and Liaoning IDC.
Step 502: and the Beijing IDC judges whether the Liaoning IDC is a node with residual broadband according to the broadband information in the speed information of the Liaoning IDC, if so, the step 503 is executed, and if not, the step 509 is executed.
Step 503: and the Beijing IDC determines the transmission delay time of the relay link from the Beijing IDC to the Liaoning IDC according to the delay information in the speed information of the Liaoning IDC.
Here, the transmission delay time of the relay link from Beijing IDC to Liaoning IDC can be calculated to be 10 ms.
Step 504: and the Beijing IDC determines the transmission delay time of the straight-through link from the Beijing IDC to the Wuxi IDC according to the delay information in the speed information of the Wuxi IDC.
Here, the transmission delay time of the through link from Beijing IDC to WuxiIDC can be calculated to be 70 ms.
Step 505: and the Beijing IDC selects a relay link from the Beijing IDC to the Liaoning IDC to send the current data to the Liaoning IDC.
The transmission delay time of a relay link from Beijing IDC to Liaoning IDC is 10ms shorter than the transmission delay time of a direct link from Beijing IDC to Wuxi IDC by 70ms, so that the Beijing IDC sends the current data to the Liaoning IDC.
Step 506: the Liaoning IDC acquires speed information of Wuxi IDC.
Step 507: and the Liaoning IDC determines the transmission delay time of the communication link from the Liaoning IDC to the Wuxi IDC according to the delay information in the speed information of the Wuxi IDC.
Here, the transmission delay time of the communication link from Liaoning IDC to Wuxi IDC is calculated to be 10 ms.
Step 508: and the Liaoning IDC sends the current data to the Wuxi IDC, and the data transmission process is finished.
Because only one communication link is needed, the communication link with the minimum transmission delay time is the communication link from Liaoning IDC to Wuxi IDC.
Step 509: and the Beijing IDC sends the current data to the Wuxi IDC, and the process is finished.
Since the Liaoning IDC has no residual bandwidth, the Liaoning IDC cannot be used as a transit node, and there is no other transit node in the implementation, the Beijing IDC can only directly send the current data to the Wuxi IDC.
In this embodiment, the Beijing IDC sends the current data to the Liaoning IDC, and then the total transmission delay time spent by the Liaoning IDC for sending the current data to the Wuxi IDC is 20ms, which is less than the transmission delay time spent by the Beijing IDC for directly sending the current data to the Wuxi IDC by the Beijing IDC by 70 ms. Therefore, the data transmission method can avoid data transmission by adopting a communication link with a slower transmission speed, maximally utilizes idle nodes in the data network for data transmission, improves the data transmission speed between the nodes, and reasonably utilizes resources in the data network.
According to the above data transmission process, a data transmission node may be constructed, as shown in fig. 6, and the node includes: an acquisition unit 610, a determination unit 620, and a transmission unit 6300. Wherein,
an obtaining unit 610, configured to obtain speed information of each node that does not receive current data initiated by a source node in a data network where nodes are intercommunicated;
the determining unit 620 is configured to determine, according to the acquired speed information of each node, a transmission delay time of each communication link connected to the node.
The transmitting unit 630 is configured to transmit the current data to the first node corresponding to the communication link with the smallest transmission delay time, so that the first node transmits the current data until the current data reaches the target node.
Specifically, the obtaining unit 610 is specifically configured to send a detection data packet to each node that has not received the current data initiated by the source node in the data network, and obtain the speed information of the corresponding node from the detection feedback data packet fed back by each node.
A determining unit 620, configured to determine, according to bandwidth information in the acquired speed information of each node, a node other than the target node and having the remaining bandwidth as a transit node, and obtain, according to delay information in the speed information of each transit node, transmission delay time of each corresponding relay link between the node and each transit node; and the number of the first and second groups,
and obtaining the transmission delay time of the through link between the node and the target node according to the delay information in the speed information of the target node.
A transmission unit 630, configured to determine a relay link with the smallest transmission delay time as a first relay link;
when the transmission delay time of the first relay link is less than that of the straight-through link, determining a node communicated with the node in the first relay link as a first node, and sending the current data to the first node by adopting the first relay link; and the number of the first and second groups,
and when the transmission delay time of the first relay link is greater than or equal to the transmission delay time of the through link, determining a target node communicated with the node in the through link as a first node, and sending the current data to the first node by adopting the through link.
In the embodiment of the invention, when the node transmits data each time, the communication link with the minimum transmission delay time is selected for data transmission until the data to be transmitted reaches the target node.
The data transmission node can be applied to a data network with intercommunicated nodes, the data network comprises at least three nodes, and each node is intercommunicated, namely, when any node in the data network transmits data, a communication link with the minimum transmission delay time is selected for data transmission, so that the speed of data transmission among the nodes is improved, idle nodes in the data network are utilized to transmit data to the maximum extent, and resources in the data network are reasonably utilized.
As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, optical storage, and the like) having computer-usable program code embodied therein.
The present invention has been described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
It will be apparent to those skilled in the art that various changes and modifications may be made in the present invention without departing from the spirit and scope of the invention. Thus, if such modifications and variations of the present invention fall within the scope of the claims of the present invention and their equivalents, the present invention is also intended to include such modifications and variations.
Claims (10)
1. A method of data transmission, comprising:
the method comprises the steps that a current node acquires speed information of each node which does not receive current data initiated by a source node in a data network with nodes intercommunicated;
the current node determines the transmission delay time of each communication link communicated with the current node according to the acquired speed information of each node;
and the current node transmits the current data to a first node corresponding to the communication link with the minimum transmission delay time, so that the first node transmits the current data until the current data reaches a target node.
2. The method of claim 1, wherein the current node obtaining speed information of each node in the data network with interworking node that has not received current data originated by the source node comprises:
the current node sends a detection data packet to each node which does not receive the current data initiated by the source node in the data network;
and the current node acquires the speed information of the corresponding node from the detection feedback data packet fed back by each node.
3. The method of claim 1 or 2, wherein the speed information comprises: bandwidth information and delay information of the node.
4. The method of claim 1, wherein said determining a transmission delay time for each communication link in communication with the current node comprises:
determining nodes which are except the target node and have residual bandwidth as transit nodes according to the bandwidth information in the acquired speed information of each node;
obtaining the transmission delay time of each corresponding relay link between the current node and each relay node according to the delay information in the speed information of each relay node;
and obtaining the transmission delay time of the through link between the current node and the target node according to the delay information in the speed information of the target node.
5. The method of claim 4, wherein the current node transmitting the current data to the first node corresponding to the communication link with the smallest transmission delay time comprises:
determining one relay link with the minimum transmission delay time as a first relay link;
when the transmission delay time of the first relay link is less than that of the through link, determining a node in the first relay link, which is communicated with the current node, as the first node, and sending the current data to the first node by adopting the first relay link;
and when the transmission delay time of the first relay link is greater than or equal to the transmission delay time of the direct link, determining a target node communicated with the current node in the direct link as the first node, and sending the current data to the first node by adopting the direct link.
6. A node for data transmission, comprising:
the device comprises an acquisition unit, a processing unit and a processing unit, wherein the acquisition unit is used for acquiring the speed information of each node which does not receive the current data initiated by a source node in a data network with nodes intercommunicated;
the determining unit is used for determining the transmission delay time of each communication link communicated with the node according to the acquired speed information of each node;
and a transmission unit, configured to transmit the current data to a first node corresponding to the communication link with the smallest transmission delay time, so that the first node transmits the current data until the current data reaches a target node.
7. The node of claim 6,
the obtaining unit is specifically configured to send a detection data packet to each node that does not receive current data initiated by the source node in the data network, and obtain speed information of the corresponding node from a detection feedback data packet fed back by each node.
8. The node of claim 6,
the determining unit is specifically configured to determine, according to bandwidth information in the acquired speed information of each node, a node other than the target node and having the remaining bandwidth as a transit node, and obtain, according to delay information in the speed information of each transit node, transmission delay time of each corresponding relay link between the node and each transit node; and the number of the first and second groups,
and obtaining the transmission delay time of the through link between the node and the target node according to the delay information in the speed information of the target node.
9. The node of claim 6,
the transmission unit is specifically configured to determine a relay link with the smallest transmission delay time as a first relay link;
when the transmission delay time of the first relay link is less than that of the through link, determining a node in the first relay link, which is communicated with the node, as the first node, and sending the current data to the first node by adopting the first relay link; and the number of the first and second groups,
and when the transmission delay time of the first relay link is greater than or equal to the transmission delay time of the direct link, determining a target node communicated with the node in the direct link as the first node, and sending the current data to the first node by adopting the direct link.
10. A data network for data transmission, comprising: at least three intercommunicating nodes according to any of claims 6-9.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2013100978240A CN103138894A (en) | 2013-03-25 | 2013-03-25 | Method and nodes and data network of data transmission |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2013100978240A CN103138894A (en) | 2013-03-25 | 2013-03-25 | Method and nodes and data network of data transmission |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN103138894A true CN103138894A (en) | 2013-06-05 |
Family
ID=48498258
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2013100978240A Pending CN103138894A (en) | 2013-03-25 | 2013-03-25 | Method and nodes and data network of data transmission |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103138894A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104768078A (en) * | 2015-04-16 | 2015-07-08 | 无锡天脉聚源传媒科技有限公司 | Video transmission method and system |
| CN108574733A (en) * | 2018-03-23 | 2018-09-25 | 网易有道信息技术（北京）有限公司 | Network agent method and device, storage medium and electronic equipment |
| CN109769139A (en) * | 2018-11-23 | 2019-05-17 | 深圳秦云网科技有限公司 | A kind of method and device of transmitting video data |
| CN113162829A (en) * | 2021-05-19 | 2021-07-23 | 北京安信智通科技有限公司 | Method and device for determining transmission delay and storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101729589A (en) * | 2008-10-14 | 2010-06-09 | 北京大学 | Method and system for improving end-to-end data transmission rate |
| CN101969396A (en) * | 2010-09-02 | 2011-02-09 | 北京邮电大学 | Time delay and bandwidth resource-based relay selection method |
| CN102281179A (en) * | 2011-06-27 | 2011-12-14 | 上海安达通信息安全技术股份有限公司 | VPN tunnel relay acceleration technology |
| CN102571856A (en) * | 2010-12-17 | 2012-07-11 | 中国移动通信集团公司 | Method, device and system for selecting transition node |
| CN102769605A (en) * | 2011-05-05 | 2012-11-07 | 中国移动通信集团设计院有限公司 | A method and device for determining a relay circuit |
-
2013
- 2013-03-25 CN CN2013100978240A patent/CN103138894A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101729589A (en) * | 2008-10-14 | 2010-06-09 | 北京大学 | Method and system for improving end-to-end data transmission rate |
| CN101969396A (en) * | 2010-09-02 | 2011-02-09 | 北京邮电大学 | Time delay and bandwidth resource-based relay selection method |
| CN102571856A (en) * | 2010-12-17 | 2012-07-11 | 中国移动通信集团公司 | Method, device and system for selecting transition node |
| CN102769605A (en) * | 2011-05-05 | 2012-11-07 | 中国移动通信集团设计院有限公司 | A method and device for determining a relay circuit |
| CN102281179A (en) * | 2011-06-27 | 2011-12-14 | 上海安达通信息安全技术股份有限公司 | VPN tunnel relay acceleration technology |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104768078A (en) * | 2015-04-16 | 2015-07-08 | 无锡天脉聚源传媒科技有限公司 | Video transmission method and system |
| CN108574733A (en) * | 2018-03-23 | 2018-09-25 | 网易有道信息技术（北京）有限公司 | Network agent method and device, storage medium and electronic equipment |
| CN109769139A (en) * | 2018-11-23 | 2019-05-17 | 深圳秦云网科技有限公司 | A kind of method and device of transmitting video data |
| CN113162829A (en) * | 2021-05-19 | 2021-07-23 | 北京安信智通科技有限公司 | Method and device for determining transmission delay and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109067617B (en) | V2X protocol consistency test method, device and system | |
| KR101896905B1 (en) | Network access method and apparatus | |
| KR20080102279A (en) | Repeater for Multiple Wireless Access | |
| CN111480374A (en) | Data packet transmission method and device | |
| CN111083647B (en) | Block chain service data transmission method and system based on mobile terminal | |
| CN103138894A (en) | Method and nodes and data network of data transmission | |
| US12294873B2 (en) | Redundant session establishment method and apparatus, radio bearer establishment method and apparatus, and nodes, terminal, and medium | |
| CN106533826A (en) | Network state detection method and system | |
| CN102882704A (en) | Link protection method and apparatus in soft restart upgrade process of ISSU (in-service software upgrade) | |
| CN103731376A (en) | Method and system for selecting chain aggregation root ports on stacked equipment | |
| CN113261249A (en) | Data transmission method, related equipment and computer storage medium | |
| CN107079480A (en) | A kind of transmission method of control information, transmitting terminal and receiving terminal | |
| WO2022160864A1 (en) | Network access method and apparatus for intelligent device, and intelligent device | |
| CN107454659A (en) | A kind of terminal identification method, system, terminal device and base station | |
| US20160087814A1 (en) | Wireless-communication quality-information processing device and communication system | |
| CN108055172A (en) | A kind of bidirectional forwarding detection (BFD) method and device | |
| CN105207752A (en) | Signal transmitting and detecting method and device | |
| US10079893B2 (en) | M2M application request sending method, CSE and system | |
| CN109672998B (en) | Bluetooth on-line establishing method | |
| CN116684836A (en) | Method, device, equipment and readable storage medium for operating computing power network | |
| CN110430548A (en) | Data reissue method, apparatus, collector and storage medium | |
| CN111543087A (en) | Data-bearing identification allocation method, network node and computer storage medium | |
| KR101785821B1 (en) | Method of monitoring frame receiving in serial communication | |
| CN110169150A (en) | A kind of method for indicating position, the network equipment and the terminal device of synchronization signal block | |
| CN104113936A (en) | Method and device for discovering specified user equipment |
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: 20130605 |