CN107135158A - Optimal route selection method in a kind of multi-path transmission - Google Patents
Optimal route selection method in a kind of multi-path transmission Download PDFInfo
- Publication number
- CN107135158A CN107135158A CN201710560005.3A CN201710560005A CN107135158A CN 107135158 A CN107135158 A CN 107135158A CN 201710560005 A CN201710560005 A CN 201710560005A CN 107135158 A CN107135158 A CN 107135158A
- Authority
- CN
- China
- Prior art keywords
- path
- link
- information
- paths
- interchanger
- 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/12—Shortest path evaluation
- H04L45/124—Shortest path evaluation using a combination of metrics
-
- 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/121—Shortest path evaluation by minimising delays
-
- 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
- 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 discloses optimal route selection method in a kind of multi-path transmission, in SDN transmission, RYU controllers obtain network topology and calculate the path set between the whole network node pair first, then bottom converting flow situation is periodically obtained, the whole network resource view is updated simultaneously, certain moment data flow is arrived, and obtains the Top K paths collection of source mesh inter-exchange according to its source mesh IP and path is evaluated, and is finally selected the best path of path evaluation and is issued in interchanger on the way.Using the inventive method so that Internet resources are optimised, the utilization rate of Internet resources is improved.
Description
Technical field
The invention belongs to SDN link load balancing association areas, more particularly to optimal path in a kind of multi-path transmission
System of selection.
Background technology
In recent years, the fast development of cloud service, the data center for carrying a large amount of cloud computing services is widely used
And deployment, propose high requirement for the framework and performance of data center network.In the data center network of high connectivity
In (DataCenter Networks, DCN), one-to-one and many-many communication is usually carried out between server.It is efficient to utilize service
Mulitpath between device can improve the communication efficiency and reliability of data center network, and under existing technical conditions, for
The utilization ratio of multipath is relatively low, and network load is unbalanced, and Internet resources can not be utilized efficiently, and data communication tends to occur gather around
Plug, causes network performance to decline.
SDN technologies based on OpenFlow, control forwarding separation, global centralized Control is Network Load Balance, lifting net
Network QoS provides a kind of new solution.And SDN technologies are applied in data center network, set up data center network
Global Resource Picture, for the different business of network, can rationally, efficiently, balancedly distribute Internet resources, optimization transmission road
Footpath, it is to avoid congestion, equally loaded lifts data exchange efficiency.
The content of the invention
The technical problem to be solved in the present invention is：Optimal route selection method in a kind of multi-path transmission is provided, according to reality
When the whole network resource view, dynamic select optimal path makes data be on network optimum path and transmits, can rationally, efficiently, it is equal
Weighing apparatus ground distribution Internet resources, optimize transmission path, it is to avoid congestion, and equally loaded lifts data exchange efficiency.
To solve the above problems, the present invention is adopted the following technical scheme that：
Optimal route selection method in a kind of multi-path transmission is flat in the routing algorithm based on RYU and transmission mechanism emulation
Realize and apply in platform, Mininet, RYU, Iperf common cooperation completes the Realization of Simulation of routing algorithm and transmission mechanism.
Set up first by Mininet in network topology, controller and run APP files to start RYU controllers, periodically through RYU's
API gets the topology information of the whole network, centralized processing and storage, data flow is produced using Iperf simulations, according to data flow
Source mesh IP, calls routing algorithm to calculate a plurality of forward-path between a pair of nodes, network optimum is selected by evaluation function
Optimal path, is finally issued in interchanger on the way by path.
To achieve the above object, the present invention is adopted the following technical scheme that：
Optimal route selection method in a kind of multi-path transmission, comprises the following steps：
Step 1：RYU controllers obtain relevant network topology information, and the network topological information is included；switch_list、
Link_list, switch_port_table, link_to_port, interior_ports, access_ports and it is based on
The network topology adjacency matrix of hop count；
Step 2, according to adjacency matrix, call the shortest_simple_paths algorithms in NetworkX instruments to be based on
Hop count calculates the K paths between any pair of node in network topology, is stored in the path set of dictionary format；
Step 3, RYU controllers issue packet-out message to interchanger by periodicity, get interchanger middle-end
Mouth flow information and flow table flow information；
Step 4, flow to when one and, according to source mesh IP, inquiry whether there is relevant information in access_ports, if
In the presence of can then obtain its source mesh interchanger；If being not present, with reference to access_ports and ARP protocol, recording-related information is arrived
In access_table, while obtaining interchanger and its connectivity port that the main frame is affiliated to；The source mesh interchanger that foundation is obtained, from
The Top-K path sets of source mesh interchanger are read in the path set calculated before；
Step 5, to TOP-K paths quality evaluate；
Step 6：After to TOP-K path evaluations, evaluation M highests path is selected as optimal road according to its evaluation
Footpath, and the optimal path is issued in interchanger on the way.
Preferably, step 1 includes：
Step 1.1：The exchanger information and link connection that RYU controllers get datum plane by LLDP agreements are believed
Breath；
Step 1.2：By calling the api interface of RYU controllers to read exchanger information switch_list and link connection
Information link_list；
Step 1.3：It can be obtained by analytical integration exchanger information switch_list and link connection information link_list
Go out following information：
1)switch_port_table：The port corresponding table that all interchangers are included with it in network；
2)link_to_port：In network in any one link source mesh interchanger and source eye end mouthful corresponding table；
3)interior_ports：The port pair that the interchanger that satisfaction in network is only connected with interchanger is included with it
Answer table；
4)access_ports：The port corresponding table that the interchanger that satisfaction in network is connected with main frame is included with it；
Step 1.4：Network topology adjacency matrix based on hop count is built according to link_to_port and switch_list.
Preferably, step 3 also includes：The flow information got is carried out at statistical analysis, each of the links inbound port
Flow information be denoted as the link flow information, and the flow information of each link is stored in adjacency matrix, while the cycle
Property update adjacency matrix information for formulate routing policy when refer to.
Preferably, step 5：Top-K paths are evaluated, following steps are specifically included：
Step 5.1：Each paths read relevant information in Top-K paths
In each paths, read it and constitute the available bandwidth information of link and calculate the hop count in the path；
Step 5.2：Calculate link available bandwidth balance degree BBD
In one path, the available bandwidth information of its each link is read, a paths link available bandwidth is calculated
Maximum and minimum value, and calculate its ratio according to formula, the link available bandwidth balance degree in a paths can be drawn
BBD,
BBD=Min (esd)/Max(esd)；
Wherein, esdRepresent the set of node s each link available bandwidths into node d path
Step 5.3：Calculate path delay of time influence degree PD
In one path, its route jumping figure is calculated to estimate its path delay of time；Calculated using equation below：
PD=2/N
Wherein, N represents the nodes that node s passes through into node d path
Step 5.4：Calculate path average link available bandwidth most goodness LBW
In Top-K paths, the average link available bandwidth of each paths is calculated, its maximum, comprehensive Ge Tiao roads is drawn
The path average link available bandwidth most goodness LBW in footpath is as follows：
Wherein,Represent the set of each link available bandwidth in node s to node d nth bar path；Expression is evaluated
The set of each link available bandwidth in path.
Step 5.5：It is good and bad that path is evaluated in comprehensive each several part influence
The aspect of selection gist 3 of optimal path in multi-path transmission, in conjunction with the additive model in statistics reciprocation
Each several part is combined, equation below is obtained：
M=a*BBD+b*PD+c*LBW
Wherein, a represents influence of the link available bandwidth balance degree to optimal route selection, and b represents the path delay of time
Influence to optimal route selection, c represents influence of the link available bandwidth size to optimal route selection.
The inventive method feasibility is high, highly reliable, and according to real-time the whole network resource view, dynamic select optimal path makes
Data are on network optimum path and transmitted, can rationally, efficiently, balancedly distribute Internet resources, optimization transmission path, it is to avoid
Congestion, equally loaded lifts data exchange efficiency.
Brief description of the drawings
Fig. 1 is network topological diagram；
Fig. 2 is exchanger information (switch_list) and link connection information (link_list)；
Fig. 3 is switch_port_table tables；
Fig. 4 is link_to_port tables；
Fig. 5 is interior_ports tables；
Fig. 6 is access_ports tables；
Fig. 7 is the network topological diagram based on hop count；
Fig. 8 is the hop collection based on hop count；
Fig. 9 is the relevant information of flow table flow；
Figure 10 is the access_table tables of first stream；
Figure 11 is the Top-K path sets of first stream source mesh interchanger；
Figure 12 is the path set evaluation table of first stream；
Figure 13 is first stream optimal route selection and issued；
Figure 14 is the access_table tables of Article 2 stream；
Figure 15 is the Top-K path sets of Article 2 stream source mesh interchanger；
Figure 16 is the path set evaluation table of Article 2 stream；
Figure 17 is Article 2 stream optimal route selection and issued；
Figure 18 is the implementing procedure figure of this method.
Embodiment
The present invention will be further described for 1-13 and embodiment below in conjunction with the accompanying drawings：
The present invention provides optimal route selection method in a kind of multi-path transmission, comprises the following steps：
Step 1：RYU controllers obtain relevant network topology information
Step 1.1：The exchanger information and link connection that RYU controllers get datum plane by LLDP agreements are believed
Breath.
Step 1.2：By calling, the api interface of RYU controllers reads exchanger information (switch_list) and link connects
Connect information (link_list).
Step 1.3：Pass through analytical integration exchanger information (switch_list) and link connection information (link_list)
Following information can be drawn：
5)switch_port_table：The port corresponding table (as shown in table 1) that all interchangers are included with it in network
Table 1：
6)link_to_port：In network in any one link source mesh interchanger and source eye end mouthful corresponding table (such as table 2
It is shown)
Table 2：
7)interior_ports：The port pair that the interchanger that satisfaction in network is only connected with interchanger is included with it
Answer table (structure is similar with table 1)
8)access_ports：The port corresponding table that the interchanger that satisfaction in network is connected with main frame is included with it
(structure is similar with table 1)
Step 1.4：Network topology adjacency matrix based on hop count is built according to link_to_port and switch_list
(as shown in table 3)
Table 3：
Note：0 represents that itself is connected, and 1 represents different inter-exchange connections, and Inf represents connectionless
Step 2：According to adjacency matrix, the shortest_simple_paths algorithms in NetworkX instruments are called to be based on
The K paths (specifying K=5 here) that hop count calculates in network topology between any pair of node are stored in the path of dictionary format
Concentrate, it is as shown in table 5 below.
Table 5：
| Source mesh node pair | Path 1 | Path 2 | … | Path K |
| (s1,s5) | [s1,…,s5] | [s1,…,s5] | … | [s1,…,s5] |
| (s3,s8) | [s3,…,s8] | [s3,…,s8] | … | [s3,…,s8] |
| … | … | … | … | … |
Step 3：Periodically obtain bottom converting flow situation；
Step 3.1：RYU controllers issue packet-out message to interchanger by periodicity, get in interchanger
Port flow information and flow table flow information.
Step 3.2：The flow information that the flow information got is carried out at statistical analysis, each of the links inbound port is denoted as
The link flow information, and the flow information of each link is stored in adjacency matrix, while periodically updating adjacency matrix
Information for formulate routing policy when refer to.
Note：Non-zero numeral represents link flow in table, but is not actual size.
Step 4：The Top-K path sets of reading source mesh interchanger
Step 4.1：Flow to and when one, according to source mesh IP, inquire about and whether deposit in access_ports as shown in table 4
In relevant information, if its source mesh interchanger can be obtained in the presence of if；If being not present, with reference to access_ports and ARP protocol, note
Relevant information is recorded into access_table, including obtains IP the and MAC information of main frame, while obtaining the exchange that the main frame is affiliated to
Machine and its connectivity port.
Table 4：
Step 4.2：According to the source mesh interchanger obtained, K=5 paths is read from the path set calculated before
Step 5：K=5 paths (being denoted as Top-K paths) are evaluated
Step 5.1：Each paths read relevant information in Top-K paths
In each paths, read it and constitute the available bandwidth information of link and calculate the hop count in the path.
Step 5.2：Calculate link available bandwidth balance degree BBD (Bandwidth Balancing Degree)
In one path, the available bandwidth information of its each link is read, a paths link available bandwidth is calculated
Maximum and minimum value, and calculate its ratio according to formula, the link available bandwidth balance degree in a paths can be drawn
BBD。
BBD=Min (esd)/Max(esd)
Wherein, esdThe set of node s each link available bandwidths into node d path is represented,
In one path, link is weighed by evaluating the ratio of path link available bandwidth minimum value and maximum
Available bandwidth equilibrium degree；The minimum value of link available bandwidth is with maximum closer to band can be used by then illustrating each bar link in path
It is wide more balanced；Simultaneously because it is 0-1 that its minimum value, which must be not more than its maximum, i.e. BBD scopes, optimally, most
Small value is equal to maximum, then BBD is 1, and in the worst case, minimum value differs greatly with maximum, then BBD is intended to 0.
Step 5.3：Calculate path delay of time influence size PD (Path Delay)
In one path, its route jumping figure is calculated to estimate its path delay of time；Calculated using equation below：
PD=2/N
Wherein, N represents the nodes that node s passes through into node d path,
Because the path delay of time and route jumping figure are in inverse correlation, therefore weigh the path delay of time for Path selection using 2/N
Influence, simultaneously because the different inter-host communications being connected on same interchanger be do not need Path selection, so path
Hop count must be not less than 2, and the ratio that the method is calculated is limited between 0-1.
Step 5.4：Calculate path average link available bandwidth most goodness LBW (Link Bandwidth)
In Top-K paths, the average link available bandwidth of each paths is calculated, its maximum, comprehensive Ge Tiao roads is drawn
The path average link available bandwidth most goodness LBW calculation formula in footpath are as follows：
Wherein,Represent the set of each link available bandwidth in node s to node d nth bar path；Expression is commented
The set of each link available bandwidth in cost path；
There is average link in mulitpath, path average link available bandwidth and multipath between a pair of server nodes
Available bandwidth the maximum is contrasted, and the bigger average link bandwidth for illustrating the path of ratio average link in multipath can use
Bandwidth it is optimal.
Step 5.5：It is good and bad that path is evaluated in comprehensive each several part influence
The aspect of selection gist 3 of optimal path in multi-path transmission, because each several part influence size computational methods are satisfied the need
Footpath selection is in positive interaction, and each several part is combined in conjunction with the additive model in statistics reciprocation, equation below is obtained：
M=a*BBD+b*LBW+c*PD
Wherein, a represents influence of the link available bandwidth balance degree to optimal route selection, and b represents the path delay of time
Influence to optimal route selection, c represents influence of the link available bandwidth size to optimal route selection.
Step 6：Optimal path is selected with reference to each path evaluation
After to TOP-K path evaluations, evaluation M highests path is selected as optimal path according to its evaluation, and
The optimal path is issued in interchanger on the way.
An emulation platform for having applied this routing algorithm is run below, and the operation of the routing algorithm is reappeared by emulating
Mechanism and effect.
Step 1：K=2 Fat-tree network topologies are set up using Mininet, network topology is as shown in Figure 1.
It is seen in fig. 1, that there is a plurality of forward-path between a pair of nodes, such as it is a plurality of from existing node E7 to node E9
Path, forward-path from H1 to H5 and forward-path from H2 to H6 not necessarily, can be in two between node E7 to node E9
Bar difference is forwarded simultaneously on path.
Step 2：Run RYU controllers.
Step 3：By calling the api interface of RYU controllers to read exchanger information (switch_list) and link connection
Information (link_list), as shown in Figure 2.
Step 4：By analytical integration exchanger information and link connection information can obtain switch_port_table tables,
Link_to_port tables, interior_ports tables, access_ports tables, as shown in Fig. 3-Fig. 9.
Step 5：The network topological diagram based on hop count and display are set up in RYU controllers, as shown in the figure.
Step 6：The path set based on hop count is shown in RYU controller running logs, as shown in Figure 9
Step 7：Flow table flow indication
Figure 10 is the relevant information of switch ports themselves flow.Datapath is interchanger number, under port is the interchanger
Certain Single port, rx-pkts, rx-bytes, rx-error represent the number-of-packet that the port is received under the interchanger, byte respectively
Number, error byte；Tx-pkts, tx-bytes, tx-error represent respectively the number-of-packet that the port under the interchanger sends,
Byte number, erroneous words joint number；Port-speed represents port speed, and current-capacity represents port capacity, port-
Stat, link-stat represent that port and link are used.
Step:8：Data flow the first data stream is produced using Iperf.
Step 9：Acquisition source mesh IP, inquiry access_table tables (Figure 10) obtain source mesh interchanger, read source mesh and exchange
Top-K path sets between machine, as shown in figure 11.
Step 10：Top-K paths are evaluated, each evaluation index parameter is as shown in figure 12
Step 11：The best path of selection path evaluation is simultaneously issued, as shown in figure 13.
Step:12：Data flow Article 2 data flow is produced using Iperf.
Step 13：Acquisition source mesh IP, inquiry access_table tables (Figure 14) obtain source mesh interchanger, read source mesh and exchange
Top-K path sets between machine, as shown in figure 15.
Step 14：Top-K paths are evaluated, each evaluation index parameter is as shown in figure 16, here compared to first
Data stream, each evaluation index parameter differences of every alternative path are obvious.
Step 15：The best path of selection path evaluation is simultaneously issued, as shown in figure 17.
By above-mentioned emulation experiment, optimal route selection method in a kind of multi-path transmission is realized, including acquisition
Path set between network topology and relevant information, calculate node, read source mesh node Top-K path sets, to path set evaluation, selection
Optimal path is simultaneously issued；Heretofore described details is realized, it is ensured that the load balancing of network.
Claims (4)
1. optimal route selection method in a kind of multi-path transmission, it is characterised in that comprise the following steps：
Step 1：RYU controllers obtain relevant network topology information, and the network topological information is included；switch_list、
Link_list, switch_port_table, link_to_port, interior_ports, access_ports and it is based on
The network topology adjacency matrix of hop count；
Step 2, according to adjacency matrix, call the shortest_simple_paths algorithms in NetworkX instruments to be based on hop count
The K paths between any pair of node in network topology are calculated, are stored in the path set of dictionary format；
Step 3, RYU controllers issue packet-out message to interchanger by periodicity, get interchanger middle port stream
Measure information and flow table flow information；
Step 4, flow to when one and, according to source mesh IP, inquiry whether there is relevant information in access_ports, if in the presence of
Its source mesh interchanger can then be obtained；If being not present, with reference to access_ports and ARP protocol, recording-related information is arrived
In access_table, while obtaining interchanger and its connectivity port that the main frame is affiliated to；The source mesh interchanger that foundation is obtained, from
The Top-K path sets of source mesh interchanger are read in the path set calculated before；
Step 5, to TOP-K paths quality evaluate；
Step 6：After to TOP-K path evaluations, evaluation M highests path is selected as optimal path according to its evaluation,
And the optimal path is issued in interchanger on the way.
2. optimal route selection method in multi-path transmission as claimed in claim 1, step 1 includes：
Step 1.1：RYU controllers get the exchanger information and link connection information of datum plane by LLDP agreements；
Step 1.2：By calling the api interface of RYU controllers to read exchanger information switch_list and link connection information
link_list；
Step 1.3：By analytical integration exchanger information switch_list and link connection information link_list can draw with
Lower information：
1)switch_port_table：The port corresponding table that all interchangers are included with it in network；
2)link_to_port：In network in any one link source mesh interchanger and source eye end mouthful corresponding table；
3)interior_ports：Meeting in network is only corresponding with the interchanger that interchanger is connected and port that it is included
Table；
4)access_ports：The port corresponding table that the interchanger that satisfaction in network is connected with main frame is included with it；
Step 1.4：Network topology adjacency matrix based on hop count is built according to link_to_port and switch_list.
3. optimal route selection method in multi-path transmission as claimed in claim 1, step 3 also includes：By the stream got
Measure information and carry out statistical analysis, the flow information at each of the links inbound port is denoted as the link flow information, and by each link
Flow information be stored in adjacency matrix, while periodically update the information of adjacency matrix for formulate routing policy when join
Examine.
4. optimal route selection method, step 5 in multi-path transmission as claimed in claim 1：Top-K paths are commented
Valency, specifically includes following steps：
Step 5.1：Each paths read relevant information in Top-K paths
In each paths, read it and constitute the available bandwidth information of link and calculate the hop count in the path；
Step 5.2：Calculate link available bandwidth balance degree BBD
In one path, the available bandwidth information of its each link is read, a paths link available bandwidth is calculated most
Big value and minimum value, and its ratio is calculated according to formula, the link available bandwidth balance degree BBD in a paths can be drawn,
BBD=Min (esd)/Max(esd)；
Wherein, esdRepresent the set of node s each link available bandwidths into node d path
Step 5.3：Calculate path delay of time influence degree PD
In one path, its route jumping figure is calculated to estimate its path delay of time；Calculated using equation below：
PD=2/N
Wherein, N represents the nodes that node s passes through into node d path；
Step 5.4：Calculate path average link available bandwidth most goodness LBW
In Top-K paths, the average link available bandwidth of each paths is calculated, its maximum is drawn, comprehensive each paths
Path average link available bandwidth most goodness LBW is as follows：
<mrow>
<mi>L</mi>
<mi>B</mi>
<mi>W</mi>
<mo>=</mo>
<mi>E</mi>
<mrow>
<mo>(</mo>
<msubsup>
<mi>e</mi>
<mrow>
<mi>s</mi>
<mi>d</mi>
</mrow>
<mo>*</mo>
</msubsup>
<mo>)</mo>
</mrow>
<mo>/</mo>
<mi>M</mi>
<mi>a</mi>
<mi>x</mi>
<mrow>
<mo>(</mo>
<mi>E</mi>
<mo>(</mo>
<msubsup>
<mi>e</mi>
<mrow>
<mi>s</mi>
<mi>d</mi>
</mrow>
<mn>1</mn>
</msubsup>
<mo>)</mo>
<mo>,</mo>
<mi>L</mi>
<mi> </mi>
<mi>E</mi>
<mo>(</mo>
<msubsup>
<mi>e</mi>
<mrow>
<mi>s</mi>
<mi>d</mi>
</mrow>
<mi>n</mi>
</msubsup>
<mo>)</mo>
<mo>)</mo>
</mrow>
</mrow>
Wherein,Represent the set of each link available bandwidth in node s to node d nth bar path；Expression is evaluated path
In each link available bandwidth set.
Step 5.5：It is good and bad that path is evaluated in comprehensive each several part influence
The aspect of selection gist 3 of optimal path in multi-path transmission, in conjunction with the additive model in statistics reciprocation to each
Part is combined, and obtains equation below：
M=a*BBD+b*PD+c*LBW
Wherein, a represents influence of the link available bandwidth balance degree to optimal route selection, and b represents the path delay of time to most
The influence of shortest path selection, c represents influence of the link available bandwidth size to optimal route selection.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710560005.3A CN107135158A (en) | 2017-07-11 | 2017-07-11 | Optimal route selection method in a kind of multi-path transmission |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710560005.3A CN107135158A (en) | 2017-07-11 | 2017-07-11 | Optimal route selection method in a kind of multi-path transmission |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107135158A true CN107135158A (en) | 2017-09-05 |
Family
ID=59737846
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710560005.3A Pending CN107135158A (en) | 2017-07-11 | 2017-07-11 | Optimal route selection method in a kind of multi-path transmission |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107135158A (en) |
Cited By (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107689919A (en) * | 2017-09-20 | 2018-02-13 | 北京科技大学 | The dynamic adjustment weight fuzzy routing method of SDN |
| CN108519872A (en) * | 2018-03-22 | 2018-09-11 | 华东师范大学 | A method of precedence diagram is evaluated based on comparison in difference |
| CN108551406A (en) * | 2018-04-24 | 2018-09-18 | 福州大学 | A kind of software definition mobile radio network channel division method based on load balancing |
| CN109327388A (en) * | 2018-12-05 | 2019-02-12 | 北京邮电大学 | A kind of network path difference quantitative evaluation method of service-oriented |
| CN110086870A (en) * | 2019-04-28 | 2019-08-02 | 北京工业大学 | The parallel method for reliable transmission of the multipath of data-oriented central site network |
| CN110213073A (en) * | 2018-04-20 | 2019-09-06 | 腾讯科技（深圳）有限公司 | Data flow variation, electronic equipment, calculate node and storage medium |
| CN110995591A (en) * | 2019-12-06 | 2020-04-10 | 苏州浪潮智能科技有限公司 | Method, device and medium for selecting optimal path based on link layer discovery protocol |
| CN111917645A (en) * | 2020-08-20 | 2020-11-10 | 深圳多拉多通信技术有限公司 | SDN-based path optimization method and system for mobile network |
| CN112269858A (en) * | 2020-10-22 | 2021-01-26 | 中国平安人寿保险股份有限公司 | Optimization method, device and equipment of synonym dictionary and storage medium |
| CN113489648A (en) * | 2021-06-28 | 2021-10-08 | 北京计算机技术及应用研究所 | Domestic platform energy-saving communication method based on SDN |
| CN113542119A (en) * | 2020-04-20 | 2021-10-22 | 四川航天神坤科技有限公司 | Method for monitoring communication link optimization of early warning and emergency command scheduling system |
| CN113992590A (en) * | 2021-10-25 | 2022-01-28 | 天津职业技术师范大学(中国职业培训指导教师进修中心) | Link load balancing method based on software defined network |
| CN114722075A (en) * | 2021-01-04 | 2022-07-08 | 中国移动通信集团山东有限公司 | Data stream processing method and device, server and storage medium |
| CN115514642A (en) * | 2022-09-22 | 2022-12-23 | 湖南泛联新安信息科技有限公司 | Multi-FPGA platform network topology optimization method based on split communication requirements |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105897575A (en) * | 2016-06-03 | 2016-08-24 | 中国电子科技集团公司第三十研究所 | Path computing method based on multi-constrained path computing strategy under SDN |
| CN106357537A (en) * | 2016-11-09 | 2017-01-25 | 北京工业大学 | Link monitoring method based on SDN multipath transmission |
| CN106411766A (en) * | 2016-09-30 | 2017-02-15 | 赛特斯信息科技股份有限公司 | Flow scheduling system and method based on SDN |
-
2017
- 2017-07-11 CN CN201710560005.3A patent/CN107135158A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105897575A (en) * | 2016-06-03 | 2016-08-24 | 中国电子科技集团公司第三十研究所 | Path computing method based on multi-constrained path computing strategy under SDN |
| CN106411766A (en) * | 2016-09-30 | 2017-02-15 | 赛特斯信息科技股份有限公司 | Flow scheduling system and method based on SDN |
| CN106357537A (en) * | 2016-11-09 | 2017-01-25 | 北京工业大学 | Link monitoring method based on SDN multipath transmission |
Non-Patent Citations (2)
| Title |
|---|
| BO LIU: "AnOpenFlow-based performance-orientedmultipath", 《FRONTIERS OF INFORMATION TECHNOLOGY & ELECTRONIC ENGINEERING》 * |
| 董宏成: "基于OpenFlow的数据中心网络负载均衡算法", 《电子技术应用》 * |
Cited By (21)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107689919A (en) * | 2017-09-20 | 2018-02-13 | 北京科技大学 | The dynamic adjustment weight fuzzy routing method of SDN |
| CN107689919B (en) * | 2017-09-20 | 2019-12-27 | 北京科技大学 | Dynamic adjustment weight fuzzy routing method for SDN network |
| CN108519872A (en) * | 2018-03-22 | 2018-09-11 | 华东师范大学 | A method of precedence diagram is evaluated based on comparison in difference |
| CN108519872B (en) * | 2018-03-22 | 2021-05-07 | 华东师范大学 | Method for evaluating sequence diagram based on difference comparison |
| CN110213073A (en) * | 2018-04-20 | 2019-09-06 | 腾讯科技（深圳）有限公司 | Data flow variation, electronic equipment, calculate node and storage medium |
| CN110213073B (en) * | 2018-04-20 | 2021-10-22 | 腾讯科技（深圳）有限公司 | Data flow direction changing method, electronic device, computing node and storage medium |
| CN108551406A (en) * | 2018-04-24 | 2018-09-18 | 福州大学 | A kind of software definition mobile radio network channel division method based on load balancing |
| CN109327388A (en) * | 2018-12-05 | 2019-02-12 | 北京邮电大学 | A kind of network path difference quantitative evaluation method of service-oriented |
| CN110086870A (en) * | 2019-04-28 | 2019-08-02 | 北京工业大学 | The parallel method for reliable transmission of the multipath of data-oriented central site network |
| CN110995591A (en) * | 2019-12-06 | 2020-04-10 | 苏州浪潮智能科技有限公司 | Method, device and medium for selecting optimal path based on link layer discovery protocol |
| CN113542119B (en) * | 2020-04-20 | 2023-06-20 | 四川航天神坤科技有限公司 | Method for monitoring and pre-warning and emergency command and dispatch system communication link optimization |
| CN113542119A (en) * | 2020-04-20 | 2021-10-22 | 四川航天神坤科技有限公司 | Method for monitoring communication link optimization of early warning and emergency command scheduling system |
| CN111917645A (en) * | 2020-08-20 | 2020-11-10 | 深圳多拉多通信技术有限公司 | SDN-based path optimization method and system for mobile network |
| CN112269858A (en) * | 2020-10-22 | 2021-01-26 | 中国平安人寿保险股份有限公司 | Optimization method, device and equipment of synonym dictionary and storage medium |
| CN112269858B (en) * | 2020-10-22 | 2024-04-19 | 中国平安人寿保险股份有限公司 | Optimization method, device, equipment and storage medium of synonymous dictionary |
| CN114722075A (en) * | 2021-01-04 | 2022-07-08 | 中国移动通信集团山东有限公司 | Data stream processing method and device, server and storage medium |
| CN113489648A (en) * | 2021-06-28 | 2021-10-08 | 北京计算机技术及应用研究所 | Domestic platform energy-saving communication method based on SDN |
| CN113992590A (en) * | 2021-10-25 | 2022-01-28 | 天津职业技术师范大学(中国职业培训指导教师进修中心) | Link load balancing method based on software defined network |
| CN113992590B (en) * | 2021-10-25 | 2024-05-14 | 天津职业技术师范大学(中国职业培训指导教师进修中心) | Link load balancing method based on software defined network |
| CN115514642A (en) * | 2022-09-22 | 2022-12-23 | 湖南泛联新安信息科技有限公司 | Multi-FPGA platform network topology optimization method based on split communication requirements |
| CN115514642B (en) * | 2022-09-22 | 2023-11-17 | 湖南泛联新安信息科技有限公司 | Multi-FPGA platform network topology optimization method based on segmentation communication requirement |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107135158A (en) | Optimal route selection method in a kind of multi-path transmission | |
| CN106789648B (en) | Software defined network route decision method based on content storage and Network status | |
| CN108600102B (en) | Flexible data transmission system based on intelligent cooperative network | |
| CN104702522B (en) | Computer implemented method, device, the controller of software defined network routing data | |
| CN106059811B (en) | Communication system, control device, packet forwarding path control method | |
| CN107370676A (en) | Fusion QoS and load balancing demand a kind of route selection method | |
| CN103685054B (en) | Multipath load balancing method based on service awareness | |
| CN107896192A (en) | The QoS control method of differentiated service priority in a kind of SDN | |
| CN107566440A (en) | The automatic discovery that is serviced in the network environment of software definition and automatic scalable | |
| CN104468351B (en) | Management method, CCN retransmission units and network controller based on SDN auxiliary CCN routes | |
| CN105897575A (en) | Path computing method based on multi-constrained path computing strategy under SDN | |
| CN108667743A (en) | Congestion control in grouped data networking | |
| CN107404526A (en) | P2P remotely-sensed data network self-adapting dissemination systems and method based on SDN | |
| CN104683244B (en) | It is a kind of that tactful multicast route method is driven based on path node | |
| CN105284150B (en) | Service shunting method, control network element, gateway router and user entity | |
| CN107689919A (en) | The dynamic adjustment weight fuzzy routing method of SDN | |
| CN102638409A (en) | Method for controlling traffics among channels in architecture of network element based on forwarding and control separation | |
| CN105992297A (en) | SDN-based connection management and forwarding control method and related equipment | |
| CN108123878A (en) | A kind of method for routing, device and data transfer equipment | |
| Jia et al. | A BUS‐aided RSU access scheme based on SDN and evolutionary game in the Internet of Vehicle | |
| CN106302012A (en) | A kind of PTN network simulation-optimization method and system | |
| CN207304583U (en) | A kind of edge network architecture of Internet of things based on software defined network | |
| CN107454630A (en) | Load-balancing method and load balancing router | |
| CN103067294B (en) | Based on the method for the data flow equilibrium treatment of stream order-preserving in multi-next-hop forwarding router | |
| CN108337168A (en) | It flows cluster and exchanges routing mechanism OpenFlow group table selection methods |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20170905 |