CN105634973A - Routing method and equipment based on load balancing - Google Patents
Routing method and equipment based on load balancing Download PDFInfo
- Publication number
- CN105634973A CN105634973A CN201410606072.0A CN201410606072A CN105634973A CN 105634973 A CN105634973 A CN 105634973A CN 201410606072 A CN201410606072 A CN 201410606072A CN 105634973 A CN105634973 A CN 105634973A
- 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.)
- Granted
Links
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The embodiment of the invention provides a routing method and equipment based on load balancing. When a starting node is about to transmit data, the starting node determines a congestion node through the load information, obtained in advance, of all nodes in a network, and enables the identification of the congestion node to be packaged in a data message, so as to enable the starting node and all central nodes where the data message passes to determine a next hop node of the data message according to the target address of the data message and the identification of the congestion node, wherein the next hop node is not a congestion node. The next hop nodes determined by the starting node and all central nodes are not the congestion node, thereby avoiding the congestion nodes during flow forwarding, and enabling the loads of the nodes of the whole network to be balanced.
Description
Technical field
The present embodiments relate to communication technology, particularly relate to a kind of method for routing based on load balancing and equipment.
Background technology
In existing various networks, unbalanced due to network traffics so that the load imbalance of each network node, namely there is some network node load weights, the situation that some network load node loads are light. Network traffic load unbalanced, can cause the throughput degradation of whole network.
In prior art, generally adopt equal cost multipath (Equal-CostMultipath, it being called for short ECMP) technology realizes load balancing, in ECMP technology, when there is a plurality of shortest path between source node and destination node, by some specific Routing Algorithms, flow is evenly distributed in these paths, all flows are avoided to be forwarded by a fixed route, to reach the purpose of load balancing.
Owing to ECMP carries out routing according to pre-configured Routing Algorithm, it is possible to the overload of network node in the path selected can be caused, cause that the delay of data stream is excessive.
Summary of the invention
The embodiment of the present invention provides a kind of method for routing based on load balancing and equipment, to solve the problem of load imbalance in existing network.
First aspect present invention provides a kind of method for routing based on load balancing, including:
When origination node has data to send, described origination node determines congested node according to the load information of all nodes in the network obtained in advance, and wherein, the load of described congested node exceedes default load threshold;
The mark of described congested node is encapsulated in data message by described origination node;
Described origination node determines the next-hop node of described data message according to the destination address of described data message and the mark of described congested node, and described next-hop node is not described congested node;
Described data message forwarding is given described next-hop node by described origination node.
In conjunction with first aspect present invention, in the first possible implementation of first aspect present invention, described origination node determines the next-hop node of described data message according to the destination address of described data message and the mark of described congested node, including:
Described origination node selects a destination path according to the destination address of described data message from a plurality of equative route;
Described origination node judges whether the next-hop node of described destination path is described congested node;
If the next-hop node of described destination path is not described congested node, then described origination node determines the next-hop node that next-hop node is described data message of described destination path;
If the next-hop node of described destination path is described congested node, then described origination node redefines the next-hop node of described data message from described a plurality of equative route in residual paths except described destination path.
In conjunction with the first possible implementation of first aspect present invention and first aspect present invention, in the implementation that the second of first aspect present invention is possible, the mark of described congested node is encapsulated in data message by described origination node, including:
The mark of described congested node is encapsulated in the adjacent fields after the network interconnection protocol IP heading of described data message or multi-link transparent interconnection TRILL heading by described origination node.
In conjunction with the implementation that the second of first aspect present invention is possible, in the third possible implementation of first aspect present invention, before described origination node determines congested node according to the load information of all nodes in the network obtained in advance, described method also includes:
Described origination node obtains the load information of described all nodes.
In conjunction with the third possible implementation of first aspect present invention, in the 4th kind of possible implementation of first aspect present invention, described origination node obtains the load information of described all nodes, including:
Described origination node receives the load information of described all nodes that controller sends.
Second aspect present invention provides a kind of method for routing based on load balancing, including:
Intermediate node receives the data message that upper hop node sends, described data message includes the mark of congested node and the destination address of described data message, the origination node that described congested node is described data message is determined according to the load information of nodes all in the network obtained in advance, and adds in described data message by the mark of described congested node;
Described intermediate node determines the next-hop node of described data message according to the destination address of described data message and the mark of described congested node, and wherein, described next-hop node can not be described congested node;
Described data message forwarding is given described next-hop node by described intermediate node.
In conjunction with second aspect present invention, in the first possible implementation of second aspect present invention, described intermediate node determines the next-hop node of described data message according to the destination address of described data message and the mark of described congested node, including:
Described intermediate node selects a destination path according to the destination address of described data message from a plurality of equative route;
Described intermediate node judges whether the next-hop node of described destination path is described congested node;
If the next-hop node of described destination path is not described congested node, then described intermediate node determines the next-hop node that next-hop node is described data message of described destination path;
If the next-hop node of described destination path is described congested node, then described intermediate node redefines the next-hop node of described data message from described a plurality of equative route in residual paths except described destination path.
The first possible implementation in conjunction with second aspect present invention and second aspect present invention, in the implementation that the second of second aspect present invention is possible, the mark of described congested node is encapsulated in the adjacent fields after the network interconnection protocol IP heading of described data message or multi-link transparent interconnection TRILL heading.
Third aspect present invention provides a kind of origination node, including:
First determines module, and for when described origination node has data to send, determining congested node according to the load information of all nodes in the network obtained in advance, wherein, the load of described congested node exceedes default load threshold;
Package module, for being encapsulated in data message by the mark of described congested node;
Second determines module, and for determining the next-hop node of described data message according to the destination address of described data message and the mark of described congested node, described next-hop node is not described congested node;
Sending module, for giving described next-hop node by described data message forwarding.
In conjunction with third aspect present invention, in the first possible implementation of third aspect present invention, described second determine module specifically for:
Destination address according to described data message selects a destination path from a plurality of equative route;
Whether the next-hop node judging described destination path is described congested node;
If the next-hop node of described destination path is not described congested node, it is determined that the next-hop node of described destination path is the next-hop node of described data message;
If the next-hop node of described destination path is described congested node, then residual paths except described destination path redefines from described a plurality of equative route the next-hop node of described data message.
In conjunction with the first possible implementation of third aspect present invention and third aspect present invention, in the implementation that the second of third aspect present invention is possible, described package module specifically for:
The mark of described congested node is encapsulated in the adjacent fields after the network interconnection protocol IP heading of described data message or multi-link transparent interconnection TRILL heading.
In conjunction with the implementation that the second of third aspect present invention is possible, in the third possible implementation of third aspect present invention, described origination node also includes:
Acquisition module, for obtaining the load information of described all nodes.
In conjunction with the third possible implementation of third aspect present invention, in the 4th kind of possible implementation of third aspect present invention, described acquisition module specifically for:
Receive the load information of described all nodes that controller sends.
Fourth aspect present invention provides a kind of intermediate node, including:
Receiver module, for receiving the data message that upper hop node sends, described data message includes the mark of congested node and the destination address of described data message, the origination node that described congested node is described data message is determined according to the load information of nodes all in the network obtained in advance, and adds in described data message by the mark of described congested node;
Determining module, for determining the next-hop node of described data message according to the destination address of described data message and the mark of described congested node, wherein, described next-hop node can not be described congested node;
Sending module, for giving described next-hop node by described data message forwarding.
In conjunction with fourth aspect present invention, in the first possible implementation of fourth aspect present invention, described determine module specifically for:
Destination address according to described data message selects a destination path from a plurality of equative route;
Whether the next-hop node judging described destination path is described congested node;
If the next-hop node of described destination path is not described congested node, it is determined that the next-hop node of described destination path is the next-hop node of described data message;
If the next-hop node of described destination path is described congested node, then residual paths except described destination path redefines from described a plurality of equative route the next-hop node of described data message.
The first possible implementation in conjunction with fourth aspect present invention and fourth aspect present invention, in the implementation that the second of fourth aspect present invention is possible, the mark of described congested node is encapsulated in the adjacent fields after the network interconnection protocol IP heading of described data message or multi-link transparent interconnection TRILL heading.
The method for routing based on load balancing of embodiment of the present invention offer and equipment, when origination node has data to send, origination node is by determining congested node according to the load information of all nodes in the network obtained in advance, the mark of congested node is encapsulated in data message, so that all intermediate nodes of this origination node and this data message process determine the next-hop node of this data message according to the destination address of this data message and the mark of this congested node, this next-hop node is not this congested node. The next-hop node that this origination node and all intermediate nodes are determined is not all this congested node, so that flow avoids this congested node when forwarding so that the load balancing of the node of whole network.
Accompanying drawing explanation
In order to be illustrated more clearly that the embodiment of the present invention or technical scheme of the prior art, the accompanying drawing used required in embodiment or description of the prior art will be briefly described below, apparently, accompanying drawing in the following describes is some embodiments of the present invention, for those of ordinary skill in the art, under the premise not paying creative work, it is also possible to obtain other accompanying drawing according to these accompanying drawings.
The flow chart of a kind of method for routing based on load balancing that Fig. 1 provides for the embodiment of the present invention one;
Such as the structural representation that Fig. 2 is the data message that the embodiment of the present invention is suitable for;
The flow chart of the method for routing based on load balancing that Fig. 3 provides for the embodiment of the present invention two;
The structural representation of the origination node that Fig. 4 provides for the embodiment of the present invention four;
The structural representation of the intermediate node that Fig. 5 provides for the embodiment of the present invention four;
The structural representation of the origination node that Fig. 6 provides for the embodiment of the present invention five;
The structural representation of the intermediate node that Fig. 7 provides for the embodiment of the present invention six.
Detailed description of the invention
For making the purpose of the embodiment of the present invention, technical scheme and advantage clearly, below in conjunction with the accompanying drawing in the embodiment of the present invention, technical scheme in the embodiment of the present invention is clearly and completely described, obviously, described embodiment is a part of embodiment of the present invention, rather than whole embodiments. Based on the embodiment in the present invention, the every other embodiment that those of ordinary skill in the art obtain under not making creative work premise, broadly fall into the scope of protection of the invention.
The embodiment of the present invention provides a kind of method for routing based on load balancing, and described method can be applied in any one network existing.
The flow chart of a kind of method for routing based on load balancing that Fig. 1 provides for the embodiment of the present invention one, as it is shown in figure 1, the method for the present embodiment may comprise steps of:
Step 101, when origination node have data to send time, this origination node determines congested node according to the load information of all nodes in the network obtained in advance, and wherein, the load of this congested node exceedes default load threshold.
Before this step, this origination node needs to obtain the load information of all nodes in network in advance, the load information of this node mainly includes the bandwidth availability ratio of each node, and alternatively, load information can also include the cpu busy percentage of node, memory usage etc. When there is multiple load balancing interface on node, the bandwidth availability ratio of node includes the bandwidth availability ratio of each load balancing interface. In the present embodiment, origination node is generally the Ingress node of network, the network node being namely directly connected with main frame.
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 of all nodes that controller sends, by increasing a controller in a network, this controller is for obtaining the load information of all nodes in network, then, it is handed down in network by the load information got each node, so, each node can both get the load information of all nodes in network, and this controller 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 both get the load information of all nodes in network.
When origination node has data to send time, this origination node determines congested node according to the load information of all nodes in the network obtained, the node that in congested node and network, load is bigger, load can be exceeded the node of default load threshold as congested node by origination node, therefore, congested node is likely one or more.
Illustrate how origination node determines congested node for the bandwidth availability ratio that load information is node, the bandwidth availability ratio of each node is compared by origination node with the bandwidth availability ratio threshold value preset, if the bandwidth availability ratio of a certain node is be more than or equal to this bandwidth availability ratio threshold value, this node is defined as congested node. When there being multiple load balancing interface in node, origination node can determine congested node by following rule: when node has the bandwidth availability ratio of a load balancing interface to exceed this bandwidth availability ratio threshold value, it is determined that this node is congested node; Or, when the bandwidth availability ratio of all load balancing interfaces of node exceedes this bandwidth availability ratio threshold value, it is determined that this node is congested node; Or, when node general more than the bandwidth availability ratio of load balancing interface exceed this bandwidth availability ratio threshold value, it is determined that this node is congested node; Or, when the averaging bandwidth utilization of all load balancing interfaces of node exceedes this bandwidth availability ratio threshold value, it is determined that this node is congested node. Certainly, origination node can be combined with other parameters such as cpu busy percentage and the memory usage of each node and determines congested node.
The mark of this congested node is encapsulated in data message by step 102, this origination node.
Origination node is after determining congested node, the mark of this congested node is encapsulated in data message, purpose is after the intermediate node in network receives this data message, when for this data message routing, can avoid choosing this congested node according to the mark of the congested node carried in this data message, select the node of other light load, need from the origination node of data message to destination node through multiple intermediate nodes, each intermediate node is when determining next-hop node, this congested node is avoided in capital, select the node of other light load, so that the load balancing of each node in network.
Specifically, this data message can adopt this origination node can adopt network interconnection protocol IP (InternetProtocol, it is called for short IP) or multi-link transparent interconnection (TransparentInterconnectionofLotsofLinks is called for short TRILL) agreement. When this data message adopts IP agreement, the mark of this congested node is encapsulated in after the IP heading of this data message in adjacent fields, when this data message adopts TRILL protocol, the mark of this congested node is encapsulated in the adjacent fields after the TRILL heading of this data message. In the present embodiment, in addition it is also necessary to increase a new protocol type in IP heading or TRILL heading, being used for identifying next field is the mark of congested node.
As shown in Figure 2, such as the structural representation that Fig. 2 is the data message that the embodiment of the present invention is suitable for, compare with existing data message, the present invention adds the mark of congested node between IP/TRILL heading and payload (payload), this congested node mark can adopt type lengths values (Type-Length-value, it is called for short TLV) TLV pattern, a message can carry the mark of multiple congested node. Need two kinds of TLV type: TYPE1 and TYPE0 of definition herein, TYPE1 represents that normal back end identifies, LENGTH represents the length of the mark of congested node, TYPE0 represents that the mark of congested node terminates, LENGTH represents the protocol type of follow-up payload, such as transmission control protocol (TransmissionControlProtocol is called for short TCP) or User Datagram Protocol (UserDatagramProtocol is called for short UDP).
Step 103, this origination node determine the next-hop node of this data message according to the destination address of this data message and the mark of this congested node, and this next-hop node is not this congested node.
This data message also carries destination address, origination node adopts routing algorithm to determine the next-hop node of this data message according to the destination address of this data message, then, judge whether next-hop node is congested node, if next-hop node is not congested node, then this next-hop node is defined as the next-hop node of this data message. If next-hop node is congested node, then origination node selects next-hop node for this data message again, till next-hop node is not congested node.
When adopting ECMP technology, there is a plurality of equative route in origination node, every corresponding interface of equative route. This origination node determines the next-hop node of this data message according to the destination address of this data message and the mark of this congested node, particularly as follows: first, this origination node selects a destination path according to the destination address of this data message from a plurality of equative route; Then, this origination node judges whether the next-hop node of this destination path is this congested node; If the next-hop node of this destination path is not this congested node, then this origination node determines the next-hop node that next-hop node is this data message of this destination path; If the next-hop node of this destination path is this congested node, then this origination node redefines the next-hop node of this data message from this plurality of equative route in residual paths except this destination path.
Such as, origination node has three equative routes: path 1, 2, 3, corresponding outgoing interface 1 respectively, 2, 3, then this origination node determines the outgoing interface of this data message according to the destination address of this data message, the outgoing interface assuming this data message that this origination node determines is outgoing interface 3, origination node judges whether the next-hop node of interface 3 correspondence is this congested node, if the next-hop node of outgoing interface 3 correspondence is not congested node, so next-hop node that next-hop node is this back end of outgoing interface 3 correspondence, if the next-hop node of outgoing interface 3 correspondence is congested node, so this origination node further determines that the next-hop node of this data message in the manner described above from remaining outgoing interface 1 and outgoing interface 2.
This data message forwarding is given this next-hop node by step 104, this origination node.
This next-hop node is the intermediate node of this back end, determine the next-hop node of this data message according to the mark of the destination address according to this data message He this congested node to each intermediate node of destination node process from the origination node of this data message, it is thus possible to avoid this data message forwarding to congested node, the load making the node in network tends to balanced, colludes and avoids this congested node and also be able to reduce the Forwarding Delay of this data message.
In the present embodiment, when origination node has data to send, origination node is by determining congested node according to the load information of all nodes in the network obtained in advance, the mark of congested node is encapsulated in data message, so that all intermediate nodes of this origination node and this data message process determine the next-hop node of this data message according to the destination address of this data message and the mark of this congested node, this next-hop node is not this congested node. The next-hop node that this origination node and all intermediate nodes are determined is not all this congested node, so that flow avoids this congested node when forwarding so that the load balancing of the node of whole network.
The flow chart of the method for routing based on load balancing that Fig. 3 provides for the embodiment of the present invention two, as it is shown on figure 3, the method that the present embodiment provides may comprise steps of:
Step 201, intermediate node receive the data message that upper hop node sends, this data message includes the mark of congested node and the destination address of this data message, the origination node that this congested node is this data message is determined according to the load information of nodes all in the network obtained in advance, and the mark of this congested node is added in this data message.
This upper hop node is likely intermediate node or origination node, alternatively, the mark of this congested node is encapsulated in the adjacent fields after the IP heading of this data message or TRILL heading, the concrete form of this data message is referred to the associated description of embodiment one, repeats no more here.
Step 202, this intermediate node determine the next-hop node of this data message according to the destination address of this data message and the mark of this congested node, and wherein, this next-hop node can not be this congested node.
This intermediate node determines with the mark of this congested node that according to the destination address of this data message the method for the next-hop node of this data message is identical with the origination node of this data message, can refer to the associated description of embodiment one, repeats no more here.
When adopting ECMP technology, there is a plurality of equative route in this intermediate node, every corresponding interface of equative route. This intermediate node determines the next-hop node of this data message according to the destination address of this data message and the mark of this congested node, particularly as follows: first, this intermediate node selects a destination path according to the destination address of this data message from a plurality of equative route; Then, this intermediate node judges whether the next-hop node of this destination path is this congested node; If the next-hop node of this destination path is not this congested node, then this intermediate node determines the next-hop node that next-hop node is this data message of this destination path; If the next-hop node of this destination path is this congested node, then this intermediate node redefines the next-hop node of this data message from this plurality of equative route in residual paths except this destination path.
This data message forwarding is given this next-hop node by step 203, this intermediate node.
In the present embodiment, the mark of the congested node that intermediate node includes according to the data message received, when determining the next-hop node of this data message, the mark of the destination address according to this data message and this congested node determines the next-hop node of this data message, and this next-hop node is not this congested node. The next-hop node determined due to all intermediate nodes is not all this congested node, so that flow avoids this congested node when forwarding so that the load balancing of the node of whole network.
The structural representation of the origination node that Fig. 4 provides for the embodiment of the present invention four, as shown in Figure 4, the origination node of the present embodiment includes: first determines module 11, package module 12, second determine module 13 and sending module 14.
Wherein, first determines module 11, and for when described origination node has data to send, determining congested node according to the load information of all nodes in the network obtained in advance, wherein, the load of described congested node exceedes default load threshold;
Package module 12, for being encapsulated in data message by the mark of described congested node;
Second determines module 13, and for determining the next-hop node of described data message according to the destination address of described data message and the mark of described congested node, described next-hop node is not described congested node;
Sending module 14, for giving described next-hop node by described data message forwarding.
Alternatively, described second determine module 13 specifically for: from a plurality of equative route, select a destination path according to the destination address of described data message; Whether the next-hop node judging described destination path is described congested node; If the next-hop node of described destination path is not described congested node, it is determined that the next-hop node of described destination path is the next-hop node of described data message; If the next-hop node of described destination path is described congested node, then residual paths except described destination path redefines from described a plurality of equative route the next-hop node of described data message.
Alternatively, described package module 12 specifically for: the mark of described congested node is encapsulated in the adjacent fields after the network interconnection protocol IP heading of described data message or multi-link transparent interconnection TRILL heading.
Alternatively, described origination node also includes: acquisition module, for obtaining the load information of described all nodes. Described acquisition module specifically for: receive the load information of described all nodes that controller sends.
The origination node of the present embodiment, can be used for performing the technical scheme that embodiment one provides, and specific implementation is similar with technique effect, repeats no more here.
The structural representation of the intermediate node that Fig. 5 provides for the embodiment of the present invention four, as it is shown in figure 5, the intermediate node that the present embodiment provides includes: receiver module 21, determine module 22 and sending module 23.
Wherein, receiver module 21, for receiving the data message that upper hop node sends, described data message includes the mark of congested node and the destination address of described data message, the origination node that described congested node is described data message is determined according to the load information of nodes all in the network obtained in advance, and adds in described data message by the mark of described congested node;
Determining module 22, for determining the next-hop node of described data message according to the destination address of described data message and the mark of described congested node, wherein, described next-hop node can not be described congested node;
Sending module 23, for giving described next-hop node by described data message forwarding.
Alternatively, described determine module specifically for: from a plurality of equative route, select a destination path according to the destination address of described data message; Whether the next-hop node judging described destination path is described congested node; If the next-hop node of described destination path is not described congested node, it is determined that the next-hop node of described destination path is the next-hop node of described data message; If the next-hop node of described destination path is described congested node, then residual paths except described destination path redefines from described a plurality of equative route the next-hop node of described data message.
Alternatively, the mark of described congested node is encapsulated in the adjacent fields after the network interconnection protocol IP heading of described data message or multi-link transparent interconnection TRILL heading.
The intermediate node of the present embodiment, can be used for performing the technical scheme that embodiment two provides, and specific implementation is similar with technique effect, repeats no more here.
The structural representation of the origination node that Fig. 6 provides for the embodiment of the present invention five, as shown in Figure 6, the origination node 300 of the present embodiment includes: processor 31, memorizer 32, communication interface 33 and communication bus 34, wherein, memorizer 32 and communication interface 33 are connected with processor 31 by communication bus 34, memorizer 32 is used for storing computer executable instructions, and processor 31 is used for performing described computer executable instructions, to perform method as described below:
Wherein, processor 31 is used for:
When origination node 300 has data to send, determining congested node according to the load information of all nodes in the network obtained in advance, wherein, the load of described congested node exceedes default load threshold;
The mark of described congested node is encapsulated in data message;
Destination address according to described data message and the mark of described congested node determine the next-hop node of described data message, and described next-hop node is not described congested node.
Communication interface 33 is used for: give described next-hop node by described data message forwarding.
Alternatively, processor 31 specifically for: from a plurality of equative route, select a destination path according to the destination address of described data message; Whether the next-hop node judging described destination path is described congested node; If the next-hop node of described destination path is not described congested node, it is determined that the next-hop node of described destination path is the next-hop node of described data message; If the next-hop node of described destination path is described congested node, then residual paths except described destination path redefines from described a plurality of equative route the next-hop node of described data message.
Alternatively, processor 31 specifically for: the mark of described congested node is encapsulated in the adjacent fields after the network interconnection protocol IP heading of described data message or multi-link transparent interconnection TRILL heading.
Described communication interface 33 is additionally operable to: obtain the load information of described all nodes. Specifically, communication interface 33 receives the load information of described all nodes that controller sends.
The origination node of the present embodiment, can be used for performing the technical scheme that embodiment one provides, and specific implementation is similar with technique effect, repeats no more here.
The structural representation of the intermediate node that Fig. 7 provides for the embodiment of the present invention six, as shown in Figure 7, the intermediate node 400 of the present embodiment includes: processor 41, memorizer 42, communication interface 43 and communication bus 44, wherein, memorizer 42 and communication interface 43 are connected with processor 41 by communication bus 44, memorizer 42 is used for storing computer executable instructions, and processor 41 is used for performing described computer executable instructions, to perform method as described below:
Wherein, processor 41 is used for:
Receive the data message that upper hop node sends, described data message includes the mark of congested node and the destination address of described data message, the origination node that described congested node is described data message is determined according to the load information of nodes all in the network obtained in advance, and adds in described data message by the mark of described congested node;
Destination address according to described data message and the mark of described congested node determine the next-hop node of described data message, and wherein, described next-hop node can not be described congested node;
Communication interface 43 is used for: give described next-hop node by described data message forwarding.
Alternatively, processor 41 specifically for: from a plurality of equative route, select a destination path according to the destination address of described data message; Whether the next-hop node judging described destination path is described congested node; If the next-hop node of described destination path is not described congested node, it is determined that the next-hop node of described destination path is the next-hop node of described data message; If the next-hop node of described destination path is described congested node, then residual paths except described destination path redefines from described a plurality of equative route the next-hop node of described data message.
Alternatively, the mark of described congested node is encapsulated in the adjacent fields after the network interconnection protocol IP heading of described data message or multi-link transparent interconnection TRILL heading.
The intermediate node of the present embodiment, can be used for performing the technical scheme that embodiment two provides, and specific implementation is similar with technique effect, repeats no more here.
One of ordinary skill in the art will appreciate that: all or part of step realizing above-mentioned each embodiment of the method can be completed by the hardware that programmed instruction is relevant. Aforesaid program can be stored in a computer read/write memory medium. This program upon execution, performs to include the step of above-mentioned each embodiment of the method; And aforesaid storage medium includes: the various media that can store program code such as ROM, RAM, magnetic disc or CDs.
Last it is noted that various embodiments above is only in order to illustrate technical scheme, it is not intended to limit; Although the present invention being described in detail with reference to foregoing embodiments, it will be understood by those within the art that: the technical scheme described in foregoing embodiments still can be modified by it, or wherein some or all of technical characteristic is carried out equivalent replacement; And these amendments or replacement, do not make the essence of appropriate technical solution depart from the scope of various embodiments of the present invention technical scheme.
Claims (16)
1. the method for routing based on load balancing, it is characterised in that including:
When origination node has data to send, described origination node determines congested node according to the load information of all nodes in the network obtained in advance, and wherein, the load of described congested node exceedes default load threshold;
The mark of described congested node is encapsulated in data message by described origination node;
Described origination node determines the next-hop node of described data message according to the destination address of described data message and the mark of described congested node, and described next-hop node is not described congested node;
Described data message forwarding is given described next-hop node by described origination node.
2. method according to claim 1, it is characterised in that described origination node determines the next-hop node of described data message according to the destination address of described data message and the mark of described congested node, including:
Described origination node selects a destination path according to the destination address of described data message from a plurality of equative route;
Described origination node judges whether the next-hop node of described destination path is described congested node;
If the next-hop node of described destination path is not described congested node, then described origination node determines the next-hop node that next-hop node is described data message of described destination path;
If the next-hop node of described destination path is described congested node, then described origination node redefines the next-hop node of described data message from described a plurality of equative route in residual paths except described destination path.
3. method according to claim 1 and 2, it is characterised in that the mark of described congested node is encapsulated in data message by described origination node, including:
The mark of described congested node is encapsulated in the adjacent fields after the network interconnection protocol IP heading of described data message or multi-link transparent interconnection TRILL heading by described origination node.
4. method according to claim 3, it is characterised in that before described origination node determines congested node according to the load information of all nodes in the network obtained in advance, described method also includes:
Described origination node obtains the load information of described all nodes.
5. method according to claim 4, it is characterised in that described origination node obtains the load information of described all nodes, including:
Described origination node receives the load information of described all nodes that controller sends.
6. the method for routing based on load balancing, it is characterised in that including:
Intermediate node receives the data message that upper hop node sends, described data message includes the mark of congested node and the destination address of described data message, the origination node that described congested node is described data message is determined according to the load information of nodes all in the network obtained in advance, and adds in described data message by the mark of described congested node;
Described intermediate node determines the next-hop node of described data message according to the destination address of described data message and the mark of described congested node, and wherein, described next-hop node can not be described congested node;
Described data message forwarding is given described next-hop node by described intermediate node.
7. method according to claim 6, it is characterised in that described intermediate node determines the next-hop node of described data message according to the destination address of described data message and the mark of described congested node, including:
Described intermediate node selects a destination path according to the destination address of described data message from a plurality of equative route;
Described intermediate node judges whether the next-hop node of described destination path is described congested node;
If the next-hop node of described destination path is not described congested node, then described intermediate node determines the next-hop node that next-hop node is described data message of described destination path;
If the next-hop node of described destination path is described congested node, then described intermediate node redefines the next-hop node of described data message from described a plurality of equative route in residual paths except described destination path.
8. the method according to claim 6 or 7, it is characterised in that the mark of described congested node is encapsulated in the adjacent fields after the network interconnection protocol IP heading of described data message or multi-link transparent interconnection TRILL heading.
9. an origination node, it is characterised in that including:
First determines module, and for when described origination node has data to send, determining congested node according to the load information of all nodes in the network obtained in advance, wherein, the load of described congested node exceedes default load threshold;
Package module, for being encapsulated in data message by the mark of described congested node;
Second determines module, and for determining the next-hop node of described data message according to the destination address of described data message and the mark of described congested node, described next-hop node is not described congested node;
Sending module, for giving described next-hop node by described data message forwarding.
10. origination node according to claim 9, it is characterised in that described second determine module specifically for:
Destination address according to described data message selects a destination path from a plurality of equative route;
Whether the next-hop node judging described destination path is described congested node;
If the next-hop node of described destination path is not described congested node, it is determined that the next-hop node of described destination path is the next-hop node of described data message;
If the next-hop node of described destination path is described congested node, then residual paths except described destination path redefines from described a plurality of equative route the next-hop node of described data message.
11. the origination node according to claim 9 or 10, it is characterised in that described package module specifically for:
The mark of described congested node is encapsulated in the adjacent fields after the network interconnection protocol IP heading of described data message or multi-link transparent interconnection TRILL heading.
12. origination node according to claim 11, it is characterised in that described origination node also includes:
Acquisition module, for obtaining the load information of described all nodes.
13. origination node according to claim 12, it is characterised in that described acquisition module specifically for:
Receive the load information of described all nodes that controller sends.
14. an intermediate node, it is characterised in that including:
Receiver module, for receiving the data message that upper hop node sends, described data message includes the mark of congested node and the destination address of described data message, the origination node that described congested node is described data message is determined according to the load information of nodes all in the network obtained in advance, and adds in described data message by the mark of described congested node;
Determining module, for determining the next-hop node of described data message according to the destination address of described data message and the mark of described congested node, wherein, described next-hop node can not be described congested node;
Sending module, for giving described next-hop node by described data message forwarding.
15. intermediate node according to claim 14, it is characterised in that described determine module specifically for:
Destination address according to described data message selects a destination path from a plurality of equative route;
Whether the next-hop node judging described destination path is described congested node;
If the next-hop node of described destination path is not described congested node, it is determined that the next-hop node of described destination path is the next-hop node of described data message;
If the next-hop node of described destination path is described congested node, then residual paths except described destination path redefines from described a plurality of equative route the next-hop node of described data message.
16. the intermediate node according to claims 14 or 15, it is characterised in that the mark of described congested node is encapsulated in the adjacent fields after the network interconnection protocol IP heading of described data message or multi-link transparent interconnection TRILL heading.
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 true CN105634973A (en) | 2016-06-01 |
| CN105634973B 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) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109597830A (en) * | 2018-11-22 | 2019-04-09 | 阿里巴巴集团控股有限公司 | A kind of data circulation method, device, equipment and medium |
| WO2021136430A1 (en) * | 2019-12-31 | 2021-07-08 | 中兴通讯股份有限公司 | Path selection method and apparatus, computer device, and computer readable medium |
| CN113393235A (en) * | 2020-03-13 | 2021-09-14 | 富士通株式会社 | Information processing apparatus for processing write request and transmission control method |
| CN114124825A (en) * | 2021-10-26 | 2022-03-01 | 中国联合网络通信集团有限公司 | Data transmission method, system, device and storage medium |
| WO2022257917A1 (en) * | 2021-06-11 | 2022-12-15 | 华为技术有限公司 | Path planning method and related device |
Citations (5)
| 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 |
| US20110110230A1 (en) * | 2008-07-16 | 2011-05-12 | Huawei Technologies Co., Ltd. | Method and apparatus for controlling congestion of wireless multi-hop 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 |
-
2014
- 2014-10-30 CN CN201410606072.0A patent/CN105634973B/en active Active
Patent Citations (5)
| 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 |
| US20110110230A1 (en) * | 2008-07-16 | 2011-05-12 | Huawei Technologies Co., Ltd. | Method and apparatus for controlling congestion of wireless multi-hop 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 |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109597830A (en) * | 2018-11-22 | 2019-04-09 | 阿里巴巴集团控股有限公司 | A kind of data circulation method, device, equipment and medium |
| CN109597830B (en) * | 2018-11-22 | 2023-05-05 | 创新先进技术有限公司 | Data circulation method, device, equipment and medium |
| WO2021136430A1 (en) * | 2019-12-31 | 2021-07-08 | 中兴通讯股份有限公司 | Path selection method and apparatus, computer device, and computer readable medium |
| CN113393235A (en) * | 2020-03-13 | 2021-09-14 | 富士通株式会社 | Information processing apparatus for processing write request and transmission control method |
| WO2022257917A1 (en) * | 2021-06-11 | 2022-12-15 | 华为技术有限公司 | Path planning method and related device |
| CN114124825A (en) * | 2021-10-26 | 2022-03-01 | 中国联合网络通信集团有限公司 | Data transmission method, system, device and storage medium |
| CN114124825B (en) * | 2021-10-26 | 2023-05-16 | 中国联合网络通信集团有限公司 | Method, system, device and storage medium for data transmission |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105634973B (en) | 2019-07-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11658905B2 (en) | Routing control method, device, and system | |
| KR102555671B1 (en) | Packet processing methods, related devices and computer storage media | |
| US11290369B2 (en) | Methods in a telecommunications network | |
| EP3395020B1 (en) | Shifting network traffic from a network device | |
| US8406153B2 (en) | Affecting node association through load partitioning | |
| US9699077B2 (en) | Method for determining a packet forwarding path, network device, and control device | |
| US20170111261A1 (en) | Latency optimized segment routing tunnels | |
| EP1757026B1 (en) | Method and apparatus for forwarding data in a data communications network | |
| CN105634973A (en) | Routing method and equipment based on load balancing | |
| CN113543219B (en) | Communication method and device | |
| US9548930B1 (en) | Method for improving link selection at the borders of SDN and traditional networks | |
| WO2015181650A1 (en) | Enhanced procedure to compute lfas with igp max metric | |
| CN103560971A (en) | Network flow balancing control method and device | |
| US11805047B2 (en) | Method and apparatus for controlling network traffic path | |
| CN112187649A (en) | Message forwarding method, message processing method and device | |
| US10003569B2 (en) | Network resource sharing for routing and forwarding information | |
| EP3484107B1 (en) | Parameter notification and obtaining methods and devices, and storage medium | |
| EP3474504B1 (en) | Leaf-to-spine uplink bandwidth advertisement to leaf-connected servers | |
| WO2020049577A1 (en) | Network node, first node, second node and methods performed thereby for routing a packet through a path | |
| EP2829027B1 (en) | Routing by selecting a routing table from a plurality of routing tables | |
| CN111740917A (en) | Message forwarding method and device | |
| CN111245716A (en) | Inter-domain routing method, device and system | |
| US20240223644A1 (en) | Method to prioritize and offload mobile edge cloud traffic in 5g | |
| CN117938744A (en) | Method, device, equipment and medium for adjusting operation state of service management system | |
| EP3316530A1 (en) | Dynamic modification of bypass label-switched paths based on monitoring network traffic conditions |
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 |