CN105634973B - Method for routing and equipment based on load balancing - Google Patents
Method for routing and equipment based on load balancing Download PDFInfo
- Publication number
- CN105634973B CN105634973B CN201410606072.0A CN201410606072A CN105634973B CN 105634973 B CN105634973 B CN 105634973B CN 201410606072 A CN201410606072 A CN 201410606072A CN 105634973 B CN105634973 B CN 105634973B
- Authority
- CN
- China
- Prior art keywords
- node
- data message
- congested
- hop
- origination
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The embodiment of the present invention provides a kind of method for routing and equipment based on load balancing, when origination node has data to send, origination node, which passes through, determines congested node according to the load information of all nodes in the network being obtained ahead of time, the mark of congested node is encapsulated in data message, so that all intermediate nodes that the origination node and the data message pass through determine the next-hop node of the data message according to the destination address of the data message and the mark of the congested node, which is not the congested node.The next-hop node that the origination node and all intermediate nodes determine is not the congested node, so that flow avoids the congested node in forwarding, so that the load balancing of the node of whole network.
Description
Technical field
The present embodiments relate to the communication technology more particularly to a kind of method for routing and equipment based on load balancing.
Background technique
It is unbalanced due to network flow in existing various networks, so that the load imbalance of each network node, i.e.,
There are some network node load weights, the light situation of some network load node loads.Network traffic load it is unbalanced, can lead
Cause the throughput degradation of whole network.
In the prior art, equal cost multipath (Equal-Cost Multipath, abbreviation ECMP) technology is generallyd use to come in fact
Existing load balancing, in ECMP technology, when between source node and destination node there are when a plurality of shortest path, by some specific
Routing Algorithm, flow is evenly distributed in these paths, avoids all flows by the forwarding of fixed route, to reach
The purpose of load balancing.
Since ECMP is to carry out routing according to pre-configured Routing Algorithm, the net in the path of selection may result in
The overload of network node causes the delay of data flow excessive.
Summary of the invention
The embodiment of the present invention provides a kind of method for routing and equipment based on load balancing, to solve to load in existing network
Unbalanced problem.
First aspect present invention provides a kind of method for routing based on load balancing, comprising:
When origination node has data to send, the origination node is according to all nodes in the network being obtained ahead of time
Load information determines congested node, wherein the load of the congested node is more than preset load threshold；
The mark of the congested node is encapsulated in data message by the origination node；
The origination node determines the number according to the destination address of the data message and the mark of the congested node
According to the next-hop node of message, the next-hop node is not the congested node；
The origination node gives the data message forwarding to the next-hop node.
It is in a first possible implementation of the first aspect of the invention, described to originate in conjunction with first aspect present invention
Node determines the next-hop section of the data message according to the destination address of the data message and the mark of the congested node
Point, comprising:
The origination node selects the road of an entry according to the destination address of the data message from a plurality of equative route
Diameter；
The origination node judges whether the next-hop node of the destination path is the congested node；
If the next-hop node of the destination path is not the congested node, the origination node determines the purpose
The next-hop node in path is the next-hop node of the data message；
If the next-hop node of the destination path is the congested node, the origination node is from a plurality of equivalence
The next-hop node of the data message is redefined in residual paths in path in addition to the destination path.
In conjunction with the possible implementation of the first of first aspect present invention and first aspect present invention, in the present invention the
In the possible implementation of second of one side, the mark of the congested node is encapsulated in data message by the origination node
In, comprising:
The mark of the congested node is encapsulated in the network interconnection protocol IP report of the data message by the origination node
In adjacent fields after literary head or multi-link transparent interconnection TRILL heading.
In conjunction with second of possible implementation of first aspect present invention, the third in first aspect present invention may
Implementation in, the origination node determines congested node according to the load information of all nodes in the network being obtained ahead of time
Before, the method also includes:
The origination node obtains the load information of all nodes.
In conjunction with the third possible implementation of first aspect present invention, in the 4th kind of possibility of first aspect present invention
Implementation in, the origination node obtains the load information of all nodes, comprising:
The origination node receives the load information for all nodes that controller is sent.
Second aspect of the present invention provides a kind of method for routing based on load balancing, comprising:
Intermediate node receives the data message that upper hop node is sent, and includes the mark of congested node in the data message
With the destination address of the data message, the congested node is the origination node of the data message according to the net being obtained ahead of time
The load information of all nodes determines in network, and the mark of the congested node is added in the data message；
The intermediate node determines the number according to the destination address of the data message and the mark of the congested node
According to the next-hop node of message, wherein the next-hop node cannot be the congested node；
The intermediate node gives the data message forwarding to the next-hop node.
In conjunction with second aspect of the present invention, in the first possible implementation of second aspect of the present invention, the middle node
Point determines the next-hop node of the data message according to the destination address of the data message and the mark of the congested node,
Include:
The intermediate node selects the road of an entry according to the destination address of the data message from a plurality of equative route
Diameter；
The intermediate node judges whether the next-hop node of the destination path is the congested node；
If the next-hop node of the destination path is not the congested node, the intermediate node determines the purpose
The next-hop node in path is the next-hop node of the data message；
If the next-hop node of the destination path is the congested node, the intermediate node is from a plurality of equivalence
The next-hop node of the data message is redefined in residual paths in path in addition to the destination path.
In conjunction with the possible implementation of the first of second aspect of the present invention and second aspect of the present invention, in the present invention the
Second of possible implementation of two aspects, the mark of the congested node are encapsulated in the network interconnection association of the data message
In adjacent fields after view IP packet head or multi-link transparent interconnection TRILL heading.
Third aspect present invention provides a kind of origination node, comprising:
First determining module, for when the origination node have data to send when, according in the network being obtained ahead of time
The load information of all nodes determines congested node, wherein the load of the congested node is more than preset load threshold；
Package module, for the mark of the congested node to be encapsulated in data message；
Second determining module, for determining institute according to the destination address of the data message and the mark of the congested node
The next-hop node of data message is stated, the next-hop node is not the congested node；
Sending module, for giving the data message forwarding to the next-hop node.
In conjunction with third aspect present invention, in a first possible implementation of the third aspect of the invention, described second
Determining module is specifically used for:
A destination path is selected from a plurality of equative route according to the destination address of the data message；
Whether the next-hop node for judging the destination path is the congested node；
If the next-hop node of the destination path is not the congested node, it is determined that the next-hop of the destination path
Node is the next-hop node of the data message；
If the next-hop node of the destination path is the congested node, except described from a plurality of equative route
The next-hop node of the data message is redefined in residual paths except destination path.
In conjunction with the possible implementation of the first of third aspect present invention and third aspect present invention, in the present invention the
In second of possible implementation of three aspects, the package module is specifically used for:
The mark of the congested node is encapsulated in the network interconnection protocol IP heading or multichain of the data message
It connects in the adjacent fields after transparent interconnection TRILL heading.
In conjunction with second of possible implementation of third aspect present invention, the third in third aspect present invention may
Implementation in, the origination node further include:
Module is obtained, for obtaining the load information of all nodes.
In conjunction with the third possible implementation of third aspect present invention, in the 4th kind of possibility of third aspect present invention
Implementation in, the acquisition module is specifically used for:
Receive the load information for all nodes that controller is sent.
Fourth aspect present invention provides a kind of intermediate node, comprising:
Receiving module includes congested node in the data message for receiving the data message of upper hop node transmission
Mark and the data message destination address, the congested node is the origination node of the data message according to obtaining in advance
The load information of all nodes determines in the network obtained, and the mark of the congested node is added in the data message
's；
Determining module, for determining the number according to the destination address of the data message and the mark of the congested node
According to the next-hop node of message, wherein the next-hop node cannot be the congested node；
Sending module, for giving the data message forwarding to the next-hop node.
In conjunction with fourth aspect present invention, in the first possible implementation of fourth aspect present invention, the determining mould
Block is specifically used for:
A destination path is selected from a plurality of equative route according to the destination address of the data message；
Whether the next-hop node for judging the destination path is the congested node；
If the next-hop node of the destination path is not the congested node, it is determined that the next-hop of the destination path
Node is the next-hop node of the data message；
If the next-hop node of the destination path is the congested node, except described from a plurality of equative route
The next-hop node of the data message is redefined in residual paths except destination path.
In conjunction with the possible implementation of the first of fourth aspect present invention and fourth aspect present invention, in the present invention the
Second of possible implementation of four aspects, the mark of the congested node are encapsulated in the network interconnection association of the data message
In adjacent fields after view IP packet head or multi-link transparent interconnection TRILL heading.
Method for routing and equipment provided in an embodiment of the present invention based on load balancing, when origination node has data to send
When, origination node, which passes through, determines congested node according to the load information of all nodes in the network being obtained ahead of time, by congestion section
The mark put is encapsulated in data message, so that all intermediate nodes that the origination node and the data message pass through are according to this
The destination address of data message and the mark of the congested node determine the next-hop node of the data message, and the next-hop node is not
For the congested node.The next-hop node that the origination node and all intermediate nodes determine is not the congested node, thus
So that flow avoids the congested node in forwarding, so that the load balancing of the node of whole network.
Detailed description of the invention
In order to more clearly explain the embodiment of the invention or the technical proposal in the existing technology, to embodiment or will show below
There is attached drawing needed in technical description to be briefly described, it should be apparent that, the accompanying drawings in the following description is this hair
Bright some embodiments for those of ordinary skill in the art without any creative labor, can be with
It obtains other drawings based on these drawings.
Fig. 1 is a kind of flow chart for method for routing based on load balancing that the embodiment of the present invention one provides；
Such as the structural schematic diagram that Fig. 2 is the data message that the embodiment of the present invention is applicable in；
Fig. 3 is the flow chart of the method for routing provided by Embodiment 2 of the present invention based on load balancing；
Fig. 4 is the structural schematic diagram for the origination node that the embodiment of the present invention four provides；
Fig. 5 is the structural schematic diagram for the intermediate node that the embodiment of the present invention four provides；
Fig. 6 is the structural schematic diagram for the origination node that the embodiment of the present invention five provides；
Fig. 7 is the structural schematic diagram for the intermediate node that the embodiment of the present invention six provides.
Specific embodiment
In order to make the object, technical scheme and advantages of the embodiment of the invention clearer, below in conjunction with the embodiment of the present invention
In attached drawing, technical scheme in the embodiment of the invention is clearly and completely described, it is clear that described embodiment is
A part of the embodiment of the present invention, instead of all the embodiments.Based on the embodiments of the present invention, those of ordinary skill in the art
Every other embodiment obtained without creative efforts, shall fall within the protection scope of the present invention.
The embodiment of the present invention provides a kind of method for routing based on load balancing, and the method can be applied at existing
It anticipates in a kind of network.
Fig. 1 is a kind of flow chart for method for routing based on load balancing that the embodiment of the present invention one provides, such as Fig. 1 institute
Show, the method for the present embodiment may comprise steps of:
Step 101, when origination node have data to send when, the origination node according in the network being obtained ahead of time owning
The load information of node determines congested node, wherein the load of the congested node is more than preset load threshold.
Before this step, which needs to obtain the load information of all nodes in network in advance, the node
Load information mainly includes the bandwidth availability ratio of each node, and optionally, load information can also include that the CPU of node is utilized
Rate, memory usage etc..When, there are when multiple load balancing interfaces, the bandwidth availability ratio of node includes each load point on node
Carry on a shoulder pole the bandwidth availability ratio of interface.In the present embodiment, origination node is usually the Ingress node of network, i.e., is directly connected with host
Network node.
In the present embodiment, origination node can obtain the load information of all nodes in network by the following method:
In a kind of mode, origination node receives the load information for all nodes that controller is sent, by increasing in a network
Add a controller, which is used to obtain the load information of all nodes in network, then, the load information that will acquire
It is handed down to each node in network, in this way, each node can get the load information of all nodes in network, the control
Device can periodically obtain the load information of node.
In another way, the load information of oneself can be sent to other nodes by each node, so that each
Node can get the load information of all nodes in network.
When origination node has data to send, the origination node is according to the negative of all nodes in the network of acquisition
Information carrying, which ceases, determines congested node, the biggish node of load in congested node, that is, network, and load can be more than default by origination node
Load threshold node as congested node, therefore, congested node may for one or more.
Illustrate how origination node determines congested node, origination node so that load information is the bandwidth availability ratio of node as an example
The bandwidth availability ratio of each node is compared with preset bandwidth availability ratio threshold value, if the bandwidth availability ratio of a certain node is big
When being equal to the bandwidth availability ratio threshold value, which is determined as congested node.When there is multiple load balancing interfaces in node,
Origination node can determine congested node by following rule: when the bandwidth availability ratio that node has a load balancing interface is more than
The bandwidth availability ratio threshold value, it is determined that the node is congested node；Alternatively, the bandwidth benefit of all load balancing interfaces when node
It is more than the bandwidth availability ratio threshold value with rate, it is determined that the node is congested node；Alternatively, when the general above load point of node
The bandwidth availability ratio for carrying on a shoulder pole interface is more than the bandwidth availability ratio threshold value, it is determined that the node is congested node；Alternatively, working as the institute of node
The averaging bandwidth utilization for having load balancing interface is more than the bandwidth availability ratio threshold value, it is determined that the node is congested node.When
So, origination node can be combined with the other parameters such as cpu busy percentage and the memory usage of each node and determine congested node.
The mark of the congested node is encapsulated in data message by step 102, the origination node.
The mark of the congested node is encapsulated in data message by origination node after determining congested node, it is therefore an objective to when
It, can be according in the data message when for the data message routing after intermediate node in network receives the data message
The mark of the congested node of carrying avoids choosing the congested node, selects the node of other light loads, from the beginning of data message
Hair node is needed to destination node by multiple intermediate nodes, and each intermediate node can all be avoided when determining next-hop node
The congested node selects the node of other light loads so that in network each node load balancing.
Specifically, which can use network interconnection protocol IP (Internet using the origination node
Protocol, abbreviation IP) or multi-link transparent interconnection (Transparent Interconnection of Lots of
Links, abbreviation TRILL) agreement.When the data message uses IP agreement, the mark of the congested node is encapsulated in the data
After the IP packet head of message in adjacent fields, when the data message uses TRILL protocol, the mark of the congested node is sealed
In the adjacent fields after the TRILL heading of the data message.In the present embodiment, it is also necessary in IP packet head or
Increase a new protocol type in TRILL heading, for identifying the mark that next field is congested node.
As shown in Fig. 2, structural schematic diagram and existing data such as Fig. 2 for the applicable data message of the embodiment of the present invention
Message is compared, and increases the mark of congested node in the present invention between IP/TRILL heading and payload (payload),
Congested node mark can use type lengths values (Type-Length-value, abbreviation TLV) TLV mode, in a message
The mark of multiple congested nodes can be carried.Need to define two kinds of TLV types herein: TYPE1 and TYPE0, TYPE1 indicate normal
Back end mark, LENGTH indicate congested node mark length, TYPE0 indicate congested node mark terminate,
LENGTH indicates the protocol type of subsequent payload, such as transmission control protocol (Transmission Control
Protocol, abbreviation TCP) or User Datagram Protocol (User Datagram Protocol, abbreviation UDP).
Step 103, the origination node determine the number according to the mark of the destination address of the data message and the congested node
According to the next-hop node of message, which is not the congested node.
Destination address is also carried in the data message, origination node is according to the destination address of the data message using routing
Algorithm determines the next-hop node of the data message, then, judges whether next-hop node is congested node, if next-hop node
It is not congested node, then the next-hop node is determined as to the next-hop node of the data message.If next-hop node is congestion
Node, then origination node is data message selection next-hop node again, until next-hop node is not congested node.
When using ECMP technology, there are a plurality of equative route, the corresponding interfaces of every equative route for origination node.It should
Origination node determines the next-hop node of the data message according to the destination address of the data message and the mark of the congested node,
Specifically: firstly, the origination node selects the road of an entry according to the destination address of the data message from a plurality of equative route
Diameter；Then, which judges whether the next-hop node of the destination path is the congested node；If under the destination path
One hop node is not the congested node, then the origination node determines that the next-hop node of the destination path is under the data message
One hop node；If the next-hop node of the destination path is the congested node, the origination node is from a plurality of equative route
The next-hop node of the data message is redefined in residual paths in addition to the destination path.
For example, origination node has three equative routes: path 1,2,3 respectively corresponds outgoing interface 1,2,3, then this originates section
Point determines the outgoing interface of the data message according to the destination address of the data message, it is assumed that the datagram that the origination node determines
The outgoing interface of text is outgoing interface 3, and origination node judges whether the corresponding next-hop node of outgoing interface 3 is the congested node, if going out
The corresponding next-hop node of interface 3 is not congested node, then the corresponding next-hop node of outgoing interface 3 is under the back end
One hop node, if the corresponding next-hop node of outgoing interface 3 is congested node, then the origination node is from remaining 1 He of outgoing interface
The next-hop node of the data message is further determined that in outgoing interface 2 in the manner described above.
Step 104, the origination node give the data message forwarding to the next-hop node.
The next-hop node is the intermediate node of the back end, is passed through from the origination node of the data message to destination node
The each intermediate node crossed determines the datagram all in accordance with according to the destination address of the data message and the mark of the congested node
The next-hop node of text, so as to avoid making the load of the node in network become the data message forwarding to congested node
In equilibrium, colludes and avoid the congested node also and can reduce the Forwarding Delay of the data message.
In the present embodiment, when origination node has data to send, origination node passes through according in the network being obtained ahead of time
The load informations of all nodes determine congested node, the mark of congested node is encapsulated in data message, so that this is originated
All intermediate nodes that node and the data message pass through are according to the destination address of the data message and the mark of the congested node
Know the next-hop node for determining the data message, which is not the congested node.The origination node and it is all in
The next-hop node that intermediate node determines is not the congested node, so that flow avoids the congested node in forwarding,
So that the load balancing of the node of whole network.
Fig. 3 is the flow chart of the method for routing provided by Embodiment 2 of the present invention based on load balancing, as shown in figure 3, this
The method that embodiment provides may comprise steps of:
Step 201, intermediate node receive the data message that upper hop node is sent, and include congested node in the data message
Mark and the data message destination address, which is the origination node of the data message according to the net being obtained ahead of time
The load information of all nodes determines in network, and the mark of the congested node is added in the data message.
The upper hop node may be intermediate node or origination node, and optionally, the mark of the congested node is encapsulated in this
In the IP packet head of data message or the adjacent fields after TRILL heading, the specific format of the data message can be with
Referring to the associated description of embodiment one, which is not described herein again.
Step 202, the intermediate node determine the number according to the mark of the destination address of the data message and the congested node
According to the next-hop node of message, wherein the next-hop node cannot be the congested node.
The intermediate node determines the data message according to the destination address of the data message and the mark of the congested node
The method of next-hop node and the origination node of the data message are identical, can refer to the associated description of embodiment one, here no longer
It repeats.
When using ECMP technology, there are a plurality of equative route, the corresponding interfaces of every equative route for the intermediate node.
The intermediate node determines the next-hop section of the data message according to the destination address of the data message and the mark of the congested node
Point, specifically: firstly, the intermediate node selects an entry according to the destination address of the data message from a plurality of equative route
Path；Then, which judges whether the next-hop node of the destination path is the congested node；If the destination path
Next-hop node is not the congested node, then the intermediate node determines that the next-hop node of the destination path is the data message
Next-hop node；If the next-hop node of the destination path is the congested node, the intermediate node is from a plurality of equative route
In the next-hop node of the data message is redefined in residual paths in addition to the destination path.
Step 203, the intermediate node give the data message forwarding to the next-hop node.
In the present embodiment, intermediate node is according to the mark of the congested node for including in the data message received, in determination
When the next-hop node of the data message, which is determined according to the mark of the destination address of the data message and the congested node
The next-hop node of message, the next-hop node are not the congested node.The next-hop node determined due to all intermediate nodes
It is not the congested node, so that flow avoids the congested node in forwarding, so that the node of whole network is negative
It carries balanced.
Fig. 4 is the structural schematic diagram for the origination node that the embodiment of the present invention four provides, as shown in figure 4, the beginning of the present embodiment
Sending out node includes: the first determining module 11, package module 12, the second determining module 13 and sending module 14.
Wherein, the first determining module 11, for when the origination node have data to send when, according to the net being obtained ahead of time
The load information of all nodes in network determines congested node, wherein the load of the congested node is more than preset load threshold
Value；
Package module 12, for the mark of the congested node to be encapsulated in data message；
Second determining module 13, for being determined according to the destination address of the data message and the mark of the congested node
The next-hop node of the data message, the next-hop node are not the congested node；
Sending module 14, for giving the data message forwarding to the next-hop node.
Optionally, second determining module 13 is specifically used for: according to the destination address of the data message from a plurality of etc.
A destination path is selected in cost path；Whether the next-hop node for judging the destination path is the congested node；If institute
The next-hop node for stating destination path is not the congested node, it is determined that the next-hop node of the destination path is the number
According to the next-hop node of message；If the next-hop node of the destination path is the congested node, from a plurality of equivalence
The next-hop node of the data message is redefined in residual paths in path in addition to the destination path.
Optionally, the package module 12 is specifically used for: the mark of the congested node is encapsulated in the data message
Network interconnection protocol IP heading or multi-link transparent interconnection TRILL heading after adjacent fields in.
Optionally, the origination node further include: module is obtained, for obtaining the load information of all nodes.Institute
It states acquisition module to be specifically used for: receiving the load information for all nodes that controller is sent.
The origination node of the present embodiment can be used for executing the technical solution of the offer of embodiment one, specific implementation and skill
Art effect is similar, and which is not described herein again.
Fig. 5 is the structural schematic diagram for the intermediate node that the embodiment of the present invention four provides, as shown in figure 5, the present embodiment provides
Intermediate node include: receiving module 21, determining module 22 and sending module 23.
Wherein, receiving module 21 include gathering around in the data message for receiving the data message of upper hop node transmission
Fill in node mark and the data message destination address, the congested node be the data message origination node according to
The load information of all nodes determines in the network being obtained ahead of time, and the mark of the congested node is added to the data
In message；
Determining module 22, for according to the determination of the mark of the destination address of the data message and the congested node
The next-hop node of data message, wherein the next-hop node cannot be the congested node；
Sending module 23, for giving the data message forwarding to the next-hop node.
Optionally, the determining module is specifically used for: according to the destination address of the data message from a plurality of equative route
One destination path of middle selection；Whether the next-hop node for judging the destination path is the congested node；If the purpose
The next-hop node in path is not the congested node, it is determined that the next-hop node of the destination path is the data message
Next-hop node；If the next-hop node of the destination path is the congested node, from a plurality of equative route
The next-hop node of the data message is redefined in residual paths in addition to the destination path.
Optionally, the mark of the congested node be encapsulated in the data message network interconnection protocol IP heading or
In adjacent fields after multi-link transparent interconnection TRILL heading.
The intermediate node of the present embodiment can be used for executing the technical solution of the offer of embodiment two, specific implementation and skill
Art effect is similar, and which is not described herein again.
Fig. 6 is the structural schematic diagram for the origination node that the embodiment of the present invention five provides, as shown in fig. 6, the beginning of the present embodiment
Sending out node 300 includes: processor 31, memory 32, communication interface 33 and communication bus 34, wherein memory 32 and communication connect
Mouth 33 is connect by communication bus 34 with processor 31, and memory 32 is used for storing computer executable instructions, processor 31
In executing the computer executable instructions, to execute method as described below:
Wherein, processor 31 is used for:
When origination node 300 has data to send, according to the load information of all nodes in the network being obtained ahead of time
Determine congested node, wherein the load of the congested node is more than preset load threshold；
The mark of the congested node is encapsulated in data message；
The next of the data message is determined according to the mark of the destination address of the data message and the congested node
Hop node, the next-hop node are not the congested node.
Communication interface 33 is used for: giving the data message forwarding to the next-hop node.
Optionally, processor 31 is specifically used for: being selected from a plurality of equative route according to the destination address of the data message
Select a destination path；Whether the next-hop node for judging the destination path is the congested node；If the destination path
Next-hop node be not the congested node, it is determined that the next-hop node of the destination path be the data message under
One hop node；If the next-hop node of the destination path is the congested node, institute is removed from a plurality of equative route
State the next-hop node that the data message is redefined in the residual paths except destination path.
Optionally, processor 31 is specifically used for: the mark of the congested node is encapsulated in the network of the data message
In adjacent fields after interconnection protocol IP packet head or multi-link transparent interconnection TRILL heading.
The communication interface 33 is also used to: obtaining the load information of all nodes.Specifically, communication interface 33 receives
The load information for all nodes that controller is sent.
The origination node of the present embodiment can be used for executing the technical solution of the offer of embodiment one, specific implementation and skill
Art effect is similar, and which is not described herein again.
Fig. 7 is the structural schematic diagram for the intermediate node that the embodiment of the present invention six provides, as shown in fig. 7, in the present embodiment
Intermediate node 400 includes: processor 41, memory 42, communication interface 43 and communication bus 44, wherein memory 42 and communication connect
Mouth 43 is connect by communication bus 44 with processor 41, and memory 42 is used for storing computer executable instructions, processor 41
In executing the computer executable instructions, to execute method as described below:
Wherein, processor 41 is used for:
Receive the data message that upper hop node is sent, include in the data message congested node mark and the number
According to the destination address of message, the congested node is that the origination node of the data message owns according in the network being obtained ahead of time
What the load information of node determined, and the mark of the congested node is added in the data message；
The next of the data message is determined according to the mark of the destination address of the data message and the congested node
Hop node, wherein the next-hop node cannot be the congested node；
Communication interface 43 is used for: giving the data message forwarding to the next-hop node.
Optionally, processor 41 is specifically used for: being selected from a plurality of equative route according to the destination address of the data message
Select a destination path；Whether the next-hop node for judging the destination path is the congested node；If the destination path
Next-hop node be not the congested node, it is determined that the next-hop node of the destination path be the data message under
One hop node；If the next-hop node of the destination path is the congested node, institute is removed from a plurality of equative route
State the next-hop node that the data message is redefined in the residual paths except destination path.
Optionally, the mark of the congested node be encapsulated in the data message network interconnection protocol IP heading or
In adjacent fields after multi-link transparent interconnection TRILL heading.
The intermediate node of the present embodiment can be used for executing the technical solution of the offer of embodiment two, specific implementation and skill
Art effect is similar, and which is not described herein again.
Those of ordinary skill in the art will appreciate that: realize that all or part of the steps of above-mentioned each method embodiment can lead to
The relevant hardware of program instruction is crossed to complete.Program above-mentioned can be stored in a computer readable storage medium.The journey
When being executed, execution includes the steps that above-mentioned each method embodiment to sequence；And storage medium above-mentioned include: ROM, RAM, magnetic disk or
The various media that can store program code such as person's CD.
Finally, it should be noted that the above embodiments are only used to illustrate the technical solution of the present invention., rather than its limitations；To the greatest extent
Pipe present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that: its according to
So be possible to modify the technical solutions described in the foregoing embodiments, or to some or all of the technical features into
Row equivalent replacement；And these are modified or replaceed, various embodiments of the present invention technology that it does not separate the essence of the corresponding technical solution
The range of scheme.
Claims (12)
1. a kind of method for routing based on load balancing characterized by comprising
When origination node has data to send, the origination node is according to the loads of all nodes in the network being obtained ahead of time
Information determines congested node, wherein the load of the congested node is more than preset load threshold；
The mark of the congested node is encapsulated in data message by the origination node；
The origination node determines the datagram according to the destination address of the data message and the mark of the congested node
The next-hop node of text, the next-hop node is not the congested node；
The origination node gives the data message forwarding to the next-hop node；
Wherein, the mark of the congested node is encapsulated in the network interconnection protocol IP report of the data message by the origination node
In adjacent fields after literary head or multi-link transparent interconnection TRILL heading.
2. the method according to claim 1, wherein destination of the origination node according to the data message
The mark of location and the congested node determines the next-hop node of the data message, comprising:
The origination node selects a destination path according to the destination address of the data message from a plurality of equative route；
The origination node judges whether the next-hop node of the destination path is the congested node；
If the next-hop node of the destination path is not the congested node, the origination node determines the destination path
Next-hop node be the data message next-hop node；
If the next-hop node of the destination path is the congested node, the origination node is from a plurality of equative route
In the next-hop node of the data message is redefined in residual paths in addition to the destination path.
3. the method according to claim 1, wherein the origination node is according to the institute in the network being obtained ahead of time
Before thering is the load information of node to determine congested node, the method also includes:
The origination node obtains the load information of all nodes.
4. according to the method described in claim 3, it is characterized in that, the origination node obtains the load letter of all nodes
Breath, comprising:
The origination node receives the load information for all nodes that controller is sent.
5. a kind of method for routing based on load balancing characterized by comprising
Intermediate node receives the data message that upper hop node is sent, and includes mark and the institute of congested node in the data message
The destination address of data message is stated, the congested node is the origination node of the data message according in the network being obtained ahead of time
What the load information of all nodes determined, and the mark of the congested node is added in the data message；
The intermediate node determines the datagram according to the destination address of the data message and the mark of the congested node
The next-hop node of text, wherein the next-hop node cannot be the congested node；
The intermediate node gives the data message forwarding to the next-hop node；
Wherein, the mark of the congested node is encapsulated in the network interconnection protocol IP heading or multi-link of the data message
In adjacent fields after transparent interconnection TRILL heading.
6. according to the method described in claim 5, it is characterized in that, the intermediate node is according to the destination of the data message
The mark of location and the congested node determines the next-hop node of the data message, comprising:
The intermediate node selects a destination path according to the destination address of the data message from a plurality of equative route；
The intermediate node judges whether the next-hop node of the destination path is the congested node；
If the next-hop node of the destination path is not the congested node, the intermediate node determines the destination path
Next-hop node be the data message next-hop node；
If the next-hop node of the destination path is the congested node, the intermediate node is from a plurality of equative route
In the next-hop node of the data message is redefined in residual paths in addition to the destination path.
7. a kind of origination node characterized by comprising
First determining module, for when the origination node has data to send, according to all in the network being obtained ahead of time
The load information of node determines congested node, wherein the load of the congested node is more than preset load threshold；
Package module, for the mark of the congested node to be encapsulated in data message；
Second determining module, for determining the number according to the destination address of the data message and the mark of the congested node
According to the next-hop node of message, the next-hop node is not the congested node；
Sending module, for giving the data message forwarding to the next-hop node；
Wherein, the package module is specifically used for:
By the mark of the congested node be encapsulated in the data message network interconnection protocol IP heading or multi-link it is saturating
In adjacent fields after bright interconnection TRILL heading.
8. origination node according to claim 7, which is characterized in that second determining module is specifically used for:
A destination path is selected from a plurality of equative route according to the destination address of the data message；
Whether the next-hop node for judging the destination path is the congested node；
If the next-hop node of the destination path is not the congested node, it is determined that the next-hop node of the destination path
For the next-hop node of the data message；
If the next-hop node of the destination path is the congested node, the purpose is removed from a plurality of equative route
The next-hop node of the data message is redefined in residual paths except path.
9. origination node according to claim 7, which is characterized in that the origination node further include:
Module is obtained, for obtaining the load information of all nodes.
10. origination node according to claim 9, which is characterized in that the acquisition module is specifically used for:
Receive the load information for all nodes that controller is sent.
11. a kind of intermediate node characterized by comprising
Receiving module includes the mark of congested node for receiving the data message of upper hop node transmission, in the data message
Know and the destination address of the data message, the congested node are the origination nodes of the data message according to being obtained ahead of time
The load information of all nodes determines in network, and the mark of the congested node is added in the data message；
Determining module, for determining the datagram according to the destination address of the data message and the mark of the congested node
The next-hop node of text, wherein the next-hop node cannot be the congested node；
Sending module, for giving the data message forwarding to the next-hop node；
Wherein, the mark of the congested node is encapsulated in the network interconnection protocol IP heading or multi-link of the data message
In adjacent fields after transparent interconnection TRILL heading.
12. intermediate node according to claim 11, which is characterized in that the determining module is specifically used for:
A destination path is selected from a plurality of equative route according to the destination address of the data message；
Whether the next-hop node for judging the destination path is the congested node；
If the next-hop node of the destination path is not the congested node, it is determined that the next-hop node of the destination path
For the next-hop node of the data message；
If the next-hop node of the destination path is the congested node, the purpose is removed from a plurality of equative route
The next-hop node of the data message is redefined in residual paths except path.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410606072.0A CN105634973B (en) | 2014-10-30 | 2014-10-30 | Method for routing and equipment based on load balancing |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410606072.0A CN105634973B (en) | 2014-10-30 | 2014-10-30 | Method for routing and equipment based on load balancing |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105634973A CN105634973A (en) | 2016-06-01 |
| CN105634973B true CN105634973B (en) | 2019-07-12 |
Family
ID=56049490
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410606072.0A Active CN105634973B (en) | 2014-10-30 | 2014-10-30 | Method for routing and equipment based on load balancing |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105634973B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109597830B (en) * | 2018-11-22 | 2023-05-05 | 创新先进技术有限公司 | Data circulation method, device, equipment and medium |
| CN113132225B (en) * | 2019-12-31 | 2024-04-26 | 中兴通讯股份有限公司 | Path selection method, path selection device, computer equipment and computer readable medium |
| JP2021144571A (en) * | 2020-03-13 | 2021-09-24 | 富士通株式会社 | Information processing device, transmission control method, and communication program |
| CN115468572A (en) * | 2021-06-11 | 2022-12-13 | 华为技术有限公司 | Path planning method and related equipment |
| CN114124825B (en) * | 2021-10-26 | 2023-05-16 | 中国联合网络通信集团有限公司 | Method, system, device and storage medium for data transmission |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101018203A (en) * | 2007-01-18 | 2007-08-15 | 北京航空航天大学 | Dynamic load allocation method of the aviation telecom network |
| CN101420379A (en) * | 2008-11-14 | 2009-04-29 | 北京航空航天大学 | Low consumption multi-path routing method for mobile ad hoc network |
| CN102065480A (en) * | 2010-11-22 | 2011-05-18 | 北京邮电大学 | Path priority-based wireless sensor network congestion avoidance and control method |
| CN102355421A (en) * | 2011-10-12 | 2012-02-15 | 华为技术有限公司 | Method for handling LSP (Label Switched Path) network congestion, device and system |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101631065B (en) * | 2008-07-16 | 2012-04-18 | 华为技术有限公司 | Method and device for controlling congestion of wireless multi-hop network |
-
2014
- 2014-10-30 CN CN201410606072.0A patent/CN105634973B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101018203A (en) * | 2007-01-18 | 2007-08-15 | 北京航空航天大学 | Dynamic load allocation method of the aviation telecom network |
| CN101420379A (en) * | 2008-11-14 | 2009-04-29 | 北京航空航天大学 | Low consumption multi-path routing method for mobile ad hoc network |
| CN102065480A (en) * | 2010-11-22 | 2011-05-18 | 北京邮电大学 | Path priority-based wireless sensor network congestion avoidance and control method |
| CN102355421A (en) * | 2011-10-12 | 2012-02-15 | 华为技术有限公司 | Method for handling LSP (Label Switched Path) network congestion, device and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105634973A (en) | 2016-06-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11658905B2 (en) | Routing control method, device, and system | |
| US11909645B2 (en) | Segment routing traffic engineering based on link utilization | |
| CN105634973B (en) | Method for routing and equipment based on load balancing | |
| US10757012B2 (en) | Path computation in a segment routing network | |
| US9036477B2 (en) | Virtual private network to label switched path mapping | |
| US9001672B2 (en) | System, method and apparatus conforming path cost criteria across multiple ABRs | |
| CN104468352B (en) | Special flow QOS support methods based on SDN | |
| US8406153B2 (en) | Affecting node association through load partitioning | |
| US9571381B2 (en) | System and method for inter-domain RSVP-TE LSP load balancing | |
| US8593986B2 (en) | Lightweight storing mode for constrained computer networks | |
| EP3186928B1 (en) | Bandwidth-weighted equal cost multi-path routing | |
| JP2020527918A (en) | Data flow transmission | |
| CN112118181B (en) | Traffic scheduling method and device | |
| CN106063202A (en) | State-dependent data forwarding | |
| KR101630519B1 (en) | Apparatus and method for controlling transmission of data traffic | |
| CN116436850A (en) | Message forwarding method, message processing method and device | |
| CN104283807B (en) | A kind of traffic engineering tunnel method for building up and device | |
| CN102355421A (en) | Method for handling LSP (Label Switched Path) network congestion, device and system | |
| EP3490200A1 (en) | Data packet transmission method and border routing bridge device | |
| CN105393597A (en) | Network congestion control method and controller | |
| CN106416153A (en) | Ldp switchover threshold tlv to denote lsp switchover threshold | |
| WO2016078070A1 (en) | Method for routing data packet, node and communication system | |
| US20030174654A1 (en) | Packet routing | |
| CN112398749A (en) | Load balancing method, device and system, network and storage medium | |
| US20160173382A1 (en) | Methods and Packet Network Devices for Forwarding Packet Data Traffic |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |