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
- link
- transmission delay
- current data
- 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
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 Internet technical field, particularly a kind of method of transfer of data, node and data networkings.
Background technology
Through high speed development in recent years, the Internet has become the important tool of life, working and learning in informationized society.Along with the degree of dependence to the Internet is higher, requirement to its service quality is also just higher, yet each network operation unit of the Internet has a long way to go on network size, number of users and internet resource, the problem that interconnects of the Internet also reveals gradually, receives vast concern.
At present, can be by merging each regional the Internet broadband resource, and distributed software system and the Internet sensing technology, the intelligent data network that foundation is interconnected, this intelligent data network can be realized interconnecting between each network operation unit, and interconnecting between each urban area.In data network as shown in Figure 1, each node is to interconnect, for example: Beijing (the Internet Date Center of Internet data center, IDC) respectively with this data network in the intercommunication such as information centre (center Provider), Shanghai IDC, Wuxi IDC, Tianjing IDC, like this, data can be transmitted in two nodes of arbitrary intercommunication.
In above-mentioned data network, be intercommunication between node, present node can directly send to arbitrary destination node with data.But, straight-through link between two nodes between different geographical or heterogeneous networks unit of operation is because the reasons such as bandwidth or transmission delay cause transmission speed slower, therefore, in existing data network, the data transmission bauds between node can also further improve.
Summary of the invention
The invention provides a kind of method, node and data networkings of transfer of data, in order to improve the speed of transfer of data between node.
The invention provides a kind of method of transfer of data, comprising:
Present node obtains the velocity information of each node that did not receive the current data that source node sends in the data network of node intercommunication;
The velocity information of described each node that described present node basis is obtained, the transmission delay time of definite every communication link that is communicated with described present node;
Described present node is transferred to described current data the first node corresponding to one communication link of described transmission delay minimal time, carries out the transmission of described current data for described first node, until described current data arrives destination node.
In the data network of node intercommunication of the present invention, the node that will carry out the current data transmission is present node, and this present node may be the source node of the current data of initiation, may be also the arbitrary node except source node and destination node in data network.Like this, the communication link that is communicated with present node has many, by determining the transmission delay time of every communication link, present node only sends to current data the first node corresponding to one communication link of transmission delay minimal time, and this first node may be destination node, may be also destination node, if destination node data transmission procedure finishes, if not this first node continues the transmission current data, until current data arrives destination node.
As seen, when each present node carries out the current data transmission, only current data is sent to the first node corresponding to a communication link of transmission delay minimal time, namely select a communication link of transmission delay minimal time to carry out the transmission of current data, like this, avoided the employing transmission speed more slowly communication link carry out transfer of data, substantially idle node in data network is used and carry out transfer of data, not only improve the speed of transfer of data between node, also reasonably utilized the resource in data network.
In the embodiment of the present invention, the velocity information that described present node obtains each node that did not receive the current data that source node initiates in the data network of node intercommunication comprises:
Each node that described present node did not receive the current data that source node initiates in the described data network sends detecting data bag;
Described present node obtains the velocity information of corresponding node from the detecting feedback data packet that each node feeds back to.
As seen, by the detecting data bag, just can obtain the velocity information of each node in data network, thereby, can determine the communication link of the transmission delay minimal time that is communicated with present node, like this, do not need complicated Signalling exchange just can obtain velocity information, can not increase the burden of data network.
Described velocity information comprises: the bandwidth information of node and deferred message.
In the present invention, the transmission delay time of described definite every communication link that is communicated with described present node comprises:
According to the bandwidth information in the velocity information of each node that obtains, will be except described destination node and node determination that bandwidth left is arranged be transit node;
According to the deferred message in the velocity information of each transit node, obtain the transmission delay time of every repeated link corresponding between described present node and described each transit node;
According to the deferred message in the velocity information of described destination node, obtain the transmission delay time of the straight-through link between described present node and described destination node.
As seen, except destination node, the node that bandwidth left is arranged can be just transit node, could form repeated link with present node, be in the data network of node intercommunication, not that the node that is communicated with present node can form communication link with present node, could form communication link with present node by the node of bandwidth left.Like this, get rid of the node that there is no bandwidth left, reduced the number of times that calculates the transmission delay time of communication link, reduced taking resource.
In the present invention, described present node comprises first node corresponding to a communication link that described current data is transferred to described transmission delay minimal time:
First repeated link that is defined as with a repeated link of transmission delay minimal time;
When transmission delay time of described the first repeated link less than the transmission delay of described straight-through link during the time, be described first node with the node determination that is communicated with described present node in described the first repeated link, and adopt described the first repeated link that described current data is sent to described first node;
When the defeated delay time of described the first repeated link more than or equal to the transmission delay of described straight-through link during the time, the destination node that is communicated with described present node in described straight-through link is defined as described first node, and adopts described straight-through link that described current data is sent to described first node.
As seen, the transmission delay time of guaranteeing to have repeated link is less than the transmission delay of straight-through link during the time, just adopt repeated link to carry out transfer of data, and the transmission delay time that there is no a repeated link is less than the transmission delay of straight-through link during the time, adopt straight-through link to carry out transfer of data, like this, can be because of through transit node, transit node being caused transmission pressure, the transfer resource of further reasonable usage data network.
The invention provides a kind of node of transfer of data, comprising:
Acquiring unit, the data network that is used for obtaining the node intercommunication did not receive the velocity information of each node of the current data that source node initiates;
Determining unit is used for the velocity information according to described each node that obtains, the transmission delay time of definite every communication link that is communicated with this node;
Transmission unit for described current data being transferred to the first node corresponding to a communication link of described transmission delay minimal time, carries out the transmission of described current data for described first node, until described current data arrives destination node.
Wherein, described acquiring unit, each node of concrete current data for do not receive the source node initiation to described data network sends detecting data bag, and obtains the velocity information of corresponding node from the detecting feedback data packet that each node feeds back to.
Described determining unit, the concrete bandwidth information that is used for according to the velocity information of each node that obtains, will be except described destination node and node determination that bandwidth left is arranged be transit node, and according to the deferred message in the velocity information of each transit node, obtain the transmission delay time of every repeated link corresponding between described node and described each transit node; And,
According to the deferred message in the velocity information of described destination node, obtain the transmission delay time of the straight-through link between described node and described destination node.
Described transmission unit, concrete first repeated link that is defined as that is used for a repeated link of transmission delay minimal time;
When transmission delay time of described the first repeated link less than the transmission delay of described straight-through link during the time, be described first node with the node determination that is communicated with described node in described the first repeated link, and adopt described the first repeated link that described current data is sent to described first node; And,
When the defeated delay time of described the first repeated link more than or equal to the transmission delay of described straight-through link during the time, the destination node that is communicated with described node in described straight-through link is defined as described first node, and adopts described straight-through link that described current data is sent to described first node
as seen, present node in data network can get the velocity information of each node of the current data that did not receive the source node initiation in this data network, and according to the velocity information of each node that obtains, the transmission delay time of definite every communication link that is communicated with present node, thereby select the communication link of a transmission delay minimal time to carry out transfer of data, be about to first node corresponding to communication link that current data sends to the transmission delay minimal time, carry out the transmission of described current data for described first node, until described current data arrives destination node.Like this, the node in data network only sends to current data the first node corresponding to one communication link of transmission delay minimal time, reasonably utilizes the resource in data network, has improved the speed of transfer of data between node.
The invention provides a kind of data network of transfer of data, comprising: the node described above of at least three intercommunications.
Namely in this data network, node can select the communication link of a transmission delay minimal time to carry out transfer of data, thereby, avoided the employing transmission speed more slowly communication link carry out transfer of data, and, rationally utilize the node except destination node, make the resource in data network be utilized by maximum reasonable, and, the speed of transfer of data between node improved in this data network.
Other features and advantages of the present invention will be set forth in the following description, and, partly become apparent from specification, perhaps understand by implementing the present invention.Purpose of the present invention and other advantages can realize and obtain by specifically noted structure in the specification of writing, claims and accompanying drawing.
Below by drawings and Examples, technical scheme of the present invention is described in further detail.
Description of drawings
Accompanying drawing is used to provide a further understanding of the present invention, and consists of the part of specification, is used for together with embodiments of the present invention explaining the present invention, is not construed as limiting the invention.In the accompanying drawings:
Fig. 1 is the Organization Chart of the data network of node intercommunication in prior art;
Fig. 2 is the flow chart of transfer of data in the embodiment of the present invention one;
Fig. 3 is the flow chart of transfer of data in the embodiment of the present invention two;
Fig. 4 is the Organization Chart of the data network of node intercommunication in the embodiment of the present invention three;
Fig. 5 is the flow chart of transfer of data in the embodiment of the present invention three;
Fig. 6 is the structure chart of the node of transfer of data in the embodiment of the present invention.
Embodiment
Below in conjunction with accompanying drawing, the preferred embodiments of the present invention are described, should be appreciated that preferred embodiment described herein only is used for description and interpretation the present invention, is not intended to limit the present invention.
In the embodiment of the present invention, in the data network of node intercommunication, when present node sends data at need, obtain the velocity information of each node that did not receive these data in data network, then according to the velocity information of each node of obtaining, the transmission delay time of definite every communication link that is communicated with present node, and with this transfer of data to first node corresponding to a communication link of transmission delay minimal time, proceed the transmission of these data for first node, until current data arrives destination node.Like this, the communication link that at every turn carries out transfer of data is all the communication link of transmission delay minimal time, avoided the employing transmission speed more slowly communication link carry out transfer of data, improved the speed of transfer of data between node.
Embodiment one: referring to Fig. 2, the process of transfer of data comprises:
Step 201: present node obtains the velocity information of each node that did not receive the current data that source node initiates in the data network of node intercommunication.
Be coupled to each other during each node in data network and mutually can communicate by letter, the node that needs to send data is present node, and this present node may be the source node of initiating current data, may be also a node except destination node in this data network.
When present node carries out transfer of data, need obtain the velocity information of each node of the current data that did not receive the source node initiation in this data network.In present node and data network, other arbitrary nodes are all interconnected, and for avoiding repeating between two nodes to send, therefore, present node only need obtain the velocity information of each node of the current data that did not receive the source node initiation.
Particularly, present node can send the velocity information that detecting data bag obtains each node by each node to the current data that did not receive the source node initiation, comprising:
Present node did not receive each node transmission detecting data bag of the current data of source node initiation in data network, and obtained the velocity information of corresponding node from the detecting feedback data packet that each node feeds back to.
Wherein, velocity information comprises: the bandwidth information of node and deferred message.For example: bandwidth, utilization rate, the information such as delay.
Step 202: the velocity information of each node that the present node basis is obtained, the transmission delay time of definite every communication link that is communicated with present node.
Although do not receive each node intercommunication of the current data of source node initiation in present node and data network,, be not that each node and the present node that did not receive the current data of source node initiation can form communication link.In these nodes, only have except destination node and could form the communication link that is communicated with front nodal point with present node by the node of bandwidth left, therefore, determine that the transmission delay time of every communication link of being communicated with present node comprises:
According to the bandwidth information in the velocity information of each node that obtains, will be except destination node and node determination that bandwidth left is arranged be transit node, according to the deferred message in the velocity information of each transit node, obtain the transmission delay time of every repeated link corresponding between present node and each transit node;
According to the deferred message in the velocity information of destination node, obtain the transmission delay time of the straight-through link between present node and destination node.
Like this, get rid of the node that there is no bandwidth left, reduced the number that needs the communication link of calculating transmission delay time, reduced taking resource.
Step 203: present node is transferred to current data the first node corresponding to one communication link of transmission delay minimal time, carries out the transmission of current data for first node, until current data arrives destination node.
Present node has determined that the transmission delay of every communication link is after the time, can sort according to the transmission delay time, one communication link of transmission delay minimal time is determined not transmission link, and the node determination that this transmission link is corresponding is first node, thereby, by this transmission link, current data is sent to first node.
Particularly, with first repeated link that is defined as of a repeated link of transmission delay minimal time.
During the time, be first node with the node determination that is communicated with present node in the first repeated link, and adopt the first repeated link that current data is sent to first node less than the transmission delay that leads directly to link when the transmission delay time of the first repeated link.
When the defeated delay time of the first repeated link during the time, is defined as first node with the destination node that is communicated with present node in straight-through link more than or equal to the transmission delay of straight-through link, and adopts and lead directly to link current data is sent to first node.
As seen, no matter be repeated link or straight-through link, as long as transmission delay shortest time, just the communication link of correspondence can be carried out transfer of data as transmission link, like this, guaranteed all to adopt the communication link of transmission delay shortest time to carry out transfer of data at every turn, improved the speed of transfer of data between node.
In the present embodiment, first node may be the terminal point of this current data transmission, it is destination node, may not also destination node, therefore, when first node is not destination node, need to proceed the transmission of current data, its transmitting procedure as above, namely in transmitting procedure, first node has been present node, detailed process has been not repeated.When first node was destination node, current data had been reached home, and this transmitting procedure finishes.
embodiment two: in the data network of node intercommunication, initiate the source node of current data, need current data is sent to destination node, can carry out by the straight-through link between source node and destination node the transmission of current data, but should straight-through link fastest link not necessarily, the speed of the repeated link of source node and a transit node may be the fastest, so, source node can first send to transit node with current data, then send to by transit node destination node corresponding to faster link that is communicated with transit node 1, again or, source node can first send to current data transit node 1 corresponding to faster link that is communicated with source node, transit node 1 sends to current data transit node 2 corresponding to faster link that is communicated with transit node 1, last transit node 2 sends to current data destination node corresponding to faster link that is communicated with transit node 2, so analogize.Be that every minor node is all node corresponding to faster link that sends the data to connection, thereby improved the data transmission bauds between two nodes of data network.Concrete data transmission procedure comprises referring to Fig. 3:
Step 301: source node obtains the velocity information of each node that did not receive the current data that source node initiates in the data network of node intercommunication as present node.
At first send current data by source node, as a node in the data network of node intercommunication, this node can obtain the velocity information of arbitrary node in this network, here, because being sends current data first, therefore, obtain the velocity information of other each nodes of thinking except source node in data network.
Particularly, source node sends by each node in this data network the velocity information that the detecting data bag obtains corresponding node.
Step 302: the velocity information of each node that the present node basis is obtained, the transmission delay time of definite every communication link that is communicated with present node.
Here, can be at first according to the bandwidth information in the velocity information of each node, will be except destination node and node determination that bandwidth left is arranged be transit node, according to the deferred message in the velocity information of each transit node, obtain the transmission delay time of every repeated link corresponding between present node and each transit node;
According to the deferred message in the velocity information of destination node, obtain the transmission delay time of the straight-through link between present node and destination node.
Step 303: present node is transferred to current data the first node corresponding to one communication link of transmission delay minimal time.
The transmission delay time with definite communication link sorts, and selects a communication link of transmission delay minimal time to carry out the transmission of current data, and the node that a communication link of this transmission delay minimal time is corresponding is first node.
Step 304: judge whether first node is destination node, if, this current data end of transmission, if not, execution in step 305.
Particularly, after first node receives current data, can determine whether this address information is the address information of this node according to the address information of carrying in current data, if this current data end of transmission is if not execution in step 305.
Perhaps, judged by the present node in previous step whether the address information of the address information territory first node that carries in current data mates, if coupling, this current data end of transmission, if do not mate, execution in step 305.
Certainly, can also there be other existing method to determine that whether first node is destination node, just has been not repeated.
Step 305: first node obtains the velocity information of each node that did not receive the current data that source node initiates in the data network of node intercommunication as present node, and returns to step 302.
Because first node is not destination node, therefore, first node need be proceeded the transmission of current data, for avoiding being transferred to the node of repetition, here, only need obtain the velocity information of each node of the current data that did not receive the source node initiation in data network, follow-up data transmission procedure can be again from step 302, until current data has been transferred to destination node.
As seen, in the present embodiment, every minor node is all node corresponding to faster link that sends the data to connection, and the transit node that bandwidth left is arranged can be used the participation transfer of data, therefore, not only improve the data transmission bauds between two nodes of data network, also reasonably utilized the resource in the data network.
Embodiment three: source node is in sending to the process of destination node with current data, can use one, two or a plurality of transit node, still, use transit node more, easilier cause transmission pressure to transit node, therefore, can be according to the scale of data network, the information such as performance, number to maximum use transit nodes limits, for example: can only use at most two transit nodes, perhaps, use at most three transit nodes.
In this enforcement, use the minimum data network to be described, as shown in Figure 4, this data network comprises the node of three intercommunications, is respectively Beijing IDC, three nodes of Wuxi IDC and Liaoning IDC.Beijing IDC initiates current data, need finally be sent to Wuxi IDC, and concrete data transmission procedure comprises referring to Fig. 5:
Step 501:Beijing IDC obtains respectively the velocity information of Wuxi IDC and Liaoning IDC.
Whether step 502:Beijing IDC judges Liaoning IDC for the remaining node in broadband is arranged according to the wide-band-message in the velocity information of Liaoning IDC, if having, and execution in step 503, otherwise, execution in step 509.
Step 503:Beijing IDC determines that according to the delayed data in the velocity information of Liaoning IDC Beijing IDC is to the transmission delay time of the repeated link of Liaoning IDC.
Here, can calculate Beijing IDC to transmission delay time of the repeated link of Liaoning IDC be 10ms.
Step 504:Beijing IDC determines that according to the delayed data in the velocity information of Wuxi IDC Beijing IDC is to the transmission delay time of the straight-through link of Wuxi IDC.
Here, can calculate Beijing IDC to transmission delay time of the straight-through link of WuxiIDC be 70ms.
Step 505:Beijing IDC selects Beijing IDC to the repeated link of Liaoning IDC, current data to be sent to Liaoning IDC.
Less than the transmission delay time 70ms of Beijing IDC to the straight-through link of Wuxi IDC, therefore, Beijing IDC sends to Liaoning IDC with current data to Beijing IDC to the transmission delay time 10ms of the repeated link of Liaoning IDC.
Step 506:Liaoning IDC obtains the velocity information of Wuxi IDC.
Step 507:Liaoning IDC determines that according to the delayed data in the velocity information of Wuxi IDC Liaoning IDC is to the transmission delay time of the communication link of Wuxi IDC.
Here, calculate to obtain Liaoning IDC to transmission delay time of the communication link of Wuxi IDC be 10ms.
Step 508:Liaoning IDC sends to Wuxi IDC with current data, and this data transmission procedure finishes.
Owing to having only had a communication link, therefore, the communication link of transmission delay minimal time has been exactly Liaoning IDC to the communication link of Wuxi IDC.
Step 509:Beijing IDC sends to Wuxi IDC with current data, and this flow process finishes.
Because Liaoning IDC does not have remaining bandwidth, can there is no other transit node in this enforcement as transit node, Beijing IDC can only directly send to current data Wuxi IDC.
In the present embodiment, Beijing IDC sends to Liaoning IDC with current data, then Liaoning IDC with current data send Wuxi IDC altogether the transmission delay time of cost be 20ms, less than Beijing IDC, current data is directly sent to the defeated delay time 70ms of Wuxi IDC cost.As seen, adopt the described data transmission method of the embodiment of the present invention can avoid adopting transmission speed more slowly communication link carry out transfer of data, substantially idle node in data network is used and carry out transfer of data, not only improve the speed of transfer of data between node, also reasonably utilized the resource in data network.
According to the process of above-mentioned transfer of data, can build a kind of node of transfer of data, as shown in Figure 6, this node comprises: acquiring unit 610, determining unit 620 and transmission unit 6300.Wherein,
Acquiring unit 610, the data network that is used for obtaining the node intercommunication did not receive the velocity information of each node of the current data that source node initiates;
Determining unit 620 is used for the velocity information according to each node that obtains, the transmission delay time of definite every communication link that is communicated with this node.
Particularly, acquiring unit 610, each node of concrete current data for do not receive the source node initiation to data network sends detecting data bag, and obtains the velocity information of corresponding node from the detecting feedback data packet that each node feeds back to.
Determining unit 620, the concrete bandwidth information that is used for according to the velocity information of each node that obtains, will be except destination node and node determination that bandwidth left is arranged be transit node, and according to the deferred message in the velocity information of each transit node, obtain the transmission delay time of every repeated link corresponding between this node and each transit node; And,
According to the deferred message in the velocity information of destination node, obtain the transmission delay time of the straight-through link between this node and destination node.
During the time, be first node with the node determination that is communicated with this node in the first repeated link, and adopt the first repeated link that current data is sent to first node less than the transmission delay that leads directly to link when the transmission delay time of the first repeated link; And,
When the defeated delay time of the first repeated link during the time, is defined as first node with the destination node that is communicated with this node in straight-through link more than or equal to the transmission delay of straight-through link, and adopts and lead directly to link current data is sent to first node.
In embodiments of the present invention, when node carries out transfer of data at every turn, select the communication link of minimum transfer delay time to carry out transfer of data, until data waiting for transmission arrive destination node.
The node of above-mentioned transfer of data, can be applicable in the data network of node intercommunication, this data network comprises at least three above-mentioned nodes, intercommunication between each node, namely the arbitrary node in this data network is when carrying out transfer of data, select the communication link of minimum transfer delay time to carry out transfer of data, like this, the speed of transfer of data between having improved between node, also substantially idle node in data network is used and carry out transfer of data, reasonably utilize the resource in data network.
Those skilled in the art should understand, embodiments of the invention can be provided as method, system or computer program.Therefore, the present invention can adopt complete hardware implementation example, implement software example or in conjunction with the form of the embodiment of software and hardware aspect fully.And the present invention can adopt the form that wherein includes the upper computer program of implementing of computer-usable storage medium (including but not limited to magnetic disc store and optical memory etc.) of computer usable program code one or more.
The present invention is that reference is described according to flow chart and/or the block diagram of method, equipment (system) and the computer program of the embodiment of the present invention.Should understand can be by the flow process in each flow process in computer program instructions realization flow figure and/or block diagram and/or square frame and flow chart and/or block diagram and/or the combination of square frame.Can provide these computer program instructions to the processor of all-purpose computer, special-purpose computer, Embedded Processor or other programmable data processing device to produce a machine, make the instruction of carrying out by the processor of computer or other programmable data processing device produce to be used for the device of realizing in the function of flow process of flow chart or a plurality of flow process and/or square frame of block diagram or a plurality of square frame appointments.
These computer program instructions also can be stored in energy vectoring computer or the computer-readable memory of other programmable data processing device with ad hoc fashion work, make the instruction that is stored in this computer-readable memory produce the manufacture that comprises command device, this command device is realized the function of appointment in flow process of flow chart or a plurality of flow process and/or square frame of block diagram or a plurality of square frame.
These computer program instructions also can be loaded on computer or other programmable data processing device, make on computer or other programmable devices and to carry out the sequence of operations step producing computer implemented processing, thereby be provided for realizing the step of the function of appointment in flow process of flow chart or a plurality of flow process and/or square frame of block diagram or a plurality of square frame in the instruction of carrying out on computer or other programmable devices.
Obviously, those skilled in the art can carry out various changes and modification and not break away from the spirit and scope of the present invention the present invention.Like this, if within of the present invention these are revised and modification belongs to the scope of claim of the present invention and equivalent technologies thereof, the present invention also is intended to comprise these changes and modification interior.
Claims (10)
1. the method for a transfer of data, is characterized in that, comprising:
Present node obtains the velocity information of each node that did not receive the current data that source node initiates in the data network of node intercommunication;
The velocity information of described each node that described present node basis is obtained, the transmission delay time of definite every communication link that is communicated with described present node;
Described present node is transferred to described current data the first node corresponding to one communication link of described transmission delay minimal time, carries out the transmission of described current data for described first node, until described current data arrives destination node.
2. the method for claim 1, is characterized in that, the velocity information that described present node obtains each node that did not receive the current data that source node initiates in the data network of node intercommunication comprises:
Each node that described present node did not receive the current data that source node initiates in the described data network sends detecting data bag;
Described present node obtains the velocity information of corresponding node from the detecting feedback data packet that each node feeds back to.
3. method as claimed in claim 1 or 2, is characterized in that, described velocity information comprises: the bandwidth information of node and deferred message.
4. the method for claim 1, is characterized in that, the transmission delay time of described definite every communication link that is communicated with described present node comprises:
According to the bandwidth information in the velocity information of each node that obtains, will be except described destination node and node determination that bandwidth left is arranged be transit node;
According to the deferred message in the velocity information of each transit node, obtain the transmission delay time of every repeated link corresponding between described present node and described each transit node;
According to the deferred message in the velocity information of described destination node, obtain the transmission delay time of the straight-through link between described present node and described destination node.
5. method as claimed in claim 4, is characterized in that, described present node comprises first node corresponding to a communication link that described current data is transferred to described transmission delay minimal time:
A repeated link of transmission delay minimal time is defined as the first repeated link;
When transmission delay time of described the first repeated link less than the transmission delay of described straight-through link during the time, be described first node with the node determination that is communicated with described present node in described the first repeated link, and adopt described the first repeated link that described current data is sent to described first node;
When the defeated delay time of described the first repeated link more than or equal to the transmission delay of described straight-through link during the time, the destination node that is communicated with described present node in described straight-through link is defined as described first node, and adopts described straight-through link that described current data is sent to described first node.
6. the node of a transfer of data, is characterized in that, comprising:
Acquiring unit, the data network that is used for obtaining the node intercommunication did not receive the velocity information of each node of the current data that source node initiates;
Determining unit is used for the velocity information according to described each node that obtains, the transmission delay time of definite every communication link that is communicated with this node;
Transmission unit for described current data being transferred to the first node corresponding to a communication link of described transmission delay minimal time, carries out the transmission of described current data for described first node, until described current data arrives destination node.
7. node as claimed in claim 6, is characterized in that,
Described acquiring unit, each node of concrete current data for do not receive the source node initiation to described data network sends detecting data bag, and obtains the velocity information of corresponding node from the detecting feedback data packet that each node feeds back to.
8. node as claimed in claim 6, is characterized in that,
Described determining unit, the concrete bandwidth information that is used for according to the velocity information of each node that obtains, will be except described destination node and node determination that bandwidth left is arranged be transit node, and according to the deferred message in the velocity information of each transit node, obtain the transmission delay time of every repeated link corresponding between described node and described each transit node; And,
According to the deferred message in the velocity information of described destination node, obtain the transmission delay time of the straight-through link between described node and described destination node.
9. node as claimed in claim 6, is characterized in that,
Described transmission unit, concrete first repeated link that is defined as that is used for a repeated link of transmission delay minimal time;
When transmission delay time of described the first repeated link less than the transmission delay of described straight-through link during the time, be described first node with the node determination that is communicated with described node in described the first repeated link, and adopt described the first repeated link that described current data is sent to described first node; And,
When the defeated delay time of described the first repeated link more than or equal to the transmission delay of described straight-through link during the time, the destination node that is communicated with described node in described straight-through link is defined as described first node, and adopts described straight-through link that described current data is sent to described first node.
10. the data network of a transfer of data, is characterized in that, comprising: at least three intercommunications as the described node of arbitrary claim in claim 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 | ***通信集团设计院有限公司 | Method and apparatus for determining 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 | ***通信集团设计院有限公司 | Method and apparatus for determining 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 |
|---|---|---|
| CN107979592B (en) | Method and device for sending service request message | |
| CN103096372B (en) | A kind of method and apparatus for calculating beamforming factor in handoff procedure | |
| KR20190039245A (en) | QoS parameter processing method and apparatus in a handover scenario | |
| CN104301066A (en) | Data packet transmission method and device | |
| EP3142442A1 (en) | Method, device and system for controlling air interface resources | |
| CN103138894A (en) | Method and nodes and data network of data transmission | |
| EP3562204A1 (en) | Method and apparatus for selecting user plane anchor | |
| CN104541536B (en) | Method, user equipment and base station for detecting device to device signals | |
| CN110177097A (en) | Data transmission method, apparatus and system | |
| US20220200742A1 (en) | Method for Determining HARQ Feedback Resource, Apparatus, and System | |
| KR20110071884A (en) | Apparatus and method for providing wireless data resource in wireless communication system | |
| CN108418696B (en) | Gateway charging method and gateway | |
| CN104301237A (en) | Data subscription and distribution method applicable to delay-tolerant and disconnection-tolerant network | |
| TWI778962B (en) | Device-to-device (d2d) communication method and d2d device | |
| CN102932820A (en) | Link processing method, device and system | |
| CN103441931A (en) | Message sending method and device | |
| CN114126085B (en) | Industrial field bus communication method and device, electronic equipment and storage medium | |
| CN113261249A (en) | Data transmission method, related equipment and computer storage medium | |
| CN102083155B (en) | Bearer admission processing method in S1 interface switching process and mobility management entity | |
| CN103636157A (en) | Method and device for sending ACK information | |
| CN106658532A (en) | Multi-subnode large-scale networking method based on 2.4GHz wireless technology | |
| CN103516502B (en) | The calculating system and method for DCCH multi-channel protocol throughput | |
| CN108886705A (en) | A kind of signal transmission method and equipment | |
| CN109429215B (en) | Data transmission method, related device and computer readable storage medium | |
| CN108293210A (en) | A kind of cell switching method and 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 |