CN108306822A - A kind of flow table merging method suitable for software defined network - Google Patents
A kind of flow table merging method suitable for software defined network Download PDFInfo
- Publication number
- CN108306822A CN108306822A CN201810015804.7A CN201810015804A CN108306822A CN 108306822 A CN108306822 A CN 108306822A CN 201810015804 A CN201810015804 A CN 201810015804A CN 108306822 A CN108306822 A CN 108306822A
- Authority
- CN
- China
- Prior art keywords
- flow table
- flow
- tables
- sip
- dip
- 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/54—Organization of routing tables
-
- 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/74—Address processing for routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L61/00—Network arrangements, protocols or services for addressing or naming
- H04L61/09—Mapping addresses
- H04L61/25—Mapping addresses of the same type
- H04L61/2503—Translation of Internet protocol [IP] addresses
- H04L61/2557—Translation policies or rules
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L61/00—Network arrangements, protocols or services for addressing or naming
- H04L61/50—Address allocation
- H04L61/5046—Resolving address allocation conflicts; Testing of addresses
Abstract
The invention discloses a kind of flow table merging methods suitable for software defined network, for the consolidation problem of the flow table of Different Strategies conversion, devise a kind of two benches flow table merging algorithm converted based on application layer strategy, flow table from same strategy or Different Strategies conversion is judged, flow table is merged when meeting merging condition, to reduce the quantity of flow table, the storage burden for alleviating bottom switch to a certain extent, solves the problems, such as bottom switch memory space inadequate.
Description
Technical field
The present invention relates to a kind of flow table merging methods suitable for software defined network, belong to network architecture flow control skill
Art field.
Background technology
Software defined network (Software DefinedNetwork, SDN), is a kind of Novel net proposed by Emulex
Network innovates framework, and core technology OpenFlow is by separating network equipment control plane with data surface, to realize
The flexible control of network flow provides good platform for the innovation of core network and application.
The design and use of flow table (Flow Table) are the cores of Openflow technologies.Not with SDN network scale
Disconnected to expand, the quantity of flow table will be incremented by with series, be caused the storage of bottom switch to be born and be sharply increased.Therefore, how to reduce
Flow table quantity is always urgent problem in SDN network.
The deployment scheme of mainstream is all that corresponding application layer strategy is realized using controller at present, i.e., by each application layer
Strategy is converted into the rudimentary rule that bottom switch can identify, these rudimentary rules are stored in bottom exchange in the form of flow table
It is large number of due to flow table in machine, the memory space in a large amount of bottom switch is occupied, therefore make to bottom switch
The problem of being born at heavier storage, and then resulting in bottom switch memory space inadequate.
Invention content
The present invention provides a kind of flow table merging method suitable for software defined network, the technical problem to be solved is that
The quantity for reducing flow table, mitigates the storage burden of bottom switch.
The present invention in order to solve the above technical problems, and uses following technological means：
A kind of flow table merging method suitable for software defined network proposed by the present invention comprising following steps：
(1) different controllers is numbered, when wherein a controller is converted into flow table to a strategy process,
The number of the controller is recorded in flow table；
(2) judge whether two flow tables come from same policy by number：
If two flow tables are from same policy and merge threshold value of the parameter more than or equal to setting, two flow tables
Merge；
If two flow tables come from Different Strategies and two strategies do not conflict, while merging parameter and being more than or equal to setting
Threshold value, then two flow tables are merged.
Further, flow table merging method proposed by the invention, calculate merge parameter the step of be：
(1) remember that a flow table is F1, then m flow table item for including in this flow table be expressed as：F1={ a1, a2……am, m ＞
1 }, similarly, remember that another flow table is F2, then n flow table item for including in this flow table be expressed as：F2={ b1, b2……bn, n ＞
1}；
(2) remember that the addresses source host ip of each flow table item are sip, the addresses destination host ip of each flow table item are dip, will
F1And F2In each flow table item compare successively, if amAnd bnThe addresses source host ip it is equal, then be denoted as amSip=bn·
Sip, if amAnd bnThe addresses destination host ip it is equal, then be denoted as amDip=bn·dip；
(3) parameter will be merged and is denoted as M, then the numerical value of M is flow table F1And F2There are a after comparisonm.sip=bn·sip
And amDip=bnThe number of dip situations.
Further, flow table merging method proposed by the invention, the calculation formula of threshold value are：
O=Min (m, n) × 2/3,
Wherein O is threshold value.
Further, flow table merging method proposed by the invention, if the source host of each flow table item of two flow tables
The set equality of the addresses ip sip, and the set of destination host ip address dip is also equal, then assert that this two flow tables are not present
Policy conflict can merge.
Compared with prior art, the present invention the technique effect having is：
The present invention merges the similar flow table of same strategy or Different Strategies conversion, reduces the number of flow table
Amount alleviates the storage burden of bottom switch, solves the problems, such as bottom switch memory space inadequate to a certain extent.
Description of the drawings
Fig. 1 is the application layer strategy conversion plan of the present invention.
Fig. 2 is the algorithm flow schematic diagram of the present invention.
Specific implementation mode
Technical scheme of the present invention is described in further detail below in conjunction with the accompanying drawings：
Those skilled in the art of the present technique are it is understood that unless otherwise defined, all terms used herein (including skill
Art term and scientific terminology) there is meaning identical with the general understanding of the those of ordinary skill in fields of the present invention.Also
It should be understood that those terms such as defined in the general dictionary should be understood that with in the context of the prior art
The consistent meaning of meaning, and unless defined as here, will not be explained with the meaning of idealization or too formal.
The rudimentary rule of high-level policy conversion is sent to respective switch in the form of flow table, and exchange is stored in a plurality of flow table
It needs to carry out first stage judgement to flow table before in machine, determines whether two flow tables come from same high-level policy, if the two
It is higher to merge parameter, then carries out first stage flow table merging.All pass through the judgement of first stage etc. all flow tables and merges it
Afterwards, second stage judgement is carried out：Two flow tables are judged whether from different high-level policies, if two flow tables are determined from not
Same high-level policy then judges that two flow tables whether there is policy conflict again, if policy conflict is not present in two flow tables, calculates
The merging parameter of two flow tables carries out second stage flow table merging if merging parameter is higher.Two benches will finally be passed through to judge
It is stored in bottom switch with a plurality of flow table after merging.
It is Algorithm Firststage to remember that first stage flow table merges algorithm, and step is：From being sent to same exchange
Two flow tables are randomly selected in a plurality of flow table of machine to be judged, if the controller id of two flow tables are inconsistent, are weighed
Newly two flow tables of selection are judged, until the numerical value of the controller id of two flow tables is equal, start to calculate two flow tables
Merging parameter M, if the value of M be more than or equal to setting threshold value, two flow tables are merged, if the value of M be less than set
Fixed threshold value then abandons flow table merging, and two flow tables of record cannot merge, and randomly choose two flow tables again and judged.
It is Algorithm Secondstage to remember that second stage flow table merges algorithm, and step is：From by the first stage
It randomly chooses two flow tables in a plurality of flow table after merging to be judged, if the number of the controller id of two flow tables
It is worth equal, then reselects two flow tables and judged, until the numerical value of the controller id of two flow tables is unequal, then
Two flow tables are from different high-level policies, if the source host ip address sets and destination host ip address sets of two flow tables
It is equal, then judge that policy conflict is not present in two flow tables, can merge, calculates the value of the merging parameter M of two flow tables, if
The value of M is more than or equal to the threshold value of setting, then merges two flow tables, if the value of M is less than the threshold value of setting, abandons flowing
Table merges, and two flow tables of record cannot merge, and randomly chooses two flow tables again and is judged.
The conversion of application layer strategy is that application layer strategy one by one is converted into the rudimentary rule that bottom switch can identify,
And rudimentary rule is stored in the form of flow table in bottom switch, as shown in Figure 1.One kind proposed by the present invention is suitable for
The flow table of software defined network merges algorithm, and algorithm flow schematic diagram is as shown in Fig. 2, specifically include：
It is as follows that first stage flow table merges algorithm Algorithm Firststage flows：
F：F={ F1, F2……FN, N ＞ 1 }, represent the set for the flow table for being sent to same interchanger；
F1, F2, F1,2：F1={ a1, a2……am, m ＞ 1 } and F2={ b1, b2……bn, n ＞ 1 } and it respectively represents in flow table collection
Two flow tables randomly selected in F are closed, a flow table includes m flow table item, and another flow table includes n flow table item, F1,2=
{c1, c2……cl, l ＞ 1 } and represent two flow table F1And F2Flow table after merging, this flow table include l flow table item；
id：The controller id for representing flow table, for distinguishing whether two flow tables come from same strategy；
sip：Represent the addresses source host ip in flow table item；
dip：Represent the addresses destination host ip in flow table item；
M：Represent the merging parameter of two flow tables；
O：O=Min (m, n) × 2/3 represents the threshold value that two flow tables can merge；
AlgorithmFirststage correlation pseudocodes are as follows：
It is as follows that second stage flow table merges algorithm Algorithm Secondstage flows：
F ＇：F ＇={ F ＇1, F '2……F′N, N ＞ 1 }, represent the flow table after first stage flow table merges algorithm process
Set；
F′1, F '2, F '1,2：F′1={ d1, d2……dm, m ＞ 1 } and F ＇2={ e1, e2……en, n ＞ 1 } and it respectively represents
Two flow tables randomly selected in flow table set F ', a flow table includes m flow table item, and another flow table includes n flow table
, F '1,2={ g1, g2……gl, l ＞ 1 } and represent two flow table F '1With F '2Flow table after merging, this flow table include l flow table
；
id：The controllerid for representing flow table, for distinguishing whether two flow tables come from same strategy；
sip：Represent the addresses source host ip in flow table item；
dip：Represent the addresses destination host ip in flow table item；
SIP：Represent the set of the addresses source host ip of flow table；
DIP：Represent the set of the addresses destination host ip of flow table；
M：Represent the merging parameter of two flow tables；
O：O=Min (m, n) × 2/3 represents the threshold value that two flow tables can merge；
AlgorithmSecondstage correlation pseudocodes are as follows：
The above is only some embodiments of the present invention, it is noted that for the ordinary skill people of the art
For member, various improvements and modifications may be made without departing from the principle of the present invention, these improvements and modifications are also answered
It is considered as protection scope of the present invention.
Claims (4)
1. a kind of flow table merging method suitable for software defined network, which is characterized in that include the following steps：
(1) different controllers is numbered, when wherein a controller is converted into flow table to a strategy process, in flow table
The middle number for recording the controller；
(2) judge whether two flow tables come from same policy by number：
If two flow tables are from same policy and merge threshold value of the parameter more than or equal to setting, two flow tables are closed
And；
If two flow tables come from Different Strategies and two strategies do not conflict, while merging the threshold that parameter is more than or equal to setting
Value then merges two flow tables.
2. flow table merging method according to claim 1, which is characterized in that calculate merge parameter the step of be：
(1) remember that a flow table is F1, then m flow table item for including in this flow table be expressed as：F1={ a1, a2……am, m ＞ 1 }, together
Reason remembers that another flow table is F2, then n flow table item for including in this flow table be expressed as：F2={ b1, b2……bn, n ＞ 1 }；
(2) remember that the addresses source host ip of each flow table item are sip, the addresses destination host ip of each flow table item are dip, by F1With
F2In each flow table item compare successively, if amAnd bnThe addresses source host ip it is equal, then be denoted as am.sip=bn.sip, if
amAnd bnThe addresses destination host ip it is equal, then be denoted as am.dip=bn·dip；
(3) parameter will be merged and is denoted as M, then the numerical value of M is flow table F1And F2There are a after comparisonmSip=bnAnd a .sipm·
Dip=bnThe number of dip situations.
3. flow table merging method according to claim 2, which is characterized in that the calculation formula of threshold value is：
O=Min (m, n) × 2/3,
Wherein O is threshold value.
4. flow table merging method according to claim 3, which is characterized in that if the source of each flow table item of two flow tables
The set equality of host ip address sip, and the set of destination host ip address dip is also equal, then assert this two flow tables not
There are policy conflicts, can merge.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810015804.7A CN108306822A (en) | 2018-01-08 | 2018-01-08 | A kind of flow table merging method suitable for software defined network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810015804.7A CN108306822A (en) | 2018-01-08 | 2018-01-08 | A kind of flow table merging method suitable for software defined network |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108306822A true CN108306822A (en) | 2018-07-20 |
Family
ID=62868473
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810015804.7A Pending CN108306822A (en) | 2018-01-08 | 2018-01-08 | A kind of flow table merging method suitable for software defined network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108306822A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109450798A (en) * | 2018-12-13 | 2019-03-08 | 郑州云海信息技术有限公司 | The management method and computer readable storage medium of routing table information |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104168209A (en) * | 2014-08-28 | 2014-11-26 | 杭州华三通信技术有限公司 | Multi-access SDN message forwarding method and controller |
| CN106254244A (en) * | 2016-07-28 | 2016-12-21 | 上海斐讯数据通信技术有限公司 | A kind of merging stream list item method based on SDN |
| WO2017152396A1 (en) * | 2016-03-09 | 2017-09-14 | 华为技术有限公司 | Flow table processing method and device |
-
2018
- 2018-01-08 CN CN201810015804.7A patent/CN108306822A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104168209A (en) * | 2014-08-28 | 2014-11-26 | 杭州华三通信技术有限公司 | Multi-access SDN message forwarding method and controller |
| WO2017152396A1 (en) * | 2016-03-09 | 2017-09-14 | 华为技术有限公司 | Flow table processing method and device |
| CN106254244A (en) * | 2016-07-28 | 2016-12-21 | 上海斐讯数据通信技术有限公司 | A kind of merging stream list item method based on SDN |
Non-Patent Citations (1)
| Title |
|---|
| 李东辉；俞俊；朱广新；王召；杨云飞: "基于应用层策略转换的两阶段流表合并算法", 《计算机应用与软件》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109450798A (en) * | 2018-12-13 | 2019-03-08 | 郑州云海信息技术有限公司 | The management method and computer readable storage medium of routing table information |
| CN109450798B (en) * | 2018-12-13 | 2022-07-12 | 郑州云海信息技术有限公司 | Method for managing routing table information and computer-readable storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104898592B (en) | A kind of generation method and electronic equipment of the rule that links | |
| Kesten et al. | The spread of a rumor or infection in a moving population | |
| CN109871828A (en) | Video frequency identifying method and identification device, storage medium | |
| CN109635165A (en) | Data summarization method, device, equipment and medium based on tree-like block chain network | |
| CN105630590B (en) | A kind of business information processing method and processing device | |
| CN106991713A (en) | Method and apparatus, medium, processor and the terminal of scene in more new game | |
| CN105511801B (en) | The method and apparatus of data storage | |
| WO2003013055A8 (en) | Methods and apparatus for storage and processing of routing information | |
| JPS5828953B2 (en) | Kokanmou Kumikaesouchi | |
| CN110059747A (en) | A kind of net flow assorted method | |
| CN108306822A (en) | A kind of flow table merging method suitable for software defined network | |
| CN107169566A (en) | Dynamic neural network model training method and device | |
| CN103200071A (en) | MTSP multiple-case calculating method and MTSP multiple-case calculating equipment | |
| CN108259334A (en) | A kind of equivalent route item establishing method and device | |
| Das et al. | An automated passive analog circuit synthesis framework using genetic algorithms | |
| CN108418752B (en) | A kind of creation method and device of aggregation group | |
| CN107846010B (en) | Power distribution network reconstruction method considering closed-loop constraint | |
| JPH0587867B2 (en) | ||
| CN106487889B (en) | A kind of task towards cloud data center and data aggregate dispositions method | |
| Obraztsova et al. | On swap-distance geometry of voting rules | |
| CN109646946B (en) | Chess and card game hosting method and device | |
| CN107528724A (en) | A kind of optimized treatment method and device of node cluster | |
| CN111931993A (en) | Power transmission network wiring diagram generation method and system | |
| CN105701419B (en) | A kind of data managing method and terminal device | |
| CN110211063A (en) | A kind of image processing method, device, electronic equipment and system |
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 | ||
| WD01 | Invention patent application deemed withdrawn after publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20180720 |