CN101873251A - Message forwarding method and device - Google Patents

Message forwarding method and device Download PDF

Info

Publication number
CN101873251A
CN101873251A CN200910137240A CN200910137240A CN101873251A CN 101873251 A CN101873251 A CN 101873251A CN 200910137240 A CN200910137240 A CN 200910137240A CN 200910137240 A CN200910137240 A CN 200910137240A CN 101873251 A CN101873251 A CN 101873251A
Authority
CN
China
Prior art keywords
interface
message
working
hash
integrated flow
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN200910137240A
Other languages
Chinese (zh)
Inventor
李伟
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
ZTE Corp
Original Assignee
ZTE Corp
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by ZTE Corp filed Critical ZTE Corp
Priority to CN200910137240A priority Critical patent/CN101873251A/en
Publication of CN101873251A publication Critical patent/CN101873251A/en
Pending legal-status Critical Current

Links

Images

Landscapes

  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention provides message forwarding method and device, wherein the message forwarding method comprises the following steps of: acquiring the cumulative flow of each working interface of a plurality of working interfaces, and updating Hash magnitude corresponding relation on the current working interfaces according to the cumulative flow of each interface and preset flow threshold values, wherein each working interface of a plurality of working interfaces has a corresponding Hash magnitude; and according to an undated result, forwarding a message through the interface corresponding to the Hash magnitude of the message required to be forwarded. The invention can overcome the problem that a sharing effect and a transmission quality can not be ensured at the same time when the message is forwarded in the prior art, can improve the sharing effect of link load in the message transmission process and is beneficial to improving the message transmission quality.

Description

Message forwarding method and device
Technical field
The present invention relates to the communications field, in particular to a kind of message forwarding method and device.
Background technology
At present, the link from another node of node arrival can have many.For example, 5 link can be from node R 1 to node R: R1-R2-R5, or R1-R3-R4-R5, but perhaps other line links.When R1 received message, a link need be selected by system in these two links, to carry out message forwarding.How this promptly, realizes the problem of the load balancing of message on multilink with regard to relating to the problem of how to carry out link selection in multilink.
More popular load balancing technology mainly comprises following two kinds at present: carry on a shoulder pole, share by message by flow point.Wherein, be meant at first that by flow point load according to the feature of message, for example, the five-tuple of message (source IP, purpose IP, protocol number, source port, destination interface) calculates a Hash (hash) value, according to this cryptographic Hash selection link.Share the mode that is to use the poll counter device by message, whenever receiving a message, the poll counter device just adds 1, selects link according to the result of calculation of poll counter device.
(can abbreviate big message as for long message, generally be meant the message of length) greater than the MTU (MTU) of link, in transmission course, this message can be divided into several fragment messages to be transmitted respectively, these several fragment messages following problem will occur when the forwarding of carrying out based on the load balancing technology:
If adopt and above-mentioned select link by flow point load mode, these fragment messages are not easy to occur out of order, but since the hash algorithm determine, so these fragment messages are only transmitted at same link.Therefore, when the kind of big message more after a little while, the link that can cause selecting is less fixing several, has influenced the effect of load balancing;
If adopt the mode of sharing by message to select link, can access load balancing effect preferably, still,, can cause the out of order of message, and then influence the transmission quality of message because the link that each fragment message is transmitted may be different.
In sum, can't take into account the problem of sharing effect and transmission quality, not propose effective solution at present as yet at the message repeating process based on the load balancing technology in the correlation technique.
Summary of the invention
, when message is transmitted, can't take into account the problem of sharing effect and transmission quality simultaneously and propose the present invention at above-mentioned.For this reason, the present invention aims to provide a kind of improved message and transmits scheme, to address the above problem.
To achieve these goals, according to an aspect of the present invention, provide a kind of message forwarding method, the destination address of the message of Zhuan Faing obtains a plurality of working interfaces corresponding with this destination address as required.
Message forwarding method according to the present invention comprises: according to the integrated flow of each working interface that obtains, and predetermined flow threshold carries out the renewal of Hash mould value corresponding relation to working interface; According to upgrading the result, the corresponding working interface of Hash mould value by the message transmitted with needs E-Packets.
Before E-Packeting, further comprise: the feature five-tuple according to message obtains cryptographic Hash, and according to cryptographic Hash the quantity of work at present interface is carried out modulo operation, obtains the Hash mould value of message.
Before the renewal operation of a plurality of working interfaces being carried out Hash mould value corresponding relation, said method also comprises: the integrated flow that each interface is current compares with the flow threshold of being scheduled to, and at comparative result be the integrated flow of this working interface more than or equal to predetermined flow threshold, this working interface is upgraded operation.
The above-mentioned renewal operation that a plurality of working interfaces are carried out Hash mould value corresponding relation further comprises: for each working interface, judge whether its interface number equates with the numerical value of corresponding Hash mould value, and be judged as under the situation that is, the interface number of this Hash mould value correspondence is updated to the interface number of the interface of integrated flow minimum in a plurality of working interfaces; Otherwise relatively the numerical value with this Hash mould value is the current integrated flow and predetermined flow threshold of other interface of interface number; If the current integrated flow of other interface is in a plurality of work at present interfaces one less than predetermined flow threshold and other interface, then the interface number of this Hash mould value correspondence is updated to the numerical value of this Hash mould value; Otherwise, the interface number of this Hash mould value correspondence is updated to the interface number of the interface of integrated flow minimum in a plurality of work at present interfaces.
Preferably, if the interface quantity of current integrated flow minimum is a plurality of, the interface of then selecting interface number minimum in the interface of current integrated flow minimum upgrades being used for.
In addition, for each working interface, after E-Packeting, method also comprises: the integrated flow that upgrades this working interface.
And, for each working interface, after the renewal operation is finished, with the integrated flow zero clearing of this interface.
Preferably, the above-mentioned predetermined flow threshold average cumulative flow that is a plurality of working interfaces.
According to a further aspect in the invention, provide a kind of apparatus for forwarding message, the destination address that comprises the message that is used for transmitting as required obtains first acquisition module of a plurality of a plurality of working interfaces corresponding with destination address.
Apparatus for forwarding message according to invention also comprises: second acquisition module is used to obtain the integrated flow of each working interface; Update module, be used for the integrated flow of each interface of obtaining according to second acquisition module and predetermined flow threshold and a plurality of working interfaces carried out the renewal of Hash mould value corresponding relation, wherein, each interface in a plurality of working interfaces has corresponding Hash mould value respectively; Sending module is used for the renewal result according to update module, E-Packets by the interface corresponding with the Hash mould value of message.
Preferably, said apparatus also comprises: comparison module, the size that is used for the integrated flow and the predetermined flow threshold of each interface that comparison second acquisition module obtains, and relatively whether the numerical value of its corresponding Hash mould of each interface value obtained of second acquisition module equates; Counter is used at each working interface, and after E-Packeting, to the integrated flow counting of this interface, and after update module was carried out the renewal operation, the integrated flow of docking port was counted again.
By means of technique scheme one of at least, by according to the integrated flow of each interface and predetermined flow threshold, a plurality of work at present interfaces are carried out the renewal of Hash mould value corresponding relation, and E-Packet according to upgrading the result, can overcome and above-mentionedly when E-Packeting, can't take into account the problem of sharing effect and transmission quality simultaneously, can improve sharing effect and helping to improve the transmission quality of message of link load in the message transmission procedure.
Description of drawings
Accompanying drawing described herein is used to provide further understanding of the present invention, constitutes the application's a part, and illustrative examples of the present invention and explanation thereof are used to explain the present invention, do not constitute improper qualification of the present invention.In the accompanying drawings:
Fig. 1 is the flow chart according to the message forwarding method of the embodiment of the invention;
Fig. 2 is the schematic diagram according to the equal-cost route interface table in the message forwarding method of the embodiment of the invention;
Fig. 3 is the detail flowchart of the message forwarding method of the embodiment of the invention;
Fig. 4 is the detail flowchart of the step 307 in the flow process of message processing method shown in Figure 3;
Fig. 5 is the block diagram of the apparatus for forwarding message of the embodiment of the invention;
Fig. 6 is the preferred block diagram of the apparatus for forwarding message of the embodiment of the invention.
Embodiment
Functional overview
As mentioned above, for based on the forwarding of load balancing technology operation, though be that the situation of packet out-ordering is less by flow point load mode, the load balancing effect is relatively poor; Though and share mode by bag is that the effect of load balancing is better, the situation of packet out-ordering is more, and then influences the transmission quality of message.Based on this, the present invention is in conjunction with the advantage of two kinds of load balancing technology, a kind of message forwarding method and device are provided, promptly, by according to the integrated flow of each interface and predetermined flow threshold, a plurality of work at present interfaces are carried out the renewal of Hash mould value corresponding relation, and E-Packet according to upgrading the result.Because the integrated flow of the interface of the Hash mould value correspondence of each message all is current less, therefore, than prior art, load balancing effect of the present invention is better, and because the interface of the Hash mould value correspondence of message is certain in a update cycle, the next update cycle also seldom can be changed, therefore, than prior art, the present invention can reduce the situation of packet out-ordering, can improve the transmission quality of message.
Below with reference to the accompanying drawings and in conjunction with the embodiments, describe the present invention in detail.Need to prove that if do not conflict, embodiment and the feature among the embodiment among the application can make up mutually.
Method embodiment
Need to prove that for convenience of description, below illustrated and described the technical scheme of method embodiment of the present invention with the form of step, the step that illustrates can be carried out in the computer system such as a set of computer-executable instructions.Though show logical order in the drawings, in some cases, can carry out step shown or that describe with the order that is different from herein.
According to the embodiment of the invention, provide a kind of message forwarding method.The destination address of the message of Zhuan Faing obtains a plurality of work at present interfaces corresponding with destination address at first, as required.Fig. 1 is the flow chart according to the message forwarding method of the embodiment of the invention, and as shown in Figure 1, this flow process comprises step 102 and 104.
Step 102, obtain the integrated flow of each interface in a plurality of work at present interfaces, and a plurality of work at present interfaces are carried out the renewal of Hash mould value corresponding relation according to the integrated flow of each interface and predetermined flow threshold, wherein, each interface in a plurality of work at present interfaces has corresponding Hash mould value respectively.The predetermined flow threshold here can be the average cumulative flow of a plurality of work at present interfaces, perhaps according to the actual performance setting of system.
The Hash mould value here can be obtained in the following way: the feature five-tuple of the message of Zhuan Faing (comprising source IP, purpose IP, protocol number, source port, destination interface) obtains cryptographic Hash as required, and this cryptographic Hash carried out modulo operation to the quantity of a plurality of work at present interfaces, obtain the Hash mould value of this message that need transmit.
Wherein, the method according to feature five-tuple calculating cryptographic Hash can be:
Suppose key0=source IP[0] ^ source IP[1] ^ source IP[2] ^ source IP[3], key1=purpose IP[0] ^ purpose IP[1] ^ purpose IP[2] ^ purpose IP[3], the key2=protocol number, key3=source port _ H8^ source port _ L8, key4=destination interface _ H8^ destination interface _ L8, key=key0^key1^key2^key3^key4, with the key of 8 bits that obtain at last as cryptographic Hash.Wherein, H8 represents high 8 bits, and L8 represents low 8 bits, and source IP and purpose IP be totally 32 bits, respectively is divided into 4 sections [0]~[3] of 8 bits, and " ^ " represents xor operation (also can be designated as XOR).
Step 104, according to upgrading the result, the corresponding interface of Hash mould value by the message transmitted with needs E-Packets.And after E-Packeting, the integrated flow of updating interface.
Preferably, in actual applications can be with predetermined period execution in step 102, the selection of update cycle can be compared flexibly, and the cycle is selected to satisfy the requirement that interface in time switches particularly, and can control by a timer.
By above description as can be seen, by E-Packeting according to the interface corresponding with the corresponding Hash mould of message value, and regularly or aperiodically Hash mould value and interface corresponding relation are upgraded, making message to share on multilink transmits, and because the corresponding relation of Hash mould value and interface is constant in a period of time, thereby reduced the situation of packet out-ordering, improved the transmission quality of message.
Below describe in detail and in the above-mentioned steps 102 a plurality of work at present interfaces carried out the renewal operation (may further comprise the steps 1-3) of Hash mould value corresponding relation:
Step 1, for each interface in a plurality of work at present interfaces, the integrated flow that each interface is current compares with predetermined flow threshold, and at comparative result be the integrated flow of this interface more than or equal to this predetermined flow threshold, this interface upgraded operates.This be because, if the integrated flow of this interface shows that then the burden of this interface link corresponding has been in saturation condition, and should avoid using this interface to E-Packet as far as possible more than or equal to predetermined flow threshold.Certainly, if the integrated flow of interface represents then that less than this predetermined flow threshold the burden of this interface link corresponding is in undersaturated condition, this link can also continue to E-Packet, and at this moment, does not need to upgrade operation;
Step 2, for each interface in a plurality of work at present interfaces, after comparative result is the integrated flow of this interface flow threshold predetermined more than or equal to this, whether the interface number of judging this interface again equates with the numerical value of corresponding Hash mould value, and be judged as under the situation that is, the interface number of this Hash mould value correspondence is updated to the interface number of the interface of integrated flow minimum in a plurality of work at present interfaces; Otherwise relatively the numerical value with this Hash mould value is the current integrated flow and predetermined flow threshold of other interface of interface number;
Step 3, if the current integrated flow that with the numerical value of above-mentioned Hash mould value is other interface of interface number is in a plurality of work at present interfaces one less than predetermined flow threshold and this other interface, then the interface number of this Hash mould value correspondence is updated to the numerical value of this Hash mould value; Otherwise, the interface number of this Hash mould value correspondence is updated to the interface number of the interface of integrated flow minimum in a plurality of work at present interfaces.
For example, the interface number of the interface (being called interface 3) of Hash mould value 0 current correspondence is 3, the interface number of the interface (being called interface 1) of Hash mould value 1 current correspondence is 1, the interface number of the interface (being called interface 0) of Hash mould value 2 current correspondences is 0, the interface number of the interface (being called interface 2) of integrated flow minimum in current a plurality of work at present interface (the integrated flow minimum can be regarded as less than predetermined flow threshold) is 2, the current integrated flow of interface 0 is less than predetermined flow threshold, and interface 0, interface 1, interface 2 and interface 3 all are the work at present interfaces.
If whether the current integrated flow of interface 3, is then judged this interface 3 more than or equal to predetermined flow threshold and is equated with the numerical value (being 0) of Hash mould value accordingly.Because both are unequal, therefore, judge that again interface number is the size of current integrated flow with the predetermined flow threshold of 0 interface (interface 0).Because after the current integrated flow of interface 0 less than predetermined flow threshold, then upgraded operation, the interface of Hash mould value 0 correspondence was an interface 0.
If whether the current integrated flow of interface 1, is then judged this interface 1 more than or equal to predetermined flow threshold and is equated with the numerical value (being 1) of Hash mould value accordingly.Because both equate, therefore, the interface number of the interface of integrated flow minimum in current a plurality of work at present interfaces (promptly 2) is updated to the interface number of Hash mould value 1 correspondence.That is, after renewal was finished, the interface of Hash mould value 1 correspondence was an interface 2.
In practical operation, if the interface quantity of current integrated flow minimum is a plurality of, the interface of then selecting interface number minimum in the interface of current integrated flow minimum upgrades being used for.For example, interface 1, interface 2, interface 3 all are the interfaces of current integrated flow minimum, and then option interface 1 is upgraded operation.
After the renewal operation (comprising that judgement does not need to upgrade the Hash mould value of operation) of each Hash mould value being carried out corresponding relation, just to the integrated flow zero clearing of total interface.
Example one
In this example, Yu Ding flow threshold is the average cumulative flow of a plurality of work at present interfaces.
The corresponding relation of its corresponding interface of Hash mould value is here described with form, and wherein, Hash mould value is as the index of form (i.e. Yi Xia equal-cost route interface table).At first set in advance equal-cost route interface table: according to the feature of each message, here with the five-tuple feature, calculate cryptographic Hash, according to the cryptographic Hash that obtains the total quantity of current effective equal-cost link (current effective equal-cost link here is above-mentioned work at present interface link corresponding) is carried out modulo operation, the value that obtains is as index (being above-mentioned Hash mould value), to search equal-cost route interface table, E-Packet (comprising fragment message) at the interface corresponding with index.
Fig. 2 is the schematic diagram of the equal-cost route interface table in this example, as shown in Figure 2, and wherein, interface ID is the interface number of above-mentioned interface, for example, the interface of the current correspondence of index 1 (being Hash mould value 1) is 6, and then Hash mould value is that 1 the current forwarding interface of message is an interface 6.The initial value of the interface ID of this equivalence routing interface table is changed to index value.
The renewal operation here is periodic, the selection of update cycle can be compared flexibly, if but the update cycle is oversize, then can not satisfy the requirement that interface in time switches, if the update cycle is too short, it is frequent that interface is switched, increase the possibility of packet out-ordering, therefore, rule of thumb be worth, the cycle here is set to 50ms between the 500ms, and this cycle can be controlled by a timer.
Describe this example in detail below in conjunction with the message forwarding method shown in Fig. 3, as shown in Figure 3, this method may further comprise the steps 301-308:
Step 301 for the message that receives, judges at first whether this message needs to carry out the forwarding based on the load balancing technology, if do not need to carry out forwarding based on the load balancing technology, then proceed to step 302, carry out forwarding if desired, then proceed to step 303 based on the load balancing technology;
Step 302 is carried out the flow process that normally E-Packets of the prior art, and upgrades the flowmeter counter of the interface that E-Packets;
Step 303 is searched the equal-cost route interface table of destination network segment correspondence under this purpose IP according to this message purpose IP;
Step 304, feature five-tuple (source IP, purpose IP, protocol number, source port, destination interface) according to this message calculates the hash value, and the hash value carried out modulo operation to current effective equal-cost link sum, with the result after the modulo operation (being above-mentioned Hash mould value) as the index of searching above-mentioned equal-cost route interface table;
Step 305 according to index, is searched the interface corresponding with index, uses this interface to transmit this message, and upgrades the flowmeter counter of this interface;
Whether then step 306 judges timer, if then proceed to step 307, otherwise forward step 301 to;
Step 307, parity price routing interface table upgrades operation, this step is corresponding to above-mentioned steps 102, all list items all upgrade finish after, proceed to step 308;
Step 308 after renewal is finished, with the zero clearing of the counting of the flow on each bar equal-cost link, is restarted the traffic statistics of following one-period.
For above-mentioned steps 307, (step 401-409) describes this step below in conjunction with flow process shown in Figure 4:
Step 401, calculate the average cumulative flow of the effective equal-cost link of current each bar, concrete operations are: according to the total data flow (being designated as T) on current each the bar equal-cost link in the equal-cost route interface table and the total quantity (being designated as N) of current equal-cost link, calculate the average cumulative flow (being designated as Ta) on current each bar equal-cost link, Ta=T/N;
Step 402, for each list item in the equal-cost route interface table (with interface ID is 1, and promptly interface 1 is an example), integrated flow (being designated as X) in interface 1 current slot in the judgement list item and the relation of Ta;
Step 403, this step promptly, judge whether X>=Ta sets up corresponding to above-mentioned steps 1, if set up, then proceed to step 404, otherwise, do not upgrade this list item, proceed to step 409;
Step 404, this step judge corresponding to above-mentioned steps 2 whether the index of this list item equates with interface ID, if equate, proceed to step 407, otherwise, proceed to step 405;
Step 405, this step be corresponding to above-mentioned steps 3, judges that ID for the relation of the integrated flow (being designated as Y) in the current slot of the interface of this table item index number with Ta, proceeds to step 406;
Step 406 judges whether Y<Ta sets up, if set up, then proceeds to step 408, otherwise, proceed to step 407;
Step 407, select that link of integrated flow minimum in current timing cycle time period in current effective equal-cost link to upgrade the interface of this list item, if the link of integrated flow minimum has many in the current timing cycle time period, then that link of option interface ID minimum;
Step 408, the interface ID that upgrades this list item is this table item index, that is, after the renewal, the value of the interface ID of this list item is identical with the value of this table item index;
Step 409 is judged whether all list items in the equal-cost route interface table all upgrade to finish, if then this flow process finishes, otherwise, forward step 402 to, carry out the renewal operation of other list items.
Device embodiment
According to the embodiment of the invention, a kind of apparatus for forwarding message is provided, be preferably used for realizing the method among the said method embodiment.Fig. 5 is the block diagram of the apparatus for forwarding message of the embodiment of the invention, and as shown in Figure 5, this device comprises: first acquisition module 1, second acquisition module 2, update module 3 and sending module 4, wherein:
First acquisition module 1, the destination address of the message that is used for transmitting as required obtains a plurality of work at present interfaces corresponding with destination address; Second acquisition module 2 is connected to first acquisition module 1, is used for obtaining the integrated flow of each interface of a plurality of work at present interfaces; Update module 3, be connected to second acquisition module 2, be used for the integrated flow of each interface of obtaining according to second acquisition module 2 and predetermined flow threshold and a plurality of work at present interfaces carried out the renewal of Hash mould value corresponding relation, wherein, each interface in a plurality of work at present interfaces has corresponding Hash mould value respectively; Sending module 4 is connected to update module 3, is used for the renewal result according to update module 3, transmits this message by the interface corresponding with the Hash mould value of message.
The predetermined flow threshold here can be the average cumulative flow of a plurality of work at present interfaces, perhaps according to the actual performance setting of system.
By above description as can be seen, upgrade the corresponding relation of Hash mould value and interface by update module 3, and sending module 4 E-Packets according to the corresponding relation after upgrading, make message to share on multilink and transmit, and message out of order situation to occur less.
Preferably, this device also comprises comparison module shown in Figure 65 sum counters 6, wherein, comparison module 5, be connected to second acquisition module 2, the size that is used for the integrated flow and the predetermined flow threshold of each interface that comparison second acquisition module 2 obtains, and relatively whether the numerical value of its corresponding Hash mould of each interface value obtained of second acquisition module 2 equates.That is, this comparison module can be used for carrying out the compare operation of the step 1 of said method embodiment, the decision operation in the step 2; Counter 6 is connected to sending module 4 and update module 3, is used for each interface at a plurality of work at present interfaces, after E-Packeting, to the counting of this interface, and after update module 3 is carried out the renewal operation, again the integrated flow of this interface is counted.The counter 6 here can be the combination of a plurality of sub-counters, and each sub-counter is used for the integrated flow of an interface is counted.
In practical operation, this device can also comprise the timer (not shown), is used for arriving constantly at timer, carries out update module 3.
The implementation particularly of above-mentioned each module can repeat no more here with reference to the corresponding description among the said method embodiment.
In sum, the present invention is according to the loading condition of work at present interface link corresponding, upgrade the corresponding relation of Hash mould value and interface, just carry out because this renewal operates in when the load of work at present interface link corresponding surpasses predetermined flow threshold, therefore, the link of same data flow selection can frequently not change, than prior art, the present invention can improve the effect of load sharing, reduces the situation of packet out-ordering, and then improves the transmission quality of message.
Obviously, those skilled in the art should be understood that, above-mentioned each module of the present invention or each step can realize with the general calculation device, they can concentrate on the single calculation element, perhaps be distributed on the network that a plurality of calculation element forms, alternatively, they can be realized with the executable program code of calculation element, thereby, they can be stored in the storage device and carry out by calculation element, perhaps they are made into each integrated circuit modules respectively, perhaps a plurality of modules in them or step are made into the single integrated circuit module and realize.Like this, the present invention is not restricted to any specific hardware and software combination.
The above is the preferred embodiments of the present invention only, is not limited to the present invention, and for a person skilled in the art, the present invention can have various changes and variation.Within the spirit and principles in the present invention all, any modification of being done, be equal to replacement, improvement etc., all should be included within protection scope of the present invention.

Claims (10)

1. message forwarding method, the destination address of the message of Zhuan Faing obtains the corresponding working interface of a plurality of and described destination address as required, it is characterized in that, comprising:
According to the integrated flow of each the described working interface that obtains, and predetermined flow threshold carries out the renewal of Hash mould value corresponding relation to described working interface;
According to upgrading the result, transmit described message by the corresponding working interface of Hash mould value of the message transmitted with needs.
2. method according to claim 1 is characterized in that, before transmitting described message, further comprises:
Feature five-tuple according to described message obtains cryptographic Hash, and according to described cryptographic Hash the quantity of described working interface is carried out modulo operation, obtains the Hash mould value of described message.
3. method according to claim 1 is characterized in that, described a plurality of working interfaces is carried out before the renewal operation of Hash mould value corresponding relation, and described method also comprises:
Integrated flow that each working interface is current and described predetermined flow threshold compare, and at comparative result be the integrated flow of this working interface more than or equal to described predetermined flow threshold, this working interface is upgraded operation.
4. method according to claim 3 is characterized in that, the renewal operation of described a plurality of working interfaces being carried out Hash mould value corresponding relation further comprises:
For each working interface, judge whether its interface number equates with the numerical value of corresponding Hash mould value, and be judged as under the situation that is, the interface number of this Hash mould value correspondence is updated to the interface number of the interface of integrated flow minimum in described a plurality of working interface; Otherwise relatively the numerical value with this Hash mould value is the current integrated flow and the described predetermined flow threshold of other interface of interface number;
If the current integrated flow of described other interface is in described a plurality of work at present interface one less than described predetermined flow threshold and described other interface, then the interface number of this Hash mould value correspondence is updated to the numerical value of this Hash mould value; Otherwise, the interface number of this Hash mould value correspondence is updated to the interface number of the interface of integrated flow minimum in described a plurality of work at present interface.
5. method according to claim 4 is characterized in that, if the interface quantity of current integrated flow minimum is a plurality of, the interface of then selecting interface number minimum in the interface of described current integrated flow minimum upgrades being used for.
6. according to each described method in the claim 1 to 5, it is characterized in that for each working interface, transmit after the described message, described method also comprises: the integrated flow that upgrades this working interface.
7. according to each described method in the claim 1 to 5, it is characterized in that, for each working interface, after the renewal operation is finished, with the integrated flow zero clearing of this interface.
8. according to each described method in the claim 1 to 5, it is characterized in that described predetermined flow threshold is the average cumulative flow of described a plurality of working interfaces.
9. apparatus for forwarding message comprises that the destination address of the message that is used for transmitting as required obtains first acquisition module of the corresponding working interface of a plurality of and described destination address, is characterized in that described device also comprises:
Second acquisition module is used to obtain the integrated flow of each working interface;
Update module, be used for the integrated flow of each interface of obtaining according to described second acquisition module and predetermined flow threshold and described a plurality of working interfaces carried out the renewal of Hash mould value corresponding relation, wherein, each interface in described a plurality of working interface has corresponding Hash mould value respectively;
Sending module is used for the renewal result according to described update module, transmits described message by the interface corresponding with the Hash mould value of described message.
10. device according to claim 9 is characterized in that, described device also comprises:
Comparison module is used for the size of the integrated flow and the described predetermined flow threshold of each interface that more described second acquisition module obtains, and whether the numerical value of its corresponding Hash mould of each interface value obtained of more described second acquisition module equates;
Counter is used for transmitting after the described message at described each working interface, and to the integrated flow counting of this interface, and after described update module was carried out the renewal operation, the integrated flow of docking port was counted again.
CN200910137240A 2009-04-27 2009-04-27 Message forwarding method and device Pending CN101873251A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN200910137240A CN101873251A (en) 2009-04-27 2009-04-27 Message forwarding method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN200910137240A CN101873251A (en) 2009-04-27 2009-04-27 Message forwarding method and device

Publications (1)

Publication Number Publication Date
CN101873251A true CN101873251A (en) 2010-10-27

Family

ID=42997927

Family Applications (1)

Application Number Title Priority Date Filing Date
CN200910137240A Pending CN101873251A (en) 2009-04-27 2009-04-27 Message forwarding method and device

Country Status (1)

Country Link
CN (1) CN101873251A (en)

Cited By (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102148768A (en) * 2011-05-26 2011-08-10 杭州华三通信技术有限公司 Message forwarding method and device
CN102158398A (en) * 2011-02-25 2011-08-17 杭州华三通信技术有限公司 Method and device for forwarding messages
CN102447636A (en) * 2012-01-06 2012-05-09 中兴通讯股份有限公司 Load sharing method and device of data center communication equipment
CN102780632A (en) * 2012-08-07 2012-11-14 华为技术有限公司 Load sharing method and flow transmission equipment
CN103391219A (en) * 2013-08-09 2013-11-13 盛科网络(苏州)有限公司 Message analysis method and device based on conversation
CN103491020A (en) * 2013-09-23 2014-01-01 迈普通信技术股份有限公司 Load balancing method and device of multilink bound with different bandwidths
CN105939283A (en) * 2016-03-17 2016-09-14 杭州迪普科技有限公司 Network flow shunting method and device
WO2016177196A1 (en) * 2015-08-27 2016-11-10 中兴通讯股份有限公司 Load sharing method and device
CN106713172A (en) * 2015-11-16 2017-05-24 华为数字技术(苏州)有限公司 Method and device for scheduling message
CN110191109A (en) * 2019-05-17 2019-08-30 杭州迪普信息技术有限公司 A kind of packet sampling method and device
CN111131059A (en) * 2019-12-04 2020-05-08 视联动力信息技术股份有限公司 Data transmission control method, device and computer readable storage medium
CN112422447A (en) * 2020-11-13 2021-02-26 新华三技术有限公司合肥分公司 Method and device for selecting member port

Cited By (22)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102158398A (en) * 2011-02-25 2011-08-17 杭州华三通信技术有限公司 Method and device for forwarding messages
CN102148768A (en) * 2011-05-26 2011-08-10 杭州华三通信技术有限公司 Message forwarding method and device
CN102148768B (en) * 2011-05-26 2014-11-26 杭州华三通信技术有限公司 Message forwarding method and device
CN102447636A (en) * 2012-01-06 2012-05-09 中兴通讯股份有限公司 Load sharing method and device of data center communication equipment
WO2013102347A1 (en) * 2012-01-06 2013-07-11 中兴通讯股份有限公司 Load sharing method and device of data center communication apparatus
CN102780632B (en) * 2012-08-07 2016-04-06 华为技术有限公司 A kind of load sharing method and flow forwarding equipment
CN102780632A (en) * 2012-08-07 2012-11-14 华为技术有限公司 Load sharing method and flow transmission equipment
WO2014023098A1 (en) * 2012-08-07 2014-02-13 华为技术有限公司 Load balance method and flow forwarding device
CN103391219A (en) * 2013-08-09 2013-11-13 盛科网络(苏州)有限公司 Message analysis method and device based on conversation
CN103491020B (en) * 2013-09-23 2016-08-24 迈普通信技术股份有限公司 Multilink binding different bandwidth load-balancing method and device
CN103491020A (en) * 2013-09-23 2014-01-01 迈普通信技术股份有限公司 Load balancing method and device of multilink bound with different bandwidths
WO2016177196A1 (en) * 2015-08-27 2016-11-10 中兴通讯股份有限公司 Load sharing method and device
CN106487703A (en) * 2015-08-27 2017-03-08 中兴通讯股份有限公司 A kind of load share method and device
CN106713172A (en) * 2015-11-16 2017-05-24 华为数字技术(苏州)有限公司 Method and device for scheduling message
CN106713172B (en) * 2015-11-16 2019-06-18 华为数字技术(苏州)有限公司 A kind of method and apparatus of schedules message
CN105939283A (en) * 2016-03-17 2016-09-14 杭州迪普科技有限公司 Network flow shunting method and device
CN105939283B (en) * 2016-03-17 2019-03-15 杭州迪普科技股份有限公司 The method and device of network flow quantity shunting
CN110191109A (en) * 2019-05-17 2019-08-30 杭州迪普信息技术有限公司 A kind of packet sampling method and device
CN110191109B (en) * 2019-05-17 2021-11-02 杭州迪普信息技术有限公司 Message sampling method and device
CN111131059A (en) * 2019-12-04 2020-05-08 视联动力信息技术股份有限公司 Data transmission control method, device and computer readable storage medium
CN112422447A (en) * 2020-11-13 2021-02-26 新华三技术有限公司合肥分公司 Method and device for selecting member port
CN112422447B (en) * 2020-11-13 2022-04-26 新华三技术有限公司合肥分公司 Method and device for selecting member port

Similar Documents

Publication Publication Date Title
CN101873251A (en) Message forwarding method and device
CN107005485B (en) Method for determining route, corresponding device and system
EP2448196A1 (en) Wireless network device, wireless network system and method of controlling selection of routings
CN107786450B (en) Data message transmission method and device and machine-readable storage medium
CN101119313A (en) Load sharing method and equipment
CN102098224B (en) Method and device for sharing data stream loads
CN102082693A (en) Method and device for monitoring network traffic
JP2012065171A (en) In-vehicle data repeating device and vehicle control system
US6976256B2 (en) Pipeline processing type shaping apparatus and its method
CN101286945A (en) Method and apparatus for processing of data fragmentation
US9401772B2 (en) Communication system, control device, forwarding node, communication control method, and program
CN102098740A (en) Link aggregation routing method and device
US11165864B2 (en) Information synchronization method and apparatus
CN109067744B (en) ACL rule processing method, device and communication equipment
CN101534253A (en) Message forwarding method and device
CN102136986B (en) Load sharing method and exchange equipment
CN104767582A (en) Ethernet synchronization method, device and system
CN103428185B (en) Packet filtering/method for limiting speed, system and device
CN102231699B (en) Route processing method in distributed system and distributed system
CN111740922B (en) Data transmission method, device, electronic equipment and medium
EP2025133A1 (en) Repository synchronization in a ranked repository cluster
CN102420766B (en) Routing determination method and routing device
CN101499936A (en) Method and arrangement for determining transmission delay differences
CN104380668A (en) Switch device, vlan configuration and management method, and program
CN113395334B (en) Service function chain online updating method, system and equipment

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C12 Rejection of a patent application after its publication
RJ01 Rejection of invention patent application after publication

Application publication date: 20101027