CN110505154A - A kind of interchanger moving method based on improved Dijkstra's algorithm - Google Patents
A kind of interchanger moving method based on improved Dijkstra's algorithm Download PDFInfo
- Publication number
- CN110505154A CN110505154A CN201910681398.2A CN201910681398A CN110505154A CN 110505154 A CN110505154 A CN 110505154A CN 201910681398 A CN201910681398 A CN 201910681398A CN 110505154 A CN110505154 A CN 110505154A
- Authority
- CN
- China
- Prior art keywords
- controller
- interchanger
- migration
- node
- algorithm
- 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
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/14—Network analysis or design
- H04L41/145—Network analysis or design involving simulating, designing, planning or modelling of a network
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/14—Network analysis or design
- H04L41/147—Network analysis or design for predicting network behaviour
-
- 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
-
- 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/127—Avoiding congestion; Recovering from congestion by using congestion prediction
-
- 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/24—Traffic characterised by specific attributes, e.g. priority or QoS
-
- 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/29—Flow control; Congestion control using a combination of thresholds
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/50—Overload detection or protection within a single switching element
- H04L49/501—Overload detection
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a kind of based on the dynamic Switch moving method for improving Dijkstra's algorithm, the loading condition of subsequent time can be predicted so that it is determined that target controller and migration trigger timing by load prediction module, it reduces unnecessary migration, and determines and move out, target controller and migration opportunity.Dynamic Switch migration algorithm by improving Dijkstra's algorithm obtains minimum cost migration path, according to the load condition of controller, and the traffic prioritization of interchanger to be migrated determines optimal migration interchanger set, by isolated node Processing Algorithm, the isolated node occurred in transition process is solved.The method ensure that controller has preferable performance after migration, migration cost is reduced, while guaranteeing that critical flow by priority processing, reduces the controller response time, improves the performance of controller.
Description
Technical field
The invention belongs to technical field of communication network, it is related to a kind of interchanger based on improved Dijkstra's algorithm and moves
Shifting method.
Background technique
Software defined network (Software Defined Network, SDN) be it is a kind of transmission separated with control, software can
The new network architectural framework of programming and centerized fusion is used to solve the problems, such as that current network structure ossifys by industry.
But when SDN is deployed in large scale network, centerized fusion plane can face very big challenge, and control
Changes in flow rate cannot be adapted dynamically between device and interchanger, to will lead to load imbalance on controller.How control is protected
Device processed, especially backbone controller improve the safety of SDN network control plane, are one ten from security threat and attack
Divide important problem.In the SDN network based on OpenFlow agreement, work as when there is no entry that can match in the flow table of interchanger
When preceding flow, interchanger will send Packet_In data packet to controller and carry out request route information, however the mechanism may be attacked
The person of hitting utilizes, and launches a offensive to controller, enables the even system crash of controller overload, or even can result in the cascade event of controller
Barrier.Backbone controller is the core of SDN network, can receive the request more from interchanger, handles a large amount of message, this
So that they are easier to be identified or swallowed up by malicious traffic stream by malicious attacker.In order to protect backbone controller, make its be difficult to by
The flow of backbone controller is moved to other controllers by interchanger migration algorithm by identification, is reduced backbone controller and is known
A possibility that not attacked, while the load between controller being made as to reach balanced as possible
Summary of the invention
To solve the above problems, the present invention provides a kind of based on the interchanger migration side for improving Dijkstra's algorithm
Method.Minimum cost migration path is obtained by improved Dijkstra's algorithm, according to the load condition of controller, and wait move
The traffic prioritization changed planes is transferred to determine optimal migration interchanger set, solves issuable isolated section in transition process
Point problem.Controller has preferable performance after ensuring to migrate, and reduces migration number, migrates cost, while guaranteeing critical flow quilt
Priority processing.
Realize this method model include four modules: flow statistical module, volume forecasting module, policy decision module and
Stream and action management module.
Flow statistical module: the module assesses current controller to receive and count the flow information from interchanger
Flow load, and judge current controller in monitoring time section, whether integrated flux is more than the preset threshold of network administrator
Value.In order to ensure the accuracy and real-time of network state information, flow statistical module need periodically to status information into
Row is collected.By Open Flow agreement, by the flow information of switch port, flow entry information and characteristic parameter information conduct
Object realizes the acquisition of data.The acquisition methods of flow statistical module critical data.In Open Flow agreement, controller is logical
Single stream request message is crossed, multithread request message, flow table statistical message, port statistics request and queue request message etc. are handed over to realize
The inquiry of current state of changing planes, and the one or more of request messages that interchanger can then reply are replied message to controller.
Port_Stats_Request message is sent to request the traffic statistics of switch port to interchanger by controller.
Volume forecasting module: volume forecasting module is to receive the flow information from flow statistical module, in conjunction with current
It is loaded with historic load information prediction future time instance controller, target controller and migration opportunity to be migrated is determined, to keep away
Exempt from frequent migration.Conventional method only determines whether to migrate by controller threshold value, is migrated as long as load is more than threshold value,
A large amount of migration cost can be generated in this way and can reduce the stability of system.For example it is more than threshold value that controller is at current time
, but next moment controller flow returns normally, migration at this time is unnecessary, and can generate and accordingly need not
The cost wanted.The load information that subsequent time is predicted using autoregression integral moving average model (ARIMA), in conjunction with past tense
The load information at quarter and the load information of present moment, adjust relevant parameter, pass through certain sample training system, realization pair
The volume forecasting of controller obtains load estimation matrix, then determines-target controller collection of moving out according to load estimation matrix
It closes, determines migration trigger timing.
Migration strategy decision-making module: nucleus module of the migration strategy decision-making module as defense schemes is responsible for according to network
Information, or the trigger request directly issued by network administrator according to current network demand are solved using corresponding model and tool
And the specific interchanger migration strategy of decision.Migration strategy decision-making module is the core of entire migration models, and this method proposition is based on
Improve the dynamic Switch migration algorithm of Dijkstra's algorithm.Minimum cost is obtained by improved Dijkstra's algorithm to move
Path is moved, optimal migration interchanger is determined according to the traffic prioritization of the load condition of controller and interchanger to be migrated
Gather, issuable isolated node problem in transition process.It is likely to result in when migrating some or certain interchangers isolated
Node problems, the exchange opportunity in isolated node request this domain and target domain controller simultaneously, bring burden to two controllers,
By the isolated node Processing Algorithm of proposition, the isolated node occurred in transition process is solved.
Stream and action management module: stream is with action management module to receive the specific migration plan from policy decision module
Slightly, and it is responsible for sending specific strategy to datalink layer switch, realizes interchanger transition process.
A kind of interchanger moving method based on improvement Dijkstra's algorithm comprising following steps:
S1: pass through Open Flow agreement, by the flow information of switch port, flow entry information and characteristic parameter information
As object, the acquisition of data is realized.In Open Flow agreement, controller is disappeared by single stream request message, multithread request
Breath, flow table statistical message and port statistics request and queue request message etc. realize the inquiry of interchanger current state, and hand over
It changes planes, the one or more of request messages that can be replied are replied message to controller.It is sent by controller to interchanger
Port_Stats_Request message requests the traffic statistics of switch port.
S2: the load information of subsequent time, the table of model are predicted using autoregression integral moving average model (ARIMA)
It is φ (B) (1-B) up to formuladXt=θ (B) εt, wherein p is Autoregressive, and q is moving average order, when d is is sequence stationary
The difference number done.B is lag operator, φ (B)=1- φ1B-φ2B2-φ3B3-···-φpBp, θ (B)=1- θ1B-θ2B2-θ3B3-···-θpBp。εtIt is to indicate model in the error of t moment.It is existing using the load information of last time as input
Relevant parameter is adjusted as output in the load information at moment, and obtains different input information by study and test
Respective load information realizes the volume forecasting to controller using respective algorithms by certain sample training system.
S3:ARIMA modeling takes calculus of differences for non-stationary series firstly the need of the stationarity for judging analyzed data
Remove its trend or periodicity, then determines the auto-regressive parameter p and sliding average parameter q of data, specific modeling and prediction
Process are as follows:
S31 detects the stationarity of analyzed data using Dickey-fowler method of inspection；
S32 data tranquilization: difference d times, if the steady d of data is 0；
S33 Parameter analysis: acquiring ACF and PACF curve respectively, observes and judges fitting effect degree of closeness according to AIC,
Determine p, q；
S34 constructs model: parameter obtained above being constructed ARIMA (p, d, q) model, obtained by flow statistical module
Data on flows training detection；
S35 forecast analysis.
Further, controller load estimation matrix is determined according to prediction model, is then determined according to load estimation matrix
It moves out-target controller set, and migration trigger timing.
Further, controller state is judged according to controller loading condition, obtains controller of moving out, while passing through prediction
Model come obtain target controller and migration opportunity.A minimum cost migration is obtained by improved Dijkstra's algorithm
Path.
Further, in transition process, in addition to consider migrating cost and load balancing degrees, it is also contemplated that class of traffic
Not, it needs for critical flow to be placed in higher migration priority.In order to guarantee that critical flow can be passed through by priority processing, this method
Flow is identified, priority is divided, makes different stream that there is different migration priority.It can be accomplished by DPI application
Realize the identification to service traffics, DPI is matched according to the feature string of known load, thus by data flow with specific
Business association is got up.Wherein feature string is to rely on used application layer feature database.
Further, by node selection algorithm, the group of switches of highest priority is selected to move to target controller section
Point, node select permeability are really dynamic programming problems, and the target of optimization is: under the limitation of total capacity, the node of selection
Priority it is maximum.
Further, by isolated node Processing Algorithm, solve the problems, such as the isolated node generated in transition process this.It is lonely
Exchange opportunity in vertical node requests this domain and target domain controller simultaneously, brings burden to two controllers, and part is isolated
Node and destination node migrate together as logical node, can solve part isolated node, and not every isolated node all may be used
It is moved in target controller domain together with being followed by target switch node.Pass through node selection algorithm
From the controller node of moving out in figure, all of its neighbor vertex V of the node is successively accessed firsti1, Vi2...,
Vin, then press the precedence that these vertex are accessed and successively access and their adjacent all not visited vertex, repetition
This process, until all vertex are accessed.Breadth first traversal spanning tree is thus obtained.To destination node in tree
The position difference of appearance makes different processing.
There will be two kinds of situations for destination node: 1) leaf node is then not in isolated node, is directly deleted.If 2)
If non-leaf nodes destination node has the brotgher of node, the child of the node, which is connected to its brotgher of node, not to be had, then is connected
To its father node.
The mapping relations of controller role and controller and interchanger are updated after the completion of migration.
Detailed description of the invention
Fig. 1 is structural schematic diagram of the invention.
Fig. 2 is migration algorithm flow chart.
Fig. 3 is isolated node comparison diagram.
Fig. 4 is transition process figure.
Specific embodiment
Below with reference to specific embodiment shown in the drawings, the present invention will be described in detail.
Fig. 1 be the present invention is based on the interchanger moving method model schematic for improving Dijkstra's algorithm, including it is following
Step:
S1 passes through Open Flow agreement, by the flow information of switch port, flow entry information and characteristic parameter information
As object, the acquisition of data is realized.
S11 sends Port_Stats_Request message to interchanger to request the flow of switch port by controller
Statistical information.
S2 predicts the load information of subsequent time, the table of model using autoregression integral moving average model (ARIMA)
It is φ (B) (1-B) up to formuladXt=θ (B) εt, wherein p is Autoregressive, and q is moving average order, when d is is sequence stationary
The difference number done.B is lag operator, φ (B)=1- φ1B-φ2B2-φ3B3-···-φpBp, θ (B)=1- θ1B-θ2B2-θ3B3-···-θpBp.Using the load information of last time as input, the load information of present moment is adjusted as output
Whole relevant parameter, and so that different input information is obtained corresponding load information by study and test, pass through certain sample
Volume forecasting of the corresponding algorithm realization to controller can be used in this training system.
S21:ARIMA modeling takes difference to transport non-stationary series firstly the need of the stationarity for judging analyzed data
Its trend or periodicity are removed in calculation, then determine the auto-regressive parameter p and sliding average parameter q of data, specifically model and pre-
Flow gauge are as follows:
S211 detects the stationarity of analyzed data using Dickey-fowler method of inspection；
S212 data tranquilization: difference d times, if the steady d of data is 0；
S213 Parameter analysis: acquiring ACF and PACF curve respectively, observes and judges fitting effect degree of closeness according to AIC,
Determine p, q；
S214 constructs model: parameter obtained above being constructed ARIMA (p, d, q) model, obtained by flow statistical module
The data on flows training detection arrived；
S215 forecast analysis.
S22 determines controller load estimation matrix according to prediction model, then determines-mesh of moving out according to load estimation matrix
Mark controller set, and migration trigger timing.
Flow chart of the Fig. 2 based on the interchanger migration algorithm for improving Dijkstra's algorithm, specifically includes:
S1 is based on improved Di Jiesitela minimal cost path algorithm.
S11 constructs valuation functions f (n)=g (n)+h (n), and h (n) represents the estimation expense from current point n to target point, i.e.,
Heuristic function.It is indicated from starting point to current point path length with g (n), i.e., from starting point to the expense of current point n.
S12 while relaxation: relaxation when s- > w mean first to check the shortest path from s to w whether be first from s- > v, then
By v- > w, if it is, updating.
S13 uses heuristic search, and valuation functions f (n) is indicated with D [v] herein, and current point is added in function
To Euclidean distance D [v]=d [v]+distance (v, t) of terminal.If D [w] > d [v]+e (v, w)+distance (w, t)),
Then update D [w] are as follows: D [w]=d [v]+e (v, w)+distance (w, t)) because d [w] is initial point s- > w path length, at this time
Another endpoint of side e (v, w) is v, and the relaxation side is s- > v and v- > w,D [w]=D [v]-
Distance (v, t)+e (v, w)+distance (w, t)) it is improvement to dijkstra's algorithm, i.e. heuristic search improves.
The direction of search is searched for generally towards terminal direction at this time, and guarantees to obtain an optimal path.
Its weight of S14 is defined as cost caused by migration interchanger, and cost definition here mainly consists of three parts:
(i) message exchange cost；(ii) load increases cost；(iii) rule deployment cost.W=rmc+rlc+rrc。
(i) message exchange cost rmc: migration request by different interchanger message transmissions to target controller, therefore the mistake
It is as follows that journey will generate message exchange cost.
Wherein, ε is the average communication rate of interchanger, hi,rIndicate interchanger i
Hop count between controller r.xirAnd xjkRespectively indicate controller CrAnd CkThe connection relationship of device within the domain.trkIndicate controller
CrInterchanger and target controller C in domainkTime delay summation.
(ii) load increases cost rlc:WhereinIt is interchanger SkIt sends
Packet-In quantity,Indicate interchanger SiTo controller CkBetween hop count.
(iii) rule deployment cost rrc
When selecting the interchanger to be migrated, flow_mod rule must be deployed in this interchanger by controller in domain.
Therefore, shown in rule deployment cost is defined as follows.
rrc=δrule·hir·xir, wherein δruleIt is the flow_mod data package size that controller is sent.
S2 belongs to the telephone net node for controller area of moving out for migrating the selection of node on above-mentioned minimal cost path
It is added in node set MigNode { } to be selected, and the node in set is judged, judges to migrate target switch node
Whether isolated node will appear.The isolated node and target switch node of appearance are formed a logical node, and by this
A logical node is added wait select in node set.
S21 determines traffic prioritization, and migration priority is directly proportional to migration factor, since the higher numerical value of priority is smaller,
So the priority pri with flow is inversely proportional
S22 calculates the receptible flow LC of target controllerin, LCinIt is defined as target controller load and control plane
The difference of the load mean value of controller,
S23, node select permeability are really dynamic programming problems, and the target of optimization is: under the limitation of total capacity, choosing
The priority for the node selected is maximum.
(1) case study:
Stage: in preceding i telephone net node, several nodes is selected to be added in set MigNode { } to be migrated.
State: in preceding i telephone net node, the set to be migrated that selects several nodes that remaining load space is added as c
Greatest priority obtained in MigNode { }.
Decision；I-th of telephone net node whether is selected to be added in set MigNode { } to be migrated.
(2) state transition equation:
After if F (i, j) indicates that preceding i telephone net node is added in the set to be migrated that load capacity is j, occupied maximum
Priority then has
Wherein, (0, j)=0 F；Load [i] indicates the load of i-th of node, and Pri [i] indicates that the migration of i-th of node is excellent
First grade.
S3, the processing for isolated node, by the above method using part isolated node and destination node as logic section
Point migrates together, solves part isolated node, and not every isolated node can be followed by target switch node together
It moves in target controller domain.The interchanger in isolated node not being solved such as Fig. 3 can ask simultaneously after the completion of migration
This domain and target domain controller are asked, burden is brought to two controllers, reduces controller performance, is one urgently to be resolved and asks
Topic.
S31 successively accesses all of its neighbor vertex V of the node from the controller node of moving out in figure firsti1,
Vi2..., Vin, then press the precedence that these vertex are accessed and successively access and their adjacent all not visited tops
Point repeats this process, until all vertex are accessed.Breadth first traversal spanning tree is thus obtained.
S32 is stored with child_slibing notion,
There will be two kinds of situations for S33 destination node: 1. leaf nodes are then not in isolated node, are directly deleted.2. such as
If fruit non-leaf nodes destination node has the brotgher of node, the child of the node, which is connected to its brotgher of node, not to be had, then is connected
It is connected to its father node.
Although not each embodiment only includes it should be appreciated that this specification is described according to embodiment
One independent technical solution, for the sake of this narrating mode of specification is just for the sake of understanding, those skilled in the art is answered
When considering the specification as a whole, the technical solution in each embodiment can also be appropriately combined, according to art technology
The understanding of personnel is implemented.
A series of detailed description illustrating only for feasible embodiment of the invention of those listed above,
They are not intended to limit protection scope of the present invention, all without departing from equivalent implementations made by invention skill spirit or change
More it should all be included in the protection scope of the present invention.
Claims (7)
1. a kind of based on the interchanger moving method for improving Dijkstra's algorithm, it is characterised in that: include the following steps,
S1: by Open Flow agreement, by the flow information of switch port, flow entry information and characteristic parameter information conduct
Object realizes the acquisition of data；In Open Flow agreement, controller flows request message, multithread request message, stream by single
The inquiry of interchanger current state is realized in table statistical message and port statistics request with queue request message, and interchanger then can
The one or more of request messages replied are replied message to controller；Port_ is sent to interchanger by controller
Stats_Request message requests the traffic statistics of switch port；
S2: moving average model ARIMA is integrated using autoregression to predict the load information of subsequent time, the expression formula of model is
φ(B)(1-B)dXt=θ (B) εt, wherein p is Autoregressive, and q is moving average order, is done when d is sequence stationary
Difference number；B is lag operator, φ (B)=1- φ1B-φ2B2-φ3B3-…-φpBp, θ (B)=1- θ1B-θ2B2-θ3B3-…-
θpBp；εtIt is to indicate model in the error of t moment；Using the load information of last time as input, the load information of present moment
As output, relevant parameter is adjusted, and so that different input information is obtained respective load information by study and test, is passed through
Certain sample training system realizes the volume forecasting to controller using respective algorithms；
S3:ARIMA modeling takes calculus of differences to remove non-stationary series firstly the need of the stationarity for judging analyzed data
Then its trend or periodicity determine the auto-regressive parameter p and sliding average parameter q of data, specific modeling and pre- flow gauge
Are as follows:
S31 detects the stationarity of analyzed data using Dickey-fowler method of inspection；
S32 data tranquilization: difference d times, if the steady d of data is 0；
S33 Parameter analysis: acquiring ACF and PACF curve respectively, observes and judges fitting effect degree of closeness according to AIC, determines
p,q；
S34 constructs model: parameter obtained above is constructed into ARIMA (p, d, q) model, it is obtained with flow statistical module
Data on flows training detection；
S35 forecast analysis.
2. according to claim 1 a kind of based on the interchanger moving method for improving Dijkstra's algorithm, feature exists
In: controller load estimation matrix is determined according to prediction model ,-target controller of moving out then is determined according to load estimation matrix
Set, and migration trigger timing.
3. according to claim 1 a kind of based on the interchanger moving method for improving Dijkstra's algorithm, feature exists
In: controller state is judged according to controller loading condition, obtains controller of moving out, while target is obtained by prediction model
Controller and migration opportunity；A minimum cost migration path is obtained by improved Dijkstra's algorithm.
4. according to claim 1 a kind of based on the interchanger moving method for improving Dijkstra's algorithm, feature exists
In: in transition process, except migration cost and load balancing degrees are considered, it is also contemplated that traffic classes, need for critical flow to be placed on
In higher migration priority；By being identified to flow, priority is divided, different stream is made to have different migrations preferential
Grade；It can accomplish to realize the identification to service traffics by DPI application, DPI is according to the progress of the feature string of known load
Match, so that data flow be got up with specific business association；Feature string is to rely on used application layer feature database.
5. according to claim 1 a kind of based on the interchanger moving method for improving Dijkstra's algorithm, feature exists
In: by node selection algorithm, the group of switches of highest priority is selected to move to target controller node, node select permeability
The target of really dynamic programming problems, optimization is, under the limitation of total capacity, the priority of the node of selection is maximum.
6. according to claim 1 a kind of based on the interchanger moving method for improving Dijkstra's algorithm, feature exists
In: by isolated node Processing Algorithm, solve the problems, such as the isolated node generated in transition process this；Exchange in isolated node
Chance requests this domain and target domain controller simultaneously, burden is brought to two controllers, by part isolated node and destination node
It is migrated together as logical node, part isolated node can be solved, not every isolated node can be followed by target friendship
Node of changing planes is moved to together in target controller domain；
From controller node of moving out, all of its neighbor vertex V of the node is successively accessed firsti1, Vi2..., Vin, then press this
The accessed precedence in a little vertex successively accesses and their adjacent all not visited vertex, repeats this process, directly
Until all vertex are accessed；Thus obtain breadth first traversal spanning tree；The position occurred to destination node in tree
Difference makes different processing.
7. a kind of interchanger moving method based on improved Dijkstra's algorithm according to claim 1, feature
It is, controller state is judged according to controller loading condition, obtains controller of moving out, while mesh is obtained by prediction model
Mark controller and migration opportunity；A minimum cost migration path, weight are obtained by improved Dijkstra's algorithm
It is defined as cost caused by migration interchanger, cost definition here consists of three parts: (i) message exchange cost；(ii)
Load increases cost；(iii) rule deployment cost；W=rmc+rlc+rrc；
(i) message exchange cost rmc: migration request by different interchanger message transmissions to target controller, therefore the process will
It is as follows to generate message exchange cost；
Wherein, ε is the average communication rate of interchanger, hi,rIndicate interchanger i to control
Hop count between device r processed；xirAnd xjkRespectively indicate controller CrAnd CkThe connection relationship of device within the domain；trkIndicate controller CrDomain
Interior interchanger and target controller CkTime delay summation；
(ii) load increases cost rlc:WhereinIt is interchanger SkIt sends
Packet-In quantity,Indicate interchanger SiTo controller CkBetween hop count；
(iii) rule deployment cost rrc
When selecting the interchanger to be migrated, flow_mod rule must be deployed in this interchanger by controller in domain；Therefore,
Shown in rule deployment cost is defined as follows；
rrc=δrule·hir·xir, wherein δruleIt is the flow_mod data package size that controller is sent.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910681398.2A CN110505154B (en) | 2019-07-26 | 2019-07-26 | Switch migration method based on improved Dijkstra algorithm |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910681398.2A CN110505154B (en) | 2019-07-26 | 2019-07-26 | Switch migration method based on improved Dijkstra algorithm |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110505154A true CN110505154A (en) | 2019-11-26 |
| CN110505154B CN110505154B (en) | 2022-06-07 |
Family
ID=68587308
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910681398.2A Active CN110505154B (en) | 2019-07-26 | 2019-07-26 | Switch migration method based on improved Dijkstra algorithm |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110505154B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113556327A (en) * | 2021-06-29 | 2021-10-26 | 中国人民解放军战略支援部队信息工程大学 | Block chain-based false flow rule injection attack detection and prevention system and method |
| CN114143209A (en) * | 2021-11-08 | 2022-03-04 | 浙江大学 | System and method for controlling elastic expansion of channel in network measurement |
| CN114338537A (en) * | 2021-12-29 | 2022-04-12 | 安徽大学 | SDN load balancing dual-weight switch migration method and system based on prediction |
| WO2022116957A1 (en) * | 2020-12-02 | 2022-06-09 | 中兴通讯股份有限公司 | Algorithm model determining method, path determining method, electronic device, sdn controller, and medium |
| CN115086237A (en) * | 2021-03-11 | 2022-09-20 | 海信集团控股股份有限公司 | Switch migration method and controller |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105516184A (en) * | 2015-12-31 | 2016-04-20 | 清华大学深圳研究生院 | Increment deployment SDN network-based method for defending link flooding attack |
| US20170093924A1 (en) * | 2015-09-29 | 2017-03-30 | The Trustees Of The University Of Pennsylvania | Methods, systems, and computer readable media for generating software defined networking (sdn) policies |
| CN107276794A (en) * | 2017-06-02 | 2017-10-20 | 重庆邮电大学 | Interchanger migration algorithm in a kind of software defined network |
| CN108650131A (en) * | 2018-05-10 | 2018-10-12 | 合肥工业大学 | The processing system disposed for multi-controller in SDN network |
| CN109508788A (en) * | 2018-11-12 | 2019-03-22 | 电子科技大学 | A kind of SDN method for predicting based on arma modeling |
-
2019
- 2019-07-26 CN CN201910681398.2A patent/CN110505154B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20170093924A1 (en) * | 2015-09-29 | 2017-03-30 | The Trustees Of The University Of Pennsylvania | Methods, systems, and computer readable media for generating software defined networking (sdn) policies |
| CN105516184A (en) * | 2015-12-31 | 2016-04-20 | 清华大学深圳研究生院 | Increment deployment SDN network-based method for defending link flooding attack |
| CN107276794A (en) * | 2017-06-02 | 2017-10-20 | 重庆邮电大学 | Interchanger migration algorithm in a kind of software defined network |
| CN108650131A (en) * | 2018-05-10 | 2018-10-12 | 合肥工业大学 | The processing system disposed for multi-controller in SDN network |
| CN109508788A (en) * | 2018-11-12 | 2019-03-22 | 电子科技大学 | A kind of SDN method for predicting based on arma modeling |
Non-Patent Citations (2)
| Title |
|---|
| 赖英旭等: ""工业控制系统入侵检测研究综述"", 《通信学报》 * |
| 赖英旭等: ""工业控制系统入侵检测研究综述"", 《通信学报》, vol. 38, no. 2, 28 February 2017 (2017-02-28), pages 143 - 156 * |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2022116957A1 (en) * | 2020-12-02 | 2022-06-09 | 中兴通讯股份有限公司 | Algorithm model determining method, path determining method, electronic device, sdn controller, and medium |
| CN115086237A (en) * | 2021-03-11 | 2022-09-20 | 海信集团控股股份有限公司 | Switch migration method and controller |
| CN113556327A (en) * | 2021-06-29 | 2021-10-26 | 中国人民解放军战略支援部队信息工程大学 | Block chain-based false flow rule injection attack detection and prevention system and method |
| CN114143209A (en) * | 2021-11-08 | 2022-03-04 | 浙江大学 | System and method for controlling elastic expansion of channel in network measurement |
| CN114143209B (en) * | 2021-11-08 | 2022-10-21 | 浙江大学 | System and method for controlling elastic expansion of channel in network measurement |
| CN114338537A (en) * | 2021-12-29 | 2022-04-12 | 安徽大学 | SDN load balancing dual-weight switch migration method and system based on prediction |
| CN114338537B (en) * | 2021-12-29 | 2024-01-19 | 安徽大学 | SDN load balancing dual-weight switch migration method and system based on prediction |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110505154B (en) | 2022-06-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110505154A (en) | A kind of interchanger moving method based on improved Dijkstra's algorithm | |
| CN109981691B (en) | SDN controller-oriented real-time DDoS attack detection system and method | |
| CN106059811B (en) | Communication system, control device, packet forwarding path control method | |
| CN106105115B (en) | Method, medium and the device of service chaining for being originated by service node | |
| CN104580027B (en) | A kind of OpenFlow message forwarding methods and equipment | |
| CN102523166B (en) | Structured network system applicable to future internet | |
| CN103858386B (en) | For performing the method and apparatus for wrapping classification by the decision tree of optimization | |
| CN106961387B (en) | Link type DDoS defense method and system based on forwarding path self-migration | |
| CN109644141A (en) | Method and system for visual network | |
| CN104662847A (en) | Gateway apparatus and data processing method | |
| CN104521199A (en) | Adaptive infrastructure for distributed virtual switch | |
| CN103346922A (en) | Controller for determining network state based on SDN (Software Defined Networking) and determination method thereof | |
| CN105791151B (en) | A kind of dynamic flow control method and device | |
| CN109995650A (en) | Path calculation method and device under Multi-dimensional constraint based on SDN network | |
| CN108011894A (en) | Botnet detecting system and method under a kind of software defined network | |
| CN112350948A (en) | SDN-based distributed network tracing system and method | |
| Zhao et al. | An improved ant colony optimization for communication network routing problem | |
| CN115622903A (en) | Telecommunication network node importance calculation method based on network structure | |
| Zhang et al. | A stochastic Petri net-approach to modeling and analysis of ad hoc network | |
| CN115442275A (en) | Hybrid telemetry method and system based on hierarchical trusted streams | |
| CN114024747A (en) | Security service chain arranging and deploying method and system based on software defined network virtualization (NFV) | |
| Akem et al. | Jewel: Resource-efficient joint packet and flow level inference in programmable switches | |
| CN114401516A (en) | 5G slice network anomaly detection method based on virtual network traffic analysis | |
| CN117201365A (en) | Flow determination method, device, electronic equipment and storage medium | |
| CN103916321B (en) | The method and apparatus for defining the look-up tables'implementation of the network element of software defined network |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |