CN106332141A - Flow load sharing method and flow load sharing device - Google Patents
Flow load sharing method and flow load sharing device Download PDFInfo
- Publication number
- CN106332141A CN106332141A CN201610821891.6A CN201610821891A CN106332141A CN 106332141 A CN106332141 A CN 106332141A CN 201610821891 A CN201610821891 A CN 201610821891A CN 106332141 A CN106332141 A CN 106332141A
- Authority
- CN
- China
- Prior art keywords
- port
- remaining bandwidth
- flow
- equal
- link
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W24/00—Supervisory, monitoring or testing arrangements
- H04W24/02—Arrangements for optimising operational condition
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/08—Load balancing or load distribution
- H04W28/082—Load balancing or load distribution among bearers or channels
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a flow load sharing method and a flow load sharing device. The flow load sharing method is used for a system having two or more than two equivalence links disposed among network devices, and comprises steps that residual bandwidths of network device ports are acquired; and new flow is allocated to the equivalence links according to the proportion of the residual bandwidths of the ports, and therefore a problem of instable link flow is solved.
Description
Technical field
The application relates to communication technology, the method and apparatus particularly relating to a kind of flow load sharing.
Background technology
Load balancing is also known as load balancing, it is possible in the case of not changing existing network infrastructure, the bandwidth of extended network,
Increase the handling capacity of network, strengthen data-handling capacity, improve the availability of network.
Load balancing typically uses flow Hash HASH algorithm at present, flow is carried out Hash calculation, according to result of calculation
Determine the physical outlet of flow.Such as: in the case of networking of equal value has three links, different flow is carried out Hash meter
Calculate, obtain the different physical outlets of flow.
Summary of the invention
The method and apparatus that this application provides a kind of flow load sharing, the problem unstable to solve link flow.
In order to solve the problems referred to above, a kind of method that this application discloses flow load sharing, described method is applied to net
In the system of the equal-cost link that there is two or more between network equipment, including:
Obtain the remaining bandwidth of network equipment port；
The ratio of the remaining bandwidth according to described port by new assignment of traffic to equal-cost link.
In order to solve the problems referred to above, disclosed herein as well is the device of a kind of flow load sharing, described device is applied to
In the system of the equal-cost link that there is two or more between the network equipment, including:
Acquisition module, for obtaining the remaining bandwidth of network equipment port；
Distribution module, for according to the ratio of the remaining bandwidth of described port by new assignment of traffic to equal-cost link.
Compared with prior art, the application includes advantages below:
First, when the application exists a plurality of equal-cost link between the network devices, new flow is according to the tape remaining of port
Wide pro rate is to equal-cost link, and old flow still uses original equal-cost link to be transmitted, thus ensure that link
Stablizing of flow.
Secondly, when equal-cost link fault, being deleted by this equal-cost link in Hash list, this link cannot participate in new
Assignment of traffic, therefore the fault of this link simply affects the flow on this link, does not interferes with the flow of other links.
Certainly, the arbitrary product implementing the application is not necessarily required to reach all the above advantage simultaneously.
Accompanying drawing explanation
Fig. 1 is the flow chart of a kind of flow load sharing method described in the application embodiment；
Fig. 2 is the flow chart of steps of the application a kind of flow rate testing methods of another embodiment；
Fig. 3 is the equal-cost link schematic diagram between the application embodiment network equipment；
Fig. 4 is the schematic diagram of the Hash list generated according to the equal-cost link described in Fig. 3；
Fig. 5 is the schematic diagram of the Hash list updated after the application load balancing；
Fig. 6 is the structured flowchart of a kind of flow load sharing device described in the application embodiment；
Fig. 7 is the structured flowchart of a kind of flow load sharing device described in another embodiment of the application.
Detailed description of the invention
Understandable for enabling the above-mentioned purpose of the application, feature and advantage to become apparent from, real with concrete below in conjunction with the accompanying drawings
The application is described in further detail by mode of executing.
When networking of equal value has new link to increase, need flow is all re-started Hash calculation, now flow
Any one the link being randomized to either on all equal-cost links, if original link of equal-cost link is the most occupied
With, the most again by assignment of traffic to original link, then over-burden to cause original link, and new link was born
Gently, thus cause the unstable problem of link flow.
The basic thought of the application is: in the case of there is two or more equal-cost link between the network equipment,
Fashionable when there being new flow to add, do not interfere with the flow on original link, but the ratio according to the remaining bandwidth of port will be new
Assignment of traffic in equal-cost link, old flow uses the equal-cost link that the old flow in equal-cost link is corresponding, thus protects
Demonstrate,prove the stability of flow in equal-cost link.
Below by embodiment, herein described method is realized flow process to be described in detail.
With reference to Fig. 1, it is shown that the flow chart of the flow load sharing method of one of them embodiment of the application.Described side
Method is applied between the network equipment to exist in the system of two or more equal-cost link, in the present embodiment, and this stream
Amount load sharing method specifically includes:
Step 101: obtain the remaining bandwidth of network equipment port.Each port of the network equipment has the tape remaining of oneself
Width, concrete, present embodiment proposes to obtain in the following manner the remaining bandwidth of the port of the network equipment, but is not limited to
This, including:
Within the setting time, the flow of the port of the monitoring network equipment takies the ratio of the port bandwidth of this correspondence, determines
The remaining bandwidth of port.
The time that sets in present embodiment can be appropriately arranged with according to demand by those skilled in the art, can be 1 minute,
Can also be any appropriate time, as 2 minutes, 5 minutes the most, this is not restricted by the application.
Step 102: according to the ratio of the remaining bandwidth of described port by new assignment of traffic to equal-cost link.
The ratio of the remaining bandwidth of port is for weighing the ratio of the new flow of distribution, and the ratio of remaining bandwidth is big, then should
The new flow that the equal-cost link that port is corresponding undertakes will be many, and the ratio of remaining bandwidth is little, then the chain of equal value that this port is corresponding
The new flow that road undertakes will lack.
Fashionable when there being new flow to add, if this new flow is the least, can be according to the ratio of the remaining bandwidth of port, will be new
Flow assign to and be transmitted on equal-cost link.
Fashionable when there being new flow to add, if this new flow is very big, the network equipment can newly increase an equal-cost link, so
After further according to the ratio of remaining bandwidth of port, new flow is assigned to and is transmitted on equal-cost link.
Equal-cost link had been distributed, therefore when the flow haveing been friends in the past enters, it is possible to use old stream before old flow
The equal-cost link of amount correspondence is transmitted.
Wherein in a kind of implementation, old flow can be mapped to correspondence according to source IP address and purpose IP address
Equal-cost link is transmitted, it would however also be possible to employ other modes, as long as old flow can use the chain of equal value that old flow is corresponding
Road, is not particularly limited this application.
It should be noted that the network equipment can be switch or router, it is also possible to for other equipment, to this this Shen
Please be not particularly limited.
The application embodiment, first, when there is a plurality of equal-cost link between the network equipment, new flow is according to port
The pro rate of remaining bandwidth to equal-cost link, and old flow still uses original equal-cost link to be transmitted, thus protects
Demonstrate,prove stablizing of link flow.
With reference to Fig. 2, it is shown that the flow chart of a kind of flow load sharing method of the application other in which embodiment.
Described method is applied between the network equipment to exist in the system of two or more equal-cost link, in present embodiment
In, this flow load sharing method specifically includes:
Step 201: obtain the remaining bandwidth of network equipment port.
Step 202: according to the ratio of the remaining bandwidth of described port by new assignment of traffic to equal-cost link.
In actual applications, in order to make new flow quickly be assigned on equal-cost link, Hash list, institute can be created
State Hash list for safeguarding equal-cost link information, wherein, if increasing new equal-cost link, then corresponding in described Hash list
Increase a list item.
Concrete, Hash list can be created according to equal-cost link, Hash list is used for maintenance port and the residue of port
The corresponding relation of bandwidth, to preserve equal-cost link information, is then searched Hash list by port, is accelerated new assignment of traffic
Speed on equal-cost link, it would however also be possible to employ the form of other lists preserves equal-cost link, does not do concrete limit to this application
System.
Wherein, described Hash list includes but not limited to: port, the remaining bandwidth of port, source IP address (are called for short
DIP), purpose IP address (being called for short SIP), protocol number etc..
Hash list is created, if there are three chains of equal value between the network equipment according to the equal-cost link between the network equipment
Road, then the Hash list created includes three list items, includes but not limited to port, the tape remaining of each port in this list item
Priority of width, source IP address, purpose IP address and port etc..When the network equipment monitors flow entrance, can be judged this
The flow entered is new flow or old flow, wherein in a kind of implementation, has flow to enter between the network equipment
Fashionable, the network equipment can search Hash list according to some field in flow, if finding in Hash list, then judging should
Flow is old flow, if not finding in Hash list, then judges that this flow is new flow.
Wherein, some field in flow can be source IP address, purpose IP address, it is also possible to for other fields, to this
The application is not particularly limited.
Fashionable when there being new flow to add, if this new flow is the least, can be according to the ratio of the remaining bandwidth of port, will be new
Flow assign to and be transmitted on equal-cost link.
Fashionable when there being new flow to add, if this new flow is very big, can increase between the network devices one new etc.
Valency link, and the list item increasing this equal-cost link in Hash list of correspondence, then further according to the remaining bandwidth of port
Ratio, will be transmitted in new assignment of traffic to equal-cost link.
Such as: between the network equipment, originally had three equal-cost links, now Hash list includes three list items, works as network
When increasing a new equal-cost link between equipment, now become 4 links between the network equipment, specifically refer to Fig. 3 institute
Show, the list item increasing this equal-cost link in Hash list that simultaneously the most also can be corresponding, Hash list such as Fig. 4 institute of generation
Show.
Concrete, present embodiment proposes to obtain in the following manner the ratio of the remaining bandwidth of port, but does not limit to
In this, including:
For each port, hold described in the ratio-dependent of the total surplus bandwidth accounting for port according to the remaining bandwidth of described port
The ratio of the remaining bandwidth of mouth.
For each port of the network equipment, calculate the ratio that the remaining bandwidth of each port accounts for the total surplus bandwidth of port
Example, determines the ratio of the remaining bandwidth of each port, and then the ratio of the remaining bandwidth according to each port, undertakes different stream
Amount.
Wherein, if not integer after the ratio of the remaining bandwidth of port calculates, some rule round numbers can be defined,
Such as: round up or the rule such as bracket function obtains integer, this application is not particularly limited.
Such as: illustrate with Fig. 4 example, the operation side of the ratio of the remaining bandwidth of each port can be obtained in the following manner
Method.
The remaining bandwidth of port 0 is 10%, and port 1 remaining bandwidth is 20%, and the remaining bandwidth of port 2 is 30%, port 3
Remaining bandwidth be 100%.
The new flow that port 0 is shared is: the remaining bandwidth of port 0 takies the ratio of the remaining bandwidth of whole port, i.e.
It it is 10%/(10%+20%+30%+100%)=1/16.
The new flow that port 1 is shared is: the remaining bandwidth of port 1 takies the ratio of the remaining bandwidth of whole port, i.e.
It it is 20%/(10%+20%+30%+100%)=2/16.
The new flow that port 2 is shared is: the remaining bandwidth of port 2 takies the ratio of the remaining bandwidth of whole port, i.e.
30%/(10%+20%+30%+100%)=3/16.
The new flow that port 3 is shared is: the remaining bandwidth of port 3 takies the ratio of the remaining bandwidth of whole port, i.e.
It it is 100%/(10%+20%+30%+100%)=10/16.
Concrete, if increasing new flow is 16, wherein, port 0 shares 1 new flow, port 1 share 2 new
Flow, port 2 shares 3 new flows, and port 3 shares 10 new flows, and i.e. when there being new flow, main use is new
Link carry out the transmission of flow, and old link undertakes the newest flow according to the remaining bandwidth of oneself, thus ensure that
The stability of the flow of whole link.
Old flow uses the equal-cost link that the old flow in equal-cost link is corresponding to be transmitted.
As one of them embodiment, the equivalence that old flow in described old assignment of traffic to equal-cost link is corresponding
The step of link specifically includes:
Described old flow is carried out Hash calculation, it is thus achieved that cryptographic Hash.
Search described Hash list according to described cryptographic Hash, it is thus achieved that the port in Hash list, use described port corresponding
Link carry out the transmission of old flow.
Step 203: after above-mentioned flow load sharing, more newly created Hash list.
After above-mentioned flow load sharing, the Hash list that the network equipment can be more newly created, thus avoid when new
Traffic flow fashionable, by less for new assignment of traffic to remaining bandwidth link, thus cause the instability of link flow.
As one of them embodiment, if the remaining bandwidth in the Hash list after flow load sharing is as described in Figure 5,
Concrete, if the remaining bandwidth of one of them port is less than setting the first remaining bandwidth threshold value, then it is assumed that this port is not involved in down
In the newest assignment of traffic, therefore list item corresponding for the described port in described Hash list is deleted, thus reach whole piece
Stablizing of link flow.
Such as: the first remaining bandwidth threshold value of the port set, as 5%, if the remaining bandwidth of port is less than 5%, then will be deleted
Except the list item that this port in Hash list is corresponding, will delete the list item of port 0 correspondence in Fig. 5.
It should be noted that in actual applications can Hash list set up after, if the residue of one of them port
Bandwidth, less than when setting the first remaining bandwidth threshold value, determines that this port is not involved in new assignment of traffic, it is also possible to obtaining network
After the remaining bandwidth of device port, it is judged that whether the remaining bandwidth of the port of acquisition has less than the first remaining bandwidth threshold value, if
Have, it is determined that this port is not involved in new assignment of traffic.
If one of them port failure, list item that in Hash list, this port is corresponding can be deleted or this list item is set
Fault flag, makes this port be no longer participate in follow-up assignment of traffic, and therefore the fault of this port the most simply affects the old of this link
Other links are not had any impact by flow.
If the remaining bandwidth of one of them port exceedes setting the second remaining bandwidth threshold value, the most described port participates in new stream
Amount distribution, the ratio of the total surplus bandwidth that continuation accounts for port according to the remaining bandwidth of described port carries out the optimization of new flow,
Till the remaining bandwidth of this port is not more than the second remaining bandwidth threshold value.
Such as: the second remaining bandwidth threshold value of the port set is as 20%, if the remaining bandwidth of port is more than 20%, then should
Port participates in new assignment of traffic, and still as a example by Fig. 5, port 2 and the maximum residual bandwidth of port 3 in query graph 5 surpass
Cross 20%, then subsequent port 2 and port 3 participate in new assignment of traffic.
Wherein, the first remaining bandwidth threshold value is less than the second remaining bandwidth threshold value, the first remaining bandwidth threshold value and the second residue
The setting of bandwidth threshold can be used any appropriate ways to be set by those skilled in the art, as used artificial experience
Set threshold value, or the difference value for historical data sets threshold value, it is also possible to adopt and be set in other ways, the application couple
This is not restricted.
Further, the ageing time of every list item in described Hash list is set, if list item exceedes the aging of setting
Time, then list item is aging, and deletes this list item.
If the list item in Hash list exceedes the ageing time of setting, then illustrate that this list item is aging, be not suitable for participating in newly
Assignment of traffic in, therefore by this list item delete.
In present embodiment, ageing time can be appropriately arranged with according to demand by those skilled in the art, can be 10 points
Clock, it is also possible to be any appropriate time, as 20 minutes, 60 minutes the most, this is not restricted by the application.
The application embodiment, first, when there is a plurality of equal-cost link between the network equipment, new flow is according to each
The ratio of the remaining bandwidth of port is carried out from all equal-cost links/be assigned to equal-cost link for the equal-cost link of assignment of traffic
Transmission, and old flow still uses original equal-cost link to be transmitted, thus ensure that stablizing of link flow.
Secondly, when equal-cost link fault, being deleted by this equal-cost link in Hash list, this link is not involved in new stream
The distributive operation of amount, therefore the fault of this link simply affects the flow on this link, does not interferes with the flow of other links.
It should be noted that for aforesaid method, in order to be briefly described, therefore it is all expressed as a series of action group
Closing, but those skilled in the art should know, the application is not limited by described sequence of movement, because according to this Shen
Please, some step can use other orders or carry out simultaneously.Secondly, those skilled in the art also should know, description
Described in belong to preferably, necessary to involved action not necessarily the application.
Explanation based on said method embodiment, present invention also provides the device of a kind of flow load sharing, comes real
Existing content described in said method.
With reference to Fig. 6, it illustrates the knot of the device of a kind of flow load sharing described in one of them embodiment of the application
Composition, described device is applied between the network equipment to exist in the system of two or more equal-cost link, and this device has
Body includes:
Acquisition module 601, for obtaining the remaining bandwidth of the port of the network equipment.
Distribution module 602, for according to the ratio of the remaining bandwidth of described port by new assignment of traffic to equal-cost link.
Distribution module is additionally operable to equal-cost link corresponding for the old flow in old assignment of traffic to equal-cost link.
The application embodiment, first, when there is a plurality of equal-cost link between the network equipment, new flow is according to port
The ratio of remaining bandwidth pass from all equal-cost links/be assigned to equal-cost link for the equal-cost link of assignment of traffic
Defeated, and old flow still uses original equal-cost link to be transmitted, thus ensure that stablizing of link flow.
Secondly, when equal-cost link fault, being deleted by this equal-cost link in Hash list, this link cannot participate in new
Assignment of traffic, therefore the fault of this link simply affects the flow on this link, does not interferes with the flow of other links.
With reference to Fig. 7, it illustrates the device of a kind of flow load sharing described in the application other in which embodiment
Structure chart, described device is applied between the network equipment to exist in the system of two or more equal-cost link, this device
Specifically include:
Acquisition module 701, for obtaining the remaining bandwidth of the port of the network equipment.
As one of them embodiment, described acquisition module was additionally operable within the setting time, the end of the monitoring network equipment
Mouth flow takies the ratio of the port bandwidth of correspondence, determines the remaining bandwidth of port.
Distribution module 702, for according to the ratio of the remaining bandwidth of described port by new assignment of traffic to equal-cost link.
Determine module 703, for for each port, account for the total surplus bandwidth of port according to the remaining bandwidth of described port
Determine the ratio of the remaining bandwidth of described port.
Distribution module is additionally operable to equal-cost link corresponding for the old flow in old assignment of traffic to equal-cost link.
As one of them embodiment, this device also includes: Hash list block 704, creates Hash list, described Kazakhstan
Uncommon list is used for safeguarding equal-cost link information, wherein, if increasing new equal-cost link, then corresponding increases in described Hash list
Article one, list item.Concrete, for creating Hash list according to equal-cost link, wherein said Hash list is used for maintenance port and end
The corresponding relation of the remaining bandwidth of mouth is to preserve equal-cost link information.
As one of them embodiment, this device also includes: port screen modeling block 705, for remaining at described port
Remaining bandwidth is less than setting the first remaining bandwidth threshold value, it is determined that described port is not involved in new assignment of traffic, then by Hash list
The list item that the port in Hash list in module is corresponding is deleted.
As one of them embodiment, port screen modeling block, if being additionally operable to described port remaining bandwidth to exceed setting
Two remaining bandwidth threshold values, it is determined that the remaining bandwidth of described port participates in new assignment of traffic.
As one of them embodiment, distribution module is for carrying out Hash calculation to described old flow, it is thus achieved that flow
Cryptographic Hash, search described Hash list according to the cryptographic Hash of described flow, it is thus achieved that the port in Hash list, use described end
The link that mouth is corresponding carries out old flow transmission.
As one of them embodiment, described device also includes: ageing module, for arranging in described Hash list
The ageing time of every list item, if exceeding the ageing time of setting, then list item is aging, and deletes this list item.
The application embodiment, first, when there is a plurality of equal-cost link between the network equipment, new flow is according to port
The pro rate of remaining bandwidth to equal-cost link, and old flow still uses original equal-cost link to be transmitted, thus protects
Demonstrate,prove stablizing of link flow.
Secondly, when equal-cost link fault, being deleted by this equal-cost link in Hash list, this link is not involved in new stream
The distributive operation of amount, therefore the fault of this link simply affects the flow on this link, does not interferes with the flow of other links.
For said apparatus embodiment, due to itself and method embodiment basic simlarity, so the comparison described
Simply, relevant part sees the part of shown method embodiment and illustrates.
Each embodiment in this specification all uses the mode gone forward one by one to describe, and each embodiment stresses
Being the difference with other embodiments, between each embodiment, identical similar part sees mutually.
Those skilled in the art will be readily apparent: the combination in any application of each embodiment above-mentioned is all feasible,
Therefore above-mentioned combination in any between each is all the embodiment of the application, but this specification is at this just as space is limited,
Detail the most one by one.
The application can be used in numerous general or special purpose computing system environment or configuration.Such as: personal computer, service
Device computer, handheld device or portable set, laptop device, multicomputer system, system based on microprocessor, top set
Box, programmable consumer-elcetronics devices, network PC, minicomputer, mainframe computer, include any of the above system or equipment
Distributed computing environment etc..
The application can be described in the general context of computer executable instructions, such as program
Module.Usually, program module includes performing particular task or realizing the routine of particular abstract data type, program, object, group
Part, data structure etc..The application can also be put into practice in a distributed computing environment, in these distributed computing environment, by
The remote processing devices connected by communication network performs task.In a distributed computing environment, program module is permissible
It is positioned in the local and remote computer-readable storage medium of storage device.
In this application, " assembly ", " device ", " system " etc. refer to be applied to the related entities of computer, such as hardware, hard
Part and the combination of software, software or executory software etc..In detail, such as, assembly can but be not limited to run on place
The reason process of device, processor, object, can executive module, perform thread, program and/or computer.Further, server is run on
On application program or shell script, server can be assembly.One or more assemblies can be at the process performed and/or line
Cheng Zhong, and assembly can localize and/or be distributed between two or multiple stage computer on one computer, it is possible to by
Various computer-readable mediums run.Assembly can also be according to having the signal of one or more packet, such as, from one
With another component interaction in local system, distributed system, and/or the network in the Internet handed over by signal and other system
The signal of mutual data is communicated by locally and/or remotely process.
Finally, in addition it is also necessary to explanation, in this article, the relational terms of such as first and second or the like be used merely to by
One entity or operation separate with another entity or operating space, and not necessarily require or imply these entities or operation
Between exist any this reality relation or order.And, term " includes ", " comprising ", not only includes those key elements, and
And also include other key elements being not expressly set out, or also include intrinsic for this process, method, article or equipment
Key element.In the case of there is no more restriction, statement " including ... " key element limited, it is not excluded that including described wanting
Process, method, article or the equipment of element there is also other identical element.
And, "and/or" above represent and the most both contain " with " relation, also contains the relation of "or", its
In: if option A and option b be " and " relation, then it represents that certain embodiment can include option A and option b simultaneously；As
Really option A and option b are the relations of "or", then it represents that can individually include option A, or the individually side of including in certain embodiment
Case B.
Those skilled in the art are it should be appreciated that presently filed embodiment can be provided as method, system or computer journey
Sequence product.Therefore, in terms of the application can use complete hardware embodiment, complete software or combine software and hardware shape
Formula.And, the application can use can be with storage at one or more computers wherein including computer usable program code
The form of the upper computer program implemented of medium (including but not limited to disk memory, CD-ROM, optical memory etc.).
The application be with reference to according to the present processes, equipment (system) and the flow chart of computer program and/or
Block diagram describes.It should be understood that can by each flow process in computer program instructions flowchart and/or block diagram and/or
Flow process in square frame and flow chart and/or block diagram and/or the combination of square frame.These computer program instructions can be provided to arrive
The processor of general purpose computer, special-purpose computer, Embedded Processor or other programmable data processing device is to produce one
Machine so that the instruction performed by the processor of computer or other programmable data processing device is produced for realizing at stream
The device of the function specified in one flow process of journey figure or multiple flow process and/or one square frame of block diagram or multiple square frame.
These computer program instructions may be alternatively stored in and computer or other programmable data processing device can be guided with spy
Determine in the computer-readable memory that mode works so that the instruction being stored in this computer-readable memory produces and includes referring to
Make the manufacture of device, this command device realize at one flow process of flow chart or multiple flow process and/or one square frame of block diagram or
The function specified in multiple square frames.
These computer program instructions also can be loaded in computer or other programmable data processing device so that at meter
Perform sequence of operations step on calculation machine or other programmable devices to produce computer implemented process, thus at computer or
The instruction performed on other programmable devices provides for realizing at one flow process of flow chart or multiple flow process and/or block diagram one
The step of the function specified in individual square frame or multiple square frame.
Although having been described for the preferred implementation of the application, but those skilled in the art once know basic wound
The property made concept, then can make other change and amendment to these.So, claims be intended to be construed to include preferably with
And fall into all changes and the amendment of the application scope.
Above to a kind of flow load sharing method and apparatus provided herein, it is described in detail, herein
Applying specific case to be set forth principle and the embodiment of the application, above explanation is only intended to help to understand this
The method of application and core concept thereof；Simultaneously for one of ordinary skill in the art, according to the thought of the application, specifically
All will change on embodiment and range of application, in sum, this specification content should not be construed as the application's
Limit.
Claims (11)
1. a method for flow load sharing, described method be applied between the network equipment to exist two or more etc.
In the system of valency link, it is characterised in that including:
Obtain the remaining bandwidth of network equipment port；
The ratio of the remaining bandwidth according to described port by new assignment of traffic to equal-cost link.
Method the most according to claim 1, it is characterised in that the step of the remaining bandwidth of the port of the described acquisition network equipment
Suddenly include:
Within the setting time, monitoring network equipment port flow takies the ratio of the port bandwidth of correspondence, determines the residue of port
Bandwidth.
Method the most according to claim 1, it is characterised in that the ratio of the remaining bandwidth of described port is as follows
Obtain:
For each port, port described in the ratio-dependent of the total surplus bandwidth accounting for port according to the remaining bandwidth of described port
The ratio of remaining bandwidth.
Method the most according to claim 1, it is characterised in that the step of the remaining bandwidth of the port of the described acquisition network equipment
Also include before rapid:
Creating Hash list, described Hash list is used for safeguarding equal-cost link information, wherein, if increasing new equal-cost link, then
Corresponding increases a list item in described Hash list.
Method the most according to claim 1, it is characterised in that described method also includes: if the remaining bandwidth of described port
Less than setting the first remaining bandwidth threshold value, it is determined that described port is not involved in new assignment of traffic.
Method the most according to claim 1, it is characterised in that described method also includes: if the remaining bandwidth of described port
Exceed setting the second remaining bandwidth threshold value, it is determined that described port participates in new assignment of traffic.
7. a device for flow load sharing, described device be applied between the network equipment to exist two or more etc.
In the system of valency link, it is characterised in that including:
Acquisition module, for obtaining the remaining bandwidth of network equipment port；
Distribution module, for according to the ratio of the remaining bandwidth of described port by new assignment of traffic to equal-cost link.
Device the most according to claim 7, it is characterised in that described acquisition module, is used within the setting time, monitoring network
The port flow of network equipment takies the ratio of the port bandwidth of correspondence, determines the remaining bandwidth of port.
Device the most according to claim 7, it is characterised in that described device also includes determining module, for for each
Port, the ratio of the remaining bandwidth of port described in the ratio-dependent of the total surplus bandwidth accounting for port according to the remaining bandwidth of described port
Example.
Device the most according to claim 7, it is characterised in that described device also includes:
Hash list block, is used for creating Hash list, and described Hash list is used for safeguarding equal-cost link information, wherein, if increasing
Add new equal-cost link, then corresponding increase a list item in described Hash list.
11. devices according to claim 7, it is characterised in that described device also includes: port screen modeling block, are used for
The remaining bandwidth of described port is less than setting the first remaining bandwidth threshold value, it is determined that described port is not involved in new assignment of traffic；
Described port screen modeling block, if the remaining bandwidth being additionally operable to described port exceedes setting the second remaining bandwidth threshold value, the most really
Fixed described port participates in new assignment of traffic.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610821891.6A CN106332141A (en) | 2016-09-13 | 2016-09-13 | Flow load sharing method and flow load sharing device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610821891.6A CN106332141A (en) | 2016-09-13 | 2016-09-13 | Flow load sharing method and flow load sharing device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN106332141A true CN106332141A (en) | 2017-01-11 |
Family
ID=57786650
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610821891.6A Pending CN106332141A (en) | 2016-09-13 | 2016-09-13 | Flow load sharing method and flow load sharing device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106332141A (en) |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108055203A (en) * | 2017-12-26 | 2018-05-18 | 杭州迪普科技股份有限公司 | A kind of equivalent route load sharing method and device |
| CN108429675A (en) * | 2018-03-30 | 2018-08-21 | 新华三技术有限公司 | VRRP linkage switching methods, device and electronic equipment |
| CN109547341A (en) * | 2019-01-04 | 2019-03-29 | 烽火通信科技股份有限公司 | A kind of load sharing method and system of link aggregation |
| CN109688421A (en) * | 2018-12-28 | 2019-04-26 | 广州华多网络科技有限公司 | Request message processing method, apparatus and system, server, storage medium |
| CN110798400A (en) * | 2019-10-23 | 2020-02-14 | 新华三信息安全技术有限公司 | Message forwarding method and device |
| CN112311687A (en) * | 2020-10-26 | 2021-02-02 | 新华三大数据技术有限公司 | Traffic scheduling method and device |
| CN113259248A (en) * | 2020-02-07 | 2021-08-13 | 华为技术有限公司 | Method and device for determining link for forwarding service flow |
| CN113630319A (en) * | 2021-06-28 | 2021-11-09 | 济南浪潮数据技术有限公司 | Data distribution method, device and related equipment |
| US11876680B2 (en) | 2020-02-07 | 2024-01-16 | Huawei Technologies Co., Ltd. | Method and apparatus for determining link for forwarding service flow |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102404156A (en) * | 2011-12-12 | 2012-04-04 | 杭州华三通信技术有限公司 | Data transmission method and device based on aggregation link |
| CN102739518A (en) * | 2012-05-30 | 2012-10-17 | 杭州华三通信技术有限公司 | Flow load sharing method and equipment |
| US8553582B1 (en) * | 2009-01-08 | 2013-10-08 | Marvell Israel (M.I.S.L) Ltd. | Traffic spraying in a chassis-based network switch |
| CN105872079A (en) * | 2016-05-12 | 2016-08-17 | 北京网瑞达科技有限公司 | Chain balancing method based on domain name system (DNS) |
-
2016
- 2016-09-13 CN CN201610821891.6A patent/CN106332141A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8553582B1 (en) * | 2009-01-08 | 2013-10-08 | Marvell Israel (M.I.S.L) Ltd. | Traffic spraying in a chassis-based network switch |
| CN102404156A (en) * | 2011-12-12 | 2012-04-04 | 杭州华三通信技术有限公司 | Data transmission method and device based on aggregation link |
| CN102739518A (en) * | 2012-05-30 | 2012-10-17 | 杭州华三通信技术有限公司 | Flow load sharing method and equipment |
| CN105872079A (en) * | 2016-05-12 | 2016-08-17 | 北京网瑞达科技有限公司 | Chain balancing method based on domain name system (DNS) |
Cited By (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108055203A (en) * | 2017-12-26 | 2018-05-18 | 杭州迪普科技股份有限公司 | A kind of equivalent route load sharing method and device |
| CN108055203B (en) * | 2017-12-26 | 2020-10-02 | 杭州迪普科技股份有限公司 | Equivalent routing load sharing method and device |
| CN108429675A (en) * | 2018-03-30 | 2018-08-21 | 新华三技术有限公司 | VRRP linkage switching methods, device and electronic equipment |
| CN109688421A (en) * | 2018-12-28 | 2019-04-26 | 广州华多网络科技有限公司 | Request message processing method, apparatus and system, server, storage medium |
| CN109688421B (en) * | 2018-12-28 | 2020-07-10 | 广州华多网络科技有限公司 | Request message processing method, device and system, server and storage medium |
| CN109547341A (en) * | 2019-01-04 | 2019-03-29 | 烽火通信科技股份有限公司 | A kind of load sharing method and system of link aggregation |
| CN110798400A (en) * | 2019-10-23 | 2020-02-14 | 新华三信息安全技术有限公司 | Message forwarding method and device |
| CN110798400B (en) * | 2019-10-23 | 2022-02-11 | 新华三信息安全技术有限公司 | Message forwarding method and device |
| CN113259248A (en) * | 2020-02-07 | 2021-08-13 | 华为技术有限公司 | Method and device for determining link for forwarding service flow |
| CN113259248B (en) * | 2020-02-07 | 2023-03-10 | 华为技术有限公司 | Method and device for determining link for forwarding service flow |
| US11876680B2 (en) | 2020-02-07 | 2024-01-16 | Huawei Technologies Co., Ltd. | Method and apparatus for determining link for forwarding service flow |
| CN112311687A (en) * | 2020-10-26 | 2021-02-02 | 新华三大数据技术有限公司 | Traffic scheduling method and device |
| CN112311687B (en) * | 2020-10-26 | 2022-04-01 | 新华三大数据技术有限公司 | Traffic scheduling method and device |
| CN113630319A (en) * | 2021-06-28 | 2021-11-09 | 济南浪潮数据技术有限公司 | Data distribution method, device and related equipment |
| CN113630319B (en) * | 2021-06-28 | 2022-08-19 | 济南浪潮数据技术有限公司 | Data distribution method, device and related equipment |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106332141A (en) | Flow load sharing method and flow load sharing device | |
| Beck et al. | Scalable and coordinated allocation of service function chains | |
| Rahman et al. | Block-sdotcloud: Enhancing security of cloud storage through blockchain-based sdn in iot network | |
| US20190386834A1 (en) | Blockchain management apparatus, blockchain management method, and program | |
| CN111478811B (en) | Network key point analysis method based on double-layer information flow transmission | |
| US10164908B2 (en) | Filtration of network traffic using virtually-extended ternary content-addressable memory (TCAM) | |
| CN104580202B (en) | The matching process and device of message | |
| CN110400217A (en) | The regular changing process method and device of intelligent contract | |
| Grashöfer et al. | Towards application of cuckoo filters in network security monitoring | |
| US10257156B2 (en) | Overprovisioning floating IP addresses to provide stateful ECMP for traffic groups | |
| CN113490231B (en) | Usability guarantee method and device for network slice | |
| Garg et al. | Heuristic and reinforcement learning algorithms for dynamic service placement on mobile edge cloud | |
| Qiu et al. | Online security-aware and reliability-guaranteed ai service chains provisioning in edge intelligence cloud | |
| CN106878356B (en) | Scheduling method and computing node | |
| CN112532542B (en) | Load balancing mode selection method and device | |
| Qu et al. | Minimizing traffic migration during network update in IaaS datacenters | |
| US12047380B2 (en) | Access control lists rules reduction | |
| Ruhimat et al. | Optimal computer network based on graph topology model | |
| CN108345699A (en) | Obtain the method, apparatus and storage medium of multi-medium data | |
| Wang et al. | Cost-aware and delay-constrained service function orchestration in multi-data-center networks | |
| CN114826728A (en) | Device authentication method, internet of things terminal device, electronic device and storage medium | |
| CN110585701B (en) | Checkpoint management method and system for mobile phone breakthrough game and mobile terminal | |
| CN113204535A (en) | Routing method and device, electronic equipment and computer readable storage medium | |
| Valdés et al. | Searching the Shortest Pair of Edge-Disjoint Paths in a Communication Network. A Fuzzy Approach | |
| CN112291241A (en) | Firewall wall opening method, firewall wall opening device and terminal equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB02 | Change of applicant information |
Address after: 310052 Binjiang District Changhe Road, Zhejiang, China, No. 466, No. Applicant after: Xinhua three Technology Co., Ltd. Address before: 310053 Hangzhou science and Technology Development Zone, Zhejiang high tech park, No. six and road, No. 310 Applicant before: Huasan Communication Technology Co., Ltd. |
|
| CB02 | Change of applicant information | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20170111 |
|
| RJ01 | Rejection of invention patent application after publication |