CN104935476A - SDN-based network flow matrix measurement method - Google Patents
SDN-based network flow matrix measurement method Download PDFInfo
- Publication number
- CN104935476A CN104935476A CN201510260772.3A CN201510260772A CN104935476A CN 104935476 A CN104935476 A CN 104935476A CN 201510260772 A CN201510260772 A CN 201510260772A CN 104935476 A CN104935476 A CN 104935476A
- Authority
- CN
- China
- Prior art keywords
- matrix
- stream
- sdn switch
- node
- flow
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
Abstract
The present invention belongs to the field of network management and network measurement and provides an SDN-based network flow matrix measurement method, which aims to meet the constraint of the flow-aggregation feasibility and the constraint of limited resources for network measurement and lowers the estimation error of a flow matrix. According to the technical scheme of the invention, the flows of the same destination node are aggregated together, and a convergence matrix is designed based on the de-agglomeration and routing rules. The flow matrix is estimated through the two-step process. During the first step, a routing rule (namely called an old rule) composed of most aggregated flows is selected to generate a new rule, so that the difference between the number of aggregated flows in the old rule and the number of aggregated flows in the new rule is minimum. After that, a flow matrix is estimated through the matrix completion technology. During the second step, the flow matrix estimated during the first step is adopted as a basis, and the largest front k flows are selected from the flow matrix to be measured directly. According to the technical scheme of the invention, the measurement period is shortened and the difficulty in directly measuring each flow is reduced. Meanwhile, the constraint of the flow-aggregation feasibility is met, and the estimation error is relatively low.
Description
Technical field
The invention belongs to network management and network measure field, particularly deploy network management and the measurement of the SDN switch supporting OpenFlow agreement.
Background technology
Network measure refers in accordance with certain Method and Technology, utilizes software or hardware tools to test the index characterizing network state and performance, obtains the general name of a series of activities such as network topology structure, nodal community and traffic characteristics.The main contents of network measure comprise time delay, the packet loss of network, available bandwidth, network topology and network traffics matrix etc.Network manager, must the running status of awareness network in time in order to supervising the network effectively.Therefore, one of Network Measurement Technologies core technology becoming network management measuring network operation state index.Wherein, the uninterrupted between what traffic matrix represented is in network any two nodes pair.Traffic matrix is the key input information of a lot of network management task, such as traffic engineering, the network planning, network performance diagnostic analysis and charge on traffic etc.The measurement of network traffics matrix is measured all uninterrupteds carried in network and estimate, so that network manager can according to measuring the traffic matrix obtained, the route of rational planning and arrangement network flow, thus improve the service quality of business and the utilization ratio of Internet resources.
Traditional network traffics matrix method of measurement mainly comprises the direct method of measurement and the estimation technique.The general principle of the direct method of measurement is arranged on network node or link by network probe, so that the parameter required for directly obtaining.But direct measuring flow matrix exists many-sided difficulty, first, the number of stream is general larger, directly can not measure the size of each stream, and the cost of cost is too large like this; Secondly, measure the measurement hardware resource needing specialty, the resource of these costlinesses can not be installed on each network node, expend too large; Finally, because network is isomery, during measurement, need the mutual cooperation between heterogeneous networks, but for some reason (such as network security), be difficult to ensure can mutually cooperate between each network, this just cannot ensure the accuracy measured.
The basic ideas of the estimation technique are that the mode by directly measuring obtains the metrical information easily measuring or spend cost little, and re-use these information and estimate traffic matrix, the estimation technique is called the indirect method of measurement again.In the estimation technique, some additional informations in network can be utilized to carry out estimated flow matrix, such as link load, route matrix.Link load represents the flow on two connected inter-node link, is the uninterrupted that the flow in network converges on link according to route matrix.Link load can obtain by using snmp protocol, and route matrix can by collecting the configuration information of interior routing protocol or being obtained by link-state information mutual between collect & route device.Therefore, traffic matrix estimates it is namely under link load and the known prerequisite of route matrix, estimates the estimated value of traffic matrix.In a network, the number of stream is generally much larger than the number of link, and namely route matrix is low-rank, accurately cannot estimate traffic matrix.In order to improve the estimation accuracy of traffic matrix, more additional information must be obtained, but due to the restriction of legacy network control plane, it is very difficult for obtaining more additional information.
In recent years, in order to strengthen the management and control ability to network, research circle proposes SDN framework.Network-based control face and data surface thoroughly separate by SDN, and what chain of command was centralized runs on network controller, and what data surface then disperseed is present on each equipment.This separation design of SDN is that the measurement of network traffics matrix also brings benefit.First, centralized control plane has the network view of the overall situation, can allotting network resource, dynamically configuration flow table uniformly.Secondly, the data surface be distributed on the network equipment provides some counters for flowing statistics, and we can provide more input for the estimation of traffic matrix to utilize these counters.Therefore, the network traffics matrix measurement studied based on SDN can be necessary by control and management network effectively to network manager.
At present, some have academicly been had based on the research of the network traffics matrix method of measurement of SDN.ProgMe proposes a kind of programmable network flow programming method structure, can collect the traffic statistics value in the flow set that user specifies.OpenSketch proposes a kind of gage frame based on Hash, can dynamically configure each framework.But ProgMe and OpenSketch supposes that all switches all support the measurement hardware of specialty, and this is obviously impossible.And these two kinds of methods are all for the incompatible measurement of some specific flow set, and such as Heavy Hitter, the measurement of their traffic matrix is all not too applicable.
Open-TM, DCM and iSTAMP are the methods based on SDN measuring flow matrix.Open-TM and DCM is the size directly measuring each stream by monitoring each stream, thus obtains traffic matrix.Obviously, the autgmentability of Open-TM and DCM is all very poor, and because the number flowed in a network is general very large, but required measurement resource is again limited, so can by directly not measuring the size of each stream to obtain traffic matrix.In order to the constraint of satisfied measurement resource, and improve the accuracy measured, first iSTAMP method measures front k maximum stream and some flow the size after converging, and then estimates traffic matrix.ISTAMP seems to have made balance between the two at Internet resources and measurement accuracy, but it still has following defect: first, search based on the matching principle of priority and asterisk wildcard to transmit during SDN switch forwarding flow, the stream only with identical destination node just may be aggregated in a list item and (namely be called the feasible constraints of stream polymerization), but have ignored this constraint in iSTAMP method, be polymerized arbitrarily; Secondly, in order to find out maximum before k stream, iSTAMP utilizes whole TCAM list items directly to measure the size of each stream in multiple time period, and this can bring again the measurement cost of can not ignore.
Summary of the invention
The object of the invention is the defect existed for background technology, a kind of network traffics matrix method of measurement based on SDN of research and design.(converging matrix is 0-1 matrix to utilize the characteristic of SDN to design convergence matrix, its the corresponding TCAM list item of every a line, represent a flow measurement rule, its element (i, j) represent whether stream j forwards through regular i), then utilize matrix completing technology to estimate traffic matrix, meet stream polymerization feasible constraints and the constraint of network measure resource-constrained to reach, reduce the evaluated error of traffic matrix, improve the objects such as the correct probability of detection Heavy Hitter.
The scheme of solution of the present invention is: suppose that, in order to save TCAM list item, destination node phase homogeneous turbulence all condenses together, and designs convergence matrix by depolymerization and routing rule; Two-step method is adopted to carry out estimated flow matrix, the first step is that the routing rule (being called old rule) that selection aggregated flow is maximum produces new regulation, make the number of old rule and new regulation aggregated flow differ minimum, then utilize matrix completing technology to estimate a traffic matrix; Second step is based on the traffic matrix that estimates in the first step, therefrom select front k maximum stream directly to measure, adopt to ask and characterize stream and SDN switch and can solve each SDN switch and directly measure the problem that adfluxion closes with the most authority of the bipartite graph of the relation between TCAM list item maximum coupling; Namely the present invention realizes its object with this.Therefore, the present invention adopts method scheme to be:
Based on a network traffics matrix method of measurement of SDN, comprise the following steps:
A. construct and initially converge matrix: when supposing initial, destination node phase homogeneous turbulence is all polymerization, namely only need carry out with a TCAM list item stream that route has identical destination node; Design the flow measurement rule that each SDN switch TCAM list item is corresponding, processing procedure is:
Step 1.0: in the TCAM list item of all SDN switch, the rule (being called old rule) selecting aggregated flow number maximum produces new regulation, old rule and new regulation are except priority, source IP prefix are different, remaining is all identical, the priority of new regulation, higher than old rule, goes to step 2.0;
Step 2.0: for new regulation finds the longer source IP prefix of a length: find this prefix in the prefix trees being tree root with the source IP prefix of old rule, makes the number of these two regular aggregated flows differ minimum, goes to step 2.1;
Step 2.1: the new regulation produced is deployed in the available TCAM list item of SDN switch, if the TCAM table of all SDN switch is all full, then goes to step 3.0, otherwise goes to step 1.0;
Step 3.0: the stream be polymerized according to each TCAM list item, builds one and converges matrix, and due to SDN switch limited amount, part stream does not monitor, so route matrix is incorporated in convergence matrix according to link flow constraint, obtains last convergence matrix;
B. estimated flow matrix: carry out estimated flow matrix according to obtaining last convergence matrix in steps A, method of estimation adopts and minimizes
λ is regular coefficient, wherein A is for converging matrix, X is required traffic matrix, and Y is the column matrix corresponding with converging square A, and element corresponding with being incorporated to the convergence matrix before route matrix in Y matrix is uninterrupted, the element corresponding with route matrix that each list item converges is link load;
C. redesign and converge matrix: redesign flow measurement rule corresponding to each SDN switch TCAM list item according to the traffic matrix estimated in step B, its processing procedure is:
Step 1.0: for each SDN switch, the adfluxion that can monitor from it select closing maximum before k (value of k equal this SDN switch can with the number of TCAM list item) individual stream directly measure, system of selection is:
Step 1.0.0: constructing virtual bipartite graph: the node first constructing Part I, represents the available TCAM list item of each SDN switch, if the available TCAM list item number of the SDN switch at node j place is s, then and corresponding generation s node j
1, j
2..., j
s, each node represents the available list item that this SDN switch TCAM shows; Then construct the node of Part II, represent each stream, if there is L stream, then just have L node, stream i represents i-th stream, i.e. node i; Finally construct Part I node and the internodal link of Part II, if the SDN switch of stream i through node j place, then node i and j
1, j
2..., j
sbe connected respectively, the weight of link is the size of stream i, and the addition manner of other link is similar, goes to step 1.0.1;
From then on step 1.0.1: ask the most maximum coupling of authority of this bipartite graph: the most maximum coupling of authority can obtaining this bipartite graph according to the most authority maximum matching algorithm of bipartite graph, then find out maximum front k the stream that each SDN switch will directly be measured in the most maximum coupling of authority; The node that such as 2 of j place SDN switch available TCAM list items are corresponding is j
1, j
2, the coupling calculated is j
1-a, j
2-b, then maximum front 2 streams that this SDN switch will directly be measured are a, b; Go to step 2.0;
Step 2.0: the most maximum coupling of authority obtained according to above-mentioned steps reconfigures after which stream each SDN switch directly will measure, just can obtain a new convergence matrix, again link flow constraint is incorporated into and converges in matrix, obtain finally new convergence matrix;
D. last traffic matrix is estimated: the finally new convergence matrix obtained according to step C is according to step B estimated flow matrix, and the error of calculation.
The present invention is due to when building convergence matrix, to produce new regulation for the maximum rule of the number of each list item aggregated flow, and the number difference of guarantee two regular aggregated flows is minimum as far as possible, then according to convergence Matrix Estimation traffic matrix now, the traffic matrix that last basis estimates finds the adfluxion conjunction that each SDN switch will directly be measured, do not need the actual size knowing each stream, reduce the cycle of measurement and directly measure the difficulty of each stream, and meet stream polymerization feasible constraints, evaluated error is lower.
Accompanying drawing explanation
Fig. 1 is the network physical topological network schematic diagram having 5 nodes to form during the present invention specifically implements.
Fig. 2 is the virtual bipartite graph of structure when selecting front k maximum stream during the present invention specifically implements.
Note:
wherein
for actual flow entry of a matrix element,
for estimating the element of the traffic matrix obtained.
Embodiment
Below in conjunction with drawings and Examples, the present invention is described in further detail.
Accompanying drawing 1 is the network physical topological network schematic diagram be made up of 5 nodes, its interior joint 1 and 3 is for deploying the node of SDN switch, link in network is two-way link, the present embodiment estimates traffic matrix, namely the flow between all nodes pair, then compares with the traffic matrix of reality.
The information of embodiment is as follows:
Suppose that the available TCAM list item number of two SDN switch (node 1 and node 3) in Fig. 1 is 7, the IP address of five nodes is respectively 61.133.128.0/17,202.100.64.0/21,222.88.0.0/15,123.184.0.0/14,116.192.0.0/16, and corresponding IP prefix is respectively 00111101100001011,110010100110010001000,110111100101100,01111011101110,0111010011000000.
Document border traffic matrix is:
Implementation step:
A. construct and initially converge matrix: in stream injection network, the route of each stream is minimum hop routing.When each SDN switch initialization be used for stream by list item after, the TCAM of the SDN switch at node 1 place shows initial list item 5, the adfluxion of being polymerized respectively is combined into { 1->0, 2->0, 4->0}, { 0->1, 2->1, 3->1, 4->1}, { 0->2, 1->2, 4->2}, { 1->3}, { 0->4, 1->4, 2->4}, the TCAM of the SDN switch at node 3 place shows initial list item 5, the adfluxion of being polymerized respectively is combined into { 3->0}, { 3->1}, { 3->2}, { 0->3, 1->3, 2->3, 4->3}, { 3->4}.Ensuing processing procedure is:
Step 1.0: in the TCAM list item of all SDN switch, the list item that aggregated flow number is maximum is the 2nd list item (or the 4th of the SDN switch at node 3 place the list item) of the SDN switch at node 1 place, select rule corresponding to this list item (being called old rule) to produce new regulation, go to step 2.0;
Step 2.0: old rule has been polymerized 4 streams, and source node is respectively 0,2,3,4, the source IP prefix of old rule is " " (being sky).Prefix " 0111 " is searched out with the prefix trees that " " is tree root by searching, the number of mating the stream of these two prefixes (" " and " 0111 ") is respectively 2, namely the source IP prefix of new regulation is " 0111 ", and the old rule of its priority ratio is high, and the number of the stream of polymerization is 2; Then new regulation is deployed in available TCAM list item.The adfluxion that now these two rules (corresponding to two TCAM list items) are polymerized is closed and is respectively { 3->1,4->1}, { 0->1,2->1}.Go to step 2.1;
Step 2.1: if the TCAM list item of all SDN switch is all finished, then goes to step 3.0, otherwise go to step 1.0;
Step 3.0: the stream be polymerized according to the TCAM list item of all SDN switch, build one and converge matrix, due to SDN switch limited amount, part stream does not monitor, so route matrix is incorporated in convergence matrix according to link flow constraint, obtain last convergence matrix.
B. estimated flow matrix: method of estimation is for minimizing
wherein A is for converging matrix, and X is required traffic matrix (traffic matrix that 5 row 5 are arranged is by from left to right being write as row from high to low), and Y is the value measured.According to said method obtaining estimated flow matrix is:
C. redesign and converge matrix: the TCAM list item redesigning each SDN switch according to the traffic matrix estimated, its processing procedure is:
Step 1.0: for each SDN switch, select from the adfluxion that can monitor is closed maximum before K=7-5=2 (the list item total number of TCAM table is 7, and the list item for route is 5) individual stream directly measure, system of selection is:
Step 1.0.0: constructing virtual bipartite graph: because the available TCAM list item number of each SDN switch is 2, the TCAM table of each SDN switch is just expressed as 2 nodes, see Fig. 2, its interior joint A1, A2 represent two of the SDN switch at node 1 place available TCAM list items, Node B 1, B2 represent two of the SDN switch at node 3 place available TCAM list items, node 1,2 ..., 20 represent 20 streams in network, if certain flows through node 1, just the node that this stream represents is connected with A1, A2, the addition manner of other link is similar.The weight (not marking in figure) of link is expressed as the size of corresponding stream, goes to step 1.0.1.
Step 1.0.1: the most maximum coupling of authority obtaining this bipartite graph: can in the hope of the most maximum coupling of authority of this bipartite graph be A1-7, A2-14, B1-3, B2-13.It can thus be appreciated that 2 maximum streams of two SDN switch selections are respectively { 1->3,3->1}, { 0->3,3->0}.Like this, the adfluxion that 7 list items of the SDN switch at node 1 place are polymerized respectively is combined into { 1->0, 2->0, 4->0}, { 0->1, 2->1, 3->1, 4->1}, { 0->2, 1->2, 4->2}, { 1->3}, { 0->4, 1->4, 2->4}, { 1->3}, { 3->1}, the adfluxion that 7 list items of the SDN switch at node 3 place are polymerized respectively is combined into { 3->0}, { 3->1}, { 3->2}, { 0->3, 1->3, 2->3, 4->3}, { 3->4}, { 0->3}, { 3->0}, then a new convergence matrix can be obtained according to these list items, link flow constraint being incorporated into converges in matrix again, obtain last convergence matrix.
D. last traffic matrix is estimated: the traffic matrix that the convergence Matrix Estimation obtained according to step C goes out is EStimated_TM
1, and to calculate NMAE error be 0.1046.
The above, be only the specific embodiment of the present invention, arbitrary feature disclosed in this specification, unless specifically stated otherwise, all can be replaced by other equivalences or the alternative features with similar object; Step in disclosed all features or all methods or process, except mutually exclusive feature and/or step, all can be combined in any way.
Claims (1)
1., based on a network traffics matrix method of measurement of SDN, comprise the following steps:
A. construct and initially converge matrix: when setting initial, destination node phase homogeneous turbulence is all polymerization, namely only need carry out with a TCAM list item stream that route has identical destination node; Design the flow measurement rule that each SDN switch TCAM list item is corresponding, processing procedure is:
Step 1.0: in the TCAM list item of all SDN switch, the rule selecting aggregated flow number maximum as old rule in order to produce new regulation, old rule and new regulation are except priority, source IP prefix are different, remaining is all identical, the priority of new regulation, higher than old rule, goes to step 2.0;
Step 2.0: for new regulation finds source IP prefix: find this prefix in the prefix trees being tree root with the source IP prefix of old rule, makes the number of these two regular aggregated flows differ minimum, goes to step 2.1;
Step 2.1: the new regulation produced is deployed in the available TCAM list item of SDN switch, if the TCAM table of all SDN switch is all full, then goes to step 3.0, otherwise goes to step 1.0;
Step 3.0: according to the stream of each TCAM list item polymerization, build one and converge matrix, then according to link flow constraint, route matrix is incorporated in convergence matrix, obtain last convergence matrix;
B. estimated flow matrix: the convergence matrix according to obtaining in steps A carrys out estimated flow matrix, method of estimation adopts and minimizes
wherein λ is regular coefficient, and A is for converging matrix, and X is required traffic matrix, and Y is the column matrix corresponding with converging square A;
C. redesign and converge matrix: redesign flow measurement rule corresponding to each SDN switch TCAM list item according to the traffic matrix estimated in step B, its processing procedure is:
Step 1.0: for each SDN switch, the adfluxion that can monitor from it select closing maximum before k stream is directly measured, the value of k equals the number that this SDN switch can use TCAM list item, system of selection is:
Step 1.0.0: constructing virtual bipartite graph: the node first constructing Part I, represents the available TCAM list item of each SDN switch, if the available TCAM list item number of the SDN switch at node j place is s, then and corresponding generation s node j
1, j
2..., j
s, each node represents the available list item that this SDN switch TCAM shows; Then construct the node of Part II, represent each stream, if there is L stream, then just have L node, stream i represents i-th stream, i.e. node i; Finally construct Part I node and the internodal link of Part II, if the SDN switch of stream i through node j place, then node i and j
1, j
2..., j
sbe connected respectively, the weight of link is the size of stream i; The addition manner of other link is identical, goes to step 1.0.1;
From then on step 1.0.1: ask the most maximum coupling of authority of this bipartite graph: the most maximum coupling of authority obtaining this bipartite graph according to the most authority maximum matching algorithm of bipartite graph, then find out maximum front k the stream that each SDN switch will directly be measured in the most maximum coupling of authority; Go to step 2.0;
Step 2.0: the most maximum coupling of authority obtained according to above-mentioned steps reconfigures the stream that each SDN switch is directly measured, obtain a new convergence matrix, according to link flow constraint, route matrix is incorporated in convergence matrix again, obtains final new convergence matrix;
D. last traffic matrix is estimated: the new convergence matrix obtained according to step C is according to step B estimated flow matrix, and the error of calculation.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510260772.3A CN104935476B (en) | 2015-05-20 | 2015-05-20 | A kind of network traffics matrix measuring method based on SDN |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510260772.3A CN104935476B (en) | 2015-05-20 | 2015-05-20 | A kind of network traffics matrix measuring method based on SDN |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104935476A true CN104935476A (en) | 2015-09-23 |
| CN104935476B CN104935476B (en) | 2018-04-06 |
Family
ID=54122451
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510260772.3A Expired - Fee Related CN104935476B (en) | 2015-05-20 | 2015-05-20 | A kind of network traffics matrix measuring method based on SDN |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104935476B (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105897518A (en) * | 2016-06-30 | 2016-08-24 | 电子科技大学 | Method for measuring link performance parameters of full SDN network |
| CN105959167A (en) * | 2016-07-18 | 2016-09-21 | 东北大学 | Global optimization SDN measuring method based on greedy algorithm |
| CN106230652A (en) * | 2016-07-19 | 2016-12-14 | 东北大学 | SDN performance measurement method based on OpenFlow agreement |
| CN106850348A (en) * | 2017-01-19 | 2017-06-13 | 中山大学 | A kind of traffic matrix On-line Estimation method of the data center internet based on SDN |
| CN110868332A (en) * | 2019-10-25 | 2020-03-06 | 电子科技大学 | SDN-based network-level flow measurement method |
| CN113316917A (en) * | 2019-02-08 | 2021-08-27 | 华为技术有限公司 | Apparatus and method for controlling network route configuration |
| CN114389858A (en) * | 2021-12-24 | 2022-04-22 | 安天科技集团股份有限公司 | Traffic processing method and device, electronic equipment and computer readable storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103346922A (en) * | 2013-07-26 | 2013-10-09 | 电子科技大学 | Controller for determining network state based on SDN (Software Defined Networking) and determination method thereof |
| CN104158753A (en) * | 2014-06-12 | 2014-11-19 | 南京工程学院 | Dynamic flow dispatch method and system based on software definition network |
| US20140376383A1 (en) * | 2013-06-19 | 2014-12-25 | Futurewei Technologies, Inc. | Systems and Methods for Traffic Engineering in Software Defined Networks |
| CN104333514A (en) * | 2014-11-28 | 2015-02-04 | 北京交通大学 | Network flow control method, device and system |
-
2015
- 2015-05-20 CN CN201510260772.3A patent/CN104935476B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20140376383A1 (en) * | 2013-06-19 | 2014-12-25 | Futurewei Technologies, Inc. | Systems and Methods for Traffic Engineering in Software Defined Networks |
| CN103346922A (en) * | 2013-07-26 | 2013-10-09 | 电子科技大学 | Controller for determining network state based on SDN (Software Defined Networking) and determination method thereof |
| CN104158753A (en) * | 2014-06-12 | 2014-11-19 | 南京工程学院 | Dynamic flow dispatch method and system based on software definition network |
| CN104333514A (en) * | 2014-11-28 | 2015-02-04 | 北京交通大学 | Network flow control method, device and system |
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105897518A (en) * | 2016-06-30 | 2016-08-24 | 电子科技大学 | Method for measuring link performance parameters of full SDN network |
| CN105897518B (en) * | 2016-06-30 | 2018-11-06 | 电子科技大学 | A kind of link performance parameters measurement method of full SDN network |
| CN105959167A (en) * | 2016-07-18 | 2016-09-21 | 东北大学 | Global optimization SDN measuring method based on greedy algorithm |
| CN105959167B (en) * | 2016-07-18 | 2019-04-23 | 东北大学 | A kind of global optimization SDN measurement method based on greedy algorithm |
| CN106230652B (en) * | 2016-07-19 | 2019-04-23 | 东北大学 | SDN network performance measurement method based on OpenFlow agreement |
| CN106230652A (en) * | 2016-07-19 | 2016-12-14 | 东北大学 | SDN performance measurement method based on OpenFlow agreement |
| CN106850348A (en) * | 2017-01-19 | 2017-06-13 | 中山大学 | A kind of traffic matrix On-line Estimation method of the data center internet based on SDN |
| CN113316917A (en) * | 2019-02-08 | 2021-08-27 | 华为技术有限公司 | Apparatus and method for controlling network route configuration |
| CN113316917B (en) * | 2019-02-08 | 2023-02-28 | 华为技术有限公司 | Apparatus and method for controlling network route configuration |
| CN110868332A (en) * | 2019-10-25 | 2020-03-06 | 电子科技大学 | SDN-based network-level flow measurement method |
| CN110868332B (en) * | 2019-10-25 | 2021-08-13 | 电子科技大学 | SDN-based network-level flow measurement method |
| CN114389858A (en) * | 2021-12-24 | 2022-04-22 | 安天科技集团股份有限公司 | Traffic processing method and device, electronic equipment and computer readable storage medium |
| CN114389858B (en) * | 2021-12-24 | 2023-08-25 | 安天科技集团股份有限公司 | Flow processing method and device, electronic equipment and computer readable storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104935476B (en) | 2018-04-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104935476A (en) | SDN-based network flow matrix measurement method | |
| CN108600102B (en) | Flexible data transmission system based on intelligent cooperative network | |
| CN105075180B (en) | Method, apparatus for adjusting network attribute and computer readable storage medium | |
| CN101321134B (en) | Service quality routing selection method under dynamic network condition | |
| US9807000B2 (en) | Method for constituting hybrid network spanning trees, method of redundancy, and control system thereof | |
| CN109039897B (en) | Software defined backhaul network routing method based on service awareness | |
| WO2016061957A1 (en) | Method and apparatus for evaluating service traffic in lte network | |
| CN105024853A (en) | SDN resource matching and service path discovering method based on rumor spreading mechanism | |
| Huang et al. | Software-defined QoS provisioning for fog computing advanced wireless sensor networks | |
| CN106209615B (en) | A kind of Dynamic Route Control method and system calculating forward-path based on SPFA algorithm | |
| CN104518899A (en) | Network routing traffic simulation method and device | |
| CN103873364A (en) | Inter-domain multi-path rooting implementation method | |
| CN102420797B (en) | Topology mapping method and system | |
| CN105306291B (en) | One kind being based on packet loss and the united Estimating topology of networks method of time delay | |
| CN105450524A (en) | Media forwarding routing optimization algorithm | |
| CN105376197B (en) | The method and system of implementation level network abstraction | |
| CN102045186B (en) | Event analysis method and system | |
| CN104363142B (en) | A kind of automation data central site network performance bottleneck analysis method | |
| Qu et al. | Enabling a resilient and self-healing PMU infrastructure using centralized network control | |
| CN101692642A (en) | Switching layer tree network based multi-subnet topology discovering device and switching layer tree network based multi-subnet topology discovering method | |
| Lemeshko et al. | A mathematical model of multipath QoS-based routing in multiservice networks | |
| CN106850348A (en) | A kind of traffic matrix On-line Estimation method of the data center internet based on SDN | |
| CN106612207A (en) | Method and device for managing and controlling RSTP (Rapid Spanning Tree Protocol) information of Ethernet equipment | |
| Petrov et al. | Minimization of multicast traffic and ensuring its fault tolerance in software-defined networks | |
| CN103701940B (en) | Address resolution protocol collocation method and device under a kind of NMS |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20180406 Termination date: 20210520 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |