CN104734995A - Link aggregation traffic upper limit setting method and network controller - Google Patents
Link aggregation traffic upper limit setting method and network controller Download PDFInfo
- Publication number
- CN104734995A CN104734995A CN201510092225.9A CN201510092225A CN104734995A CN 104734995 A CN104734995 A CN 104734995A CN 201510092225 A CN201510092225 A CN 201510092225A CN 104734995 A CN104734995 A CN 104734995A
- Authority
- CN
- China
- Prior art keywords
- node
- link
- business
- network topology
- upper limit
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a link aggregation traffic upper limit setting method and a network controller. The method and the network controller aim to solve the technical problem that in the prior art, the aggregation traffic upper limit cannot reflect the importance to the network of links. In some feasible embodiments, the method includes the steps that a current network topology is determined, and the value of the influence on the network connectivity of any link in the current network topology is obtained; according to the value of the influence on the network connectivity of any link and the capacity of any link, the aggregation traffic upper limit is computed and arranged for any link in the current network topology.
Description
Technical field
The present invention relates to communication technical field, be specifically related to a kind of method to set up and network controller of the link aggregation flow upper limit.
Background technology
The every bar business of network can be simplified shown as tlv triple (source point, Su Dian, flow).In network, every bar link has certain flux capacity.Network traffics converge and refer to, under the flow that any link carries is no more than the prerequisite of the capacity of link, different business the path shared link as far as possible of process, take the expensive network equipment (such as optical add/drop multiplexer) to save as far as possible.Why allow multi-service shared link, be to allow the path of different business have public part as much as possible as far as possible, thus make node of process required for this group path of these business of carrying more few better.
Fig. 1 a and Fig. 1 b is the schematic diagram of two kinds of service convergences.From traffic aggregation angle, in Fig. 1 b, the arrangement path of two business is better than the arrangement path of two business in Fig. 1 a.The path that the number of nodes that in Fig. 1 b, the path of two business uses is starkly lower than two business in Fig. 1 a uses number of nodes.
But, network traffics converge exists following contradiction point: the requirement of traffic aggregation is tried one's best shared link in the path of business process, if but without stint requires business shared link, and some link may be caused to cause the flux capacity that can carry to be occupied full because having converged too many business.When a vivid analogy is festivals or holidays, nearly all vehicle all converges toward those several major trunk roads, causes the large traffic congestion of major trunk roads, meanwhile but also has many secondary roads can allow the vehicle dispersal of major trunk roads arrive respective destination completely.Fully loaded link, because no longer can be used by any service path, is equivalent to and is removed from network topology.Increasing and converging along with business, fully loaded link also progressively increases, and causes network topology to destroy connectedness because part of links is removed, and then makes business afterwards cannot be logical.If previous service convergence degree is so not high, do not cause part of links to be fully loaded with, these business afterwards can arrange down in a network.
In order to solve this contradiction, needing to arrange on link and converging the flow upper limit.Before flow on link arrives this upper limit, business can converge without restriction on this link; Once the flow that link carries reaches this preset upper limit, unless certain business does not just exist any other feasible path without this link, this business could use this link, otherwise this business can not use this link.For example, suppose link L capacity 100G, converge flow upper limit 60G, bearer traffic 40G, is provided with business s, service traffics 40G, if s has the path without L to use, then do not allow s to use L because on L bearer traffic add that service traffics can be greater than and converge the flow upper limit; If s does not just have path to use without L, business s is just allowed to use link L.
Prior art is the convergence flow upper limit arranged link is fixing, and can be fixed proportion, the flow such as converged on link must not exceed 50% of link capacity; Also can be fixed value, the flow such as converged on link must not more than 100GHz.
Arrange at present the method for the convergence flow upper limit of fixed value or fixed proportion for link, do not embody different link has different importance to the connection of whole network in network topology.For example the major trunk roads in city or river-spanning bridge to the importance of whole city traffic network far above other medium and small road of city.Arrange the same flow upper limit to the link of different significance level, important link aggregation flow can be caused too much to affect leading to of follow-up business, and the flow meanwhile secondary link carried fully is converged.
Summary of the invention
The embodiment of the present invention provides a kind of method to set up and network controller of the link aggregation flow upper limit, can not reflect the technical problem of link to the importance of network to solve the convergence flow upper limit arranged in prior art.
First aspect present invention provides a kind of method to set up of the link aggregation flow upper limit, comprising: determine current network topology, to obtain in current network topology arbitrary link to the influence value of network connectivty; According to described arbitrary link to the influence value of network connectivty, and the capacity of arbitrary link, arranges converge the flow upper limit for arbitrary link calculation in current network topology.
In conjunction with first aspect, in the implementation that the first is possible, in the network topology that described acquisition is current, arbitrary link is to the influence value of network connectivty, comprising:
Be a node pair by any two node definitions in current network topology, obtain m node pair, m=n* (n-1)/2, n is the number of the node that current network topology comprises, and n be more than or equal to 2 integer;
Obtain the business probability of occurrence Pi of described m any one node of node centering to Di, i is the right numbering of node, and i is the positive integer being less than or equal to m;
For described m any one node of node centering Di to arranging jumping figure upper limit Hui, wherein, Hui is more than or equal to Hi, and Hi is the jumping figure of node to the minimal weight path of Di in current network topology;
Assuming that remove arbitrary link Lj from current network topology, judge that any node is to the reachable path that whether there is jumping figure between Di and be less than or equal to Hui, if existed, variable X ij is made to equal 1, if there is no, variable X ij is made to equal 0, wherein, j is link number, and j is the positive integer being less than or equal to m;
Calculating arbitrary link Lj to the influence value of network connectivty is
In conjunction with the first possible implementation of first aspect, in the implementation that the second is possible, the described m of described acquisition the business probability of occurrence Pi of any one node of node centering to Di comprises:
Obtaining user is the business probability of occurrence Pi that any one node is arranged Di;
Or the sourcesink point of known all business to be scheduled and flow, arrange the business probability of occurrence Pi of any one node to Di and equal with node the total flow sum of the Di service traffics sum to be scheduled that is sourcesink point divided by all business to be scheduled;
Or, obtain the history service flow in certain hour, the business probability of occurrence Pi of any one node to Di be set and equal node to the history service total flow of Di divided by all history service total flow sums;
Or, the business probability of occurrence Pi of any one node to Di is set and equals 1/m;
Wherein, the business probability of occurrence sum that all nodes are right equals 1.
In conjunction with the first possible implementation of first aspect, in the implementation that the third is possible, described according to described arbitrary link to the influence value of network connectivty, and, the capacity of arbitrary link, arranges converge the flow upper limit for arbitrary link calculation, comprising:
The convergence flow upper limit calculating arbitrary link Lj is
wherein Rj is the capacity of link Lj, and is that in current network topology, arbitrary link Lj arranges and converge the flow upper limit according to result of calculation.
In conjunction with the first of first aspect or first aspect to any one in the third possible implementation, in the 4th kind of possible implementation, describedly determine that current network topology comprises:
When network topology is initially formed, when not arranging any business, determine current network topology;
Or, when the structure of network topology changes, determine current network topology.
In conjunction with the first of first aspect or first aspect to any one in the third possible implementation, in the 5th kind of possible implementation, method also comprises:
When the calculation road request receiving new business, it is described new business computing service path;
Obtain the minimum value of the convergence flow upper limit of each link at least one link included by service path calculated;
Judge in the service path calculated, the flow of bearer service adds the flow of described new business, whether be more than or equal to the minimum value of the described convergence flow upper limit, if, whether the service path calculated described in further judgement is exclusive path, if so, in the service path calculated described in described new business being arranged in, otherwise, described new business is arranged in other path.
Second aspect present invention provides a kind of network controller, the flow upper limit is converged for arranging for the link in network topology, described network controller comprises: processing module, for determining current network topology, to obtain in current network topology arbitrary link to the influence value of network connectivty; Module is set, for according to described arbitrary link to the influence value of network connectivty, and the capacity of arbitrary link, arranges converge the flow upper limit for arbitrary link calculation in current network topology.
In conjunction with second aspect, in the implementation that the first is possible, described processing module comprises:
Processing unit, for being a node pair by any two node definitions in current network topology, obtain m node pair, m=n* (n-1)/2, n is the number of the node that current network topology comprises, and n be more than or equal to 2 integer; Also for obtaining the business probability of occurrence Pi of described m any one node of node centering to Di, i is the right numbering of node, and i is the positive integer being less than or equal to m; And, for for described m any one node of node centering Di to arranging jumping figure upper limit Hui, wherein, Hui is more than or equal to Hi, and Hi is the jumping figure of node to the minimal weight path of Di in current network topology;
Computing unit, from current network topology, arbitrary link Lj is removed for supposing, judge that any node is to the reachable path that whether there is jumping figure between Di and be less than or equal to Hui, if existed, variable X ij is made to equal 1, if there is no, variable X ij is made to equal 0, wherein, j is link number, and j is the positive integer being less than or equal to m; And calculating arbitrary link Lj to the influence value of network connectivty is
In conjunction with the first possible implementation of second aspect, in the implementation that the second is possible,
Described processing unit is the business probability of occurrence Pi that any one node is arranged Di specifically for obtaining user;
Or the sourcesink point of known all business to be scheduled and flow, arrange the business probability of occurrence Pi of any one node to Di and equal with node the total flow sum of the Di service traffics sum to be scheduled that is sourcesink point divided by all business to be scheduled;
Or, obtain the history service flow in certain hour, the business probability of occurrence Pi of any one node to Di be set and equal node to the history service total flow of Di divided by all history service total flow sums;
Or, the business probability of occurrence Pi of any one node to Di is set and equals 1/m;
Wherein, the business probability of occurrence sum that all nodes are right equals 1.
In conjunction with the first possible implementation of second aspect, in the implementation that the third is possible,
Described module being set, specifically for calculating the convergence flow upper limit of arbitrary link Lj being
wherein Rj is the capacity of link Lj, and is that in current network topology, arbitrary link Lj arranges and converge the flow upper limit according to result of calculation.
In conjunction with the first of second aspect or second aspect to any one in the third possible implementation, in the 4th kind of possible implementation, described processing module, specifically for initially being formed when network topology, when not arranging any business, determine current network topology; Or, when the structure of network topology changes, determine current network topology.
In conjunction with the first of second aspect or second aspect to any one in the third possible implementation, in the 5th kind of possible implementation, network controller also comprises:
Calculating road module, for when the calculation road request receiving new business, is described new business computing service path; Obtain the minimum value of the convergence flow upper limit of each link at least one link included by service path calculated; Judge in the service path calculated, the flow of bearer service adds the flow of described new business, whether be more than or equal to the minimum value of the described convergence flow upper limit, if, whether the service path calculated described in further judgement is exclusive path, if so, in the service path calculated described in described new business is arranged in by indicating services module, otherwise described new business is arranged in other path by indicating services module;
Described business module, for arranging described new business according to the instruction of described calculation road module.
Therefore, in feasible execution modes more of the present invention, adopt and to obtain in current network topology arbitrary link to the influence value of network connectivty, and then according to the capacity of this influence value and link, the technical scheme of the link aggregation flow upper limit is set, achieves following technique effect:
Because the link aggregation flow upper limit arranged considers the influence value of link to network connectivty, reflect the significance level of link in network topology, the link making importance different is set up the different convergence flow upper limits, thus, the problem that important link easily blocks because taking can being avoided, secondary link also can be avoided easily to converge insufficient problem.
Accompanying drawing explanation
In order to be illustrated more clearly in embodiment of the present invention technical scheme, be briefly described to the accompanying drawing used required in embodiment and description of the prior art below, apparently, accompanying drawing in the following describes is only some embodiments of the present invention, for those of ordinary skill in the art, under the prerequisite not paying creative work, other accompanying drawing can also be obtained according to these accompanying drawings.
Fig. 1 a and 1b is the schematic diagram of two kinds of service convergences;
Fig. 2 is the flow chart of the method to set up of a kind of link aggregation flow upper limit that the embodiment of the present invention provides;
Fig. 3 is the schematic diagram of a kind of network topology structure in the embodiment of the present invention;
Fig. 4 arranges the flow chart converging the flow upper limit in the embodiment of the present invention;
Fig. 5 is the equipment interaction diagrams in embodiment of the present invention network;
Fig. 6 a is the schematic diagram of a kind of network controller that the embodiment of the present invention provides;
Fig. 6 b is the schematic diagram of another network controller that the embodiment of the present invention provides;
Fig. 7 is the schematic diagram of the another kind of network controller that the embodiment of the present invention provides.
Embodiment
The embodiment of the present invention provides a kind of method to set up and network controller of the link aggregation flow upper limit, can not reflect the technical problem of link to the importance of network to solve the convergence flow upper limit arranged in prior art.
The present invention program is understood better in order to make those skilled in the art person, below in conjunction with the accompanying drawing in the embodiment of the present invention, technical scheme in the embodiment of the present invention is clearly and completely described, obviously, described embodiment is only the embodiment of a part of the present invention, instead of whole embodiments.Based on the embodiment in the present invention, those of ordinary skill in the art, not making the every other embodiment obtained under creative work prerequisite, should belong to the scope of protection of the invention.
Below by specific embodiment, be described in detail respectively.
Please refer to Fig. 2, the embodiment of the present invention provides a kind of method to set up of the link aggregation flow upper limit, and the method can comprise:
210, determine current network topology, to obtain in current network topology arbitrary link to the influence value of network connectivty;
220, according to described arbitrary link to the influence value of network connectivty, and the capacity of arbitrary link, arranges converge the flow upper limit for arbitrary link calculation in current network topology.
The object of technical solution of the present invention is, require the prerequisite as far as possible converged in service traffics under, reasonably the flow upper limit is converged for bar link every in network is arranged, this convergence flow upper limit embodies link importance in a network, lower for the convergence flow upper limit of the link that the convergence flow upper limit of the link making importance higher is lower relative to importance, and higher for the convergence flow upper limit of the convergence flow upper limit of the lower link of the importance link higher relative to importance.Why the importance higher convergence flow upper limit is lower, because more important link more can not exhaust capacity because of traffic aggregation, causes follow-up business cannot use this link, and this is similar reason with only having major trunk roads just to need to restrict driving.As how quantization method reaches above-mentioned purpose, it is exactly the technical problem to be solved in the present invention.
In the embodiment of the present invention, suppose current given network topology T, and network topology T comprises n node, n be more than or equal to 2 positive integer.In the embodiment of the present invention, be a node pair by any two node definitions wherein, then obtain m node pair, m=n* (n-1)/2.In addition, there is a link between every two nodes, then current network topology T comprises maximum m bar link.For convenience of describing, represent i-th node pair with Di, i is the right numbering of node; Represent jth bar link with Lj, j is link number; Wherein, i and j is the positive integer being less than or equal to m.
In the embodiment of the present invention, to wherein each link Lj, after supposing this link Lj unavailable because capacity is occupied full (being equivalent to remove Lj from T), weigh have how many nodes between transport will be forced to take a roundabout way or be blocked, judge the importance of this link Lj, obtain link Lj to the influence value of network connectivty.General, suppose that Lj from after removing from T, the node being forced to take a roundabout way or be blocked, to more, thinks that the importance of this link Lj is higher, then set lower by link Lj to the influence value of network connectivty; Suppose that Lj from after removing from T, right fewer of the node being forced to take a roundabout way or be blocked, thinks that the importance of this link Lj is lower, then by link Lj to the influence value of network connectivty set higher.That is, herein, the importance of link is contrary with it to the influence value of network connectivty, and more important, influence value is lower; More inessential, influence value is higher.This is that conveniently subsequent calculations converges the flow upper limit.
In the present inventor's embodiment, can by the capacity of link Lj and it be to the product of the influence value of network connectivty, or this product is multiplied by certain coefficient, be set as the convergence flow upper limit of link Lj.
Therefore, in T, a certain bar link Lj once remove from T, the node being forced to take a roundabout way or be blocked is more to quantity, the importance of Lj is higher, illustrate that this link Lj is more important in network topology, this link more to be avoided as far as possible to be occupied full because flow excessively assembles, this link to converge the flow upper limit and just should arrange lower.
Optionally, it is also conceivable to node between the difference of importance, for the railway network, node is to (Beijing, Guangzhou) importance much larger than node to (Urumchi, Nanning), just can see with the passenger-cargo flow of their history and draw.Thus in preferred embodiment, suppose that in T, a certain bar link Lj once after removing from T, not only to consider the quantity that the node that is forced to take a roundabout way or be blocked is right, also will consider the importance that the node that is forced to take a roundabout way or be blocked is right, the quantity right according to the node of importance to statistics is weighted process.Such as, suppose that in T, a certain bar link Lj once after removing from T, the node being forced to take a roundabout way or be blocked is to there being three, and the right importance weight coefficient of three nodes is a, b, c respectively, then, after weighting process, right quantity is (a+b+c) can to think the node that is forced to take a roundabout way or be blocked.Follow-up, according to the quantity of the node after this weighting process to (being forced to take a roundabout way or be blocked), the influence value of link Lj to network connectivty can be determined.
In the embodiment of the present invention, two opportunitys, current network topology can be determined, and then according to current network topology, arrange converge the flow upper limit for wherein each link calculation.
In said two opportunitys, an opportunity is, when network topology is initially formed, when not arranging any business.The current network topology now determined is initial network topology, and available T0 represents, is empty in T0, does not place any business.
Another opportunity is, when the structure of network topology changes.Along with in network, business increases gradually, when adding at least one business in network topology or after cancelling at least one business, at least one link may be had to exit network because flow is occupied full topology, at least one link before exited may rejoin network topology because of part or all of flow release, now, need to redefine current network topology.The current network topology now determined, its structure may have occurred change relative to T0, such as, may lack one or more link.
For ease of describing, in the embodiment of the present invention, said network topology adopts the network of SDNization to be that example is described.Network topology structure as shown in Figure 3, network SDNization be the router-level topology be originally distributed on each node 301 and controlling functions are focused on SDN network controller 302 on perform, in this context, the executive agent of the inventive method can be specifically the network controller of SDN.But embodiment of the present invention method need be appreciated that, also can be applied in other various network of non-SDNization.
The network controller of SDN is the centerized fusion device of the whole network, from all network elements of the whole network node acquisition in other words real time information, controls all nodes in real time, meet various computation requests, most importantly said computation requests calculates road for business, that is, be service computation path.Network controller has the real time information of the various Link States of all links in whole network, can the parameters of the every bar link of dynamic conditioning and restriction, comprising: the convergence flow upper limit that can calculate and arrange each link.The various information of network controller how in Real-time Obtaining network topology, all can adopt prior art means to realize, repeat no more herein.Embodiment of the present invention method, key is how to utilize the various information of acquisition calculate and arrange the convergence flow upper limit of each link, makes the importance of convergence flow upper limit reflection link in network topology of setting.
General, after network controller receives the calculation road request initiated from operation interface or self operation interface of node, and calculation road can be specified tactful for the business calculated in the request of road calculates road (calculating path) according to real-time network topological information, calculate Lu Shixu to ensure to meet the various requirement (the link aggregation flow upper limit that such as the present invention relates to) to path, after calculating road success, result path is handed down to interdependent node road construction (setting up path).
In some embodiments of the invention, obtain arbitrary link in current network topology in 210 and, to the influence value of network connectivty, can comprise:
2101, be a node pair by any two node definitions in current network topology, obtain m node pair, m=n* (n-1)/2, n is the number of the node that current network topology comprises, and n be more than or equal to 2 integer.
Suppose that in network topology, all number of nodes are n, in this step, first all in generating network topology (without repeating) node pair, according to the mathematical principle of permutation and combination, can calculate, the quantity m=n* (n-1)/2 that all nodes are right.Citing, node set 1,2,3} institute with or without duplicate node to being (1,2) (2,3) and (1,3).Can, to each node to numbering, number from 1 to m, wherein, be numbered the node of i to being designated as Di, i be the positive integer being less than or equal to m.Each node to represent all with this node to the business for sourcesink point.It is noted that not distinguishing which node is source point herein for two nodes of a node centering, and which node is place point.
2102, obtain the business probability of occurrence Pi of described m any one node of node centering to Di, i is the right numbering of node, and i is the positive integer being less than or equal to m.
In this step, specify or prediction or calculate the right business probability of occurrence of each node, namely this node between have much probability to have service traffics flowing future.If certain node between business probability of occurrence very large, show there will be flow future very high to the possibility of another point from any point starting flow of this node centering, if the right business probability of occurrence of certain node is 0, represents following and do not have any flow and flow to another point from any point that this node is right.
Concrete, the method obtaining the right business probability of occurrence of each node can comprise following several:
A, acquisition user are the business probability of occurrence Pi that any one node is arranged Di.
In some execution modes, artificially can specify the business probability of occurrence that each node is right, as long as the right business probability of occurrence sum of all nodes is 1.
The sourcesink point of B, known all business to be scheduled and flow, arrange the business probability of occurrence Pi of any one node to Di and equal with node the total flow sum of the Di service traffics sum to be scheduled that is sourcesink point divided by all business to be scheduled.
In some execution modes, if known all futures business to be scheduled sourcesink point and flow, the business probability of occurrence that each node is right can be predicted.Such as, (each node is to the business probability of occurrence Pi of Di) will equal (the service traffics to be scheduled sum in future being sourcesink point to Di with this node) divided by the total flow sum of business to be scheduled (all futures).Obvious, the business probability of occurrence that all nodes are right and be 1.This sight be mainly applicable to all or most of future services subscribed and subscription information is fully known when.
C, the history service flow obtained in certain hour, arrange the business probability of occurrence Pi of any one node to Di and equal node to the history service total flow of Di divided by all history service total flow sums.
In some execution modes, can obtain from sometime in the current time period, all business total flows (referred to as history service total flow) that is sourcesink point with this node to Di, (each node is to the business probability of occurrence Pi of Di) is set and equals (the history service total flow that this node is right) divided by (the history service total flow sum that all nodes are right), the business probability of occurrence that obvious all nodes are right and be 1.This sight mainly utilize node between this node of historical traffic information prediction between following can by flow information.
D, the business probability of occurrence Pi of any one node to Di is set equals 1/m.
In some execution modes, the business probability of occurrence that also can arrange each node right is equal to each other, and summation is 1, that is, arranges the business probability of occurrence Pi of any one node to Di and equals 1/m.
In E, other execution mode, other method to set up can also be adopted to arrange business probability of occurrence, the business probability of occurrence following between the node pair such as based on large data mining or other theoretical installation.
It should be noted that no matter adopt above-mentioned any method to set up, after setting, the right business probability of occurrence sum of all nodes equals 1.
2103, for described m any one node of node centering Di to arranging jumping figure upper limit Hui, wherein, Hui is more than or equal to Hi, and Hi is the jumping figure of node to the minimal weight path of Di in current network topology.
In this step, for each node is to arranging the jumping figure upper limit.Specifically can comprise:
To each node to Di, in current network topology, calculate the jumping figure (hopnumber) in its minimal weight path, remember that this jumping figure is Hi (i is the right numbering of node).In the present embodiment, based on Hi, for node formulates predetermined jumping figure upper limit Hiupper to Di, simply can be designated as Hui, make Hui>Hi.Once node exceedes this upper limit Hui to the path jumping figure between Di, then think to take a roundabout way in this path.Herein, do not limit for node formulates the concrete grammar of predetermined jumping figure upper limit Hui to Di based on Hi, illustrating to arrange Hui=k*Hi, and k is coefficient, and k is greater than 1, such as, can make Hui=2*Hi.Especially, if node does not exist reachable path to Di in current network topology, then Hi and Hiupper is infinitely great.
2104, suppose from current network topology, remove arbitrary link Lj, judge that any node is to the reachable path that whether there is jumping figure between Di and be less than or equal to Hui, if existed, variable X ij is made to equal 1, if there is no, variable X ij is made to equal 0, wherein, j is link number, and j is the positive integer being less than or equal to m.
In this step, by hypothesis from current network topology, remove arbitrary link Lj, weigh have how many nodes between transport will be forced to take a roundabout way or be blocked, judge the importance of this link Lj.Concrete, can comprise:
To each link Lj in network topology T, check whether each node exists to Di the reachable path (such as can check the method for two inter-node connectivity with the BellmanFord algorithm or adjacency matrix multiplication of specifying the jumping figure upper limit, or any other existing method) that jumping figure is less than or equal to jumping figure upper limit Hui (see the 3rd step) in the topological T-Lj (remainder namely in current network topology T except Lj).Once remove link Lj in topology T, find that node is to the reachable path that there is not jumping figure between Di and be less than or equal to predetermined jumping figure upper limit Hiupper, if then illustrate that node is to not having Lj just must take a roundabout way between Di or not reachable path.Herein, if carry out expression node to there is no Lj between Di the need of taking a roundabout way or not reachable path with variable X ij.
Variable X ij=0, and if only if in topological T-Lj, and node is to the reachable path that there is not jumping figure between Di and be less than or equal to Hui;
Xij=1, and if only if in topological T-Lj, and node is less than or equal to the reachable path of Hui to there is jumping figure between Di.
Optionally, each node can be preserved in advance to the minimal weight path in topological T.Check in topological T-Lj each node to Di whether exist jumping figure be less than or equal to the reachable path of the predetermined jumping figure upper limit Hui time, the node pair itself not comprising Lj in those original minimal weight paths can be ignored, even if because remove Lj in T, these nodes between original minimal weight path still can lead to, and jumping figure must be less than or equal to Hui.
2105, calculating arbitrary link Lj to the influence value of network connectivty is
In this step, calculate link Lj to the influence value of network connectivty, this influence value is
wherein, ∑ is sued for peace to i=1 to m.
Above computational process embodies once link Lj removes from network topology T, and all nodes from i=1 to m are forced to take a roundabout way or be blocked to which has in Di, and its interior joint represents the importance of the Di business probability of occurrence Pi that node is right.
In conjunction with the above, in some embodiments of the invention, in 220 according to described arbitrary link to the influence value of network connectivty, and the capacity of arbitrary link, arranges converge the flow upper limit for arbitrary link calculation, can comprise:
The convergence flow upper limit calculating arbitrary link Lj is
wherein Rj is the capacity of link Lj, and is that in current network topology, arbitrary link Lj arranges and converge the flow upper limit according to result of calculation.
As seen from the above equation, once link Lj removes from network topology, the node being forced to take a roundabout way or be blocked to more, then Xij intermediate value be 0 more,
be worth less, the convergence flow upper limit on this link
less relative to link capacity.Because utilizable flow on this link is once be occupied full, the node being forced to take a roundabout way or block is to relatively many, cause destroying large to the connectedness of network, therefore the convergence flow upper limit of this link must arrange low, is occupied full because having converged various flow to prevent this link.
Conversely, once link Lj removes from network topology, the node being forced to take a roundabout way or be blocked to fewer, then Xij intermediate value be 1 more,
be worth larger, the convergence flow upper limit on this link
larger relative to link capacity.Even if because utilizable flow is occupied full on this link, the node being forced to take a roundabout way or block is to relatively few, destroy little to the connectedness of network, therefore the convergence flow upper limit of this link can arrange high, and does not worry that this link was occupied full because having converged various flow.
Above, for given network topology, how describe in detail is every bar link calculation convergence flow upper limit.Below, the link introduced in detail in network topology arranges the flow process converging the flow upper limit.
Please refer to Fig. 4, arranging the flow process converging the flow upper limit can comprise:
401, initialization network topology.
When netinit, network does not carry any business, all links are all available, now by the network topology not carrying any business under T0 record (backup), and arranging the topology of business as reality with T, T=T0 time initial, T0 are initial network topology.
402, for current network topology, adopt the method to set up of the link aggregation flow upper limit of the present invention, calculate and the convergence flow upper limit of wherein each link is set.
Before place any business in T, call the convergence flow upper limit calculating every bar link in the process computation T converging the flow upper limit of the present invention, the convergence flow upper limit calculated is set in respective links.
403, in T, arrange one or a batch traffic, or from T, cancel one or a batch traffic.
404, judged whether that link is occupied full because of newly putting into business, or newly cancelled business and become from the state of being occupied full and do not take.
In T, arrangement one or a batch traffic (please note at every turn, when arranging business in T, calculate the restriction that road will be subject to link converges the flow upper limit) after, or after cancelling one or a batch traffic from T at every turn, in T, some link be not occupied full original may become by taking completely and can not carry any other business again, or in T, some link be occupied full original is cancelled due to business and become and is not occupied full.Therefore, after arranging one or a batch traffic in T, or after cancelling one or a batch traffic from T, reexamine each link in T0 (namely initial network topology) at every turn at every turn.
405, T is reset to T0-Lk.
If wherein truly have link to be discontented with state from capacity to become and taken state or link completely and take state completely from capacity and become and have capacity to free out, then T is reset to T0-Lk, Lk refers to the link that in T0, current all capacity are occupied full, T0-Lk refers to from T0, to remove remaining part after Lk, make to comprise in T and only to comprise in T0 all links having vacant capacity at present, and call the method to set up of the link aggregation flow upper limit of the present invention, recalculate the convergence flow upper limit of every bar link in T and be set in respective links.If T remains unchanged, in T, all links continue to use the convergence flow upper limit previously arranged, and (when needed) continues place in T or cancel next group (bar) business.
Need when why having link to be occupied full to reset network topology T and the convergence flow upper limit recalculating all links in T at every turn, be any other flow because the link that capacity is occupied full can not circulate again, be equivalent to and be removed from topology.When have link from capacity be discontented with state become the state that taken completely (otherwise or) time, mean that this link is equivalent to remove (or getting back to topology) from topology, also just mean that the structure of current network topology changes, and the method to set up of the link aggregation flow upper limit of the present invention, be that topological structure Network Based calculates, when therefore the structure of network topology changes, need the convergence flow upper limit recalculating and arrange link.
Above, describe in detail as the link in network topology arranges the flow process converging the flow upper limit.
Below, in conjunction with calculating and the setting procedure of the above-mentioned convergence flow upper limit, and calculate road flow process, network controller in network topology and the interaction flow between node and webmaster are described.
Please refer to Fig. 5, in some embodiments, interaction flow can comprise:
1, when network topology is initially formed, network element (namely above said node) to the initial empty topology of SDN controller report, that is, that also do not arrange any business, blank initial network topology.
2, SDN controller is according to the initial network topology of the blank of reported by network elements, according to the method to set up of the link aggregation flow upper limit of the present invention, the convergence flow upper limit of all links in computing network topology, and return to each network element and be arranged on link, as the initial convergence flow upper limit of link.
3, webmaster is submitted to as business calculation road request or business cancel request to SDN controller.Wherein webmaster can be understood as the operation interface of network such as SDN controller.
4, SDN controller is when the business for webmaster request carries out calculation road, avoids that service path is arranged in total flow (bearer traffic+service traffics) as far as possible and can meet or exceed on the link of the link aggregation flow upper limit.Unless when not using the link that exceedes the link aggregation flow upper limit then business just can not be led to, can meet or exceed on the link of the link aggregation flow upper limit Cai service path is arranged in total flow (bearer traffic+service traffics).If webmaster request is cancel business, then SDN controller need not calculate road.
5, the routing information of the business arranging or cancel being issued network element, is the path of business foundation or dismounting reality by this information by network element.
6, network element issues SDN controller arranging/cancelling the network topology after business.
7, SDN controller feeds back to webmaster business arrangement situation.
8, SDN controller check reported by network elements, set up or cancel network topology after business.If find that there is link to be occupied full or link becomes from taking the state of not taking, represent network topology structure compared to setting up or there occurs change before cancelling business, then according to the method to set up of the link aggregation flow upper limit of the present invention, recalculate the convergence flow upper limit of all links in current network topology, returning to each network element is arranged on link, as the convergence flow upper limit under the current network topology of link.
What please note is, interaction flow shown in above-mentioned Fig. 5 is one of way of realization of the present invention, when realizing of the present invention, can the method to set up of the link aggregation flow upper limit of the present invention be deployed in different devices or module, mutual order also can change to some extent, but the difference in these usings method does not change essence of the present invention.
To sum up, in the embodiment of the present invention, for weigh the importance of arbitrary link in network topology structure in network (after namely removing this link network have how many nodes between connection can be affected) provide quantization method; Further, for the traffic aggregation degree of different business on network and network connectivty keep between provide the balance point of quantification; In addition, amount of calculation remained in the lower order polynomial expressions time, and did not need, for calculating when business calculates road, and can do parallelization process, can not affect the efficiency that business calculates road.
Therefore, in feasible execution modes more of the present invention, in the network topology adopting acquisition current, arbitrary link is to the influence value of network connectivty, and then according to the capacity of this influence value and link, the technical scheme of the link aggregation flow upper limit is set, achieve following technique effect: because the link aggregation flow upper limit arranged considers the influence value of link to network connectivty, reflect the significance level of link in network topology, the link making importance different is set up the different convergence flow upper limits, thus, the problem that important link easily blocks because taking can be avoided, also secondary link can be avoided easily to converge insufficient problem.
In order to better implement the such scheme of the embodiment of the present invention, be also provided for below coordinating the relevant apparatus implementing such scheme.
Please refer to Fig. 6 a, a kind of network controller 600 of the embodiment of the present invention, converge the flow upper limit for arranging for the link in network topology, described network controller can comprise:
Processing module 601, for determining current network topology, to obtain in current network topology arbitrary link to the influence value of network connectivty;
Module 602 is set, for according to described arbitrary link to the influence value of network connectivty, and the capacity of arbitrary link, arranges converge the flow upper limit for arbitrary link calculation in current network topology.
Please refer to Fig. 6 b:
In some embodiments of the invention, described processing module 601 specifically can comprise:
Processing unit 6011, for being a node pair by any two node definitions in current network topology, obtain m node pair, m=n* (n-1)/2, n is the number of the node that current network topology comprises, and n be more than or equal to 2 integer; Also for obtaining the business probability of occurrence Pi of described m any one node of node centering to Di, i is the right numbering of node, and i is the positive integer being less than or equal to m; And, for for described m any one node of node centering Di to arranging jumping figure upper limit Hui, wherein, Hui is more than or equal to Hi, and Hi is the jumping figure of node to the minimal weight path of Di in current network topology;
Computing unit 6012, from current network topology, arbitrary link Lj is removed for supposing, judge that any node is to the reachable path that whether there is jumping figure between Di and be less than or equal to Hui, if existed, variable X ij is made to equal 1, if there is no, variable X ij is made to equal 0, wherein, j is link number, and j is the positive integer being less than or equal to m; And calculating arbitrary link Lj to the influence value of network connectivty is
In some embodiments of the invention, described processing unit 6011, specifically for: obtaining user is the business probability of occurrence Pi that any one node is arranged Di; Or the sourcesink point of known all business to be scheduled and flow, arrange the business probability of occurrence Pi of any one node to Di and equal with node the total flow sum of the Di service traffics sum to be scheduled that is sourcesink point divided by all business to be scheduled; Or, obtain the history service flow in certain hour, the business probability of occurrence Pi of any one node to Di be set and equal node to the history service total flow of Di divided by all history service total flow sums; Or, the business probability of occurrence Pi of any one node to Di is set and equals 1/m; Wherein, the business probability of occurrence sum that all nodes are right equals 1.
In some embodiments of the invention, describedly arrange module 602, the convergence flow upper limit that specifically can be used for calculating arbitrary link Lj is
wherein Rj is the capacity of link Lj, and is that in current network topology, arbitrary link Lj arranges and converge the flow upper limit according to result of calculation.
In some embodiments of the invention, described processing module 601, specifically for initially being formed when network topology, when not arranging any business, determines current network topology; Or, when the structure of network topology changes, determine current network topology.
In some embodiments of the invention, can also comprise:
Calculating road module 603, for when the calculation road request receiving new business, is described new business computing service path; Obtain the minimum value of the convergence flow upper limit of each link at least one link included by service path calculated; Judge in the service path calculated, the flow of bearer service adds the flow of described new business, whether be more than or equal to the minimum value of the described convergence flow upper limit, if, whether the service path calculated described in further judgement is exclusive path, if so, in the service path calculated described in described new business is arranged in by indicating services module, otherwise described new business is arranged in other path by indicating services module;
Described business module 604, for arranging described new business according to the instruction of described calculation road module.
Be appreciated that the function of each functional module of the network controller of the embodiment of the present invention can according to the method specific implementation in said method embodiment, its specific implementation process can refer to the associated description in said method embodiment, repeats no more herein.
Therefore, in feasible execution modes more of the present invention, in the network topology adopting acquisition current, arbitrary link is to the influence value of network connectivty, and then according to the capacity of this influence value and link, the technical scheme of the link aggregation flow upper limit is set, achieve following technique effect: because the link aggregation flow upper limit arranged considers the influence value of link to network connectivty, reflect the significance level of link in network topology, the link making importance different is set up the different convergence flow upper limits, thus, the problem that important link easily blocks because taking can be avoided, also secondary link can be avoided easily to converge insufficient problem.
The embodiment of the present invention also provides a kind of computer-readable storage medium, and this computer-readable storage medium can have program stored therein, and comprises the part or all of step of the method to set up of the link aggregation flow upper limit recorded in said method embodiment when this program performs.
Please refer to Fig. 7, the embodiment of the present invention also provides a kind of network controller 700, and this network controller 700 can be micro-process computer.Such as: this network controller 700 can be the one in the portable equipments such as all-purpose computer, customization machine, mobile phone terminal or purl machine.This network controller 700 comprises: 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.
Described bus 708 can be industry standard architecture (Industry Standard Architecture, referred to as ISA) bus or peripheral component interconnect (Peripheral Component, referred to as PCI) bus or extended industry-standard architecture (Extended Industry Standard Architecture, referred to as EISA) bus etc.Described bus can be divided in address bus, data/address bus, control bus one or more.For ease of representing, only representing with a thick line in Fig. 7, but not representing the bus only having a bus or a type.
Memory 706 is for stores executable programs code, and this program code comprises computer-managed instruction.When forwarding unit 700 performs this program code, described network controller 700 can complete step 210 ~ 220 of embodiment one, also can realize all functions of network controller 600 described in embodiment two.Memory 706 can comprise high-speed RAM (Ramdom Access Memory) memory.Alternatively, memory 706 also can also comprise nonvolatile memory (non-volatile memory).Such as memory 706 can comprise magnetic disc store.
Processor 704 can be a central processing unit (Central Processing Unit, referred to as CPU), or processor 704 can specific integrated circuit (Application Specific Integrated Circuit, referred to as ASIC), or processor 704 can be the one or more integrated circuits being configured to implement the embodiment of the present invention.
Communication interface 702, determines current network topology for performing, and to obtain in current network topology arbitrary link to the influence value of network connectivty; According to described arbitrary link to the influence value of network connectivty, and the capacity of arbitrary link is the operation of arbitrary the link calculation convergence flow upper limit in current network topology;
Processor 704 is that in current network topology, arbitrary link arranges the operation of converging the flow upper limit for performing according to result of calculation.
Alternatively, described processor 704 also for being a node pair by any two node definitions in current network topology, obtains m node pair, m=n* (n-1)/2, n is the number of the node that current network topology comprises, and n be more than or equal to 2 integer; Obtain the business probability of occurrence Pi of described m any one node of node centering to Di, i is the right numbering of node, and i is the positive integer being less than or equal to m; For described m any one node of node centering Di to arranging jumping figure upper limit Hui, wherein, Hui is more than or equal to Hi, and Hi is the jumping figure of node to the minimal weight path of Di in current network topology; Assuming that remove arbitrary link Lj from current network topology, judge that any node is to the reachable path that whether there is jumping figure between Di and be less than or equal to Hui, if existed, variable X ij is made to equal 1, if there is no, variable X ij is made to equal 0, wherein, j is link number, and j is the positive integer being less than or equal to m; Calculating arbitrary link Lj to the influence value of network connectivty is
Alternatively, described communication interface 702 is also for obtaining the business probability of occurrence Pi that user is arranged Di for any one node; Wherein, the business probability of occurrence sum that all nodes are right equals 1.
Alternatively, described processor 704, also for sourcesink point and the flow of known all business to be scheduled, arranges the business probability of occurrence Pi of any one node to Di and equals with node the total flow sum of the Di service traffics sum to be scheduled that is sourcesink point divided by all business to be scheduled; Or, obtain the history service flow in certain hour, the business probability of occurrence Pi of any one node to Di be set and equal node to the history service total flow of Di divided by all history service total flow sums; Or, the business probability of occurrence Pi of any one node to Di is set and equals 1/m; Wherein, the business probability of occurrence sum that all nodes are right equals 1.
Alternatively, described processor 704 for calculating the convergence flow upper limit of arbitrary link Lj is also
wherein Rj is the capacity of link Lj.
Alternatively, described processor 704, specifically for initially being formed when network topology, when not arranging any business, determines current network topology; Or, when the structure of network topology changes, determine current network topology.
Alternatively, described processor 704 for when the calculation road request receiving new business, is also described new business computing service path; Obtain the minimum value of the convergence flow upper limit of each link at least one link included by service path calculated; Judge in the service path calculated, the flow of bearer service adds the flow of described new business, whether be more than or equal to the minimum value of the described convergence flow upper limit, if, whether the service path calculated described in further judgement is exclusive path, if so, in the service path calculated described in described new business being arranged in, otherwise, described new business is arranged in other path.
What deserves to be explained is, each functional unit of the network equipment that the embodiment of the present invention provides, it can be the specific implementation of the function that device that the method that provides based on embodiment one and embodiment two provide possesses, the definition of term and to illustrate and embodiment one and embodiment two are consistent, repeats no more herein.
Be appreciated that the function of each functional module of the network controller of the embodiment of the present invention can according to the method specific implementation in said method embodiment, its specific implementation process can refer to the associated description in said method embodiment, repeats no more herein.
Therefore, in feasible execution modes more of the present invention, in the network topology adopting acquisition current, arbitrary link is to the influence value of network connectivty, and then according to the capacity of this influence value and link, the technical scheme of the link aggregation flow upper limit is set, achieve following technique effect: because the link aggregation flow upper limit arranged considers the influence value of link to network connectivty, reflect the significance level of link in network topology, the link making importance different is set up the different convergence flow upper limits, thus, the problem that important link easily blocks because taking can be avoided, also secondary link can be avoided easily to converge insufficient problem.
In the above-described embodiments, the description of each embodiment is all emphasized particularly on different fields, in certain embodiment, there is no the part described in detail, can see the associated description of other embodiment.
It should be noted that, for aforesaid each embodiment of the method, in order to simple description, 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 by the restriction of described sequence of movement, because according to the present invention, some step can adopt other order or carry out simultaneously.Secondly, those skilled in the art also should know, the embodiment described in specification all belongs to preferred embodiment, and involved action and module might not be that the present invention is necessary.
One of ordinary skill in the art will appreciate that all or part of step in the various methods of above-described embodiment is that the hardware that can carry out instruction relevant by program has come, this program can be stored in a computer-readable recording medium, and storage medium can comprise: ROM, RAM, disk or CD etc.
Above the method to set up of the link aggregation flow upper limit that the embodiment of the present invention provides and network controller are described in detail, apply specific case herein to set forth principle of the present invention and execution mode, the explanation of above embodiment just understands method of the present invention and core concept thereof for helping; Meanwhile, for one of ordinary skill in the art, according to thought of the present invention, all will change in specific embodiments and applications, in sum, this description should not be construed as limitation of the present invention.
Claims (12)
1. a method to set up for the link aggregation flow upper limit, is characterized in that, comprising:
Determine current network topology, to obtain in current network topology arbitrary link to the influence value of network connectivty;
According to described arbitrary link to the influence value of network connectivty, and the capacity of arbitrary link, arranges converge the flow upper limit for arbitrary link calculation in current network topology.
2. method according to claim 1, is characterized in that, in the network topology that described acquisition is current, arbitrary link is to the influence value of network connectivty, comprising:
Be a node pair by any two node definitions in current network topology, obtain m node pair, m=n* (n-1)/2, n is the number of the node that current network topology comprises, and n be more than or equal to 2 integer;
Obtain the business probability of occurrence Pi of described m any one node of node centering to Di, i is the right numbering of node, and i is the positive integer being less than or equal to m;
For described m any one node of node centering Di to arranging jumping figure upper limit Hui, wherein, Hui is more than or equal to Hi, and Hi is the jumping figure of node to the minimal weight path of Di in current network topology;
Assuming that remove arbitrary link Lj from current network topology, judge that any node is to the reachable path that whether there is jumping figure between Di and be less than or equal to Hui, if existed, variable X ij is made to equal 1, if there is no, variable X ij is made to equal 0, wherein, j is link number, and j is the positive integer being less than or equal to m;
Calculating arbitrary link Lj to the influence value of network connectivty is
3. method according to claim 2, is characterized in that, the described m of described acquisition the business probability of occurrence Pi of any one node of node centering to Di comprises:
Obtaining user is the business probability of occurrence Pi that any one node is arranged Di;
Or the sourcesink point of known all business to be scheduled and flow, arrange the business probability of occurrence Pi of any one node to Di and equal with node the total flow sum of the Di service traffics sum to be scheduled that is sourcesink point divided by all business to be scheduled;
Or, obtain the history service flow in certain hour, the business probability of occurrence Pi of any one node to Di be set and equal node to the history service total flow of Di divided by all history service total flow sums;
Or, the business probability of occurrence Pi of any one node to Di is set and equals 1/m;
Wherein, the business probability of occurrence sum that all nodes are right equals 1.
4. method according to claim 2, is characterized in that, described according to described arbitrary link to the influence value of network connectivty, and the capacity of arbitrary link, arranges converge the flow upper limit for arbitrary link calculation, comprising:
The convergence flow upper limit calculating arbitrary link Lj is
wherein Rj is the capacity of link Lj, and is that in current network topology, arbitrary link Lj arranges and converge the flow upper limit according to result of calculation.
5. according to described method arbitrary in Claims 1-4, it is characterized in that, describedly determine that current network topology comprises:
When network topology is initially formed, when not arranging any business, determine current network topology;
Or, when the structure of network topology changes, determine current network topology.
6., according to described method arbitrary in Claims 1-4, it is characterized in that, also comprise:
When the calculation road request receiving new business, it is described new business computing service path;
Obtain the minimum value of the convergence flow upper limit of each link at least one link included by service path calculated;
Judge in the service path calculated, the flow of bearer service adds the flow of described new business, whether be more than or equal to the minimum value of the described convergence flow upper limit, if, whether the service path calculated described in further judgement is exclusive path, if so, in the service path calculated described in described new business being arranged in, otherwise, described new business is arranged in other path.
7. a network controller, is characterized in that, converge the flow upper limit for arranging for the link in network topology, described network controller comprises:
Processing module, for determining current network topology, to obtain in current network topology arbitrary link to the influence value of network connectivty;
Module is set, for according to described arbitrary link to the influence value of network connectivty, and the capacity of arbitrary link, arranges converge the flow upper limit for arbitrary link calculation in current network topology.
8. network controller according to claim 7, is characterized in that, described processing module comprises:
Processing unit, for being a node pair by any two node definitions in current network topology, obtain m node pair, m=n* (n-1)/2, n is the number of the node that current network topology comprises, and n be more than or equal to 2 integer; Also for obtaining the business probability of occurrence Pi of described m any one node of node centering to Di, i is the right numbering of node, and i is the positive integer being less than or equal to m; And, for for described m any one node of node centering Di to arranging jumping figure upper limit Hui, wherein, Hui is more than or equal to Hi, and Hi is the jumping figure of node to the minimal weight path of Di in current network topology;
Computing unit, from current network topology, arbitrary link Lj is removed for supposing, judge that any node is to the reachable path that whether there is jumping figure between Di and be less than or equal to Hui, if existed, variable X ij is made to equal 1, if there is no, variable X ij is made to equal 0, wherein, j is link number, and j is the positive integer being less than or equal to m; And calculating arbitrary link Lj to the influence value of network connectivty is
9. network controller according to claim 8, is characterized in that,
Described processing unit is the business probability of occurrence Pi that any one node is arranged Di specifically for obtaining user;
Or the sourcesink point of known all business to be scheduled and flow, arrange the business probability of occurrence Pi of any one node to Di and equal with node the total flow sum of the Di service traffics sum to be scheduled that is sourcesink point divided by all business to be scheduled;
Or, obtain the history service flow in certain hour, the business probability of occurrence Pi of any one node to Di be set and equal node to the history service total flow of Di divided by all history service total flow sums;
Or, the business probability of occurrence Pi of any one node to Di is set and equals 1/m;
Wherein, the business probability of occurrence sum that all nodes are right equals 1.
10. network controller according to claim 8, is characterized in that,
Described module being set, specifically for calculating the convergence flow upper limit of arbitrary link Lj being
wherein Rj is the capacity of link Lj, and is that in current network topology, arbitrary link Lj arranges and converge the flow upper limit according to result of calculation.
11., according to described network controller arbitrary in claim 7 to 9, is characterized in that,
Described processing module, specifically for initially being formed when network topology, when not arranging any business, determines current network topology; Or, when the structure of network topology changes, determine current network topology.
12., according to described network controller arbitrary in claim 7 to 9, is characterized in that, also comprise:
Calculating road module, for when the calculation road request receiving new business, is described new business computing service path; Obtain the minimum value of the convergence flow upper limit of each link at least one link included by service path calculated; Judge in the service path calculated, the flow of bearer service adds the flow of described new business, whether be more than or equal to the minimum value of the described convergence flow upper limit, if, whether the service path calculated described in further judgement is exclusive path, if so, in the service path calculated described in described new business is arranged in by indicating services module, otherwise described new business is arranged in other path by indicating services module;
Described business module, for arranging described new business according to the instruction of described 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 true CN104734995A (en) | 2015-06-24 |
| CN104734995B 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) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111080033A (en) * | 2019-12-30 | 2020-04-28 | 北京三快在线科技有限公司 | Method, device, computer equipment and storage medium for predicting service capacity |
Citations (5)
| 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 |
| US20140211621A1 (en) * | 2013-01-25 | 2014-07-31 | 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 (5)
| 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 |
| US20140211621A1 (en) * | 2013-01-25 | 2014-07-31 | Dell Products L.P. | System and method for link aggregation group hashing using flow control information |
| CN103268701A (en) * | 2013-06-05 | 2013-08-28 | 王燚 | Urban road network load balancing method |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111080033A (en) * | 2019-12-30 | 2020-04-28 | 北京三快在线科技有限公司 | Method, device, computer equipment and storage medium for predicting service capacity |
| CN111080033B (en) * | 2019-12-30 | 2021-09-28 | 北京三快在线科技有限公司 | Method, device, computer equipment and storage medium for predicting service capacity |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104734995B (en) | 2018-02-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108965014B (en) | QoS-aware service chain backup method and system | |
| CN107888425B (en) | network slice deployment method and device for mobile communication system | |
| US10748067B2 (en) | Kernel scheduling based on precedence constraints and/or artificial intelligence techniques | |
| CN108011817B (en) | Method and system for redeploying power communication private network service route | |
| KR102342063B1 (en) | Proactive handling of network faults | |
| WO2015096761A1 (en) | Traffic behavior driven dynamic zoning for distributed traffic engineering in sdn | |
| US9722912B2 (en) | Network stochastic cross-layer optimization for meeting traffic flow availability target at minimum cost | |
| US20150363240A1 (en) | System for controlling resources, control pattern generation apparatus, control apparatus, method for controlling resources and program | |
| CN107682211B (en) | Network topology structure determination method and device and computer readable storage medium | |
| CN113098773A (en) | Data processing method, device and system | |
| CN106817306B (en) | Method and device for determining target route | |
| CN116055406B (en) | Training method and device for congestion window prediction model | |
| CN108347377B (en) | Data forwarding method and device | |
| US11294717B2 (en) | Multiple stage data stream processing method and data stream processing system | |
| CN109560961B (en) | Virtual network service chain deployment method for improving availability based on superposition | |
| CN113535381A (en) | Service function chain mapping method, device and equipment based on improved genetic algorithm | |
| CN104734995A (en) | Link aggregation traffic upper limit setting method and network controller | |
| CN113014302B (en) | Network function service chain deployment method facing satellite network | |
| Pyakurel et al. | Efficent Algorithms for Flow Over Time Evacuation Planning Problems with Lane Reversal Strategy | |
| CN111200566A (en) | Network service flow information grooming method and electronic equipment | |
| CN114422453B (en) | Method, device and storage medium for online planning of time-sensitive stream | |
| CN108270605A (en) | The determining method, apparatus and equipment of a kind of important network element | |
| Yadollahzadeh Tabari et al. | Estimating reliability in mobile ad-hoc networks based on Monte Carlo simulation | |
| CN115883401B (en) | End-to-end network performance prediction method, system and platform based on flow interaction graph | |
| CN111860972B (en) | Rail transit route generation method and device |
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 |