CN110166364A - A kind of software definition opportunistic network flow table update method based on practical Byzantine failure tolerance algorithm - Google Patents
A kind of software definition opportunistic network flow table update method based on practical Byzantine failure tolerance algorithm Download PDFInfo
- Publication number
- CN110166364A CN110166364A CN201910401829.5A CN201910401829A CN110166364A CN 110166364 A CN110166364 A CN 110166364A CN 201910401829 A CN201910401829 A CN 201910401829A CN 110166364 A CN110166364 A CN 110166364A
- Authority
- CN
- China
- Prior art keywords
- flow table
- interchanger
- interchangers
- forwarding
- content
- 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
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
- H04L45/021—Ensuring consistency of routing table updates, e.g. by using epoch numbers
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
- H04L45/023—Delayed use of routing table updates
Abstract
The software definition opportunistic network flow table update method based on practical Byzantine failure tolerance algorithm that the invention discloses a kind of sends initial flow table to be updated from control layer to all interchangers first；Then received initial flow table to be updated is forwarded by the first interchanger；After other interchangers receive the first flow table forwarded by the first interchanger, the content of first flow table is matched with the content that itself is received, successful match then continues to forward the first flow table to other interchangers, if the quantity for the first feedback information that certain interchanger receives is more than preset value, then the interchanger enters acknowledgement state, and itself state is forwarded to other interchangers, when the interchanger quantity for eventually entering into acknowledgement state is more than preset value, then each interchanger carries out the update of flow table.It is inconsistent that the present invention using the PBFT algorithm of block chain solves the problems, such as that flow table updates, it can also be ensured that flow table is reliably distributed, and has high fault-tolerance.
Description
Technical field
The present invention relates to field of computer technology, and in particular to a kind of software definition based on practical Byzantine failure tolerance algorithm
Opportunistic network flow table update method.
Background technique
As a kind of novel network structure, software definition opportunistic network has opportunistic network and software defined network
Double grading.Firstly, it is a kind of network structure of movable self-organization as opportunistic network, with tolerable structure clash
Feature, this is the important difference with traditional network.Self-organizing, network topology constantly change between non-stop layer node, mobile node
Limited with the storage capacity and the energy of mobile node is the most distinct characteristic of opportunistic network.It is different comprising several in opportunistic network
Node, these all nodes have certain communication range, and have certain characteristics of motion, the movement of different nodes
The attributes such as model, communication range may be different.These constantly mobile nodes constitute the basis of opportunistic network communication, section
Communications status can be kept in point moving process, constitutes the communication link of dynamic change.The node of opportunistic network is able to carry out message
Forwarding, when two nodes in the communication radius of other side due to that can not interact directly, then other nodes will be relied on
Mobile, carrying forwards to assist the two nodes to carry out indirect communication, this communication for just resulting in opportunistic network has randomness
And time delay.Secondly, as software defined network (SDN, Software Defined Network), it is by the closed net of tradition
The decoupling of network system is data plane, control plane and applies plane, by can logically realize in control plane programming
The centralized management of network environment, open and programmability is the most important feature of SDN.
Currently, SDN technology obtains in fields such as data center network, network virtualization, cloud computing and WLANs
It is widely applied, it is this to realize that network structure centralized control and the thought of data forwarding separation cause depth in academia in logic
Concern.SDN technology is independent from complicated embedded topological structure by the control plane of the network equipment, passes through software-driven
Central controller whole network topology is disposed, with opening, convenient and fast PLC technology plane instead of traditional
The control of system embedment formula, greatlies simplify the workflow of customer network management, CNM, provides good network programmability.
At least there is following technology in implementing the present invention, it may, the method for finding the prior art in present inventor
Problem:
Unique structure makes software definition opportunistic network have the feature of some protrusions, and such as: network topology dynamic is more
Change, the communication strategy of forwarded hop-by-hop, network more fragility itself etc..Authentication center and storage base since there is no centralization
It stands, compared to traditional fixed cable network, software definition opportunistic network is easier pseudo- by listening in information, node identities
It makes, the security threats such as data tampering and distributed denial of service attack.Also, flow table in software definition opportunistic network lose and
It updates inconsistence problems often to occur, it is weaker all to there is ineffective and scalability in existing flow table optimizing research scheme
Problem.
It follows that method in the prior art updates inconsistent technical problem there are flow table.
Summary of the invention
In view of this, the present invention provides a kind of software definition opportunistic network flow tables based on practical Byzantine failure tolerance algorithm
Update method is asked to solve or at least partly solve method in the prior art and update inconsistent technology there are flow table
Topic.
The software definition opportunistic network flow table update method based on practical Byzantine failure tolerance algorithm that the present invention provides a kind of,
Include:
Control layer in interchanger upper layer sends initial flow table to be updated to all interchangers；
Itself received initial flow table to be updated is transmitted to other interchangers by the first interchanger, wherein the first exchange
The content of machine forwarding is the first flow table；
After other interchangers in addition to the first interchanger receive the first flow table forwarded by the first interchanger, the friendship
It changes planes and matches the content for the flow table information that the content of the first flow table is received with itself, if successful match, to other
Interchanger continues to forward the first flow table, and the exchange opportunity collects and counts first of the forwarding from other remaining interchangers instead
Feedforward information, wherein the first feedback information indicates the set of the flow table information of other interchangers forwarding；
If the quantity of flow table is more than preset value in the first feedback information that certain interchanger receives, which enters
Acknowledgement state, and forward to other interchangers the state of itself, and the exchange opportunity collects the from other remaining interchangers
Two feedback informations, wherein the second feedback information indicates whether the interchanger enters acknowledgement state；
When the interchanger quantity for eventually entering into acknowledgement state is more than preset value, then each interchanger carries out the update of flow table.
In one embodiment, the method also includes when the interchanger quantity for eventually entering into acknowledgement state is not up to
When preset value, then update of each interchanger without flow table.
In one embodiment, the content of the flow table information itself received when the content of the first flow table and the interchanger
When identical, then successful match.
In one embodiment, the set of the flow table information of other interchangers forwarding includes except the first interchanger and itself
Except interchanger forwarding flow table information.
In one embodiment, the second feedback information adoption status parameter indicates whether interchanger enters acknowledgement state.
Said one or multiple technical solutions in the embodiment of the present application at least have following one or more technical effects:
A kind of software definition opportunistic network flow table update method based on practical Byzantine failure tolerance algorithm provided by the invention,
Initial flow table to be updated is sent to all interchangers from the control layer for being located at interchanger upper layer first；When interchanger receives just
Begin flow table to be updated, itself received initial flow table to be updated can be transmitted to other interchangers；When interchanger is by first
The content of flow table information that the content for the first flow table that interchanger is sent is received with itself is matched, when successful match, then
Continue to forward the first flow table to other interchangers, if the quantity of flow table is more than in the first feedback information that certain interchanger receives
Preset value, then the interchanger enters acknowledgement state, and the state of itself is forwarded to other interchangers, and the exchange opportunity is collected and
From the second feedback information of other remaining interchangers, wherein the second feedback information indicates whether the interchanger enters acknowledgement state；
When the interchanger quantity for eventually entering into acknowledgement state is more than preset value, then each interchanger carries out the update of flow table.
The present invention updates inconsistent problem for the flow table in software definition opportunistic network in the prior art, by block chain
PBFT algorithm (practical Byzantine failure tolerance algorithm) come solve flow table renewal process flow table update inconsistent and safety problem.It is logical
After crossing execution PBFT algorithm, when the interchanger quantity for eventually entering into acknowledgement state is more than preset value, each interchanger carries out flow table
Update, thereby may be ensured that all interchangers are updated according to unified rule.Even if having part in network structure to hand over
It changes planes or controller fails, still be able to guarantee that flow table is reliably distributed, there is high fault-tolerance.
Detailed description of the invention
In order to more clearly explain the embodiment of the invention or the technical proposal in the existing technology, to embodiment or will show below
There is attached drawing needed in technical description to be briefly described, it should be apparent that, the accompanying drawings in the following description is the present invention
Some embodiments for those of ordinary skill in the art without creative efforts, can also basis
These attached drawings obtain other attached drawings.
Fig. 1 is the software definition opportunistic network flow table update side based on practical Byzantine failure tolerance algorithm in the embodiment of the present invention
The flow chart of method；
Fig. 2 is PBFT algorithm principle figure used in the embodiment of the present invention；
Fig. 3 is the influence schematic diagram that error interchanger pair executes wheel number with algorithm in the embodiment of the present invention；
Fig. 4 is change curve schematic diagram of the forwarding by probability with malicious node in the embodiment of the present invention.
Specific embodiment
It is an object of the invention to update inconsistent technical problem there are flow table for method in the prior art, provide
A kind of software definition opportunistic network flow table update method based on practical Byzantine failure tolerance algorithm.
In order to make the object, technical scheme and advantages of the embodiment of the invention clearer, below in conjunction with the embodiment of the present invention
In attached drawing, technical scheme in the embodiment of the invention is clearly and completely described, it is clear that described embodiment is
A part of the embodiment of the present invention, instead of all the embodiments.Based on the embodiments of the present invention, those of ordinary skill in the art
Every other embodiment obtained without creative efforts, shall fall within the protection scope of the present invention.
Embodiment one
Present inventor is by largely practice discovery, often can frequent progress routing in software definition opportunistic network
Switching, traffic monitoring, load balancing etc. change the behavior of network state, this needs to change flow entry by interchanger just come logarithm
Difference processing is carried out according to packet, i.e. the flow table of SDN updates, and the old regular flow table on several interchangers is replaced with new regular flow
Table, this can generate two kinds as a result, first is that several interchangers all according to new rule or old rule process flow entry, second is that
Part interchanger receives the definition of new rule, and the Policy Updates of another part interchanger fail, and causes flow table to update different
It causes.
Thus, the invention proposes using the PBFT algorithm of block chain to solve the safety problem of flow table renewal process,
PBFT algorithm is the common scheme that distributed node message propagational reliability is solved in block chain, which can tolerate more
Node failure, even if there is part of nodes to break down or malicious dissemination spoofing, also can guarantee other normally can be received just
True message.
Software definition opportunistic network is that one kind is moved freely by node, is met at random to carry out the special net of message transmission
Network structure, it is logical to be formed with the route pattern of " storage-carrying-forwarding " independent of the complete routing between mobile node
Believe chance and hop-by-hop communication.But this communication mode also brings new problem.Software definition opportunistic network does not need building
There is fixed reliable transmission channel between two nodes of vertical communication, do not require network that there is connectivity, node it is random
The mobile unstability etc. for also resulting in communication.In secure context, software definition opportunistic network interior joint sparsity is higher, causes
Malicious node can arbitrarily be added in current network environment, and malicious node meeting malicious dissemination deceptive information, secondly and malice saves
Point can capture normal node to mislead it and carry out normal message propagation, so that the authenticity of message can not protect in whole network
Card.
It is reliably connected end to end secondly, software definition opportunistic network can not be established, therefore can not be using online to concentration
Formula authentication center carries out real time communication, and any node identities and the reliability of message of identifying can only all pass through traditional cryptography solution
Certainly, it has greater limitations.In addition, the mode that software definition opportunistic network interior joint carries information is held in terms of secret protection
It is easily maliciously intercepted or is distorted, the integrality of data and the fault-tolerance of equipment are all by very big threat.
Block chain can be considered a kind of tool that can solve safety issue in software definition opportunistic network.In discrete networks
In, block chain can safeguard the database that all members unanimously accept, even if node can not be real with centralized authentication center
Shi Tongxin can also guarantee the safe and reliable of data in block.The list structure that block chain is ordered into, in addition to number in each " block "
According to outer, timestamp, reference of precursor block etc. is also stored, and every time modification, update the common license that will obtain all members,
All members are in the status of complete equity in block chain, and keep identical block chain copy.The core of block chain is " to dig
The selection strategy of mine " power devises herein by the common election mechanism of block chain is imitated and a kind of has combined proof of work
Mechanism and equity prove trust offset " block " update scheme that mechanism combines, and data store organisation has good appearance
Mistake, under no enough calculation power supports, any malicious node can not all distort the record in chain.
It is had the advantage that using the safety of block chain technical optimization opportunistic network
1) decentralization: under block chain structure, data cooperate maintenance by each distributed node, and each node is protected
A block chain copy is stayed, Single Point of Faliure is effectively prevent, the scalability of whole system is also improved；
2) anti-tamper: the storage organization based on chained list makes malicious node in attempting to tamper with chain when data, needs simultaneously
Entire chained list is rebuild, so that crime cost is exponentially increased；
3) data consistency: in block chain structure, database is safeguarded jointly by all nodes, the operation only reached common understanding
It can just be allowed to, the inquiry request that any node issues all returns to obtain identical result；
4) it updates timeliness: proving the more new strategy of mechanism based on equity, so that the operation of more new block chain can be maximum every time
The variation for changing reflection node confidence, ensures that the update timeliness of data in chain；
5) fault-tolerance: " miner " election strategy based on proof of work mechanism, so that failing or being captured in part of nodes
In the case where obtaining, as long as there is enough calculation power to support, it still is able to the normal operation of guarantee system.Present embodiments provide a kind of base
In the software definition opportunistic network flow table update method of practical Byzantine failure tolerance algorithm, referring to Figure 1, this method comprises:
Step S1: the control layer in interchanger upper layer sends initial flow table to be updated to all interchangers.
Specifically, software definition opportunistic network includes control layer and interchanger, and interchanger is used for the content according to flow table
Carry out the forwarding of data packet.Method of the invention uses practical Byzantine failure tolerance algorithm, and its principle is as shown in Figure 2, and PBFT is calculated
Method makes system in a manner of sacrificing a part of message and propagate real-time, reduction throughput of system by introducing coordinator's node
Fault tolerant node ratio reached 1/3, it is assumed that network environment interior joint sum be 3f+1, wherein f be malicious node number,
Malicious node can upset the transmitting of the information in network by way of distorting original message, and remaining 2f+1 is normal node.
Itself received initial flow table to be updated is transmitted to other interchangers by the S2: the first interchanger of step, wherein the
The content of one interchanger forwarding is the first flow table.
Specifically, the first interchanger can be any one interchanger, and present embodiment illustrates for convenience, be ordered
Entitled first interchanger.Other interchangers are the interchanger other than the first interchanger, if a total of 3f+1 exchange
Machine, then the first exchange opportunity forwards the first flow table to other 3f interchanger.Meanwhile the stream that other interchangers can will also receive
Table is forwarded.Step S2 is the pre-preparation process of entire algorithm: PRE-PREPARE process.
Step S3: when other interchangers in addition to the first interchanger receive the first flow table forwarded by the first interchanger
Afterwards, which matches the content for the flow table information that the content of the first flow table is received with itself, if successful match,
Continue to forward the first flow table to other interchangers, and the exchange opportunity collects and counts the forwarding from other remaining interchangers
First feedback information, wherein the first feedback information indicates the set of the flow table information of other interchangers forwarding.
Specifically, the content of the flow table information itself received is other other than the first interchanger and itself
The flow table information of 3f-1 interchanger forwarding.
In one embodiment, the content of the flow table information itself received when the content of the first flow table and the interchanger
When identical, then successful match.
Specifically, if the flow table information for the first interchanger forwarding that the interchanger receives and the flow table information received
Content it is consistent when, show that the first interchanger is reliable.At this point, then the exchange opportunity is forwarded to other 3f-1 interchanger
First flow table.
Wherein, the set of the flow table information of other interchangers forwarding includes the interchanger in addition to the first interchanger and itself
The flow table information of forwarding.
Specifically, S3 is the preparation process of algorithm really: PREPARE process.First feedback information of PREPARE process
Be exactly in addition to the first interchanger other interchangers forwarding all flow table information set, quantity [0,3f-1] section it
It is interior, wherein f is the number of malice interchanger.
Step S4: if the quantity of flow table is more than preset value, the friendship in the first feedback information that certain interchanger receives
It changes planes and enters acknowledgement state, and forward the state of itself to other interchangers, and the exchange opportunity is collected from other remaining friendships
The second feedback information changed planes, wherein the second feedback information indicates whether the interchanger enters acknowledgement state.
Specifically, preset value can be configured according to the quantity of interchanger.If such as the total quantity of interchanger is 3f+
1, then preset value is 2f.Step S4 is COMMIT process: process is promised to undertake in confirmation.
Wherein, the second feedback information can indicate whether interchanger enters acknowledgement state with adoption status parameter.
Specifically, if interchanger has entered COMMIT state, it will show this with a parameter in the second feedback information
The current state of interchanger is COMMIT；Conversely, if the value of the parameter is not COMMIT.
Step S5: when the interchanger quantity for eventually entering into acknowledgement state is more than preset value, then each interchanger carries out flow table
Update.
Specifically, when entering COMMIT state if there is 2f interchanger, then it represents that the transmission process is believable.This
When, respective switch carries out the update of flow table, to guarantee that respective switch carries out the update of flow table according to uniform rules, guarantees
The safety of transmission.
In one embodiment, the method also includes when the interchanger quantity for eventually entering into acknowledgement state is not up to
When preset value, then update of each interchanger without flow table.
When the interchanger quantity for entering acknowledgement state eventually is not up to preset value, show that the transmission process is insincere, then not
The update for carrying out flow table, to guarantee safety.
In order to illustrate more clearly of the beneficial effect of the method for the present invention, it is illustrated below by specific example.This reality
It applies mode to be assessed for the flow table update consistency optimum results based on PBFT algorithm, using based on MiniNet-Wifi
Opportunistic network model emulation platform tested.This example mainly judges the feasibility and optimization of scheme by two indices
Efficiency: 1) interchanger serious forgiveness；2) flow table, which updates, operates required time loss of reaching an agreement.This exemplary topology is controlled by one
Device processed and 100 coupled group of switches are not at needing to interact with host or node.
By controlling different error interchanger ratios, when controller issues flow table to be updated, handed over respectively in each group
It changes planes and carries out flow table update using PBFT algorithm, every executed looks into the flow table information on all interchangers once wheel algorithm
It askes, when internal flow table information and the consistent interchanger ratio of flow table to be updated are more than 97%, stop the group and test and count calculation
Method executes wheel number, if not up to 97%, it continues to execute.
By experimental result in table 1 it is found that the PBFT algorithm optimization flow table using block chain distributes consistency problem, it is ensured that
In the software definition opportunistic network structure of decentralization, when interchanger single point failure ratio is less than or equal to 38% or so, according to
So can be with minority delay for cost, the reliability and consistency realizing flow table distribution or updating, when failure interchanger ratio is more than
When 39%, latency penalty is excessive, and the practicability of the program drastically reduces, and experimental result meets the expected expectation of model.
1 PBFT algorithm of table executes wheel number distribution table
Advantages of the present invention is derived using inference mode below.
PBFT algorithm uses meeting so that the inter-exchange data packet repeating process in software definition opportunistic network occurs one
A little variations, firstly, certain interchanger can generate an incremental timestamp Δ when forwarding data packet to other interchangers, if former single
The time loss of forwarding is T, then it is T+ Δ that modified single forwarding is time-consuming, and the PBFT algorithm in block chain uses coinFlip
Instruction generate one 0 to 1 between random number random ∈ [0,1), in this way, interchanger execute above-mentioned PREPARE process when,
Nonce can be calculated according to random number random first, this is to verify whether the workload of the data packet meets the requirements.
The randomness of random results in the randomness of workload verification result, it is assumed that once proves that the probability passed through is p, then single turns
The probability distributed may be expressed as:
Wherein n is the interchanger number that manages under controller, and f is the interchanger number wherein to malfunction, and f < n/3.
If this time forwarding initiated by normal node, the wheel forwarding eventually by probability are as follows:
After r takes turns, bi-distribution is met by the forwarding number of success that normal node is initiated:
blockc=Binom (pc, r) and (1-3)
Conversely, as primary mistake forwarding when verifying workload, can combine the calculation power of all error interchangers to compel
Pass through the process, thus by error node initiate repeating process eventually by probability are as follows:
Likewise, obeying other bi-distribution by the forwarding number of success that error node is initiated after r takes turns:
blockf=Binom (pf, r) and (1-5)
Using just too distribution N (np, np (1-p)) fitting bi-distribution Binom (n, p) can be by formula (1-3) and formula (1-5)
It is converted into following form:
blockc=N (rpc,rpc(1-pc)) (1-6)
blockf=N (rpf,rpf(1-pf)) (1-7)
According to " the most long-chain principle " of block chain, needs to guarantee to execute normal total degree and is greater than mistake hop count, it may be assumed that
blockc-blockf> 0, thus according to just too distribution property can obtain:
blockc-blockf=N (r (pc-pf),rpc(1-pc)+rpf(1-pf)) (1-8)
By standard just too distribution property prob=P { u-k σ < X < u+k σ }, will should ensure that after formula (1-8) modification:
Wheel number r is extracted to the left side of formula and is obtained:
By pc、pfIt brings into above formula respectively, it is total that algorithm execution wheel number r, error interchanger number f and interchanger can be obtained
Relationship between number n three, the functional relation drawn between f and r are as shown in Figure 3.It can be seen that from Fig. 3, the functional relation between f and r
Meet and be just distributed very much, in experiment, obtain n=1000, the value of f is adjusted from n/4 to n/2-1, and observation algorithm executes wheel number r's
Numerical value change, it is easy to see that when the value of f is less than 0.38n or is greater than 0.43n, it is ensured that taken turns in the lower situation of number r executing
Guarantee the reliability of flow table forwarding, wherein part of the f greater than 0.43n does not have practical significance, therefore gives up this partial data.Conversely,
When f value is when 0.39n is between 0.43n, time loss is excessive.
In addition, by above it is known that the correct implementing result of the algorithm should ensure that normal interchanger forwarding success rate is greater than
The forwarding success rate of wrong interchanger, this is the necessary condition that system finally achieves consistency, therefore p can be obtainedcWith pfRespectively with f's
Change curve is as shown in Figure 4.
As seen from Figure 4, normal interchanger is about that 0.42n or so intersects in f with wrong interchanger forwarding success rate, energy
Enough guarantee inference pc> pf, at this point, the success rate of normal interchanger forwarding flow table is higher than mistake interchanger, be conducive to flow table more
Newly reach an agreement.
Distribute consistency problem using the PBFT algorithm optimization flow table of block chain, it is ensured that in the software definition of decentralization
In opportunistic network structure, when interchanger single point failure ratio is less than or equal to 38% or so, it can be still delayed with minority as cost,
The reliability and consistency realizing flow table distribution or updating, when the interchanger ratio that fails is more than 39%, latency penalty is excessive, should
The practicability of scheme drastically reduces, and experimental result meets the expected expectation of model.
It should be understood by those skilled in the art that, the embodiment of the present invention can provide as method, system or computer program
Product.Therefore, complete hardware embodiment, complete software embodiment or reality combining software and hardware aspects can be used in the present invention
Apply the form of example.Moreover, it wherein includes the computer of computer usable program code that the present invention, which can be used in one or more,
The computer program implemented in usable storage medium (including but not limited to magnetic disk storage, CD-ROM, optical memory etc.) produces
The form of product.
The present invention be referring to according to the method for the embodiment of the present invention, the process of equipment (system) and computer program product
Figure and/or block diagram describe.It should be understood that every one stream in flowchart and/or the block diagram can be realized by computer program instructions
The combination of process and/or box in journey and/or box and flowchart and/or the block diagram.It can provide these computer programs
Instruct the processor of general purpose computer, special purpose computer, Embedded Processor or other programmable data processing devices to produce
A raw machine, so that being generated by the instruction that computer or the processor of other programmable data processing devices execute for real
The device for the function of being specified in present one or more flows of the flowchart and/or one or more blocks of the block diagram.
Although preferred embodiments of the present invention have been described, it is created once a person skilled in the art knows basic
Property concept, then additional changes and modifications can be made to these embodiments.So it includes excellent that the following claims are intended to be interpreted as
It selects embodiment and falls into all change and modification of the scope of the invention.
Obviously, those skilled in the art can carry out various modification and variations without departing from this hair to the embodiment of the present invention
The spirit and scope of bright embodiment.In this way, if these modifications and variations of the embodiment of the present invention belong to the claims in the present invention
And its within the scope of equivalent technologies, then the present invention is also intended to include these modifications and variations.
Claims (5)
1. a kind of software definition opportunistic network flow table update method based on practical Byzantine failure tolerance algorithm, which is characterized in that packet
It includes:
Control layer in interchanger upper layer sends initial flow table to be updated to all interchangers；
Itself received initial flow table to be updated is transmitted to other interchangers by the first interchanger, wherein the first interchanger turns
The content of hair is the first flow table；
After other interchangers in addition to the first interchanger receive the first flow table forwarded by the first interchanger, the interchanger
The content for the flow table information that the content of first flow table is received with itself is matched, if successful match, is exchanged to other
Machine continues to forward the first flow table, and the exchange opportunity collects and counts the first feedback letter of the forwarding from other remaining interchangers
Breath, wherein the first feedback information indicates the set of the flow table information of other interchangers forwarding；
If the quantity of flow table is more than preset value in the first feedback information that certain interchanger receives, which enters confirmation
State, and forward to other interchangers the state of itself, and to collect second from other remaining interchangers anti-for the exchange opportunity
Feedforward information, wherein the second feedback information indicates whether the interchanger enters acknowledgement state；
When the interchanger quantity for eventually entering into acknowledgement state is more than preset value, then each interchanger carries out the update of flow table.
2. the method as described in claim 1, which is characterized in that the method also includes when the friendship for eventually entering into acknowledgement state
When quantity of changing planes is not up to preset value, then update of each interchanger without flow table.
3. method according to claim 2, which is characterized in that itself received when the content of the first flow table and the interchanger
When the content of flow table information is identical, then successful match.
4. the method as described in claim 1, which is characterized in that the set of the flow table information of other interchangers forwarding includes except the
The flow table information of one interchanger and the interchanger forwarding except itself.
5. the method as described in claim 1, which is characterized in that whether the second feedback information adoption status parameter indicates interchanger
Into acknowledgement state.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910401829.5A CN110166364B (en) | 2019-05-15 | 2019-05-15 | Software defined opportunistic network flow table updating method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910401829.5A CN110166364B (en) | 2019-05-15 | 2019-05-15 | Software defined opportunistic network flow table updating method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110166364A true CN110166364A (en) | 2019-08-23 |
| CN110166364B CN110166364B (en) | 2020-07-24 |
Family
ID=67634780
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910401829.5A Active CN110166364B (en) | 2019-05-15 | 2019-05-15 | Software defined opportunistic network flow table updating method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110166364B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110752925A (en) * | 2019-10-31 | 2020-02-04 | 电子科技大学 | Improved PBFT consensus method suitable for Internet of things equipment management |
| CN111221561A (en) * | 2020-01-14 | 2020-06-02 | 平安科技（深圳）有限公司 | Flow table updating method, device, system, computer device and storage medium |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105933236A (en) * | 2016-07-07 | 2016-09-07 | 北京邮电大学 | Method and device for updating SDN (Software Defined Network) flow table |
| CN107040472A (en) * | 2017-03-07 | 2017-08-11 | 浙江工商大学 | A kind of chain of command list item method synchronous with flow table and the forwarding of all kinds of forwarding-table items in SDN |
| CN107231299A (en) * | 2017-06-07 | 2017-10-03 | 众安信息技术服务有限公司 | A kind of chain route and realized the system that block chain communicates across chain |
| WO2018144302A1 (en) * | 2017-01-31 | 2018-08-09 | Rush Thomas Jay | Blockchain data-processing engine |
| CN108614748A (en) * | 2018-04-19 | 2018-10-02 | 上海分布信息科技有限公司 | A kind of method of Byzantine failure tolerance and its economic governing system of logical card |
| CN109246176A (en) * | 2018-07-03 | 2019-01-18 | 北京邮电大学 | Based on the multi-controller synchronous method and device of block chain in software defined network |
| CN109327548A (en) * | 2018-11-27 | 2019-02-12 | 北京瑞卓喜投科技发展有限公司 | A kind of block chain update method and block chain more new system |
| CN109600323A (en) * | 2018-11-12 | 2019-04-09 | 中山大学 | A kind of Byzantium's common recognition mechanism |
| CN109756558A (en) * | 2018-12-04 | 2019-05-14 | 广州通链计算机智能技术有限责任公司 | A kind of Byzantine failure tolerance common recognition algorithm based on asynchronous packet switching |
-
2019
- 2019-05-15 CN CN201910401829.5A patent/CN110166364B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105933236A (en) * | 2016-07-07 | 2016-09-07 | 北京邮电大学 | Method and device for updating SDN (Software Defined Network) flow table |
| WO2018144302A1 (en) * | 2017-01-31 | 2018-08-09 | Rush Thomas Jay | Blockchain data-processing engine |
| CN107040472A (en) * | 2017-03-07 | 2017-08-11 | 浙江工商大学 | A kind of chain of command list item method synchronous with flow table and the forwarding of all kinds of forwarding-table items in SDN |
| CN107231299A (en) * | 2017-06-07 | 2017-10-03 | 众安信息技术服务有限公司 | A kind of chain route and realized the system that block chain communicates across chain |
| WO2018223995A1 (en) * | 2017-06-07 | 2018-12-13 | 众安信息技术服务有限公司 | Method, device and system for cross-chain communication in blockchains |
| CN108614748A (en) * | 2018-04-19 | 2018-10-02 | 上海分布信息科技有限公司 | A kind of method of Byzantine failure tolerance and its economic governing system of logical card |
| CN109246176A (en) * | 2018-07-03 | 2019-01-18 | 北京邮电大学 | Based on the multi-controller synchronous method and device of block chain in software defined network |
| CN109600323A (en) * | 2018-11-12 | 2019-04-09 | 中山大学 | A kind of Byzantium's common recognition mechanism |
| CN109327548A (en) * | 2018-11-27 | 2019-02-12 | 北京瑞卓喜投科技发展有限公司 | A kind of block chain update method and block chain more new system |
| CN109756558A (en) * | 2018-12-04 | 2019-05-14 | 广州通链计算机智能技术有限责任公司 | A kind of Byzantine failure tolerance common recognition algorithm based on asynchronous packet switching |
Non-Patent Citations (1)
| Title |
|---|
| 蔡圣龙: ""一种软件定义网络（SDN）的拜占庭容差控制器"", 《通信技术》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110752925A (en) * | 2019-10-31 | 2020-02-04 | 电子科技大学 | Improved PBFT consensus method suitable for Internet of things equipment management |
| CN110752925B (en) * | 2019-10-31 | 2021-12-03 | 电子科技大学 | Improved PBFT consensus method suitable for Internet of things equipment management |
| CN111221561A (en) * | 2020-01-14 | 2020-06-02 | 平安科技（深圳）有限公司 | Flow table updating method, device, system, computer device and storage medium |
| WO2021143026A1 (en) * | 2020-01-14 | 2021-07-22 | 平安科技（深圳）有限公司 | Flow table updating method, apparatus and system, computer device, and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110166364B (en) | 2020-07-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109922162B (en) | Flat building equipment Internet of things monitoring system and method based on block chain | |
| CN110113328A (en) | A kind of software definition opportunistic network DDoS defence method based on block chain | |
| WO2020113545A1 (en) | Method for generating and managing multimodal identified network on the basis of consortium blockchain voting consensus algorithm | |
| CN107231299A (en) | A kind of chain route and realized the system that block chain communicates across chain | |
| CN111800758B (en) | Unmanned aerial vehicle swarm layered consensus method based on block chain | |
| Wang et al. | Blockchain-based data storage mechanism for industrial internet of things | |
| Mershad et al. | Proof of accumulated trust: A new consensus protocol for the security of the IoV | |
| CN114218612B (en) | Consensus method suitable for alliance chain high-frequency transaction scene | |
| CN110113148B (en) | Software defined opportunistic network node identity verification method based on block chain | |
| Xu et al. | An efficient blockchain pbft consensus protocol in energy constrained iot applications | |
| CN114048578A (en) | High-throughput block chain system and performance optimization model for 6G network | |
| CN110166364A (en) | A kind of software definition opportunistic network flow table update method based on practical Byzantine failure tolerance algorithm | |
| CN110324331A (en) | Power system security stability contorting terminal identity authentication method based on block chain | |
| Germanus et al. | Increasing the resilience of critical scada systems using peer-to-peer overlays | |
| Xue et al. | Research on key technologies of software-defined network based on blockchain | |
| Li et al. | Federated hierarchical trust-based interaction scheme for cross-domain industrial IoT | |
| CN112395113A (en) | Practical Byzantine fault-tolerant consensus method and device and readable storage medium | |
| Gu et al. | Cluster-based malicious node detection for false downstream data in fog computing-based VANETs | |
| Shao et al. | Data Trusted Sharing Delivery: A Blockchain-Assisted Software-Defined Content Delivery Network | |
| Wang et al. | Blockchain-aided secure access control for UAV computing networks | |
| CN113156803A (en) | Task-oriented unmanned aerial vehicle cluster resource management and fault-tolerant control method | |
| CN111405005B (en) | Operation control method and system of block chain and controllable network terminal equipment | |
| Wang et al. | Toward a trust evaluation framework against malicious behaviors of industrial iot | |
| CN108900518B (en) | Credible software-defined cloud network data distribution system | |
| Yu et al. | Blockchain-based pki system and its application in internet of things |
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 |