CN105933230A - Multi-node data transmission method, node and computer system - Google Patents
Multi-node data transmission method, node and computer system Download PDFInfo
- Publication number
- CN105933230A CN105933230A CN201610202527.1A CN201610202527A CN105933230A CN 105933230 A CN105933230 A CN 105933230A CN 201610202527 A CN201610202527 A CN 201610202527A CN 105933230 A CN105933230 A CN 105933230A
- Authority
- CN
- China
- Prior art keywords
- node
- destination node
- numerical value
- label
- message
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/50—Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/50—Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]
- H04L45/507—Label distribution
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/80—Actions related to the user profile or the type of traffic
- H04L47/805—QOS or priority aware
Abstract
The invention provides a multi-node data transmission method, nodes and a computer system, and the method comprises the steps: a corresponding label is arranged for the connection between a present node and each external node, and a value of each label in the present node is configured; when a to-be-transmitted message is acquired, a destination node is determined according to the to-be-transmitted message; the value of the label corresponding to the destination node in the present node is determined; and the to-be-transmitted message is sent to the destination node according to the value. According to the scheme, the transmission efficiency of the message between the nodes can be improved.
Description
Technical field
The present invention relates to field of computer technology, particularly to data transmission method, the joint of a kind of multinode
Point and computer system.
Background technology
Along with the development of server application, the application demand of multinode high-end server has been entered
Enter an important stage.Wherein, in multi-node computer system, general by interconnection between node
Chip realizes interconnection, and carries out internodal data transmission by interconnection die.And interconnection die transporting
Can be limited, if interconnection die is beyond its transmission performance, the efficiency of transmission of whole system may be affected.
Summary of the invention
Embodiments provide the data transmission method of a kind of multinode, node and computer system,
To realize the transmission of internodal data.
First aspect, embodiments provides the data transmission method of a kind of multinode, is working as prosthomere
Point arranges corresponding label for each coupled external node, every in this present node
The numerical value of one label configures;Also include:
When getting message to be transmitted, determine destination node according to described message to be transmitted;
Determine the numerical value of label corresponding with described destination node in present node;
According to the numerical value of label corresponding with described destination node in this present node, by described report to be transmitted
Literary composition is sent to described destination node.
Wherein, the described numerical value according to label corresponding with described destination node in this present node, by institute
State message to be transmitted and be sent to described destination node, including: in this prior in node with described destination node
When the numerical value of corresponding label is more than 0, then described message to be transmitted is sent to described destination node,
When the numerical value of label corresponding with described destination node is equal to 0 in this present node, then waits and deserve prosthomere
When in point, the numerical value of label corresponding with described destination node is more than 0, described message to be transmitted is sent to
Described destination node;
Described described message to be transmitted is sent to described destination node after, farther include: should
In present node, the numerical value of label corresponding with described destination node subtracts 1;
Farther include: when receiving the response message that described destination node returns, by this present node
In the numerical value of label corresponding with described destination node add 1.
Wherein, the described numerical value to each label in this present node configures, including:
As follows the numerical value of each target labels in present node is configured:
Determine the destination node corresponding with described target labels can the maximum message segment number of parallel processing, and
Determine the node number being connected with described destination node, and according to this maximum message segment number determined and this joint
The numerical value of described target labels is configured, wherein, each with what described destination node was connected by some number
In individual node, the numerical value summation of the label for described destination node of configuration is not more than described maximum message segment
Number.
Wherein, farther include:
When often arriving the first time period of setting, for the number of each target labels in this present node
Value is adjusted as follows:
Determine the destination node corresponding with described target labels can the maximum message segment number of parallel processing, and
Within second time period in past, each node being connected with described destination node is sent out to described destination node
Deliver newspaper the number of literary composition, and the node being connected with described destination node with each according to this maximum message segment number
Send the number of message to described destination node, adjust in each node being connected with described destination node
Numerical value for the label of described destination node.
Wherein, when the destination node determined includes multiple, described described message to be transmitted is sent to institute
State destination node, including:
Determine the priority of each described destination node;
Described message to be transmitted is sent to the highest and corresponding label in present node the numerical value of priority
Destination node more than 0.
Second aspect, embodiments provides a kind of node, including:
Unit is set, for arranging corresponding label for each external node self being connected and deposit
Storage;
Dispensing unit, for configuring the numerical value of each label of self storage;
First determines unit, for when getting message to be transmitted, determines according to described message to be transmitted
Destination node;
Second determines unit, for determining the numerical value of the label corresponding with described destination node self stored;
Transmitting element, for the numerical value of the label corresponding with described destination node according to self storage, will
Described message to be transmitted is sent to described destination node.
Wherein, described transmitting element, specifically for corresponding with described destination node in node in this prior
When the numerical value of label is more than 0, then described message to be transmitted is sent to described destination node, in this prior
In node the numerical value of label corresponding with described destination node equal to 0 time, then wait in this present node with
When the numerical value of the corresponding label of described destination node is more than 0, described message to be transmitted is sent to described mesh
Node, and perform terminate after trigger processing unit perform by this present node with described destination node
The operation that the numerical value of corresponding label subtracts 1;
Farther include: receive unit, for receiving the response message that described destination node returns, and
Execution triggers described processing unit and performs mark corresponding with described destination node in this present node after terminating
The operation that the numerical value signed adds 1.
Wherein, described dispensing unit, specifically for as follows to each target in present node
The numerical value of label configures: determine the destination node corresponding with described target labels can parallel processing
Big message number, and determine the node number being connected with described destination node, and according to determine this
The numerical value of described target labels is configured, wherein, with described by big message number and this node number
In each node that destination node is connected, the numerical value summation of the label for described destination node of configuration is little
In described maximum message segment number;
And/or,
Farther include: adjustment unit, for when often arriving the first time period of setting, for deserving
In front nodal point, the numerical value of each target labels is adjusted as follows: determine and described target mark
Sign corresponding destination node can the maximum message segment number of parallel processing, and within second time period in past
Each node being connected with described destination node to described destination node send message number, and according to
This maximum message segment number sends report with each node being connected with described destination node to described destination node
The number of literary composition, adjusts the mark for described destination node in each node being connected with described destination node
The numerical value signed.
Wherein, described transmitting element, specifically for determining, described first, the destination node bag that unit determines
When including multiple, determine the priority of each described destination node;Described message to be transmitted is sent to excellent
First the highest and corresponding label in present node the numerical value of the level destination node more than 0.
The third aspect, the embodiment of the present invention additionally provides a kind of computer system, above-mentioned including at least two
Arbitrary described node.
Embodiments provide the data transmission method of a kind of multinode, node and computer system,
By arranging corresponding label for each coupled external node in node, and to each
The numerical value of label configures, between node when carrying out message transmissions, and can be according to the numerical value of this label
Realize transmission, such that it is able to improve the efficiency of data transmission.
Accompanying drawing explanation
In order to be illustrated more clearly that the embodiment of the present invention or technical scheme of the prior art, below will be to reality
Execute the required accompanying drawing used in example or description of the prior art to be briefly described, it should be apparent that below,
Accompanying drawing in description is some embodiments of the present invention, for those of ordinary skill in the art, not
On the premise of paying creative work, it is also possible to obtain other accompanying drawing according to these accompanying drawings.
Fig. 1 is a kind of method flow diagram that one embodiment of the invention provides;
Fig. 2 is a kind of node structure schematic diagram that one embodiment of the invention provides;
Fig. 3 is the another kind of node structure schematic diagram that one embodiment of the invention provides;
Fig. 4 is a kind of Computer Systems Organization schematic diagram that one embodiment of the invention provides;
Fig. 5 is the another kind of method flow diagram that one embodiment of the invention provides.
Detailed description of the invention
For making the purpose of the embodiment of the present invention, technical scheme and advantage clearer, below in conjunction with this
Accompanying drawing in bright embodiment, is clearly and completely described the technical scheme in the embodiment of the present invention,
Obviously, described embodiment is a part of embodiment of the present invention rather than whole embodiments, based on
Embodiment in the present invention, those of ordinary skill in the art are institute on the premise of not making creative work
The every other embodiment obtained, broadly falls into the scope of protection of the invention.
As it is shown in figure 1, embodiments provide the data transmission method of a kind of multinode, the method
May comprise steps of:
Step 101: in present node, corresponding mark is set for each coupled external node
Sign;
Step 102: the numerical value of each label in this present node is configured;
Step 103: when getting message to be transmitted, determines destination node according to described message to be transmitted;
Step 104: determine the numerical value of label corresponding with described destination node in present node;
Step 105: according to the numerical value of label corresponding with described destination node in this present node, by institute
State message to be transmitted and be sent to described destination node.
The scheme provided according to above-described embodiment, by node for outside coupled each
Node arranges corresponding label, and configures the numerical value of each label, is reporting between node
During literary composition transmission, can transmit according to the Numerical Implementation of this label, such that it is able to improve the efficiency of data transmission.
In an embodiment of the invention, described according to corresponding with described destination node in this present node
The numerical value of label, is sent to described destination node by described message to be transmitted, including: node in this prior
In label corresponding with described destination node numerical value more than 0 time, then described message to be transmitted is sent to
Described destination node, when in node, the numerical value of label corresponding with described destination node is equal to 0 in this prior,
Then wait when the numerical value of label corresponding with described destination node is more than 0 in this present node, treat described
Transmission message is sent to described destination node;
Described described message to be transmitted is sent to described destination node after, farther include: should
In present node, the numerical value of label corresponding with described destination node subtracts 1;
Farther include: when receiving the response message that described destination node returns, by this present node
In the numerical value of label corresponding with described destination node add 1.
The scheme provided according to above-described embodiment, the numerical value of this label be i.e. this present node can simultaneously to
This label corresponding node sends the number of message, and present node often sends a message to destination node, then
By to the label numerical value of destination node subtracting 1, show the message that currently can send to destination node
Number reduces one, after receiving the response message that destination node returns, then by should destination node
Label numerical value adds 1, the most currently can increase by one to the message number that destination node sends, so,
The congestion problems caused too much due to the message number sent to destination node simultaneously can be avoided, improve
The transmission performance of message.
In an embodiment of the invention, the described numerical value to each label in this present node is carried out
Configuration, including:
As follows the numerical value of each target labels in present node is configured:
Determine the destination node corresponding with described target labels can the maximum message segment number of parallel processing, and
Determine the node number being connected with described destination node, and according to this maximum message segment number determined and this joint
The numerical value of described target labels is configured, wherein, each with what described destination node was connected by some number
In individual node, the numerical value summation of the label for described destination node of configuration is not more than described maximum message segment
Number.
According to the scheme of above-described embodiment, according to destination node can the maximum message segment number of parallel processing, right
In each node being connected with this destination node, the numerical value for the label of this destination node configures,
Make all nodes being connected with this destination node are respectively directed to the numerical value sum of the label of this destination node,
Be not more than this destination node can the maximum message segment number of parallel processing, thereby may be ensured that this destination node energy
Enough satisfied process to coupled all nodes to the message that it transmits, thus avoid message transmissions
Block up.
In an embodiment of the invention, in different time sections, there may be the transmission of message between node
Measure different problems, therefore, when often arriving the first time period of setting, for every in this present node
The numerical value of one target labels is adjusted as follows:
Determine the destination node corresponding with described target labels can the maximum message segment number of parallel processing, and
Within second time period in past, each node being connected with described destination node is sent out to described destination node
Deliver newspaper the number of literary composition, and the node being connected with described destination node with each according to this maximum message segment number
Send the number of message to described destination node, adjust in each node being connected with described destination node
Numerical value for the label of described destination node.
The scheme provided according to above-described embodiment, is possible not only to realize every a first time period each
In node, the numerical value of label once adjusts, it is also possible to realize label according to inter-node transmission quantities of messages
The configuration of numerical value, thus ensure the optimal performance of message transmissions.
In an embodiment of the invention, may be by many for the message transmissions between two nodes
Paths is transmitted, and each paths potentially includes at least two node, therefore, at the mesh determined
Node when including multiple, described described message to be transmitted is sent to described destination node, including: really
The priority of each described destination node fixed;Described message to be transmitted is sent to priority the highest and
The numerical value of the corresponding label destination node more than 0 in present node.Such that it is able to improve the transmission of message
Efficiency.
As in figure 2 it is shown, embodiments provide a kind of node, this node may include that
Unit 201 is set, for arranging corresponding label for each external node self being connected
And store;
Dispensing unit 202, for configuring the numerical value of each label of self storage;
First determines unit 203, for when getting message to be transmitted, according to described message to be transmitted
Determine destination node;
Second determines unit 204, for determining the label corresponding with described destination node that self store
Numerical value;
Transmitting element 205, for the numerical value of the label corresponding with described destination node according to self storage,
Described message to be transmitted is sent to described destination node.
In an embodiment of the invention, described transmitting element 205, specifically in node in this prior
When the numerical value of label corresponding with described destination node is more than 0, then described message to be transmitted is sent to institute
State destination node, when in node, the numerical value of label corresponding with described destination node is equal to 0 in this prior,
Then wait when the numerical value of label corresponding with described destination node is more than 0 in this present node, treat described
Transmission message is sent to described destination node, and it is current by this to trigger processing unit execution after performing to terminate
The operation that in node, the numerical value of label corresponding with described destination node subtracts 1;
Refer to Fig. 3, in an embodiment of the invention, this node may further include: receives single
Unit 301, for receiving the response message that described destination node returns, and triggers described after performing to terminate
Processing unit performs the operation adding 1 by the numerical value of label corresponding with described destination node in this present node.
In an embodiment of the invention, described dispensing unit 202, specifically for the most right
In present node, the numerical value of each target labels configures: determine the mesh corresponding with described target labels
Mark node can the maximum message segment number of parallel processing, and determine that the node being connected with described destination node is individual
Count, and the numerical value of described target labels is carried out by this maximum message segment number and this node number according to determining
Configuration, wherein, in each node being connected with described destination node configure for described destination node
The numerical value summation of label be not more than described maximum message segment number;
Refer to Fig. 3, in an embodiment of the invention, this node may further include: adjusts single
Unit 302, for when often arriving the first time period of setting, for each target in this present node
The numerical value of label is adjusted as follows: determine that the destination node corresponding with described target labels can
The maximum message segment number of parallel processing, and each saves with described target within second time period in past
The node that point is connected sends the number of message to described destination node, and according to this maximum message segment number with every
One node being connected with described destination node sends the number of message to described destination node, adjusts each
For the numerical value of label of described destination node in the node that individual and described destination node is connected.
In an embodiment of the invention, described transmitting element 205, specifically for determining described first
When the destination node that unit determines includes multiple, determine the priority of each described destination node;By institute
State message to be transmitted and be sent to priority the highest and corresponding label in present node numerical value more than 0
Destination node.
The embodiment of the present invention additionally provides a kind of computer system, and this computer system can include at least two
Node described in individual any of the above-described embodiment.
For making the object, technical solutions and advantages of the present invention clearer, below so that computer system to be wrapped
As a example by including 4 nodes, refer to the interconnection structure between 4 nodes in Fig. 4, to the embodiment of the present invention
The data transmission method of a kind of multinode provided is described in further detail, and refer to Fig. 5, the party
Method may comprise steps of:
Step 501: be respectively directed to each coupled external node in each node and phase is set
The label flag answered.
In the present embodiment, this node can be for realizing the totally interconnected interconnection of CPU in computer system
Chip, it is also possible to the CPU in computer system, or any two needs to carry out the joint of message transmissions
Point.
In Fig. 4, totally interconnected between node 0, node 1, node 2 and node 3.According to Fig. 4,
Each node connects three external nodes, therefore, needs to arrange three flag in each node.
As a example by node 1, node 1 includes three below flag, flag0, flag2 and flag3, divides
Do not represent for node 0, node 2, the flag of node 3.
Step 502: the numerical value of each flag included in each node is configured.
In the present embodiment, in each present node flag value for external node to be used for characterizing this outer
Portion's node can send the number of message simultaneously to this present node.
In the present embodiment, in order to ensure that the excessive transmission caused of message transmissions quantity is blocked up, can pass through
The numerical value of each target labels in each present node is configured by following manner:
First, determine that the destination node (this destination node by node 1 as a example by) corresponding with target labels can
The maximum message segment number of parallel processing.Such as, this maximum number is N.
Secondly, the node number being connected with destination node 1 is determined.According to Fig. 4, with destination node
The 1 node number being connected is 3, respectively node 0, node 2 and node 3.
Finally, each is worked as prosthomere by this maximum message segment number N and this node number 3 and according to determining
In point, the required numerical value for the label of destination node 1 setting configures.Wherein, with destination node
In 1 each node being connected, the numerical value summation of the label for destination node 1 of configuration is not more than maximum report
Literary composition number N.
Wherein, arranging the flag for destination node 1 in node 0 is flag0_1, arranges pin in node 2
Flag to destination node 1 is flag2_1, and arranging the flag for destination node 1 in node 0 is flag3_1,
So need to ensure flag0_1+flag2_1+flag3_1≤N.In order to realize message in computer system
The optimal performance of transmission, can make flag0_1+flag2_1+flag3_1=N.
Under initial situation, when the numerical value of each flag is configured, can configure at random, example
As, during N=10, flag0_1=3, flag2_1=3, flag3_1=4 can be configured.
Step 503: when node 0 gets message to be transmitted, determine that purpose saves according to message to be transmitted
Point is node 1 and 2 two nodes of node.
Step 504: determine in node 0 and distinguish the most corresponding flag numerical value with node 1, node 2, and
Determine node 1 and the priority of node 2.
Such as, now corresponding with node 1 in node 0 flag0_1 is 2, right with node 2 in node 0
The flag0_2 answered is 0.
In the present embodiment, the priority for node can be carried out the treatability according to actual node by user
Can arrange, it is also possible to according to needed for node 0 to finish node through the path of node 1 and required warp
Which bar of path crossing node 2 is that optimal path is arranged.Such as, the priority of node 1 is less than node
The priority of 2.
If now node 0 being 0 with node 1, flag numerical value that node 2 is the most corresponding, then need
When flag numerical value to be waited is more than 0, continuing transmission.
Step 505: this message to be transmitted is sent to the purpose that priority is the highest and flag numerical value is more than 0
Node.
Step 506: the flag numerical value corresponding with this destination node of storage in node 0 is subtracted 1.
Step 507: receive the response message that destination node returns.
Step 508: flag numerical value corresponding for this destination node in node 0 is added 1.
Step 509: when often arriving the first time period of setting, to each flag in each node
Numerical value is adjusted.
In the present embodiment, for the numerical value of each target labels in this present node as follows
It is adjusted:
Determine that the destination node (this destination node by node 1 as a example by) corresponding with target labels can be located parallel
Maximum message segment number N of reason, and each is connected with destination node 1 within second time period in past
Node send the number of message to destination node 1, and according to this maximum message segment number and each and mesh
The node that mark node 1 is connected sends the number of message to destination node 1, adjusts each and destination node
For the numerical value of label of this destination node 1 in 1 node being connected.
Such as, it is 500 that node 1 receives the message number of node 0 transmission within the second time period, receives
The message number sent to node 2 is 200, and the message number receiving node 3 transmission is 300.
So according to the numerical value of N, such as N=10, the flag0_1 in node 0 is revised as 5, will joint
Flag2_1 in point 2 is revised as 2, and the flag3_1 in node 3 is revised as 3.
In the present embodiment, this first time period can be identical with this second time period, it is also possible to differs.
In sum, the embodiment of the present invention at least can realize following beneficial effect:
1, in embodiments of the present invention, by setting for each coupled external node in node
Put corresponding label, and the numerical value of each label is configured, between node, carry out message transmissions
Time, can transmit according to the Numerical Implementation of this label, such that it is able to improve the efficiency of data transmission.
2, in embodiments of the present invention, according to sending message to destination node and receiving response message, it is achieved
To the plus-minus of this destination node correspondence flag numerical value in own node, can avoid owing to saving to purpose simultaneously
The congestion problems that the message number that point sends causes too much, improves the transmission performance of message.
3, in embodiments of the present invention, by every a first time period to each node in the number of label
Value once adjusts, and realizes the configuration to label numerical value according to inter-node transmission quantities of messages, thus
Ensure the optimal performance of message transmissions.
The contents such as the information between each unit in said apparatus is mutual, execution process, due to the present invention
Embodiment of the method is based on same design, and particular content can be found in the narration in the inventive method embodiment, this
Place repeats no more.
It should be noted that in this article, the relational terms of such as first and second etc be used merely to by
One entity or operation separate with another entity or operating space, and not necessarily require or imply this
Relation or the order of any this reality is there is between a little entities or operation.And, term " includes ",
" comprise " or its any other variant is intended to comprising of nonexcludability, so that include that one is
The process of row key element, method, article or equipment not only include those key elements, but also include the brightest
Other key elements really listed, or also include intrinsic for this process, method, article or equipment
Key element.In the case of there is no more restriction, statement " include one " and limit
Key element, it is not excluded that there is also another in including the process of described key element, method, article or equipment
Outer same factor.
One of ordinary skill in the art will appreciate that: realize all or part of step of said method embodiment
Can be completed by the hardware that programmed instruction is relevant, aforesaid program can be stored in embodied on computer readable
Storage medium in, this program upon execution, performs to include the step of said method embodiment;And it is aforementioned
Storage medium include: various Jie that can store program code such as ROM, RAM, magnetic disc or CD
In matter.
Last it should be understood that the foregoing is only presently preferred embodiments of the present invention, it is merely to illustrate this
The technical scheme of invention, is not intended to limit protection scope of the present invention.All spirit in the present invention and former
Any modification, equivalent substitution and improvement etc. done within then, are all contained in protection scope of the present invention.
Claims (10)
1. the data transmission method of a multinode, it is characterised in that in present node for its phase
Each external node even arranges corresponding label, the numerical value to each label in this present node
Configure;Also include:
When getting message to be transmitted, determine destination node according to described message to be transmitted;
Determine the numerical value of label corresponding with described destination node in present node;
According to the numerical value of label corresponding with described destination node in this present node, by described report to be transmitted
Literary composition is sent to described destination node.
Method the most according to claim 1, it is characterised in that
The described numerical value according to label corresponding with described destination node in this present node, by described to be passed
Defeated message is sent to described destination node, including: in this prior in node corresponding with described destination node
When the numerical value of label is more than 0, then described message to be transmitted is sent to described destination node, in this prior
In node the numerical value of label corresponding with described destination node equal to 0 time, then wait in this present node with
When the numerical value of the corresponding label of described destination node is more than 0, described message to be transmitted is sent to described mesh
Node;
Described described message to be transmitted is sent to described destination node after, farther include: should
In present node, the numerical value of label corresponding with described destination node subtracts 1;
Farther include: when receiving the response message that described destination node returns, by this present node
In the numerical value of label corresponding with described destination node add 1.
Method the most according to claim 1, it is characterised in that described every in this present node
The numerical value of one label configures, including:
As follows the numerical value of each target labels in present node is configured:
Determine the destination node corresponding with described target labels can the maximum message segment number of parallel processing, and
Determine the node number being connected with described destination node, and according to this maximum message segment number determined and this joint
The numerical value of described target labels is configured, wherein, each with what described destination node was connected by some number
In individual node, the numerical value summation of the label for described destination node of configuration is not more than described maximum message segment
Number.
Method the most according to claim 1, it is characterised in that farther include:
When often arriving the first time period of setting, for the number of each target labels in this present node
Value is adjusted as follows:
Determine the destination node corresponding with described target labels can the maximum message segment number of parallel processing, and
Within second time period in past, each node being connected with described destination node is sent out to described destination node
Deliver newspaper the number of literary composition, and the node being connected with described destination node with each according to this maximum message segment number
Send the number of message to described destination node, adjust in each node being connected with described destination node
Numerical value for the label of described destination node.
5. according to described method arbitrary in claim 1-4, it is characterised in that at the purpose joint determined
Point is when including multiple, described described message to be transmitted is sent to described destination node, including:
Determine the priority of each described destination node;
Described message to be transmitted is sent to the highest and corresponding label in present node the numerical value of priority
Destination node more than 0.
6. a node, it is characterised in that including:
Unit is set, for arranging corresponding label for each external node self being connected and deposit
Storage;
Dispensing unit, for configuring the numerical value of each label of self storage;
First determines unit, for when getting message to be transmitted, determines according to described message to be transmitted
Destination node;
Second determines unit, for determining the numerical value of the label corresponding with described destination node self stored;
Transmitting element, for the numerical value of the label corresponding with described destination node according to self storage, will
Described message to be transmitted is sent to described destination node.
Node the most according to claim 6, it is characterised in that
Described transmitting element, specifically for label corresponding with described destination node in node in this prior
When numerical value is more than 0, then described message to be transmitted is sent to described destination node, in this prior in node
The numerical value of label corresponding with described destination node equal to 0 time, then wait in this present node with described mesh
The corresponding label of node numerical value more than 0 time, described message to be transmitted is sent to described destination node,
And after performing to terminate, trigger processing unit execution by mark corresponding with described destination node in this present node
The operation that the numerical value signed subtracts 1;
Farther include: receive unit, for receiving the response message that described destination node returns, and
Execution triggers described processing unit and performs mark corresponding with described destination node in this present node after terminating
The operation that the numerical value signed adds 1.
Node the most according to claim 6, it is characterised in that
Described dispensing unit, specifically for as follows to each target labels in present node
Numerical value configures: determine that the destination node corresponding with described target labels can the maximum message segment of parallel processing
Number, and determine the node number being connected with described destination node, and according to this maximum message segment determined
The numerical value of described target labels is configured by number and this node number, wherein, is saving with described target
In each node that point is connected, the numerical value summation of the label for described destination node of configuration is not more than described
Maximum message segment number;
And/or,
Farther include: adjustment unit, for when often arriving the first time period of setting, for deserving
In front nodal point, the numerical value of each target labels is adjusted as follows: determine and described target mark
Sign corresponding destination node can the maximum message segment number of parallel processing, and within second time period in past
Each node being connected with described destination node to described destination node send message number, and according to
This maximum message segment number sends report with each node being connected with described destination node to described destination node
The number of literary composition, adjusts the mark for described destination node in each node being connected with described destination node
The numerical value signed.
9. according to described node arbitrary in claim 6-8, it is characterised in that described transmitting element,
Specifically for when described first determines that the destination node that unit determines includes multiple, determining described in each
The priority of destination node;Described message to be transmitted is sent to priority the highest and in present node
The numerical value of the corresponding label destination node more than 0.
10. a computer system, it is characterised in that include at least two the claims 6-9
Arbitrary described node.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201610202527.1A CN105933230A (en) | 2016-04-01 | 2016-04-01 | Multi-node data transmission method, node and computer system |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201610202527.1A CN105933230A (en) | 2016-04-01 | 2016-04-01 | Multi-node data transmission method, node and computer system |
Publications (1)
Publication Number | Publication Date |
---|---|
CN105933230A true CN105933230A (en) | 2016-09-07 |
Family
ID=56840476
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201610202527.1A Pending CN105933230A (en) | 2016-04-01 | 2016-04-01 | Multi-node data transmission method, node and computer system |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN105933230A (en) |
Citations (10)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN1747434A (en) * | 2004-09-10 | 2006-03-15 | 华为技术有限公司 | Flow control for pipeline distributing system |
CN1754335A (en) * | 2003-02-25 | 2006-03-29 | 摩托罗拉公司 | Flow control in a packet data communication system |
CN1968185A (en) * | 2006-06-09 | 2007-05-23 | 华为技术有限公司 | Switching device with overload control capability and its overload control notification method |
CN1968135A (en) * | 2006-04-27 | 2007-05-23 | 华为技术有限公司 | Flow distribution system and method |
CN102685904A (en) * | 2012-05-07 | 2012-09-19 | 中兴通讯股份有限公司 | Bandwidth self-adaptive allocation method and bandwidth self-adaptive allocation system |
CN102811166A (en) * | 2011-05-31 | 2012-12-05 | 三星Sds株式会社 | Method and apparatus for controlling stream to receive data in parallel |
CN103873380A (en) * | 2014-02-24 | 2014-06-18 | 华为技术有限公司 | Method, device and system for adjusting data distribution strategy |
CN103905300A (en) * | 2012-12-25 | 2014-07-02 | 华为技术有限公司 | Data message sending method, device and system |
CN104092619A (en) * | 2014-07-25 | 2014-10-08 | 华为技术有限公司 | Traffic control method and device |
WO2015085489A1 (en) * | 2013-12-10 | 2015-06-18 | 华为技术有限公司 | Overload control method and apparatus for peer network element |
-
2016
- 2016-04-01 CN CN201610202527.1A patent/CN105933230A/en active Pending
Patent Citations (10)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN1754335A (en) * | 2003-02-25 | 2006-03-29 | 摩托罗拉公司 | Flow control in a packet data communication system |
CN1747434A (en) * | 2004-09-10 | 2006-03-15 | 华为技术有限公司 | Flow control for pipeline distributing system |
CN1968135A (en) * | 2006-04-27 | 2007-05-23 | 华为技术有限公司 | Flow distribution system and method |
CN1968185A (en) * | 2006-06-09 | 2007-05-23 | 华为技术有限公司 | Switching device with overload control capability and its overload control notification method |
CN102811166A (en) * | 2011-05-31 | 2012-12-05 | 三星Sds株式会社 | Method and apparatus for controlling stream to receive data in parallel |
CN102685904A (en) * | 2012-05-07 | 2012-09-19 | 中兴通讯股份有限公司 | Bandwidth self-adaptive allocation method and bandwidth self-adaptive allocation system |
CN103905300A (en) * | 2012-12-25 | 2014-07-02 | 华为技术有限公司 | Data message sending method, device and system |
WO2015085489A1 (en) * | 2013-12-10 | 2015-06-18 | 华为技术有限公司 | Overload control method and apparatus for peer network element |
CN103873380A (en) * | 2014-02-24 | 2014-06-18 | 华为技术有限公司 | Method, device and system for adjusting data distribution strategy |
CN104092619A (en) * | 2014-07-25 | 2014-10-08 | 华为技术有限公司 | Traffic control method and device |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US7310319B2 (en) | Multiple-domain processing system using hierarchically orthogonal switching fabric | |
CN107181679A (en) | A kind of port binding implementation method and device | |
CN104247341B (en) | The dynamic optimization method of distribution switch and its multicast tree hierarchical structure | |
CN105450618A (en) | Operation method and operation system of big data process through API (Application Programming Interface) server | |
CN101616083A (en) | A kind of message forwarding method and device | |
CN101072176A (en) | Report processing method and system | |
CN109194578B (en) | Method and device for opening private line service | |
CN109918203A (en) | Access server memory management optimization method, access server and communication system | |
CN108347477A (en) | Data transmission method for uplink, device and server | |
CN108092922B (en) | Method and device for transmitting message by interface board | |
CN105162732A (en) | Method and device for creating expansion port | |
CN110213147A (en) | A kind of cloud network interoperability methods, device, storage medium and terminal device | |
CN105704167B (en) | A kind of business chain processing method, equipment and system | |
CN110389711A (en) | Endpoint device is helped to realize method, equipment and the computer program product of SR-IOV function | |
CN106502841B (en) | Data back up method and device | |
CN111885158B (en) | Cluster task processing method and device, electronic equipment and storage medium | |
CN106856459A (en) | A kind of method for dispatching message and device | |
CN105933230A (en) | Multi-node data transmission method, node and computer system | |
CN104104594B (en) | VSU protocol massages are sent and method of reseptance, equipment and system | |
CN115065637B (en) | Method and device for transmitting computing power resource information and electronic equipment | |
CN105871761A (en) | High order matrix switch, network on chip and communication method | |
CN109005122A (en) | File transmitting method, device and the network equipment | |
CN110535672A (en) | A kind of network function dispositions method and network function dispose device | |
CN103825767B (en) | The implementation method and bridge of service quality | |
CN108259527B (en) | Proxy-based service processing method and device and network element 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 | ||
RJ01 | Rejection of invention patent application after publication | ||
RJ01 | Rejection of invention patent application after publication |
Application publication date: 20160907 |