CN108173764A - A kind of balancing link load multipath computational methods based on SDN network - Google Patents
A kind of balancing link load multipath computational methods based on SDN network Download PDFInfo
- Publication number
- CN108173764A CN108173764A CN201810184259.4A CN201810184259A CN108173764A CN 108173764 A CN108173764 A CN 108173764A CN 201810184259 A CN201810184259 A CN 201810184259A CN 108173764 A CN108173764 A CN 108173764A
- Authority
- CN
- China
- Prior art keywords
- node
- path
- shortest path
- weights
- record sheet
- 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.)
- Withdrawn
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/12—Avoiding congestion; Recovering from congestion
- H04L47/125—Avoiding congestion; Recovering from congestion by balancing the load, e.g. traffic engineering
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a kind of balancing link load multipath computational methods based on SDN network, first calculate the shortest path of any two node and the weights of each shortest path, breadth first search model is built again to calculate the comprehensive mobile cost in each path and shortest path, finally judge the shortest path obtained with the presence or absence of side overlapping and loop, if, it then returns and continues to calculate, otherwise, be added to the first record sheet.First record sheet has recorded source node to the several ways diameter of destination node, and there is no side overlapping and loop between each path, suitable for the balancing link load of arbitrary network topology, so as to improve the versatility of balancing link load and applicability.
Description
Technical field
The present invention relates to field of computer technology more particularly to a kind of balancing link load multipaths based on SDN network
Computational methods.
Background technology
Traditional distributed network, since the calculating of routing is respectively on different routers or interchanger respectively with oneself
The calculating of shortest path is carried out for root node, is usually all only to accomplish road of equal value it is difficult to accomplish the load balancing of network multilink
By the load balancing of (ECMP).And the appearance of SDN network so that control plane and forwarding surface phase separation, the control of the whole network concentrate on
In controller, the topology and link information of the whole network can be taken in controller, can easily calculate the chain of a plurality of routing
Road path, and load balancing is carried out with this.
But the existing balancing link load multipath calculating based on SDN network is all to be only applicable to specific network to open up
Structure is flutterred, for example the Leaf-Spine/Fat Tree topological structures of data center, lack versatility and adaptability.And for it
His network topology, K items reach the shortest path of destination node before multipath calculating can obtain, these paths are it is possible that can go out
It is now overlapped or has endless path, if the path to be used as to the link of load balancing, the presence of overlay links can lead to gathering around for link
Plug, effect are run counter to desire.
Invention content
The embodiment of the present invention proposes a kind of balancing link load multipath computational methods based on SDN network, realizes arbitrary
The calculating of a plurality of non-overlapping loop-free shortest path of topological network improves the versatility and applicability of balancing link load.
The embodiment of the present invention provides a kind of balancing link load multipath computational methods based on SDN network, including：
Step 1：Network topology structure is obtained, and according to network topology structure, calculated most short between any two node
Path and the weights of the shortest path；Wherein, network topology structure includes the connection path between each node and each connection
The weights in path；
Step 2：The shortest path of destination node to source node is added in the first record sheet；
Step 3：The source node is added in queue, and calculates the comprehensive mobile cost of the source node；Wherein, institute
Queue is stated for the mobile route that records several nodes and corresponding to several described nodes；The comprehensive movement of i-th of node
Cost by the source node according to the corresponding mobile route of i-th of node be moved to i-th of node weights and, in addition institute
Destination node is stated to obtain to the weights of the shortest path of i-th of node；Each node in the queue is according to described comprehensive
Mobile cost is closed to sort from small to large；I is integer；
Step 4：It is taken out from the queue and deletes the most preceding node that sorts as first node, and judge described first
Whether node is purpose node, if it is, performing step 5；If it is not, then calculate what is be connected directly with the first node
The comprehensive mobile cost of each second node and corresponding second mobile route, then perform step 6；Wherein, the second movement road
Diameter is added the second node by the first movement path of the first node and is obtained；
Step 5：Judge the first movement path and the path in first record sheet with the presence or absence of side it is Chong Die and
The first movement path is judged there are loop, if not being, the first movement path is added to first note
It records in table, return to step 4 reaches K until the number of paths recorded in first record sheet；Otherwise, return to step 4；The K
Value pre-set by user；
Step 6：Whether the second mobile route and the path in first record sheet for judging each second node respectively are deposited
It is overlapped on side and judges second mobile route there are loop, if not being, by the second node and described the
Two mobile routes are added in the queue, return again to step 4, otherwise, the second node are not added in the queue,
Return again to step 4.
Further, it is described according to the network topology structure, calculate shortest path between any two node and
The weights of the shortest path, specially：
According to the network topology structure, using Freud's algorithm, the shortest path between any two node is calculated
And the weights of the shortest path.
Implement the embodiment of the present invention, have the advantages that：
Balancing link load multipath computational methods provided in an embodiment of the present invention based on SDN network first calculate arbitrary
The shortest path of two nodes and the weights of each shortest path, then breadth first search model is built to calculate the comprehensive of each path
Mobile cost and shortest path are closed, the shortest path obtained is finally judged with the presence or absence of side overlapping and loop, if it is, returning
Continue to calculate, otherwise, be added to the first record sheet.First record sheet has recorded source node to the several ways of destination node
Diameter, and there is no side overlapping and loop between each path, suitable for the balancing link load of arbitrary network topology, so as to improve link
The versatility and applicability of load balancing.
Description of the drawings
Fig. 1 is that the present invention is to provide a kind of implementations of the balancing link load multipath computational methods based on SDN network
The flow diagram of example；
Fig. 2 is a kind of network topological diagram of embodiment provided by the invention；
Fig. 3 and Fig. 4 is a kind of schematic diagram of embodiment of path provided by the invention and weights.
Specific embodiment
Below in conjunction with the attached drawing in the embodiment of the present invention, the technical solution in the embodiment of the present invention is carried out clear, complete
Site preparation describes, it is clear that described embodiment is only part of the embodiment of the present invention, instead of all the embodiments.It is based on
Embodiment in the present invention, those of ordinary skill in the art are obtained every other without creative efforts
Embodiment shall fall within the protection scope of the present invention.
It is that a kind of flow of embodiment of the balancing link load multipath computational methods based on SDN network is shown referring to Fig. 1
It is intended to, this method includes the following steps：
Step 1：Network topology structure is obtained, and according to network topology structure, calculated most short between any two node
Path and the weights of shortest path；Wherein, network topology structure includes the connection path between each node and each link road
The weights of diameter.
In the present embodiment, step 1 is specially：According to the network topology structure, calculated using Freud (Floyd)
Method calculates the weights of the shortest path and the shortest path between any two node.Its algorithm idea is from arbitrary section
The shortest path of point i to arbitrary node j is nothing more than 2 kinds of possibility, and 1 is directly from i to j, and 2 be to pass through several nodes k to j from i.
So, it will be assumed that Dis (i, j) is distances of the node u to the shortest path of node v, and for each node k, we check
Dis(i,k)+Dis(k,j)<Whether Dis (i, j) is true, if set up, it was demonstrated that arrive j's to the path of j is more direct than i again from i to k
Path is short, we just set Dis (i, j)=Dis (i, k)+Dis (k, j), so, when we have traversed all node k,
What is recorded in Dis (i, j) is the distance of the shortest path of i to j.
The algorithm the specific steps are：
A, the adjacency matrix D of network is provided, enables D(-1)=D, element dij (-1), i, j are vertex.With the following formula into
Row initialization.
In order to facilitate understanding, the present invention provides a kind of network topological diagram of embodiment as shown in Figure 2, as shown in Fig. 2,
V0~V5 is the mark node of respective switch, and the line between node represents the link between interchanger, the number on line side
For link metric, weights be combine link remaining bandwidth size and remaining bandwidth account for total bandwidth proportion digitlization table
It states, weights are smaller, and to represent link communication cost smaller.And according to above-mentioned formula, initialization matrix D can be obtained(-1)Such as Fig. 3 institutes
Show.
B, in original route increase a new node, if generate new route than original route smaller, with new route value
Instead of the value of original route.It is sequentially generated n matrix (n is network node number) D in this way(0),D(1),D(2)…D(n-1)。
It is formulated and is exactly, for k=0,1,2,3... (n-1), k-th of matrix D(k)={ dij( k)}；
dij(k)=min { dij (k-1),dik (k-1)+dkj (k-1)}
K is since 0 in calculating process, and i, j then take time all values from 0 to n-1 respectively, and then k adds 1, until k is equal to n
When stop.Final network topology shown in Fig. 2, D(5)It is exactly the shortest path and their weights between arbitrary 2 nodes
With, in detail as shown in Figure 4.
Step 2：The shortest path of destination node to source node is added in the first record sheet.
In the present embodiment, the first record sheet has recorded source node to the several ways diameter of destination node, and each path
Between without overlapping side and loop, available for load balancing.The number of paths K of first record sheet record is pre-set by user, is
System or user can change the value of K according to actual needs, and K is integer.The result that step 1 is calculated is directly appended to by the present invention
In first record sheet, arithmetic speed can be improved.
Step 3：Source node is added in queue, and calculates the comprehensive mobile cost of source node；Wherein, queue is used to remember
Record several nodes and the mobile route corresponding to several nodes；The comprehensive mobile cost of i-th node by source node according to
The corresponding mobile route of i-th of node be moved to i-th of node weights and, in addition destination node is to the most short of i-th node
The weights in path and obtain；Each node in queue sorts from small to large according to comprehensive mobile cost；I is integer.
In the present embodiment, the comprehensive mobile cost F=G+H of i-th of node, wherein, G is represented from source node according to i-th
The mobile route of a node is moved to the mobile cost of i-th of node, i.e., source node be moved to i-th of node weights and.H tables
Show the weights that the estimated cost, i.e. destination node to the shortest path of i-th of node that are moved to destination node are saved from i-th,
It is exactly the weights for the shortest path that step 1 calculates.
In the present embodiment, each node in queue sorts from small to large according to the mobile cost of its synthesis, in order to most short
The extraction in path.
Step 4：It is taken out from queue and deletes the most preceding node that sorts as first node, and whether judge first node
For purpose node, if it is, performing step 5；If it is not, then calculate each second node being connected directly with first node
Comprehensive mobile cost and corresponding second mobile route, then perform step 6；Wherein, the second mobile route is by the of first node
One mobile route adds second node and obtains.
Step 5：Judge that first movement path and the path in the first record sheet are Chong Die and judge first with the presence or absence of side
Mobile route is there are loop, if not being, first movement path is added in the first record sheet, return to step 4 until
The number of paths recorded in first record sheet reaches K；Otherwise, return to step 4；The value of K is pre-set by user.
In the present embodiment, when judging side overlapping, side overlap problem is solved come high efficiency using hash algorithm.Such as first
Path in record sheet can be recorded in Hash tables, if detecting side in first movement path in Hash tables,
Illustrate that there are side overlappings.Otherwise, illustrate that there is no sides to be overlapped.
In the present embodiment, if the number of paths in the first record sheet does not reach K still, and when there is no node in queue,
Terminate to calculate.
In the present embodiment, it is main to judge in first movement path with the presence or absence of identical when judging whether loop
Node, if there is identical node, then there are loop, otherwise without loop.
Step 6：Judge that the path in the second mobile route and the first record sheet of each second node whether there is side respectively
It is overlapped and judges the second mobile route there are loop, if not being, second node and the second mobile route are added to
In queue, step 4 is returned again to, otherwise, second node is not added in queue, returns again to step 4.
In the present embodiment, before node is added to queue, side overlapping and the judgement of loop is first carried out, addition can be reduced
To the number of nodes of queue, calculating speed is improved.
In order to which technical solution of the present invention is better described, technical scheme of the present invention is exemplified below.As shown in Figure 2
Network topological diagram needs to ask preceding 3 shortest paths from interchanger V0 to V5, so-called shortest path in figure just to refer to what is be obtained
The sum of routine weight value minimum.If calculated using the prior art, shortest 3 paths can be obtained：Weights and be 70
{ V0, V2, V5 }, weights and be 75 { V0, V2, V4, V5 }, weights and be 90 { V0, V1, V5 }, wherein weights and be 70
Shortest path { V0, V2, V5 } and weights and for 75 second shortest path { V0, V2, V4, V5 } there are side V0V2 overlappings, be not appropriate for
As load balancing link.
And using technical solution of the present invention, first using Freud's algorithm, calculate the shortest path between any two node
The weights of diameter and the shortest path, in detail as described above.
After the completion of calculating, due to having obtained shortest path { V0, V2, V5 }, it is added in the first record sheet, and will
Source node V0 is added in first node set, calculates the F values of V0 and adds it in path.The F=70 of V0, G=0, H=
70, path：{V0}.
It since queue only has V0, is then taken out from queue and deletes V0, it is not destination node V5 to judge it, then calculating and V0
The comprehensive mobile cost of tri- nodes of V2, V1 and the V3 being connected directly and corresponding mobile route, according to result can obtain by
The mobile route { V0, V2 } of node V2 is overlapping there are side with the path of the first record sheet, then V2 is abandoned, V1 and V3 are added to
In queue.
At this moment it repeats the above steps, V1 is taken out and deleted from queue, V1 is not destination node V5, then calculates straight with V1
The comprehensive mobile cost and mobile route of tri- nodes of connected V5, V3 and V0 are connect, it, can according to result according to ascending sequence
To obtain node V0 is added to { V0, V2, the V2 } that is obtained behind the second path there are loops, then V0 abandoned, V5 and V3 are added
It is added in queue.
Shortest path { V0, V1, V5 } can be obtained by repeating above-mentioned steps, and the F values in the path are 90.Due to this example
K is 3, then continues to acquire third path { V0, V3, V2, V4, V5 }, F values are 125.As it can be seen that using technical solution of the present invention
Path that the shortest path obtained is obtained with the prior art simultaneously differs, and is applicable to the load balancing of arbitrary network topology.
In conclusion the balancing link load multipath computational methods provided in an embodiment of the present invention based on SDN network, first
The shortest path of any two node and the weights of each shortest path are calculated, then build breadth first search model to calculate respectively
The comprehensive mobile cost and shortest path in path, finally judge the shortest path obtained with the presence or absence of side overlapping and loop, if
It is then to return and continue to calculate, otherwise, be added to the first record sheet.First record sheet has recorded source node to destination node
Several ways diameter, and there is no side overlapping and loop between each path, suitable for the balancing link load of arbitrary network topology, from
And improve the versatility and applicability of balancing link load.
One of ordinary skill in the art will appreciate that realizing all or part of flow in above-described embodiment method, being can be with
Relevant hardware is instructed to complete by computer program, the program can be stored in a computer read/write memory medium
In, the program is when being executed, it may include such as the flow of the embodiment of above-mentioned each method.Wherein, the storage medium can be magnetic
Dish, CD, read-only memory (Read-Only Memory, ROM) or random access memory (Random Access
Memory, RAM) etc..
The above is the preferred embodiment of the present invention, it is noted that for those skilled in the art
For, various improvements and modifications may be made without departing from the principle of the present invention, these improvements and modifications are also considered as
Protection scope of the present invention.
Claims (2)
1. a kind of balancing link load multipath computational methods based on SDN network, which is characterized in that including：
Step 1：Network topology structure is obtained, and according to the network topology structure, calculated most short between any two node
Path and the weights of the shortest path；Wherein, the network topology structure include each node between connection path and
The weights of each connection path；
Step 2：The shortest path of destination node to source node is added in the first record sheet；
Step 3：The source node is added in queue, and calculates the comprehensive mobile cost of the source node；Wherein, the team
Arrange the mobile route for recording several nodes and corresponding to several described nodes；The comprehensive mobile cost of i-th of node
By the source node according to the corresponding mobile route of i-th of node be moved to i-th of node weights and, in addition the mesh
Node obtained to the weights of the shortest path of i-th of node；Each node in the queue is according to the comprehensive shifting
Dynamic cost sorts from small to large；I is integer；
Step 4：It is taken out from the queue and deletes the most preceding node that sorts as first node, and judge the first node
Whether it is purpose node, if it is, performing step 5；If it is not, then calculate each the be connected directly with the first node
The comprehensive mobile cost of two nodes and corresponding second mobile route, then perform step 6；Wherein, second mobile route by
It adds the second node and obtains in the first movement path of the first node；
Step 5：Judge the first movement path and the path in first record sheet with the presence or absence of side is Chong Die and judgement
The first movement path is there are loop, if not being, the first movement path is added to first record sheet
In, return to step 4 reaches K until the number of paths recorded in first record sheet；Otherwise, return to step 4；The value of the K
It is pre-set by user；
Step 6：The second mobile route and the path in first record sheet for judging each second node respectively whether there is side
It is overlapped and judges second mobile route there are loop, if not being, the second node and described second are moved
Dynamic path is added in the queue, returns again to step 4, otherwise, the second node is not added in the queue, then return
Return step 4.
2. the balancing link load multipath computational methods according to claim 1 based on SDN network, which is characterized in that
It is described according to the network topology structure, calculate the power of the shortest path and the shortest path between any two node
Value, specially：
According to the network topology structure, using Freud's algorithm, calculate shortest path between any two node and
The weights of the shortest path.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810184259.4A CN108173764A (en) | 2018-03-06 | 2018-03-06 | A kind of balancing link load multipath computational methods based on SDN network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810184259.4A CN108173764A (en) | 2018-03-06 | 2018-03-06 | A kind of balancing link load multipath computational methods based on SDN network |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108173764A true CN108173764A (en) | 2018-06-15 |
Family
ID=62511962
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810184259.4A Withdrawn CN108173764A (en) | 2018-03-06 | 2018-03-06 | A kind of balancing link load multipath computational methods based on SDN network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108173764A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109889447A (en) * | 2019-01-08 | 2019-06-14 | 北京全路通信信号研究设计院集团有限公司 | A kind of network transfer method and system based on mixing ring networking and fountain codes |
| CN112769697A (en) * | 2020-12-22 | 2021-05-07 | 广州技象科技有限公司 | Transmission path distribution method and device for multi-user access |
-
2018
- 2018-03-06 CN CN201810184259.4A patent/CN108173764A/en not_active Withdrawn
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109889447A (en) * | 2019-01-08 | 2019-06-14 | 北京全路通信信号研究设计院集团有限公司 | A kind of network transfer method and system based on mixing ring networking and fountain codes |
| CN109889447B (en) * | 2019-01-08 | 2021-02-19 | 北京全路通信信号研究设计院集团有限公司 | Network transmission method and system based on hybrid ring networking and fountain codes |
| CN112769697A (en) * | 2020-12-22 | 2021-05-07 | 广州技象科技有限公司 | Transmission path distribution method and device for multi-user access |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109039942B (en) | Network load balancing system and balancing method based on deep reinforcement learning | |
| Papadopoulos et al. | Network mapping by replaying hyperbolic growth | |
| CN101777990B (en) | Method for selecting multi-objective immune optimization multicast router path | |
| CN101465793B (en) | Method and device for obtaining shortest route between two points in network | |
| CN108040008B (en) | Cross-domain deployment method of online service function chain | |
| Hsiao et al. | Ant colony optimization for best path planning | |
| CN106936645B (en) | The optimization method of tree network topology structure based on queueing theory | |
| CN108965141A (en) | A kind of calculation method and device of Multi-path route tree | |
| CN102506886B (en) | Method for realizing path planning in navigation equipment | |
| CN106685745B (en) | A kind of constructing network topology method and device | |
| CN103281245A (en) | Method and device for determining routing path of service | |
| CN108173764A (en) | A kind of balancing link load multipath computational methods based on SDN network | |
| Wang et al. | Ant colony optimization for multicast routing | |
| CN106209618A (en) | A kind of communication mixed networking method and system improving intelligence adapted electric energy effect | |
| CN103078796B (en) | A kind of route computing method and equipment | |
| CN104239965B (en) | A kind of extensive road network bilayer method for routing divided based on overlap corporations | |
| CN108964746A (en) | The more topology search shortest route methods of time-varying satellite network | |
| CN106911574A (en) | Name data network multiple constraint routing algorithm based on population | |
| CN107241273B (en) | A kind of communications ring network structure setting method based on genetic algorithm | |
| CN108449266A (en) | A kind of balancing link load multipath computational methods based on SDN network | |
| CN110661704B (en) | Calculation method of forwarding path and SDN controller | |
| CN108462640A (en) | A kind of balancing link load multipath computational methods based on SDN network | |
| CN106982162A (en) | Methods, devices and systems for forwarding service stream | |
| CN111800339B (en) | Route optimization method with path number constraint in hybrid SDN scene | |
| Chen et al. | An efficient neural network-based next-hop selection strategy for multi-hop VANETs |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WW01 | Invention patent application withdrawn after publication | ||
| WW01 | Invention patent application withdrawn after publication |
Application publication date: 20180615 |