CN104734995B - A kind of method to set up and network controller of link aggregation flow rate upper limit - Google Patents
A kind of method to set up and network controller of link aggregation flow rate upper limit Download PDFInfo
- Publication number
- CN104734995B CN104734995B CN201510092225.9A CN201510092225A CN104734995B CN 104734995 B CN104734995 B CN 104734995B CN 201510092225 A CN201510092225 A CN 201510092225A CN 104734995 B CN104734995 B CN 104734995B
- Authority
- CN
- China
- Prior art keywords
- node
- link
- business
- network topology
- equal
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a kind of method to set up and network controller of link aggregation flow rate upper limit, to solve the technical problem that the convergence flow rate upper limit set in the prior art can not reflect the importance of link pair network.In some feasible embodiments of the invention, method includes：It is determined that current network topology, the influence value of any bar link pair network connectivty in current network topology is obtained；According to the influence value of any bar link pair network connectivty, and, the capacity of any bar link, for any bar link calculation in current network topology and convergence flow rate upper limit is set.
Description
Technical field
The present invention relates to communication technical field, and in particular to a kind of method to set up of link aggregation flow rate upper limit and network control
Device processed.
Background technology
Every business of network can be simplified shown as triple (source point, Su Dian, flow).Each of the links has certain in network
Flux capacity.Network traffics convergence refers to, different on the premise of the flow carried on any link is no more than the capacity of link
Business paths traversed shared link as far as possible, the expensive network equipment (such as OADM is taken to save as far as possible
Device).Why allow multi-service shared link as far as possible, be in order to allow the path of different business to have common portion as much as possible, from
And the node of process is more few better required for making this group of path of these business of carrying.
Fig. 1 a and Fig. 1 b are the schematic diagrames of two kinds of service convergences.In terms of traffic aggregation angle, the road of two business in Fig. 1 b
Footpath arranges to be better than the arrangement path of two business in Fig. 1 a.The number of nodes that the path of two business uses in Fig. 1 b is significantly lower than
The path of two business uses number of nodes in Fig. 1 a.
But there is following contradiction point in network traffics convergence：The requirement of traffic aggregation is that the path that business is passed through is as far as possible common
With link, but if without stint requires business shared link, some links may be caused because having converged too many business and
The flux capacity for causing to carry is occupied full.When one vivid analogy is festivals or holidays, almost all of vehicle is all toward that several
Major trunk roads converge, and cause the big traffic congestion of major trunk roads, at the same time but also have many secondary roads to allow the vehicles of major trunk roads completely
Evacuate and reach respective destination.Fully loaded link is equivalent to open up from network because can no longer be used by any service path
It is removed in flutterring.Increasing and converge with business, fully loaded link also progressively increases, and causes network topology because part of links
It is removed and destroys connectedness, and then makes later business can not be logical.If previous service convergence degree is less high,
If not causing part of links fully loaded, these later business can arrange down in a network.
In order to solve this contradiction, it is necessary to set convergence flow rate upper limit on link.Flow on link is reached on this
Before limit, business can be without restriction toward converging on this link；Once the flow carried on link has reached this preset upper limit,
Unless any other feasible path is just not present without this link in certain business, the business could use this link, otherwise the industry
Business can not use this link.As an example it is assumed that link L capacity 100G, converge flow rate upper limit 60G, bearer traffic 40G, if
There are business s, service traffics 40G, be can use if s has without L path, do not allow s to use L, because bearer traffic on L
It can be more than convergence flow rate upper limit plus service traffics；It is can use if s is without L without path, just allow business s to use link
L。
Prior art is that the convergence flow rate upper limit set to link is fixed, can be fixed proportion, such as converge
Gather and the 50% of link capacity is must not exceed in the flow on link；Can also be fixed value, such as the flow converged on link
It must not exceed 100GHz.
The method for setting the convergence flow rate upper limit of fixed value or fixed proportion for link at present, does not embody different links
There is different importance for the connection of whole network in network topology.The for example major trunk roads in city or big across river
Bridge is far above the other medium and small roads in city to the importance of whole city traffic network.The link of different significance levels is set equally
Flow rate upper limit, important link aggregation flow can be caused excessive and influence leading to for follow-up business, at the same time on secondary link
The flow of carrying is not converged fully.
The content of the invention
The embodiment of the present invention provides a kind of method to set up and network controller of link aggregation flow rate upper limit, existing to solve
The convergence flow rate upper limit set in technology can not reflect the technical problem of the importance of link pair network.
First aspect present invention provides a kind of method to set up of link aggregation flow rate upper limit, including：It is determined that current network
Topology, obtain the influence value of any bar link pair network connectivty in current network topology；According to any bar link pair
The influence value of network connectivty, and, the capacity of any bar link, for any bar link calculation in current network topology and set
Put convergence flow rate upper limit.
It is described to obtain any bar in current network topology with reference in a first aspect, in the first possible implementation
The influence value of link pair network connectivty, including：
It is a node pair by any two node definition in current network topology, obtains m node pair, m=n*
(n-1)/2, n is the number for the node that current network topology includes, and n is greater than or equal to 2 integer；
Obtain the m node to any of node to Di business probability of occurrence Pi, i is the numbering of node pair, and i
It is less than or equal to m positive integer；
For the m node to any of node to Di set hop count upper limit Hui, wherein, Hui is more than or equal to
Hi, Hi are the hop counts in minimal weight path of the node to Di in current network topology；
It is assumed that removing any bar link Lj from current network topology, judge that any node is jumped to whether there is between Di
Reachable path of the number less than or equal to Hui, if it does, make variable X ij be equal to 1, if it does not, make variable X ij be equal to 0,
Wherein, j is link number, and j is less than or equal to m positive integer；
Calculate any bar link Lj is to the influence value of network connectivty
With reference to the first possible implementation of first aspect, in second of possible implementation, the acquisition
The m node to any of node Di business probability of occurrence Pi is included：
It is the business probability of occurrence Pi that any one node is set to Di to obtain user；
Or, it is known that the sourcesink point and flow of all business to be scheduled, set any one node Di business occur general
Rate Pi be equal to using node to Di as the service traffics sum to be scheduled of sourcesink point divided by the total flow sum of all business to be scheduled；
Or the history service flow in acquisition certain time, business probability of occurrence Pi of any one node to Di is set
Equal to history service total flow of the node to Di divided by all history service total flow sums；
Or any one node is set to be equal to 1/m to Di business probability of occurrence Pi；
Wherein, the business probability of occurrence sum of all nodes pair is equal to 1.
With reference to the first possible implementation of first aspect, in the third possible implementation, the basis
The influence value of any bar link pair network connectivty, and, the capacity of any bar link, for any bar link calculation and set
Convergence flow rate upper limit is put, including：
The convergence flow rate upper limit for calculating any bar link Lj isWherein Rj is link Lj capacity,
And convergence flow rate upper limit is set for any bar link Lj in current network topology according to result of calculation.
With reference to any of the first of first aspect or first aspect to the third possible implementation, the 4th
It is described to determine that current network topology includes in the possible implementation of kind：
When network topology is initially formed, and does not arrange any business, it is determined that current network topology；
Or when the structure of network topology changes, it is determined that current network topology.
With reference to any of the first of first aspect or first aspect to the third possible implementation, the 5th
In the possible implementation of kind, method also includes：
When being asked on the calculation road for receiving new business, service path is calculated for the new business；
On the convergence flow for obtaining each link at least one link included by the service path being calculated
The minimum value of limit；
In the service path that judgement is calculated, the flow of bearer service adds the flow of the new business, if big
In or equal to the convergence flow rate upper limit minimum value, if it is, whether determining whether the service path being calculated
It is exclusive path, if it is, the new business is arranged in the service path being calculated, otherwise, by the new industry
Business is arranged in other paths.
Second aspect of the present invention provides a kind of network controller, for setting convergence flow for the link in network topology
Limit, the network controller include：Processing module, for determining current network topology, obtain in current network topology and appoint
The influence value of one link pair network connectivty；Setup module, for the shadow according to any bar link pair network connectivty
Value is rung, and, the capacity of any bar link, for any bar link calculation in current network topology and set on convergence flow
Limit.
With reference to second aspect, in the first possible implementation, the processing module includes：
Processing unit, for being a node pair by any two node definition in current network topology, obtain m
Node pair, m=n* (n-1)/2, n are the number of node that current network topology includes, and n be greater than or equal to 2 it is whole
Number；Be additionally operable to obtain the m node to any of node be the numbering of node pair to Di business probability of occurrence Pi, i, and
I is less than or equal to m positive integer；And for for the m node to any of node to Di set the hop count upper limit
Hui, wherein, Hui is more than or equal to Hi, and Hi is the hop count in minimal weight path of the node to Di in current network topology；
Computing unit, for assuming to remove any bar link Lj from current network topology, judge any node to Di
Between with the presence or absence of hop count be less than or equal to Hui reachable path, if it does, make variable X ij be equal to 1, if it does not, order
Variable X ij is equal to 0, wherein, j is link number, and j is less than or equal to m positive integer；And calculate any bar link Lj
Influence value to network connectivty is
With reference to the first possible implementation of second aspect, in second of possible implementation,
The processing unit, it is the business probability of occurrence Pi that any one node is set to Di specifically for obtaining user；
Or, it is known that the sourcesink point and flow of all business to be scheduled, set any one node Di business occur general
Rate Pi be equal to using node to Di as the service traffics sum to be scheduled of sourcesink point divided by the total flow sum of all business to be scheduled；
Or the history service flow in acquisition certain time, business probability of occurrence Pi of any one node to Di is set
Equal to history service total flow of the node to Di divided by all history service total flow sums；
Or any one node is set to be equal to 1/m to Di business probability of occurrence Pi；
Wherein, the business probability of occurrence sum of all nodes pair is equal to 1.
With reference to the first possible implementation of second aspect, in the third possible implementation,
The setup module, it is specifically for the convergence flow rate upper limit for calculating any bar link Lj
Wherein Rj is link Lj capacity, and is that any bar link Lj sets convergence flow in current network topology according to result of calculation
The upper limit.
With reference to any of the first of second aspect or second aspect to the third possible implementation, the 4th
In the possible implementation of kind, the processing module, specifically for being initially formed when network topology, when not arranging any business,
It is determined that current network topology；Or when the structure of network topology changes, it is determined that current network topology.
With reference to any of the first of second aspect or second aspect to the third possible implementation, the 5th
In the possible implementation of kind, network controller also includes：
Road module is calculated, for when receiving the calculation road request of new business, service path to be calculated for the new business；Obtain meter
The minimum value of the convergence flow rate upper limit of each link at least one link included by obtained service path；Judge
In the service path being calculated, the flow of bearer service adds the flow of the new business, if more than or equal to described
The minimum value of flow rate upper limit is converged, if it is, determining whether the service path being calculated is exclusive path, such as
Fruit is that the new business is arranged in the service path being calculated by instruction business module, otherwise, indicates business module
The new business is arranged in other paths；
The business module, for arranging the new business according to the instruction of the calculation road module.
Therefore in some feasible embodiments of the present invention, it is any in current network topology using obtaining
The influence value of bar link pair network connectivty, and then according to the influence value and the capacity of link, set on link aggregation flow
The technical scheme of limit, achieve following technique effect：
Because the link aggregation flow rate upper limit of setting considers the influence value of link pair network connectivty, reflect link and exist
The significance level of network topology so that different convergence flow rate upper limits is set in the different link of importance, it is thus possible to avoid
The problem of important link easily blocks because taking, secondary link can also be avoided easily to converge the problem of insufficient.
Brief description of the drawings
Technical scheme in order to illustrate the embodiments of the present invention more clearly, below will be to institute in embodiment and description of the prior art
The accompanying drawing needed to use is briefly described, it should be apparent that, drawings in the following description are only some implementations of the present invention
Example, for those of ordinary skill in the art, on the premise of not paying creative work, can also be obtained according to these accompanying drawings
Obtain other accompanying drawings.
Fig. 1 a and 1b are the schematic diagrames of two kinds of service convergences；
Fig. 2 is a kind of flow chart of the method to set up of link aggregation flow rate upper limit provided in an embodiment of the present invention；
Fig. 3 is a kind of schematic diagram of network topology structure in the embodiment of the present invention；
Fig. 4 is the flow chart that convergence flow rate upper limit is set in the embodiment of the present invention；
Fig. 5 is the equipment interaction diagrams in network of the embodiment of the present invention；
Fig. 6 a are a kind of schematic diagrames of network controller provided in an embodiment of the present invention；
Fig. 6 b are the schematic diagrames of another network controller provided in an embodiment of the present invention；
Fig. 7 is the schematic diagram of another network controller provided in an embodiment of the present invention.
Embodiment
The embodiment of the present invention provides a kind of method to set up and network controller of link aggregation flow rate upper limit, existing to solve
The convergence flow rate upper limit set in technology can not reflect the technical problem of the importance of link pair network.
In order that those skilled in the art more fully understand the present invention program, below in conjunction with the embodiment of the present invention
Accompanying drawing, the technical scheme in the embodiment of the present invention is clearly and completely described, it is clear that described embodiment is only
The embodiment of a part of the invention, rather than whole embodiments.Based on the embodiment in the present invention, ordinary skill people
The every other embodiment that member is obtained under the premise of creative work is not made, it should all belong to the model that the present invention protects
Enclose.
Below by specific embodiment, it is described in detail respectively.
Fig. 2 is refer to, the embodiment of the present invention provides a kind of method to set up of link aggregation flow rate upper limit, and this method can wrap
Include：
210th, current network topology is determined, obtains the shadow of any bar link pair network connectivty in current network topology
Ring value；
220th, according to the influence value of any bar link pair network connectivty, and, the capacity of any bar link, to work as
Any bar link calculation and convergence flow rate upper limit is set in preceding network topology.
The purpose of technical solution of the present invention is, is every in network on the premise of service traffics requirement is converged as far as possible
Link sets rational convergence flow rate upper limit, and this convergence flow rate upper limit embodies the importance of outgoing link in a network so that weight
The convergence flow rate upper limit of the higher link of the property wanted is relatively low for the convergence flow rate upper limit of the relatively low link of importance, and weighs
The convergence flow rate upper limit of the relatively low link of the property wanted is higher for the convergence flow rate upper limit of the higher link of importance.Institute
It is lower with the higher convergence flow rate upper limit of importance, because more important link more can not exhaust capacity because of traffic aggregation, lead
Cause follow-up business can not use the link, this and the reason for only major trunk roads just need restricted driving to be similar.Such as how quantization method
Reach above-mentioned purpose, be exactly the technical problem to be solved in the present invention.
In the embodiment of the present invention, it is assumed that currently given network topology T, and network topology T includes n node, n for more than
Or the positive integer equal to 2.It is a node pair by any two node definition therein in the embodiment of the present invention, then obtains m
Node pair, m=n* (n-1)/2.In addition, a link between each two node be present, then current network topology T is included most
More m bars links.For convenience of description, i-th of node pair is represented with Di, i is the numbering of node pair；J-th strip link, j are represented with Lj
For link number；Wherein, i and j is the positive integer less than or equal to m.
In the embodiment of the present invention, to each of which bar link Lj, by assuming that link Lj because capacity is occupied full and
After unavailable (equivalent to Lj is removed from T), weighing the transport between how many node pair will be forced to take a roundabout way or be blocked,
To judge link Lj importance, influence values of the link Lj to network connectivty is obtained.In general, it is assumed that Lj moves from from T
After removing, it is forced to take a roundabout way or the node that is blocked is to more, it is believed that link Lj importance is higher, then by link Lj to net
The connective influence value setting of network is lower；Assuming that after Lj removes from from T, it is forced to take a roundabout way or the node that is blocked is to getting over
It is few, it is believed that link Lj importance is lower, then sets link Lj to the influence value of network connectivty higher.Namely
Say, herein, the importance of link is opposite to the influence value of network connectivty with it, and more important, influence value is lower；More not
Important, influence value is higher.This is that follow-up calculate converges flow rate upper limit for convenience.
In the present inventor's embodiment, can by the product of link Lj capacity and its influence value to network connectivty, or
The product is multiplied by some coefficient by person, is set as link Lj convergence flow rate upper limit.
Therefore a certain bar link Lj once removes from T in T, the node logarithm for being forced to take a roundabout way or being blocked
Amount is more, and Lj importance is higher, illustrates that link Lj is more important in network topology, more to avoid the link as far as possible because stream
Amount is excessively assembled and is occupied full, and flow rate upper limit is converged on the link just should set lower.
Optionally, it is also contemplated that to the difference of the importance between node pair, by taking the railway network as an example, node to (Beijing,
Guangzhou) importance much larger than node to (Urumchi, Nanning), could see to come with the passenger-cargo flow can of their history.
So as in preferred embodiment, it is assumed that a certain bar link Lj in T once from T after removal, not only to consider to be forced to take a roundabout way or
The quantity for the node pair being blocked, it is also contemplated that the importance of node pair for being forced to take a roundabout way or being blocked, according to importance
Processing is weighted to the quantity of the node pair of statistics.For example, it is assumed that a certain bar link Lj is forced Yi Dan removed from T in T
The node taken a roundabout way or be blocked is to there is three, and the importance weight coefficient of three nodes pair is a, b, c respectively, then, adds
After power processing, it is believed that the quantity for the node pair for being forced to take a roundabout way or being blocked is (a+b+c).Subsequently, can be according to this
Node after weighting processing determines influences of the link Lj to network connectivty to the quantity of (be forced to take a roundabout way or be blocked)
Value.
, can be two opportunitys, it is determined that current network topology in the embodiment of the present invention, and then opened up according to current network
Flutter, for each of which bar link calculation and convergence flow rate upper limit is set.
In two described opportunitys, an opportunity is, when network topology is initially formed, and does not arrange any business.Now
The current network topology determined, is initial network topology, can be represented with T0, be empty in T0, do not place any business.
Another opportunity is, when the structure of network topology changes.As business gradually increases in network, work as network
After at least one business of at least one business or revocation is added in topology, at least one link is might have because flow is occupied full
And the topology that exits network, at least one link exited before may rejoin network because of the release of part or all of flow and open up
Flutter, at this time, it may be necessary to redefine current network topology.The current network topology now determined, its structure can relative to T0
It can be changed, for example, it may be possible to lack one or more link.
For ease of describing, in the embodiment of the present invention, described network topology illustrates exemplified by using the network of SDNization.
Network topology structure as shown in Figure 3, network SDNization are the router-level topology and control being distributed in originally on each node 301
Function is focused on SDN network controller 302 and performed, and in this context, the executive agent of the inventive method can be specifically
SDN network controller.But it is to be understood that present invention method, can also apply other various networks in non-SDNization
In.
SDN network controller is the centralized controller of the whole network, and from all network elements of the whole network, node obtains in real time in other words
Information, all nodes being controlled in real time, meeting various computation requests, described computation requests most importantly calculate road for business, i.e.
For service computation path.Network controller possesses the real time information of the various Link States of all links in whole network, Ke Yidong
The parameters of state adjustment each of the links and limitation, including：It can calculate and set the convergence flow rate upper limit of each link.Network
How controller obtains the various information in network topology in real time, can be realized using prior art means, herein no longer
Repeat.Present invention method, key are the convergence that how to be calculated and be set each link using the various information of acquisition
Flow rate upper limit, make importance of the convergence flow rate upper limit reflection link of setting in network topology.
In general, network controller receive the calculation road request from the operation interface of node or the initiation of itself operation interface
Afterwards, according to real-time network topological information and calculation road strategy can be specified to be calculated to calculate business calculation road (calculating path) in the request of road
Lu Shixu ensures to meet the various requirement (such as link aggregation flow rate upper limit of the present invention) to path, after calculating road success,
Result path is handed down to interdependent node road construction (establishing path).
Any bar link pair network connectivty in current network topology is obtained in some embodiments of the invention, in 210
Influence value, it can include：
2101st, it is a node pair by any two node definition in current network topology, obtains m node pair, m
=n* (n-1)/2, n is the number for the node that current network topology includes, and n is greater than or equal to 2 integer.
Assuming that all number of nodes are n in network topology, firstly generate in network topology and own (no to repeat) in this step
Node pair, according to the mathematical principle of permutation and combination, it can be calculated that the quantity m=n* (n-1)/2 of all nodes pair.Citing, section
Point set { 1,2,3 } whether there is duplicate node to being (1,2) (2,3) and (1,3).Can be to each node to numbering, numbering
From 1 to m, wherein, the node that numbering is i is less than or equal to m positive integer to being designated as Di, i.Each node to represent it is all with
The node is to the business for sourcesink point.It is noted that herein for two nodes of a node centering, which does not differentiate between
Node is source point, and which node is place point.
2102nd, obtain the m node to any of volume of the node to Di business probability of occurrence Pi, i for node pair
Number, and i is less than or equal to m positive integer.
In this step, the business probability of occurrence of each node pair is specified or predicts or calculate, that is, in this node
There are more maximum probability futures to have service traffics flowing between.If the business probability of occurrence between certain node pair is very big, show
Future have flow flowed to from any point of the node centering another point possibility it is very high, if the business of certain node pair goes out
Existing probability is 0, represents that future does not have any flow and flows to another point from any point of the node pair.
Specifically, the method for obtaining the business probability of occurrence of each node pair may include it is following several：
A, it is the business probability of occurrence Pi that any one node is set to Di to obtain user.
, can be taking human as the business probability of occurrence for specifying each node pair, as long as all nodes pair in some embodiments
Business probability of occurrence sum is 1.
B, the sourcesink point and flow of known all business to be scheduled, business probability of occurrence Pi of any one node to Di is set
Equal to using node to Di as the service traffics sum to be scheduled of sourcesink point divided by the total flow sum of all business to be scheduled.
In some embodiments, if it is known that the sourcesink point and flow of all future business to be scheduled, can be predicted each
The business probability of occurrence of node pair.For example, (business probability of occurrence Pi of each node to Di) be equal to (using the node to Di as source
The following service traffics sum to be scheduled of place point) divided by (the total flow sums of all future business to be scheduled).It is obvious, Suo Youjie
The business probability of occurrence of point pair and for 1.The scene is primarily adapted for use in all or most of future services and has subscribed for and subscribe
In the case of knowable to information is abundant.
C, the history service flow in certain time is obtained, sets any one node to be equal to Di business probability of occurrence Pi
History service total flow divided by all history service total flow sum of the node to Di.
In some embodiments, it can obtain since sometime putting in the current period, it is all with the node
To the business total flow (referred to as history service total flow) that Di is sourcesink point, (each node occurs general to Di business for setting
Rate Pi) it is equal to (the history service total flow of the node pair) divided by (the history service total flow sums of all nodes pair), it is obvious
The business probability of occurrence of all nodes pair and for 1.This scene is mainly to utilize the historical traffic information prediction between node pair
The following flow information that may pass through between the node pair.
D, any one node is set to be equal to 1/m to Di business probability of occurrence Pi.
In some embodiments, the business probability of occurrence of each node pair can also be set to be equal to each other, summation 1,
That is any one node is set to be equal to 1/m to Di business probability of occurrence Pi.
E, in other embodiment, business probability of occurrence can also be set using other methods to set up, such as based on big
Following business probability of occurrence between the node pair of data mining or other theoretical installations.
It should be noted that no matter using above-mentioned any method to set up, after setting, the business of all nodes pair occurs
Probability sum is equal to 1.
2103rd, for the m node to any of node to Di set hop count upper limit Hui, wherein, Hui be more than or
Equal to Hi, Hi is the hop count in minimal weight path of the node to Di in current network topology.
In this step, be each node to set the hop count upper limit.Specifically it may include：
To each node to Di, the hop count (hop in its minimal weight path is calculated in current network topology
Number), it is Hi to remember this hop count (i is the numbering of node pair).In the present embodiment, can based on Hi, be node to Di systems
Fixed predetermined hop count upper limit Hiupper, is simply designated as Hui so that Hui>Hi.Once node exceedes this to the route jumping figure between Di
Upper limit Hui, then it is assumed that take a roundabout way in the path.Herein, do not limit and the predetermined hop count upper limit is formulated to Di for node based on Hi
Hui specific method, it is coefficient that Hui=k*Hi, k can be set by, which illustrating, and k is more than 1, for example, Hui=2*Hi can be made.It is special
Other, if node Di is not present in current network topology reachable path, Hi and Hiupper are infinitely great.
2104th, assume from current network topology remove any bar link Lj, judge any node between Di whether
The reachable path that hop count is less than or equal to Hui be present, if it does, making variable X ij be equal to 1, if it does not, making variable X ij
Equal to 0, wherein, j is link number, and j is less than or equal to m positive integer.
In this step, by assuming that removing any bar link Lj from current network topology, how many node pair weighed
Between transport will be forced to take a roundabout way or be blocked, to judge link Lj importance.Specifically, it may include：
To each link Lj in network topology T, in topological T-Lj (i.e. residues in current network topology T in addition to Lj
Part) in check that each node is less than or equal to hop count upper limit Hui (referring to the 3rd step) reachable road to Di with the presence or absence of hop count
Footpath (for example the BellmanFord algorithms for specifying the hop count upper limit or adjacency matrix multiplication can be used to check two inter-node connectivities
Method, or any other existing method).Once removing link Lj in topological T, find node to hop count is not present between Di
Less than or equal to predetermined hop count upper limit Hiupper reachable path, then illustrate node to that must be gone the long way round if no Lj between Di
Road or in the absence of reachable path.Herein, with variable X ij come expression node between Di if whether no Lj needs to go the long way round
Road or in the absence of reachable path.
Variable X ij=0, and if only if in topological T-Lj, node between Di be not present hop count less than or equal to Hui can
Up to path；
Xij=1, and if only if in topological T-Lj, the reachable road that node is less than or equal to Hui to hop count between Di be present
Footpath.
Optionally, each node can be pre-saved to the minimal weight path in topological T.Checked in topological T-Lj
When each node is less than or equal to predetermined hop count upper limit Hui reachable path to Di with the presence or absence of hop count, it is original that those can be ignored
Minimal weight path in itself do not include Lj node pair, because even removing Lj in T, between these nodes pair it is original most
Small weight path still can lead to, and hop count is certainly less than equal to Hui.
2105th, calculate any bar link Lj is to the influence value of network connectivty
In this step, influence values of the link Lj to network connectivty is calculated, the influence value isWherein, ∑
It is that i=1 to m is summed.
Once above calculating process embodies link Lj and removed from network topology T, all nodes from i=1 to m are to Di
In which has be forced to take a roundabout way or be blocked, its interior joint is represented with the business probability of occurrence Pi of node pair Di importance.
With reference to described above, in some embodiments of the invention, according to any bar link pair network connectivty in 220
Influence value, and, the capacity of any bar link, for any bar link calculation and convergence flow rate upper limit is set, can be included：
The convergence flow rate upper limit for calculating any bar link Lj isWherein Rj is link Lj capacity,
And convergence flow rate upper limit is set for any bar link Lj in current network topology according to result of calculation.
As seen from the above equation, once link Lj removes from network topology, it is forced to take a roundabout way or the node that is blocked is to more,
Then Xij intermediate values be 0 it is more,It is worth smaller, the convergence flow rate upper limit on the linkPhase
It is smaller for link capacity.Because utilizable flow is once occupied full on the link, it is forced to take a roundabout way or the node that blocks is to relative
It is more, cause to network it is connective destroy it is big, therefore the convergence flow rate upper limit of the link must be provided with it is low, to prevent the link
It is occupied full because having converged and having crossed various flow.
In turn, once link Lj removes from network topology, it is forced to take a roundabout way or the node that is blocked is to fewer, then
Xij intermediate values be 1 it is more,It is worth bigger, the convergence flow rate upper limit on the linkRelatively
It is bigger in link capacity.Because even if utilizable flow is occupied full on the link, it is forced to take a roundabout way or the node that blocks is to relatively few,
The connective of network is destroyed less, therefore the convergence flow rate upper limit of the link can be configured high, and without worrying the link
It is occupied full because having converged and having crossed various flow.
More than, for giving network topology, it is described in detail how to calculate for each of the links and converges flow rate upper limit.Below,
The link being discussed in detail in network topology sets the flow of convergence flow rate upper limit.
Fig. 4 is refer to, setting the flow of convergence flow rate upper limit can include：
401st, network topology is initialized.
In netinit, any business is not carried on network, all links are available, now recorded (backup) with T0
Under do not carry the network topology of any business, and by the use of T as the actual topology for arranging business, T=T0 when initial, T0 are original nets
Network topology.
402nd, for current network topology, using the method to set up of the link aggregation flow rate upper limit of the present invention, calculate simultaneously
The convergence flow rate upper limit of each of which link is set.
Before any business is placed into T, the process of the calculating convergence flow rate upper limit of the present invention is called to calculate in T every
The convergence flow rate upper limit of link, the convergence flow rate upper limit being calculated is set onto respective links.
403rd, toward arrangement one or a batch traffic in T, or one or a batch traffic are cancelled from T.
404th, determine whether link because newly be put into business and be occupied full, or new revocation business and from being occupied full state change
Not take.
Toward one or a batch traffic is arranged in T, (in note that toward T during arrangement business, calculation road will be by converging on link every time
The limitation of flow rate upper limit) after, or after cancelling one or a batch traffic from T every time, original some links not being occupied full can in T
Can become to be taken completely and any other business can not be carried again, or in T original some links being occupied full due to industry
Business cancels and becomes not to be occupied full.Therefore, every time toward after arranging one or a batch traffic in T, or every time from T revocation one or
After one batch traffic, each link in T0 (namely initial network topology) is reexamined.
405th, T is reset to T0-Lk.
If wherein truly have link from capacity to be discontented with state and be changed into being taken state or link completely to account for completely from capacity
Full state is changed into having capacity to free out, then T is reset to T0-Lk, and Lk refers to the link that current all capacity are occupied full in T0,
T0-Lk refers to remove remaining part after Lk from T0 so that including in T and only including all at present in T0 has vacant capacity
Link, and the method to set up of the link aggregation flow rate upper limit of the present invention is called, recalculate the convergence flow of each of the links in T
The upper limit is simultaneously set onto respective links.If T keeps constant, all links continue to use previously positioned convergence flow rate upper limit in T,
(when needed) continue to place or cancel next group (bar) business in toward T.
Need to reset network topology T when why thering is link to be occupied full every time and recalculate the convergence of all links in T
Flow rate upper limit, it is because the link that is occupied full of capacity is unable to recirculation any other flow, is equivalent to be removed from topology.When
When thering is link to be discontented with state from capacity to be changed into being taken state (or otherwise) completely, it is meant that the link is equivalent to move from topology
Except (or returning in topology), also imply that the structure of current network topology changes, and the link aggregation stream of the present invention
The method to set up of the upper limit is measured, is calculated based on network topology structure, therefore is needed when the structure of network topology changes again
The new convergence flow rate upper limit for calculating and link being set.
More than, describe the flow that convergence flow rate upper limit is set for the link in network topology in detail.
Below, the calculating with reference to above-mentioned convergence flow rate upper limit and setting procedure, and road flow is calculated, in network topology
Interaction flow between network controller and node and webmaster illustrates.
Fig. 5 is refer to, in some embodiments, interaction flow may include：
1st, when network topology is initially formed, network element (i.e. above described node) is initially empty to SDN controller report
Topology, i.e. do not arrange any business, blank initial network topology also.
2nd, SDN controller is according to the initial network topology of the blank of reported by network elements, according to the link aggregation of the present invention
The method to set up of flow rate upper limit, the convergence flow rate upper limit of all links in calculating network topology, and return to each network element and set
On link, the initial convergence flow rate upper limit as link.
3rd, webmaster is submitted to SDN controller and calculates road request or business revocation request for business.Wherein webmaster can be managed
Solve as the operation interface of network such as SDN controller.
4th, SDN controller when the business asked for webmaster carries out calculation road avoids service path from being arranged in as far as possible
Total flow (bearer traffic+service traffics) can be met or exceeded on the link of link aggregation flow rate upper limit.Unless without using super
When crossing the link of link aggregation flow rate upper limit then business can not just lead to, just service path be arranged in total flow (bearer traffic+
Service traffics) it can meet or exceed on the link of link aggregation flow rate upper limit.What if webmaster was asked is revocation business, SDN
Network controller does not have to calculate road.
5th, the routing information for the business for arranging or cancelling is issued network element, is established or removed for business by this information by network element
Actual path.
6th, the network topology after arrangement/revocation business is issued SDN controller by network element.
7th, business arrangement situation is fed back to webmaster by SDN controller.
8th, SDN controller check reported by network elements, establish or revocation business after network topology.If it find that there is chain
Road is occupied full or link is changed into not taking state from taking, represent network topology structure compared to establish or revocation business before occur
Change, then according to the method to set up of the link aggregation flow rate upper limit of the present invention, recalculate in current network topology and own
The convergence flow rate upper limit of link, return to each network element and be arranged on link, as the remittance under the current network topology of link
Poly- flow rate upper limit.
It may be noted that the interaction flow shown in above-mentioned Fig. 5 is one of way of realization of the present invention, the present invention is being realized
When, the method to set up of the link aggregation flow rate upper limit of the present invention can be deployed in different devices or module, time of interaction
Sequence can also be varied from, but the difference in these application methods does not change the essence of the present invention.
To sum up, in the embodiment of the present invention, for importance of any bar link in network topology structure in measurement network (i.e.
Removing the connection after the link between how many node pair of network can be affected) provide quantization method；Also, it is network
The traffic aggregation degree and network connectivty of upper different business provide the equalization point of quantization between keeping；In addition, amount of calculation is protected
Hold within the lower order polynomial expressions time, and need not be calculated when calculating road for business, and parallelization processing can be made, do not interfere with
Business calculates the efficiency on road.
Therefore in some feasible embodiments of the present invention, it is any in current network topology using obtaining
The influence value of bar link pair network connectivty, and then according to the influence value and the capacity of link, set on link aggregation flow
The technical scheme of limit, achieve following technique effect：Connect because the link aggregation flow rate upper limit of setting considers link pair network
The influence value of the general character, reflect significance level of the link in network topology so that the different link of importance is set different
Flow rate upper limit is converged, it is thus possible to which the problem of avoiding important link from easily being blocked because taking, can also avoid the secondary chain appearance of a street
Easily converge the problem of insufficient.
In order to preferably implement the such scheme of the embodiment of the present invention, it is also provided below and implements such scheme for coordinating
Relevant apparatus.
It refer to Fig. 6 a, a kind of network controller 600 of the embodiment of the present invention, for being set for the link in network topology
Flow rate upper limit is converged, the network controller may include：
Processing module 601, for determining current network topology, obtain any bar link pair net in current network topology
The connective influence value of network；
Setup module 602, for the influence value according to any bar link pair network connectivty, and, any bar chain
The capacity on road, for any bar link calculation in current network topology and convergence flow rate upper limit is set.
It refer to Fig. 6 b：
In some embodiments of the invention, the processing module 601 specifically may include：
Processing unit 6011, for being a node pair by any two node definition in current network topology, obtain
To m node pair, m=n* (n-1)/2, n is the number for the node that current network topology includes, and n is greater than or equal to 2
Integer；Be additionally operable to obtain the m node to any of node be the volume of node pair to Di business probability of occurrence Pi, i
Number, and i is less than or equal to m positive integer；And for for the m node to any of node to Di set jump
Number upper limit Hui, wherein, Hui is more than or equal to Hi, and Hi is minimal weight path of the node to Di in current network topology
Hop count；
Computing unit 6012, for assuming to remove any bar link Lj from current network topology, judge any node
It is less than or equal to Hui reachable path to whether there is hop count between Di, if it does, making variable X ij be equal to 1, if do not deposited
, make variable X ij be equal to 0, wherein, j is link number, and j is less than or equal to m positive integer；And calculate any bar chain
Road Lj is to the influence value of network connectivty
In some embodiments of the invention, the processing unit 6011, it is specifically used for：Acquisition user is any one node pair
The business probability of occurrence Pi that Di is set；Or, it is known that the sourcesink point and flow of all business to be scheduled, any one node pair is set
Di business probability of occurrence Pi is equal to using node to be scheduled service traffics sums of the Di as sourcesink point divided by all industry to be scheduled
The total flow sum of business；Or the history service flow in acquisition certain time, set any one node Di business occur
Probability P i is equal to history service total flow divided by all history service total flow sum of the node to Di；Or any one is set
Node is equal to 1/m to Di business probability of occurrence Pi；Wherein, the business probability of occurrence sum of all nodes pair is equal to 1.
In some embodiments of the invention, the setup module 602, the convergence flow for calculating any bar link Lj is particularly used in
Measuring the upper limit isWherein Rj is link Lj capacity, and is in current network topology according to result of calculation
Any bar link Lj sets convergence flow rate upper limit.
In some embodiments of the invention, the processing module 601, specifically for being initially formed when network topology, do not arrange
During any business, it is determined that current network topology；Or when the structure of network topology changes, it is determined that current network
Topology.
In some embodiments of the invention, it can also include：
Road module 603 is calculated, for when receiving the calculation road request of new business, service path to be calculated for the new business；Obtain
Take the minimum value of the convergence flow rate upper limit of each link at least one link included by the service path being calculated；
In the service path that judgement is calculated, the flow of bearer service adds the flow of the new business, if is more than or equal to
The minimum value of the convergence flow rate upper limit, if it is, determining whether the service path being calculated is unique road
Footpath, if it is, the new business is arranged in the service path being calculated by instruction business module, otherwise, indicate industry
The new business is arranged in other paths by business module；
The business module 604, for arranging the new business according to the instruction of the calculation road module.
It is appreciated that the function of each functional module of the network controller of the embodiment of the present invention can be real according to the above method
The method specific implementation in example is applied, its specific implementation process can refer to the associated description in above method embodiment, herein no longer
Repeat.
Therefore in some feasible embodiments of the present invention, it is any in current network topology using obtaining
The influence value of bar link pair network connectivty, and then according to the influence value and the capacity of link, set on link aggregation flow
The technical scheme of limit, achieve following technique effect：Connect because the link aggregation flow rate upper limit of setting considers link pair network
The influence value of the general character, reflect significance level of the link in network topology so that the different link of importance is set different
Flow rate upper limit is converged, it is thus possible to which the problem of avoiding important link from easily being blocked because taking, can also avoid the secondary chain appearance of a street
Easily converge the problem of insufficient.
The embodiment of the present invention also provides a kind of computer-readable storage medium, and the computer-readable storage medium can have program stored therein, should
The part or all of step of method to set up including the link aggregation flow rate upper limit described in above method embodiment when program performs
Suddenly.
Fig. 7 is refer to, the embodiment of the present invention also provides a kind of network controller 700, and the network controller 700 can be micro-
Handle computer.Such as：The network controller 700 can be all-purpose computer, customization machine, mobile phone terminal or purl machine etc.
One kind in portable equipment.The network controller 700 includes：Processor 704, memory 706, communication interface 702 and bus
708.Processor 704, memory 706 and communication interface 702 are connected by bus 708 and complete mutual communication.
The bus 708 can be industry standard architecture (Industry Standard Architecture, abbreviation
For ISA) bus or external equipment interconnection (Peripheral Component, referred to as PCI) bus or extension industrial standard body
Architecture (Extended Industry Standard Architecture, referred to as EISA) bus etc..The bus can be with
The one or more being divided into address bus, data/address bus, controlling bus.For ease of representing, only with a thick line table in Fig. 7
Show, it is not intended that an only bus or a type of bus.
Memory 706 is used to store executable program code, and the program code includes computer-managed instruction.When forwarding is set
During standby 700 execution program code, the network controller 700 can complete step 210~220 of embodiment one, can also
Realize that the institute of network controller 600 described in embodiment two is functional.Memory 706 can include high-speed RAM (Ramdom
Access Memory) memory.Alternatively, memory 706 can also also include nonvolatile memory (non-volatile
memory).Such as memory 706 can include magnetic disk storage.
Processor 704 can be a central processing unit (Central Processing Unit, referred to as CPU), or
It is that processor 704 (Application Specific Integrated Circuit, can be referred to as with specific integrated circuit
ASIC), or processor 704 can be arranged to implement one or more integrated circuits of the embodiment of the present invention.
Communication interface 702, current network topology is determined for performing, obtains any bar link in current network topology
To the influence value of network connectivty；According to the influence value of any bar link pair network connectivty, and, any bar link
Capacity, it is the operation that any bar link calculation converges flow rate upper limit in current network topology；
Processor 704, convergence flow is set for any bar link in current network topology according to result of calculation for performing
Measure the operation of the upper limit.
Alternatively, it is one that the processor 704, which is additionally operable to any two node definition in current network topology,
Node pair, m node pair is obtained, m=n* (n-1)/2, n is the number for the node that current network topology includes, and n is big
In or equal to 2 integer；Obtain the m node to any of node to Di business probability of occurrence Pi, i is node pair
Numbering, and i is less than or equal to m positive integer；For the m node to any of node to Di set the hop count upper limit
Hui, wherein, Hui is more than or equal to Hi, and Hi is the hop count in minimal weight path of the node to Di in current network topology；
It is assumed that remove any bar link Lj from current network topology, judge any node to being less than between Di with the presence or absence of hop count or
Reachable path equal to Hui, if it does, make variable X ij be equal to 1, if it does not, make variable X ij be equal to 0, wherein, j is
Link number, and j is less than or equal to m positive integer；Calculate any bar link Lj is to the influence value of network connectivty
Alternatively, it is that the business that any one node is set to Di occurs that the communication interface 702, which is additionally operable to obtain user,
Probability P i；Wherein, the business probability of occurrence sum of all nodes pair is equal to 1.
Alternatively, the processor 704 is additionally operable to the sourcesink point and flow of known all business to be scheduled, sets any one
Node is equal to Di business probability of occurrence Pi by the service traffics sum to be scheduled of sourcesink point divided by be needed using node to Di
The total flow sum of arrangement business；Or the history service flow in acquisition certain time, industry of any one node to Di is set
Business probability of occurrence Pi is equal to history service total flow divided by all history service total flow sum of the node to Di；Or set
Any one node is equal to 1/m to Di business probability of occurrence Pi；Wherein, the business probability of occurrence sum of all nodes pair is equal to 1.
Alternatively, the convergence flow rate upper limit that the processor 704 is additionally operable to calculate any bar link Lj isWherein Rj is link Lj capacity.
Alternatively, the processor 704 is specifically used for when network topology is initially formed, and does not arrange any business, it is determined that
Current network topology；Or when the structure of network topology changes, it is determined that current network topology.
Alternatively, when the processor 704 is additionally operable to ask on the calculation road for receiving new business, industry is calculated for the new business
Business path；Obtain the convergence flow rate upper limit of each link at least one link included by the service path being calculated
Minimum value；In the service path that judgement is calculated, the flow of bearer service adds the flow of the new business, if big
In or equal to the convergence flow rate upper limit minimum value, if it is, whether determining whether the service path being calculated
It is exclusive path, if it is, the new business is arranged in the service path being calculated, otherwise, by the new industry
Business is arranged in other paths.
What deserves to be explained is each functional unit of the network equipment provided in an embodiment of the present invention, can be based on embodiment
The specific implementation for the device possessed function that one method provided and embodiment two provide, the definition of term and explanation and implementation
Example one and embodiment two are consistent, and here is omitted.
It is appreciated that the function of each functional module of the network controller of the embodiment of the present invention can be real according to the above method
The method specific implementation in example is applied, its specific implementation process can refer to the associated description in above method embodiment, herein no longer
Repeat.
Therefore in some feasible embodiments of the present invention, it is any in current network topology using obtaining
The influence value of bar link pair network connectivty, and then according to the influence value and the capacity of link, set on link aggregation flow
The technical scheme of limit, achieve following technique effect：Connect because the link aggregation flow rate upper limit of setting considers link pair network
The influence value of the general character, reflect significance level of the link in network topology so that the different link of importance is set different
Flow rate upper limit is converged, it is thus possible to which the problem of avoiding important link from easily being blocked because taking, can also avoid the secondary chain appearance of a street
Easily converge the problem of insufficient.
In the above-described embodiments, the description to each embodiment all emphasizes particularly on different fields, and is not described in some embodiment
Part, may refer to the associated description of other embodiments.
It should be noted that for foregoing each method embodiment, in order to be briefly described, therefore it is all expressed as a series of
Combination of actions, but those skilled in the art should know, the present invention is not limited by described sequence of movement because according to
According to the present invention, some steps can use other orders or carry out simultaneously.Secondly, those skilled in the art should also know,
Embodiment described in this description belongs to preferred embodiment, and not necessarily the present invention must for involved action and module
Must.
One of ordinary skill in the art will appreciate that all or part of step in the various methods of above-described embodiment is can
To instruct the hardware of correlation to complete by program, the program can be stored in a computer-readable recording medium, storage
Medium can include：ROM, RAM, disk or CD etc..
The method to set up and network controller of the link aggregation flow rate upper limit provided above the embodiment of the present invention are carried out
It is discussed in detail, specific case used herein is set forth to the principle and embodiment of the present invention, above example
Explanation be only intended to help understand the present invention method and its core concept；Meanwhile for those of ordinary skill in the art,
According to the thought of the present invention, there will be changes in specific embodiments and applications, in summary, in this specification
Appearance should not be construed as limiting the invention.
Claims (10)
- A kind of 1. method to set up of link aggregation flow rate upper limit, it is characterised in that including：It is determined that current network topology, the influence value of any bar link pair network connectivty in current network topology, institute are obtained State influence value be in network topology, when any one link is removed, be forced to take a roundabout way in the network topology or The negatively correlated value of the number of the node pair that person is blocked；According to the influence value of any bar link pair network connectivty, and, the capacity of any bar link, it is current network Any bar link calculation and convergence flow rate upper limit is set in topology；The influence value for obtaining any bar link pair network connectivty in current network topology, including：It is a node pair by any two node definition in current network topology, obtains m node pair, m=n* (n- 1)/2, n is the number for the node that current network topology includes, and n is greater than or equal to 2 integer；Obtain the m node to any of node to Di business probability of occurrence Pi, i is the numbering of node pair, and i is small In or equal to m positive integer；For the m node to any of node to Di set hop count upper limit Hui, wherein, Hui is more than or equal to Hi, Hi It is the hop count in minimal weight path of the node to Di in current network topology；It is assumed that removing any bar link Lj from current network topology, judge that any node is small to whether there is hop count between Di In or equal to Hui reachable path, if it does, make variable X ij be equal to 1, if it does not, make variable X ij be equal to 0, wherein, J is link number, and j is less than or equal to m positive integer；Calculate any bar link Lj is to the influence value of network connectivty
- 2. according to the method for claim 1, it is characterised in that it is described obtain the m node to any of node pair Di business probability of occurrence Pi includes：It is the business probability of occurrence Pi that any one node is set to Di to obtain user；Or, it is known that the sourcesink point and flow of all business to be scheduled, business probability of occurrence Pi of any one node to Di is set Equal to using node to Di as the service traffics sum to be scheduled of sourcesink point divided by the total flow sum of all business to be scheduled；Or the history service flow in acquisition certain time, set any one node to be equal to Di business probability of occurrence Pi History service total flow divided by all history service total flow sum of the node to Di；Or any one node is set to be equal to 1/m to Di business probability of occurrence Pi；Wherein, the business probability of occurrence sum of all nodes pair is equal to 1.
- 3. according to the method for claim 1, it is characterised in that described according to any bar link pair network connectivty Influence value, and, the capacity of any bar link, for any bar link calculation and convergence flow rate upper limit is set, including：The convergence flow rate upper limit for calculating any bar link Lj isWherein Rj is link Lj capacity, and root It is that any bar link Lj sets convergence flow rate upper limit in current network topology according to result of calculation.
- 4. according to any described method in claims 1 to 3, it is characterised in that described to determine that current network topology includes：When network topology is initially formed, and does not arrange any business, it is determined that current network topology；Or when the structure of network topology changes, it is determined that current network topology.
- 5. according to any described method in claims 1 to 3, it is characterised in that also include：When being asked on the calculation road for receiving new business, service path is calculated for the new business；Obtain the convergence flow rate upper limit of each link at least one link included by the service path being calculated Minimum value；Judge in the service path that is calculated, the flow of bearer service adds the flow of the new business, if be more than or Equal to the minimum value of the convergence flow rate upper limit, if it is, determining whether the service path being calculated is only One path, if it is, the new business is arranged in the service path being calculated, otherwise, the new business is pacified Come in other paths.
- 6. a kind of network controller, it is characterised in that for setting convergence flow rate upper limit, the net for the link in network topology Network controller includes：Processing module, for determining current network topology, obtain any bar link pair network-in-dialing in current network topology Property influence value, the influence value is in network topology, when any one link is removed, and in the network topology It is forced to take a roundabout way or value that the number of node pair that is blocked is negatively correlated；Setup module, for the influence value according to any bar link pair network connectivty, and, the appearance of any bar link Amount, for any bar link calculation in current network topology and convergence flow rate upper limit is set；The processing module, for being a node pair by any two node definition in current network topology, obtain m Node pair, m=n* (n-1)/2, n are the number of node that current network topology includes, and n be greater than or equal to 2 it is whole Number；Be additionally operable to obtain the m node to any of node be the numbering of node pair to Di business probability of occurrence Pi, i, and I is less than or equal to m positive integer；And for for the m node to any of node to Di set the hop count upper limit Hui, wherein, Hui is more than or equal to Hi, and Hi is the hop count in minimal weight path of the node to Di in current network topology；Computing module, for assuming to remove any bar link Lj from current network topology, judge any node between Di It is less than or equal to Hui reachable path with the presence or absence of hop count, if it does, making variable X ij be equal to 1, if it does not, making variable Xij is equal to 0, wherein, j is link number, and j is less than or equal to m positive integer；And any bar link Lj is calculated to net The connective influence value of network is
- 7. network controller according to claim 6, it is characterised in thatThe processing module, it is the business probability of occurrence Pi that any one node is set to Di specifically for obtaining user；Or, it is known that the sourcesink point and flow of all business to be scheduled, business probability of occurrence Pi of any one node to Di is set Equal to using node to Di as the service traffics sum to be scheduled of sourcesink point divided by the total flow sum of all business to be scheduled；Or the history service flow in acquisition certain time, set any one node to be equal to Di business probability of occurrence Pi History service total flow divided by all history service total flow sum of the node to Di；Or any one node is set to be equal to 1/m to Di business probability of occurrence Pi；Wherein, the business probability of occurrence sum of all nodes pair is equal to 1.
- 8. network controller according to claim 6, it is characterised in thatThe setup module, it is specifically for the convergence flow rate upper limit for calculating any bar link LjWherein Rj is link Lj capacity, and is that any bar link Lj is set on convergence flow in current network topology according to result of calculation Limit.
- 9. according to any described network controller in claim 6 to 8, it is characterised in thatThe processing module, specifically for being initially formed when network topology, when not arranging any business, it is determined that current network is opened up Flutter；Or when the structure of network topology changes, it is determined that current network topology.
- 10. according to any described network controller in claim 6 to 8, it is characterised in that also include：Road module is calculated, for when receiving the calculation road request of new business, service path to be calculated for the new business；Acquisition calculates To service path included by least one link in each link convergence flow rate upper limit minimum value；Judge to calculate In obtained service path, the flow of bearer service adds the flow of the new business, if more than or equal to the convergence The minimum value of flow rate upper limit, if it is, determine whether the service path being calculated is exclusive path, if It is that the new business is arranged in the service path being calculated by instruction business module, otherwise, instruction business module will The new business is arranged in other paths；The business module, for arranging the new business according to the instruction of the calculation road module.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510092225.9A CN104734995B (en) | 2015-02-28 | 2015-02-28 | A kind of method to set up and network controller of link aggregation flow rate upper limit |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510092225.9A CN104734995B (en) | 2015-02-28 | 2015-02-28 | A kind of method to set up and network controller of link aggregation flow rate upper limit |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104734995A CN104734995A (en) | 2015-06-24 |
| CN104734995B true CN104734995B (en) | 2018-02-23 |
Family
ID=53458442
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510092225.9A Active CN104734995B (en) | 2015-02-28 | 2015-02-28 | A kind of method to set up and network controller of link aggregation flow rate upper limit |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104734995B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111080033B (en) * | 2019-12-30 | 2021-09-28 | 北京三快在线科技有限公司 | Method, device, computer equipment and storage medium for predicting service capacity |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1675899A (en) * | 2002-08-14 | 2005-09-28 | 西门子公司 | Access control for packet-oriented networks |
| CN101155085A (en) * | 2006-09-29 | 2008-04-02 | 中兴通讯股份有限公司 | Method and device for real-time flux prediction and real-time flux monitoring and early warning |
| CN103268701A (en) * | 2013-06-05 | 2013-08-28 | 王燚 | Urban road network load balancing method |
| CN103841015A (en) * | 2012-11-20 | 2014-06-04 | 英业达科技有限公司 | Network system and routing method |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9007906B2 (en) * | 2013-01-25 | 2015-04-14 | Dell Products L.P. | System and method for link aggregation group hashing using flow control information |
-
2015
- 2015-02-28 CN CN201510092225.9A patent/CN104734995B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1675899A (en) * | 2002-08-14 | 2005-09-28 | 西门子公司 | Access control for packet-oriented networks |
| CN101155085A (en) * | 2006-09-29 | 2008-04-02 | 中兴通讯股份有限公司 | Method and device for real-time flux prediction and real-time flux monitoring and early warning |
| CN103841015A (en) * | 2012-11-20 | 2014-06-04 | 英业达科技有限公司 | Network system and routing method |
| CN103268701A (en) * | 2013-06-05 | 2013-08-28 | 王燚 | Urban road network load balancing method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104734995A (en) | 2015-06-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108965014B (en) | QoS-aware service chain backup method and system | |
| CA2379043C (en) | Method and apparatus for communications traffic engineering | |
| Park et al. | A neural network based multi-destination routing algorithm for communication network | |
| Tian et al. | Traffic engineering in partially deployed segment routing over IPv6 network with deep reinforcement learning | |
| CN106549779A (en) | A kind of maximum non-intersect double route collocation method of multiple constraint energy communication service | |
| CN101753462B (en) | Method and device for realizing multiple next hop routes | |
| CN106533966A (en) | Network service resource arranging method and apparatus | |
| CN109560961B (en) | Virtual network service chain deployment method for improving availability based on superposition | |
| CN104734995B (en) | A kind of method to set up and network controller of link aggregation flow rate upper limit | |
| WO2018072690A1 (en) | Method, apparatus and system for measuring network path | |
| CN106470165A (en) | A kind of load sharing method, system and relevant device | |
| CN108347377A (en) | Data forwarding method and device | |
| CN106105282A (en) | Link buffer zone state is utilized to carry out the system and method for traffic engineering | |
| Wei et al. | G-Routing: Graph Neural Networks-Based Flexible Online Routing | |
| CN113014302B (en) | Network function service chain deployment method facing satellite network | |
| WO2012103852A2 (en) | Method and device for wavelength-division multiplexing network planning | |
| Zaman et al. | Enhancement of load balanced gateway selection in integrated Internet-MANET using genetic algorithm | |
| CN109963316A (en) | Multi-path route method and equipment for mobile satellite network | |
| CN106130895B (en) | The heavy route method and device of SDN network failure | |
| Khodayari et al. | Network routing based on reinforcement learning in dynamically changing networks | |
| Gotani et al. | Design of an SDN control method considering the path switching time under disaster situations | |
| Amaral et al. | Achieving correct hop-by-hop forwarding on multiple policy-based routing paths | |
| Vasilakos et al. | On routing and performance comparison of techniques for packet-switched networks using learning automata | |
| Fouquet et al. | Elastic routing: a distributed variant, implementation issues, and numerical results | |
| Krile et al. | Centralized routing algorithm based on flow permutations |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |