CN104601485B - The distribution method of network flow and the method for routing for realizing network flow distribution - Google Patents
The distribution method of network flow and the method for routing for realizing network flow distribution Download PDFInfo
- Publication number
- CN104601485B CN104601485B CN201510076331.8A CN201510076331A CN104601485B CN 104601485 B CN104601485 B CN 104601485B CN 201510076331 A CN201510076331 A CN 201510076331A CN 104601485 B CN104601485 B CN 104601485B
- Authority
- CN
- China
- Prior art keywords
- flow
- link
- address
- node
- hop
- 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 distribution methods of network flow and the method for routing of realization network flow distribution, the distribution method of the network flow to include：All or part of flow of source node is sent to destination node by multilink, and make the flow for any link for flowing to the destination node close to the setting flow of the link, wherein, each link sets flow as the flow value that is determined according to the bandwidth of maximum link utilization and the link.The method achieve the optimum allocations of the shunting link flow to network flow, reduce the maximum link utilization of network.Simultaneously by establishing the retransmission method based on two dimension routing to realize optimal network assignment of traffic, the problem of being unable to fully in OSPF method for routing in existing domain using non-shortest path is overcome, the quality of network service is improved.
Description
Technical field
The present invention relates to field of Internet communication more particularly to the distribution methods and realization network flow of a kind of network flow
The method for routing of distribution.
Background technology
Business Stream is mapped to the task on existing physical topology and is referred to as traffic engineering.Internet early stage, it is this to reflect
It penetrates and is only simply based on the routing configuration of product and is mapped, but with growing, the network operator of internet traffic
It is faced with huge flow pressure, is taken in order to more efficiently provide good network using the integration of network for client
Business, needs the traffic engineering for establishing entirely different realization method.
The traffic engineering method that routing configuration based on product is mapped can lead to network congestion, be embodied in, one
A little link flow transmission overloads, and other links are relatively idle.It understands to lead to the problem of this by further analyzing
The reason of be, in existing domain the OSPF routings of Web vector graphic only route according to shortest path, be unable to fully using non-most short
Path, thus it is unbalanced to cause link to use.
In conclusion there is an urgent need for a kind of distribution methods for the network flow that can make full use of non-shortest path, in solution
State problem.
Invention content
The first technical problem to be solved by the present invention is to need to provide a kind of net that can make full use of non-shortest path
The distribution method of network flow.
In order to solve the above-mentioned technical problem, embodiments herein provides firstly a kind of distribution method of network flow,
Including：All or part of flow of source node is sent to destination node by multilink, and makes to flow to the destination node
Any link flow close to the link setting flow, wherein each link set flow as according to maximum link profit
The flow value determined with rate and the bandwidth of the link.
Preferably, above-mentioned multilink includes by source node to destination node without cycle next-hop node and source node shape
At link.
Preferably, the setting flow of the link is calculated using linear programming model, wherein make maximum link utilization
For the first optimization aim of linear programming model object function, using average link utilization as linear programming model object function
The second optimization aim.
Preferably, linear programming model is as shown in following expressions：
In formula, V is the set of node, and E is the set of link, | E | it is the number of link；α is maximum link utilization, δ
For constant；dijIt indicates from node i to the uninterrupted of node j；gjkThe uninterrupted on link k to reach destination node j；
OUT (i) goes out for node i to link set, and IN (i) enters for node i to link set；Ava (i, j) is that node i reaches mesh
Node j without cycle next-hop；K and e is the link in set E, ckFor the bandwidth of link k, ceFor the bandwidth of link e.
On the other hand, embodiments herein additionally provides a kind of method for routing for realizing network flow distribution, including：Root
Destination node information corresponding with destination address is obtained according to the first mapping table；It is reflected according to the destination node information inquiry second
Firing table obtains the address block belonging to source address；Address block belonging to source address obtains next-hop node information, and will
Flow corresponding with source address is sent to next-hop node.
Preferably, the first mapping table includes destination address prefix and destination node information, wherein the destination node information
For the address of the memory space corresponding with the destination node of direction second mapping table.
Preferably, the second mapping table includes the multiple address blocks divided to source address space, wherein described
Address area root tuber is according to for forwarding the multilink of all or part of flow of source node to be divided.
Preferably, source address space is divided according to following steps to obtain the multiple address block：Step 1:
Choose a link in multilink, wherein each of the links in multilink correspond to an address block；Step 2: will
The corresponding flow of each source address that any address block is not added adds up one by one；Step 3: when cumulative flow and approaching
When the setting flow of the link of selection, address corresponding with link block is added in the source address that executed flow is added up, and
Again a link return to step two is chosen.
Preferably, the first mapping table is stored in TCAM, and the second mapping table is stored in SRAM.
Preferably, the address block belonging to binary search source address is utilized.
Compared with prior art, one or more of said program embodiment can have the following advantages that or beneficial to effect
Fruit：
By to being optimized using the traffic engineering model shunted without cycle next-hop, realizing to network flow
Shunting link flow optimum allocation, reduce the maximum link utilization of network.Simultaneously by establishing based on two dimension routing
Retransmission method to realize optimal network assignment of traffic, overcome be unable to fully in OSPF method for routing in existing domain using it is non-most
The problem of short path, improves the quality of network service.
Other advantages, target and the feature of the present invention will be illustrated in the following description to a certain extent, and
And to a certain extent, based on will be apparent to those skilled in the art to investigating hereafter, Huo Zheke
To be instructed from the practice of the present invention.The target and other advantages of the present invention can be wanted by following specification, right
Specifically noted structure is sought in book and attached drawing to realize and obtain.
Although describing the present invention, people in the art hereinafter in connection with some exemplary implementations and application method
Member is it should be appreciated that be not intended to limit the invention to these embodiments.It is on the contrary, it is intended to which that covering is wanted included in appended right
Seek all substitutes, amendment and the equivalent in spirit and scope of the invention defined in book.
Description of the drawings
Attached drawing is used for providing to the technical solution of the application or further understanding for the prior art, and constitution instruction
A part.Wherein, technical side of the attached drawing of the embodiment of the present application together with embodiments herein for explaining the application is expressed
Case, but do not constitute the limitation to technical scheme.
Fig. 1 is the flow diagram for the method for routing that the realization network flow of the embodiment of the present application is distributed；
Fig. 2 is the first mapping table schematic diagram of the embodiment of the present application；
Fig. 3 is the second mapping table schematic diagram of the embodiment of the present application；
Fig. 4 is an exemplary core network topological structure schematic diagram；
Fig. 5 (a) is an exemplary flow information schematic diagram, and Fig. 5 (b) is an exemplary traffic matrix schematic diagram；
Fig. 6 is that first/second of the example on the router A when being forwarded using the method for the embodiment of the present application is reflected
Firing table schematic diagram；
Fig. 7 is that first/second of the example on the router D when being forwarded using the method for the embodiment of the present application is reflected
Firing table schematic diagram.
Specific implementation mode
Hereinafter, embodiments of the present invention will be described in detail with reference to the accompanying drawings and examples, how to be applied to the present invention whereby
Technological means solves technical problem, and the realization process for reaching relevant art effect can fully understand and implement.This Shen
Each feature that please be in embodiment and embodiment, can be combined with each other under the premise of not colliding, be formed by technical solution
Within protection scope of the present invention.
Without cycle next-hop (Loop-free next hop) also referred to as using next-hop, definition such as expression formula (1)
It is shown：
Dist(N,D)<Dist(N,S)+Dist(S,D) (1)
In formula, what Dist (A, B) was indicated is the length from node A to the shortest path of node B, and S indicates source node, D tables
Show that destination node, N indicate intermediate node.
Expression formula (1) is meant that, if the length that intermediate node N reaches the shortest path of destination node D is less than from source
Node S reaches the length of the shortest path of destination node D and reaches the length of the shortest path of source node S from intermediate node N
Sum will not be being sent to intermediate node N from source node S then ensure that on intermediate node N, and finally want
The flow for reaching destination node D is forwarded again back to source node S, at this moment, can be using intermediate node N as from source node S to purpose
The routing of node D without cycle next-hop.
In embodiments herein based on without cycle next-hop establish a kind of distribution method of network flow, specifically,
All or part of flow of source node is sent to destination node (Egress node for as flowing out core net) by multilink,
To realize the shunting for reaching same destination node, to achieve the purpose that reduce maximum link utilization.Wherein described is a plurality of
Link includes the link formed with source node without cycle next-hop node by source node to destination node.
Further, on the basis of known network topological relation and traffic matrix, using linear programming model to network
The distribution of flow optimizes.Specifically,
Network topology G=<V,E,C,W>, wherein V={ 1,2 ..., | V | } is the set of node；E=1,2 ..., |
E | } be link set；C={ ceBe link bandwidth set, wherein ceIndicate the bandwidth of link e ∈ E；W={ weIt is link
The set of weight, wherein weIndicate the weight of link e ∈ E.
Traffic matrix { dij, wherein dijIt indicates from node i to the uninterrupted of node j.Linear programming model such as expression formula
(2) shown in：
In formula (2), V is the set of node, and E is the set of link, | E | it is the number of link
Formula (2-1) is the object function of linear programming model.In formula, α is maximum link utilization, gjkTo reach purpose section
Uninterrupted on the link k of point j, wherein j ∈ V, k ∈ E.Min indicates to obtain minimum value as linear programming using object function
The optimization aim of model.Further, δ is a sufficiently small constant, so it is min that object function is degenerated in a certain range
α, i.e., using maximum link utilization as the first optimization aim of linear programming model；gjkIt is link flow to be allocated, ckFor
The bandwidth of link k,What is indicated is average link utilization, further right after α obtains minimum valueIt optimizes, i.e., using average link utilization as the second optimization aim of linear programming model.
Formula (2-2), (2-3) and (2-4) is the constraints of linear programming model, wherein
In formula (2-2), what OUT (i) was indicated is that node i goes out to link set, what IN (i) was indicated be node i enter to
Link set.The formula is meant that, the flow of destination node j is flowed to from source node i, can reach purpose by several links
Node j.With in the shunting mode of multilink substitution OSPF/IS-IS networks in such a way that shortest path is forwarded, slow
While having solved the pressure of shortest path, non-shortest path is taken full advantage of, keeps the use of link more balanced.
In formula (2-3), what Ava (i, j) was indicated is node i arrival destination node j without cycle next-hop.If node i
Non- upgrade node (node being route using shortest path in i.e. existing OSPF/IS-IS networks), node i it is available
Next-hop is only the shortest path next-hop that node i reaches node j.If node i is upgrade node (i.e. in existing OSPF/
The node being route using the method for the embodiment of the present application in IS-IS networks), node i is that node i arrives using next-hop
Shortest path next-hop up to node j and other next-hops that will not cause cycle.
It should be noted that the method support section deployment of the embodiment of the present application, i.e., for an OSPF/IS-IS core
Arbitrary node in net, can a part be deployed as being route using existing shortest path, rest part is deployed as using
The embodiment of the present application is route without cycle next-hop.Further, corresponding to the not homologous address at the same node
Flow, can a part route using existing shortest path, rest part is using the embodiment of the present application without cycle
Next-hop is route.
Formula (2-3) has carried out further restriction to formula (2-2), is meant that, flows to destination node j's from source node i
In flow, it can only cannot pass through the link of not available next-hop formation by the link formed without cycle next-hop.It needs
It is noted that shortest path next-hop is also without cycle next-hop.So being removed without cycle into link in going out for source node i
The flow of the other chain roads for the link that next-hop is formed should be 0.Due to using without cycle next-hop node and source node shape
At link E-Packet, so forwarding when will not cause routing cycle.
In formula (2-4), α ceFor the maximum stream flow of link.The formula is meant that, flows to any link of destination node j
Flow be not more than link maximum stream flow, be further ensured that link will not there is a phenomenon where overload.
According to the linear programming model of expression formula (2), optimal solution can be acquired in the event expressed by multinomial, and
Optimal flow assignment does not have routing cycle.The minimum value that α is acquired according to the first optimization aim, is asked according to the second optimization aim
Obtain gjkMinimum value.Wherein, what the minimum value of α indicated is the minimum value of maximum link utilization, is to all links in network
Optimization, make the loads of all links all in the maximum stream flow of link below.gjkMinimum value indicate be reach purpose section
The optimal solution of the flow of the link k of point (i.e. Egress node) j, as link setting flow come to the flow in network into
Row distribution, makes the flow for the link k for flowing to destination node j close to the setting flow of the link.Specifically, when the link of distribution
Flow when being more than or less than the setting flow of the link, the difference of the flow of the link of the distribution and the setting flow of the link
Absolute value all should be sufficiently small, due to that can cause using the flow of an IP address as smallest allocation unit to distribute when distribution
The flow of link and the setting flow of the link differ surely absolutely equal, and such difference is allowed.
Next, for each destination node j and each link k, needs to select corresponding source address, make to pick out
Source address reach setting flow g of the flow as close possible to link of destination node jjk, thus embodiments herein also carry
Go out a kind of method for routing for realizing above-mentioned network flow distribution, as shown in Figure 1, the method for routing includes：
Step S110, destination node information corresponding with destination address is obtained according to the first mapping table.
Step S120, according to second mapping table of destination node information inquiry, the address block belonging to source address is obtained.
Step S130, the address block belonging to source address obtains next-hop node information, and will be opposite with source address
The flow answered is sent to next-hop node.
Fig. 2 is the first mapping table schematic diagram of the embodiment of the present application.It can be seen from the figure that the first mapping table includes purpose
The correspondence of address prefix and destination node (i.e. Egress node).The method for building up of first mapping table is to close network topology
System regards a core net as, finds out to need to go out to reach from which Egress node of core net for each purpose prefix addresses and be somebody's turn to do
Purpose prefix addresses, and this correspondence is recorded in the first mapping table.Such as purpose prefix addresses are 1.1.1.0/24
Destination node be N1.It should be noted that the destination node information in the first mapping table is actually an address pointer, refer to
To some memory headroom of SRAM, and the memory headroom stores information related with the destination node.Pass through address pointer reality
Existing chain between first mapping table and the second mapping table fetches the two-dimentional routing of progress.
Fig. 3 is the second mapping table schematic diagram of the embodiment of the present application.It can be seen from the figure that the second mapping table includes and mesh
The corresponding next-hop number of node and source address perception next-hop.Wherein, the next hop information that source address perceives is will
Multiple address blocks that source address space is divided, the number of address block is equal with next-hop number, such as purpose
The next-hop number of node is if there is K1It is a, then according to K1Source address space is subjected to piecemeal, is divided into K1The continuous address of block is empty
Between.
According to fig. 2 with Fig. 3 it is found that the specific routing procedure based on the first mapping table and the second mapping table is：
When router receives a message, the longest of the purpose IP address of the message is searched in the first mapping table first
With the Egress node (i.e. destination node) corresponding to prefix.Such as the purpose IP address of a message is 2.2.0.8, it is known that the IP
Address belongs to purpose prefix 2.2.0.0/16, tables look-up to obtain its egress to be N1.Obtained N1 is actually in one of SRAM
Deposit the address in space.The second mapping table of inquiry is next proceeded to, the outlet is stored in the internal storage location that address above mentioned N1 is directed toward
The blocking information of source address space corresponding to node.Further which block source address is the source address of the inquiry transmission message be located at
Space.Assuming that the source address of the message is located at v blocks (1≤v≤k, wherein k are the number of the multilink for E-Packeting)
The message is then forwarded by source address space with the next-hop corresponding to v block source address spaces.It should be noted that looking into
Look for this process of source address space that can realize that binary chop has the characteristics that be simple and efficient, right by binary chop
In k conversion link, lookup complexity is O (log2k)。
Further, address area root tuber is according to for forwarding the multilink of all or part of flow of source node to be drawn
Point, specific step is：
Step 1: choosing a link in multilink, wherein each of the links in multilink correspond to an address
Block.
Step 2: the corresponding flow of each source address that any address block is not added is added up one by one.
Step 3: when the setting flow of cumulative flow and the link close to selection, by the cumulative source of executed flow
Address corresponding with link block is added in address, and chooses a link return to step two again.
Table 1 is the specific example for carrying out piecemeal to source address space using above-mentioned division methods, detailed below according to table 1
Illustrate above steps：
The method that source address space is carried out piecemeal by table 1
As can be known from Table 1, the embodiment of the present application collects the five-tuple of flow by NetFlow first<Source address, purpose
Address, source port, destination interface, agreement>Information and corresponding uninterrupted information are (reference can be made to Fig. 5 (a), wherein protocol information
It is not shown).Flow Trace information can also be acquired by sFlow, and general router all supports this flow collection function.
Further, according to the topological relation of network, all nodes for reaching destination node j are ranked up.Specifically,
Reach the assignment of traffic { g of destination node jjk| k ∈ E and gjk＞ 0 } corresponding to link can form an acyclic oriented topology, it is right
Node under the topology is ranked up, and obtains sequence node n1,n2,…,n|V|.Next, choosing each node n respectivelyu, to every
Source address space at a node is divided.
Node n will be reacheduAnd the flow for going to destination node j is polymerize according to the IP address of source address space.At this
In example, the natural order according to IP address is ranked up, and obtains Z [IP1,IP2,…,IPn], wherein Z [IPi] indicate No. i-th
Source address IPiThe size of corresponding flow.
Two variables Ls ow and High are defined, for indicating the range of source address space.In no progress piecemeal, for
IPv4 source address spaces, Low=0.0.0.0, High=255.255.255.255；For IPv6 source address spaces, Low=0::
0, High=ffff:ffff:ffff:ffff:ffff:ffff:ffff:ffff.Next, in each node nuPlace is to each nothing
Recycle next-hop node and node nuIt is formed by link to be investigated, the investigation range is by k ∈ Out (nu)-{k|k∈Out
(nu)and gjk=0 } it is bound.
Deterministic process is, if first judge link k whether be without the last item link in cycle next-hop set, if
It is then all to be forwarded the flow of remaining source address in source address space by link k.It is followed if link k is not the nothing
The last item link in ring next-hop set, then judged according to the step in above-mentioned method of partition.If specifically, will
Node nuThe source address at place is IPpFlow be forwarded by link k, then at this time by total flow of link k be flow
Form acc=acc+Z [the IP of sump], that wherein acc is indicated is forwarding Z [IPp] pass through the sum of the link k flows forwarded before.
At this point, if flow and acc are more than optimal flow assignment gjk, then continue to judge that Z [IP are addedp] whether acc has more afterwards flow small
In being not added with Z [IPp] when less than gjkFlow, if it is, thinking Z [IPp] be forwarded by link k and can make the chain
Setting flow g of the flow of the distribution on road closer to linkjk, so being IP by source addresspFlow turned by link k
Hair, and the initial address of next piece of source address space is revised as IP accordinglyp.Conversely, if Z [IP are addedp] afterwards acc have more
Flow, which is more than or equal to, is not added with Z [IPp] when less than gjkFlow, then it is assumed that not by Z [IPp] be forwarded and can be made by link k
Its flow is obtained closer to gjk, so being IP by source addresspFlow pass through node nuOther links without cycle next-hop at place
It is forwarded, and the initial address of next piece of source address space is revised as IP accordinglyp-1。
It should be noted that in other embodiments of the application, the standard that piecemeal is carried out to source address space may be used also
Think acc-gjk<1/2[gjk-(acc-Z[IPp])] etc. other forms, can be chosen according to actual conditions, only need to meet
It is sent to the exhausted of the difference of each flow without each IP address at cycle next-hop node and with the link setting flow
It is sufficiently small to being worth, the link of distribution can be caused when due to distribution using the flow of an IP address as smallest allocation unit
Flow and the setting flow of the link differ surely absolutely equal, and such difference is allowed.
By source address space according to without cycle next-hop carry out piecemeal, make full use of in network topology without under cycle
One hop link carries out the shunting of flow, overcomes and is unable to fully asking using non-shortest path in existing domain in OSPF method for routing
Topic.The method for routing simply and efficiently realizes all standing of source address space, while meeting optimal assignment of traffic, improves
The utilization ratio of link.
Supplement is further needed exist for, in the network based on OSPF/IS-IS, router forwarding table (mapping table) passes through
Shortest path first is that each purpose prefix addresses calculate the shortest path next-hop up to the prefix addresses, and by routing table
It is stored in TCAM.The method for routing of the embodiment of the present application is based on two mapping tables and carries out two-dimentional routing, wherein the first mapping table
It is stored in TCAM, the second mapping table is stored in SRAM.Specifically, the first mapping table stored in TCAM, root are changed first
Correspondence is established according to the port information at network topology structure and each node.Due to the method for routing branch of the embodiment of the present application
Hold partial deployment, it is possible to which only the routing mapping table based on shortest path first carries out part modification to original.Second reflects
Firing table is established in sram, when the flow in network has greatly changed, convenient for carrying out real-time update to the second mapping table.
The two-dimentional method for routing based on first/second mapping table structure of the embodiment of the present application has good autgmentability.
When network flow changes, i.e., traffic matrix changes, only need to be according to the network flow distribution side of the embodiment of the present application
Method redistributes link flow, and is established and updated storage in SRAM according to the method for routing of the distribution of realization network flow
The second mapping table, without changing the first mapping table, so being more favorable for extending to adapt to the variation of network flow.
The two-dimentional method for routing based on first/second mapping table structure of the embodiment of the present application, which has, changes network flow
Quick responding ability.TCAM it is easy to operate, execute that speed is fast, but the update of TCAM simultaneously is also extremely complex, and updates
The speed of SRAM is quickly.So in embodiments herein, make to be not easy to the stabilization that newer TCAM keeps opposite,
When network flow changes, the second mapping table in SRAM is deposited in only update, moreover, because newer entry number is equal to core
The number of heart net node can quickly adapt to the variation of flow so update entry is considerably less.
Fig. 4 to Fig. 7 is a specific example of the method based on the embodiment of the present application, specifically below according to Fig. 4 to Fig. 7
It is bright to carry out assignment of traffic and the process of routing using the embodiment of the present application.
Fig. 4 is an exemplary core network topological structure schematic diagram.It can be seen from the figure that the network has 6 nodes,
Assuming that the bandwidth of each of the links is all 100, the weight of each of the links is all 1, then can extract following topology according to Fig. 4 closes
System：Node set V={ A, B, C, D, E, F }, link set E=(A, B), (B, C), (C, F), (A, D), (D, E), (D, F),
(E, F) }, link bandwidth set C={ cij=100 | i ∈ V, j ∈ V }, link weight set W={ wij=1 | i ∈ V, j ∈ V }.
Fig. 5 (a) is an exemplary flow information schematic diagram, and Fig. 5 (b) is an exemplary traffic matrix schematic diagram.In Fig. 5
(a) flow information of each message and corresponding source address are listed in.By these flow informations according to source node, purpose section
Point is polymerize, and traffic matrix figure { d can be obtainedij, as shown in Fig. 5 (b).From Fig. 5 (b) as can be seen that node A to node F
Total flow be 50, the total flow of node D to node F is 50, and the total flow of node C to node F is 20.Further analysis can
Know, if according to Shortest path routing, node A can reach node F via the path of A → D → F, so on link D → F
Flow will be 50+50, i.e., the link utilization of link (D, F) is up to 100% at this time.To ensure the efficient communication of network,
This maximum link utilization must be reduced.
Next according to Fig. 4 determine each node of the core network reach destination node F without cycle next-hop.Due to
The weight of each of the links is all 1, it is possible to acquire each node without cycle next-hop be respectively：Ava (A, F)={ D, B },
Ava (B, F)={ C, A }, Ava (C, F)={ F }, Ava (D, F)={ F, E }, Ava (E, F)={ F, D }, and be readily available B and
A is each other without cycle next-hop, and D and E are each other without cycle next-hop.The topology obtained by obtained above-mentioned relation and according to Fig. 4 is closed
It is, and the traffic matrix obtained according to Fig. 5 that the linear programming model for inputting the embodiment of the present application together carries out assignment of traffic.
By calling the optimal link flow under the obtained traffic matrix shown in Fig. 5 (b) of linear programming model
It is assigned as：gF,A→B=20；gF,B→C=20；gF,C→F=40；gF,A→D=30；gF,D→F=40；gF,D→E=40；gF,E→F=40.Its
His link, which reaches destination node F, does not have flow, it can be seen that maximum link utilization at this time substantially reduces.
It is respectively on router A when being forwarded using the method for the embodiment of the present application shown in Fig. 6 and Fig. 7 and router
The schematic diagram of first/second mapping table on D.In figure 6, the structure on the left side is the first mapping table, in this exemplary core net
In network, destination address has 9.9.9.1 and 9.9.9.2, their destination node is F.Structure on the right of Fig. 6 is the second mapping
Table, according to the analysis of front it is found that at node A, reach destination node F without there are two cycle next-hop nodes, respectively
Node D and node B, so in the second mapping table shown in Fig. 6, the next-hop number corresponding to destination node F is 2, is utilized
Source address space is divided into the continuous address block in two addresses by the method for partition in the embodiment of the present application.
It further can also be according to gF,A→B=20 and gF,A→D=30 pairs of piecemeal results are verified.According to Fig. 5 (a) and
Fig. 5 (b) is it is found that at node A, and the flow of source address 1.1.1.1 and 2.2.2.2 are forwarded by node D, then link A → D
Total flow be 30, the flow of source address 3.3.3.3 is forwarded by node B, then the total flow of link A → B be 20, meet
The result of optimal flow assignment.
The conclusion of Fig. 7 is similar with Fig. 6, repeats no more.Other nodes reach destination node F, and only there are one next-hops, herein
Also it repeats no more.
Traffic engineering method proposed by the present invention based on two dimension routing can not only optimize network flow distribution, also have
Good autgmentability is re-routed when network flow changes by the information quickly updated in SRAM, and
It is common to IPv4 and IPv6 networks and support section deployment.
Although disclosed herein embodiment it is as above, the content is only to facilitate understanding the present invention and adopting
Embodiment is not limited to the present invention.Any those skilled in the art to which this invention pertains are not departing from this
Under the premise of the disclosed spirit and scope of invention, any modification and change can be made in the implementing form and in details,
But the scope of patent protection of the present invention, still should be subject to the scope of the claims as defined in the appended claims.
Claims (5)
1. a kind of method for routing for realizing network flow distribution, including：
Destination node information corresponding with destination address is obtained according to the first mapping table；
According to second mapping table of destination node information inquiry, the address block belonging to source address is obtained；
Address block belonging to source address obtains next-hop node information, and flow corresponding with source address is sent to
Next-hop node；
Wherein, first mapping table includes the correspondence of destination address prefix and destination node；The second mapping table packet
The next-hop of next-hop number corresponding with destination node and source address perception is included, the next-hop of the source address perception is pair
The corresponding next-hop of multiple address blocks that source address space is divided, wherein described address block is according to for turning
The multilink of all or part of flow of originating node is divided；
Source address space is divided according to following steps to obtain the multiple address block：
Step 1: choosing a link in multilink, wherein each of the links in multilink correspond to an address area
Block；
Step 2: the corresponding flow of each source address that any address block is not added is added up one by one；
Step 3: when the setting flow of cumulative flow and the link close to selection, by the cumulative source address of executed flow
Address corresponding with link block is added, and chooses a link return to step two again.
2. method for routing according to claim 1, which is characterized in that first mapping table include destination address prefix and
Destination node information, wherein the destination node information is the corresponding with the destination node of direction second mapping table
The address of memory space.
3. method for routing according to claim 1 or 2, which is characterized in that first mapping table is stored in TCAM, institute
The second mapping table is stated to be stored in SRAM.
4. method for routing according to claim 1, which is characterized in that utilize the address area belonging to binary search source address
Block.
5. method for routing according to claim 1, which is characterized in that the next-hop node includes without cycle next-hop section
Point.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510076331.8A CN104601485B (en) | 2015-02-12 | 2015-02-12 | The distribution method of network flow and the method for routing for realizing network flow distribution |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510076331.8A CN104601485B (en) | 2015-02-12 | 2015-02-12 | The distribution method of network flow and the method for routing for realizing network flow distribution |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104601485A CN104601485A (en) | 2015-05-06 |
| CN104601485B true CN104601485B (en) | 2018-08-28 |
Family
ID=53127002
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510076331.8A Active CN104601485B (en) | 2015-02-12 | 2015-02-12 | The distribution method of network flow and the method for routing for realizing network flow distribution |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104601485B (en) |
Families Citing this family (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105763454B (en) * | 2016-02-25 | 2018-11-27 | 比威网络技术有限公司 | Data message forwarding method and device based on two-dimentional routing policy |
| CN108429699B (en) * | 2018-05-31 | 2021-12-07 | 首都师范大学 | Congestion avoidance mechanism and device based on two-dimensional routing |
| CN109587049B (en) * | 2018-12-05 | 2021-02-02 | 首都师范大学 | Two-dimensional routing-based external access flow control and rapid self-healing mechanism and device |
| CN110149247B (en) * | 2019-06-06 | 2021-04-16 | 北京神州绿盟信息安全科技股份有限公司 | Network state detection method and device |
| CN112804159A (en) * | 2019-11-14 | 2021-05-14 | 华为技术有限公司 | Flow distribution method and device |
| WO2021139286A1 (en) * | 2020-01-07 | 2021-07-15 | 华为技术有限公司 | Load sharing method, device, and network system |
| CN111314391B (en) * | 2020-03-31 | 2022-03-08 | 四川九强通信科技有限公司 | Block chain-based satellite network secure routing method |
| CN114050993B (en) * | 2021-09-26 | 2023-06-02 | 比威网络技术有限公司 | Access side-based active selection method and device for safe trusted paths |
| CN114363191B (en) * | 2021-12-24 | 2023-11-10 | 中国联合网络通信集团有限公司 | Route diffusion simulation method and device based on node and IP address |
| CN115277570B (en) * | 2022-07-26 | 2024-05-03 | 中国工商银行股份有限公司 | Traffic distribution method, traffic distribution device, computer equipment and storage medium |
| CN117527675A (en) * | 2022-07-27 | 2024-02-06 | 华为技术有限公司 | Path determination method and related equipment |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103780493A (en) * | 2014-01-20 | 2014-05-07 | 清华大学 | Method and system for data forwarding |
-
2015
- 2015-02-12 CN CN201510076331.8A patent/CN104601485B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103780493A (en) * | 2014-01-20 | 2014-05-07 | 清华大学 | Method and system for data forwarding |
Non-Patent Citations (1)
| Title |
|---|
| "CTE:Cost-Effective Intra-domain Traffic Engineering";Baobao Zhang等;《SIGCOMM’14》;20140822;第1-2页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104601485A (en) | 2015-05-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104601485B (en) | The distribution method of network flow and the method for routing for realizing network flow distribution | |
| CN108667734A (en) | It is a kind of that the through street with LSTM neural networks is learnt by decision making algorithm based on Q | |
| CN104335537B (en) | For the system and method for the multicast multipath of layer 2 transmission | |
| US9503360B2 (en) | Method and apparatus for traffic engineering in shortest path bridged networks | |
| CN102394819B (en) | Electoral method and device of appointed VLAN (virtual local area network) transmitter in TRILL network | |
| CN102150148A (en) | Differentiated services for unicast multicast frames in layer 2 topologies | |
| CN107294852B (en) | Network routing method using topology dispersed short path set | |
| CN105471747B (en) | A kind of intelligent router route selecting method and device | |
| KR102342723B1 (en) | Multi-homed network routing and forwarding method based on programmable network technology | |
| CN107370673A (en) | Method, controller and the system of forward-path are established in a kind of network | |
| JP2019122040A (en) | Network source reuse and routing mechanism defining multi-source by software | |
| CN102957589A (en) | Method, network node and system for service data transmission | |
| CN105591937A (en) | Network topology information acquisition method and device | |
| CN108965141A (en) | A kind of calculation method and device of Multi-path route tree | |
| CN113242179B (en) | SDN-based SR path calculation and label stack generation method and SDN controller | |
| CN106817299A (en) | The list item generation method and device and message forwarding method of software defined network | |
| CN106533733A (en) | CCN collaborative cache method and device based on network clustering and Hash routing | |
| CN106059941A (en) | Backbone network traffic scheduling method for eliminating link congestion | |
| CN105681438A (en) | Centralized caching decision strategy in content-centric networking | |
| CN105743804A (en) | Data flow control method and system | |
| CN103441930B (en) | A kind of MPLS TE packet forwards and management method and device | |
| Nazumudeen et al. | Performance Analysis of Dynamic Routing Protocols Using Packet Tracer | |
| Zhao et al. | Flow aggregation through dynamic routing overlaps in software defined networks | |
| CN110022263A (en) | A kind of method and relevant apparatus of data transmission | |
| Bagula | Hybrid routing in next generation IP networks |
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 |