CN107070792A - A kind of route selection method based on SDN - Google Patents
A kind of route selection method based on SDN Download PDFInfo
- Publication number
- CN107070792A CN107070792A CN201710271228.8A CN201710271228A CN107070792A CN 107070792 A CN107070792 A CN 107070792A CN 201710271228 A CN201710271228 A CN 201710271228A CN 107070792 A CN107070792 A CN 107070792A
- Authority
- CN
- China
- Prior art keywords
- sdn
- network
- path
- route selection
- selection method
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/14—Routing performance; Theoretical aspects
-
- 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/02—Topology update or discovery
-
- 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
- H04L45/125—Shortest path evaluation based on throughput or bandwidth
-
- 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/38—Flow based routing
-
- 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/56—Routing software
-
- 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 present invention relates to a kind of route selection method based on SDN, using SDN controllers, comprise the following steps:The information data file of networking connection is collected, network node and network adjacency list are updated according to the information data read from information data file;Router-level topology and Route Selection are carried out using balance GSLB algorithm according to obtained network node and adjacency list;Obtained optimal path is preserved and file is write.The present invention can improve the stability of whole system and the optimization of Path selection, improve the utilization rate of overall link.
Description
Technical field
The present invention relates to network technique field, more particularly to a kind of route selection method based on SDN.
Background technology
All be in legacy network individual equipment manage, and keeper is invisible to many things occurred in network,
There is the equipment of many various different manufacturers inside network, it is difficult to there is a unified management platform, sometimes occur in that new
Business demand, the equipment component in network is modified, but many times even change an order all can not
Can, because equipment is exactly a flight data recorder for keeper.For network, forward-path is calculated by dynamic protocol
, keeper is very difficult to know which paths the message of some business has walked, it is also difficult to understand be where to be blocked, be
Be not with the presence of more excellent path, even if if so, also be difficult to quickly being gone in this service switching to more excellent path because
Path is not what keeper specified, but what agreement was calculated.Various complicated agreement is relate to inside network, also
It is that producer is privately owned to have some, and keeper is very difficult to all knowledge to get a thorough understanding of, when this also results in network and gone wrong
Keeper is difficult to position, and the automation service deployment based on network topology is not just known where to begin more.
These problems bring most directly influence is exactly when disposing new business in network, to be typically passed through very long
Time, so the new situations under traditional network architecture, have reached the limit of its ability, become the bottle of business development
Neck, in order to solve these problems in existing network, SDN be most be recognized at present, a kind of mode that influence power is maximum.Compared to biography
System network, it is to change the mode that legacy network is controlled data stream that SDN, which solves these the very corns of a subject,.In legacy network
In, message is forwarded to during purpose from source, and the forwarding behavior of message is one by one independent control, is independently configured, had
Oneself specific disposal ability and configuration mode, this control is fully distributed.
Based on above-mentioned analysis, using the advantage of SDN framework, it is to determine that route turns using a kind of routing algorithm of optimization
Hair path seems increasingly important.
The content of the invention
The technical problems to be solved by the invention are to provide a kind of route selection method based on SDN, it is possible to increase whole
The stability of system and the optimization of Path selection, improve the utilization rate of overall link.
The technical solution adopted for the present invention to solve the technical problems is:A kind of route selection method based on SDN is provided,
Using SDN controllers, comprise the following steps:
(1) information data file of networking connection is collected, is updated according to the information data read from information data file
Network node and network adjacency list;
(2) router-level topology and road are carried out using balance GSLB algorithm according to obtained network node and adjacency list
By selecting;
(3) obtained optimal path is preserved and writes file.
Information data file reads the stage by link information and abutted to update network node and network in the step (1)
Table.
Balance GSLB algorithm all stores for every a pair of source hosts and destination host in network in the step (2)
All possible set of paths between this two main frame, passes throughCalculate the path of each possible path
Weight, wherein, WpFor path weight value;For the average value of available bandwidth,For can
Bandwidth sum is used, n is the quantity of available bandwidth;σlinksBWFor the standard deviation of all link current available bandwidths in path, path
Weight WpUplink average available bandwidth in bigger expression path is higher.
Also include degree of balance monitoring step in the step (2), be specially:By testing and calculating dynamic load leveling threshold
Value and load balancing parameter, when load balancing parameter is more than dynamic load leveling threshold value, then triggering and the scheduling of operation state stream
Strategy, the minimum node of load is dispatched to by max-flow, and minimum stream is dispatched to the maximum node of load, loaded with balance nodes,
Realize that overall dynamics are balanced.
The SDN controllers outwards expose the API of oneself by RESTAPI form, and RESTAPI is by the API of program
General http GET/PUT form is encapsulated into, API operations can be completed by sending HTTP request.
Beneficial effect
As a result of above-mentioned technical scheme, the present invention compared with prior art, has the following advantages that and actively imitated
Really:Present invention may apply to any controller, the present invention is more than using greedy algorithm for single-hop, and B-GLB algorithms are one
The available bandwidth considered on whole piece path is planted, the algorithm of routing is carried out using path weight value, and monitored in routing process
System can be monitored in real time, it is to avoid network local congestion occur.The degree of balance of the present invention is calculated according to whole network topology
, it is the reference data of the present invention.The present invention is while Path selection speed is improved, it is ensured that whole network system
Stability and practicality.
Brief description of the drawings
Fig. 1 is the flow chart of the present invention;
Fig. 2 is B-GLB routing algorithm particular flow sheets.
Embodiment
With reference to specific embodiment, the present invention is expanded on further.It should be understood that these embodiments are merely to illustrate the present invention
Rather than limitation the scope of the present invention.In addition, it is to be understood that after the content of the invention lectured has been read, people in the art
Member can make various changes or modifications to the present invention, and these equivalent form of values equally fall within the application appended claims and limited
Scope.
Embodiments of the present invention are related to a kind of route selection method based on SDN, using SDN controllers, including following
Step:The information data file of networking connection is collected, network section is updated according to the information data read from information data file
Point and network adjacency list;Router-level topology is carried out using balance GSLB algorithm according to obtained network node and adjacency list
And Route Selection;Obtained optimal path is preserved and file is write.
The present invention uses B-GLB (balance GSLB) algorithm in the router-level topology stage.This algorithm can work as
It when data flow focuses on same path and forwarded, can be in real time monitored during routing forwarding, a degree of balance is set,
Once more than this degree of balance, forward-path can be changed at once, it is to avoid occur me and come congestion.
The SDN controllers used in present embodiment can be general purpose controller (including FlooddLight,
OpenDaylight, Ryu, POX/NOX etc.).The controller collects the link information and bandwidth of network element, is handed over according to OpenFlow
Information data of changing planes updates network node, network adjacency list, is that each host node calculates optimal path, finally according to calculating
The optimal path gone out issues corresponding flow table.SDN controllers can outwards be exposed the API of oneself by RESTAPI form,
The API of program is encapsulated into general http GET/PUT form by RESTAPI, need not thus pay close attention to program and realize carefully
Section, API operations can be completed by sending HTTP request.
As shown in figure 1, the overall flow block diagram of the present invention, including link information read stage 5, the and of router-level topology stage 6
Routing iinformation reservation phase 7.The calculating of optimal path, scheduling decision realize in application layer, using controller carry out equipment control,
Topology Management, flow table management and packet detection etc..Wherein, data message file 1 reads the stage 5 to update by link information
Network node and network adjacency list 2;According to obtained network node and adjacency list 2 using B-GLB algorithms 3 carry out router-level topology and
Route Selection 6, contains a real-time monitoring process 8 to the degree of balance in B-GLB algorithms, it is to avoid local gather around occurs for network
Plug.Finally enter routing iinformation reservation phase 7, preserve calculated optimal path, and write Output.txt files.
Specific B-GLB routing algorithms are as follows:B-GLB stores this for every a pair of source hosts and destination host in network
All possible set of paths between two main frames, calculates the path weight value of each possible path:
The average value of wherein available bandwidth is:
In formula, WpFor path weight value;For the average value of available bandwidth,
For available bandwidth sum, n is the quantity of available bandwidth;σlinksBWFor the standard deviation of all link current available bandwidths in path.
From above formula, available bandwidth average value is bigger, path weight value WpAlso bigger, path uplink averagely can use band
It is wide higher.σlinksBWIt is worth smaller, weight WpIt is bigger, therefore difference is smaller between the available bandwidth of each of the links on path, does not allow more
Easily cause congestion because bandwidth bottleneck occurs in certain link.
But above-mentioned steps can not also ensure system long-play load will not run-off the straight.Therefore the present invention is calculated herein
A degree of balance is set on the basis of method, with this continuous monitoring system, when monitoring system run-off the straight, max-flow is adjusted
Spend on the node of most lightly loaded, stream scheduling is carried out to the flow of interdependent node.Concrete mode is as follows:Set out by measuring and calculation
State load balancing threshold value Ω (i.e. maximum inclination) and load balancing parameter phi (t), load balancing parameter are bigger, each node it is negative
Load distribution is more uneven, and load balancing parameter is smaller, and the load difference of each node is smaller.As φ (t) > Ω, load is inclined
Tiltedly, by triggering, simultaneously operation state stream scheduling strategy is adjusted to loading into Mobile state, i.e., max-flow is dispatched into the minimum section of load
Point, minimum stream is dispatched to the maximum node of load, is loaded with balance nodes, realizes that overall dynamics are balanced.
Claims (5)
1. a kind of route selection method based on SDN, it is characterised in that use SDN controllers, comprise the following steps:
(1) information data file of networking connection is collected, network is updated according to the information data read from information data file
Node and network adjacency list;
(2) router-level topology and route choosing are carried out using balance GSLB algorithm according to obtained network node and adjacency list
Select;
(3) obtained optimal path is preserved and writes file.
2. the route selection method according to claim 1 based on SDN, it is characterised in that Information Number in the step (1)
Read the stage to update network node and network adjacency list by link information according to file.
3. the route selection method according to claim 1 based on SDN, it is characterised in that balance is complete in the step (2)
Office's load-balancing algorithm be in network every a pair of source hosts and destination host all store it is all possible between this two main frames
Set of paths, passes throughThe path weight value of each possible path is calculated, wherein, WpFor path weight value; For the average value of available bandwidth,For available bandwidth sum, n is available bandwidth
Quantity;σlinksBWFor the standard deviation of all link current available bandwidths in path, path weight value WpBigger expression path uplink is put down
Equal available bandwidth is higher.
4. the route selection method according to claim 1 based on SDN, it is characterised in that also include in the step (2)
Degree of balance monitoring step, be specially:By testing and calculating dynamic load leveling threshold value and load balancing parameter, work as load balancing
When parameter is more than dynamic load leveling threshold value, then triggering and operation state stream scheduling strategy, are dispatched to load minimum by max-flow
Node, minimum stream is dispatched to the maximum node of load, loaded with balance nodes, realizes that overall dynamics are balanced.
5. the route selection method according to claim 1 based on SDN, it is characterised in that the SDN controllers by oneself
API outwards exposed by RESTAPI form, the API of program is encapsulated into general http GET/PUT's by RESTAPI
Form, API operations can be completed by sending HTTP request.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201710271228.8A CN107070792A (en) | 2017-04-24 | 2017-04-24 | A kind of route selection method based on SDN |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201710271228.8A CN107070792A (en) | 2017-04-24 | 2017-04-24 | A kind of route selection method based on SDN |
Publications (1)
Publication Number | Publication Date |
---|---|
CN107070792A true CN107070792A (en) | 2017-08-18 |
Family
ID=59603479
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201710271228.8A Pending CN107070792A (en) | 2017-04-24 | 2017-04-24 | A kind of route selection method based on SDN |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN107070792A (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN112804712A (en) * | 2021-01-05 | 2021-05-14 | 山东电力工程咨询院有限公司 | Energy consumption balancing method and system in power communication network |
Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN103795805A (en) * | 2014-02-27 | 2014-05-14 | 中国科学技术大学苏州研究院 | Distributed server load balancing method based on SDN |
CN105516312A (en) * | 2015-12-09 | 2016-04-20 | 重庆邮电大学 | Software defined networking load balancingdevice and method |
CN105634974A (en) * | 2015-12-31 | 2016-06-01 | 杭州华为数字技术有限公司 | Route determining method and apparatus in software-defined networking |
CN106411733A (en) * | 2016-09-08 | 2017-02-15 | 重庆邮电大学 | SDN dynamic load balanced scheduling method based on real-time load of link |
US20170070434A1 (en) * | 2012-04-27 | 2017-03-09 | Level 3 Communications, Llc | Load balancing of network communications |
-
2017
- 2017-04-24 CN CN201710271228.8A patent/CN107070792A/en active Pending
Patent Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20170070434A1 (en) * | 2012-04-27 | 2017-03-09 | Level 3 Communications, Llc | Load balancing of network communications |
CN103795805A (en) * | 2014-02-27 | 2014-05-14 | 中国科学技术大学苏州研究院 | Distributed server load balancing method based on SDN |
CN105516312A (en) * | 2015-12-09 | 2016-04-20 | 重庆邮电大学 | Software defined networking load balancingdevice and method |
CN105634974A (en) * | 2015-12-31 | 2016-06-01 | 杭州华为数字技术有限公司 | Route determining method and apparatus in software-defined networking |
CN106411733A (en) * | 2016-09-08 | 2017-02-15 | 重庆邮电大学 | SDN dynamic load balanced scheduling method based on real-time load of link |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN112804712A (en) * | 2021-01-05 | 2021-05-14 | 山东电力工程咨询院有限公司 | Energy consumption balancing method and system in power communication network |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN108600102B (en) | Flexible data transmission system based on intelligent cooperative network | |
US10642739B2 (en) | Distributed coordination of caching and processing by networking devices | |
Manzoor et al. | Performance analysis and route optimization: redistribution between EIGRP, OSPF & BGP routing protocols | |
Wu et al. | Towards distributed SDN: Mobility management and flow scheduling in software defined urban IoT | |
Sun et al. | A QoS-guaranteed intelligent routing mechanism in software-defined networks | |
WO2012060316A1 (en) | Communication system, control device, method for controlling packet transfer path, and program | |
Bi et al. | Intelligent quality of service aware traffic forwarding for software-defined networking/open shortest path first hybrid industrial internet | |
CN103685054A (en) | Multipath load balancing method based on service awareness | |
Wang et al. | Implementation of multipath network virtualization with SDN and NFV | |
CN106209669A (en) | Towards SDN data center network maximum of probability path stream scheduling method and device | |
CN111327525B (en) | Network routing method and device based on segmented routing | |
JP5943431B2 (en) | Network, data transfer node, communication method and program | |
CN106209615B (en) | A kind of Dynamic Route Control method and system calculating forward-path based on SPFA algorithm | |
Lin et al. | DTE-SDN: A dynamic traffic engineering engine for delay-sensitive transfer | |
Lin et al. | Jointly optimized QoS-aware virtualization and routing in software defined networks | |
Oddi et al. | A decentralized load balancing algorithm for heterogeneous wireless access networks | |
Tomovic et al. | Toward a scalable, robust, and QoS-aware virtual-link provisioning in SDN-based ISP networks | |
CN109889444A (en) | A kind of methods, devices and systems of planning path | |
Ren et al. | A sdn-based dynamic traffic scheduling algorithm | |
CN104994019B (en) | A kind of horizontal direction interface system for SDN controllers | |
Josbert et al. | Solution for industrial networks: Resilience-based sdn technology | |
JP2006245874A (en) | Communication path computation system and communication path computation method using partial measurement in overlay network, and program therefor | |
Vdovin et al. | Network utilization optimizer for SD-WAN | |
CN104917677A (en) | Data stream forwarding control method and system | |
Khoobbakht et al. | Hybrid flow-rule placement method of proactive and reactive in SDNs |
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 | ||
RJ01 | Rejection of invention patent application after publication |
Application publication date: 20170818 |
|
RJ01 | Rejection of invention patent application after publication |