CN106875165A - A kind of common recognition algorithm of utilization software defined network optimization - Google Patents
A kind of common recognition algorithm of utilization software defined network optimization Download PDFInfo
- Publication number
- CN106875165A CN106875165A CN201710096499.4A CN201710096499A CN106875165A CN 106875165 A CN106875165 A CN 106875165A CN 201710096499 A CN201710096499 A CN 201710096499A CN 106875165 A CN106875165 A CN 106875165A
- Authority
- CN
- China
- Prior art keywords
- rpc
- index
- leader
- follower
- request
- 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
- 238000005457 optimization Methods 0.000 title claims abstract description 9
- 230000004044 response Effects 0.000 claims abstract description 6
- 238000000034 method Methods 0.000 claims description 36
- 230000008569 process Effects 0.000 claims description 10
- 238000012545 processing Methods 0.000 claims description 6
- 230000001934 delay Effects 0.000 claims description 3
- 235000013399 edible fruits Nutrition 0.000 claims description 3
- 238000003860 storage Methods 0.000 claims description 3
- 229910017435 S2 In Inorganic materials 0.000 claims 2
- 230000007246 mechanism Effects 0.000 abstract description 12
- 238000013461 design Methods 0.000 abstract description 5
- 230000006872 improvement Effects 0.000 abstract description 4
- 239000002699 waste material Substances 0.000 abstract description 4
- 238000012546 transfer Methods 0.000 abstract description 3
- 230000000694 effects Effects 0.000 description 5
- 238000005516 engineering process Methods 0.000 description 4
- 230000005540 biological transmission Effects 0.000 description 3
- 238000004364 calculation method Methods 0.000 description 2
- 230000008859 change Effects 0.000 description 2
- 230000002776 aggregation Effects 0.000 description 1
- 238000004220 aggregation Methods 0.000 description 1
- 238000013475 authorization Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 230000003111 delayed effect Effects 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000009826 distribution Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012856 packing Methods 0.000 description 1
- 238000012827 research and development Methods 0.000 description 1
- 230000001360 synchronised effect Effects 0.000 description 1
- 230000007704 transition Effects 0.000 description 1
- 238000012795 verification Methods 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/04—Payment circuits
- G06Q20/06—Private payment circuits, e.g. involving electronic currency used among participants of a common payment scheme
- G06Q20/065—Private payment circuits, e.g. involving electronic currency used among participants of a common payment scheme using e-cash
Landscapes
- Business, Economics & Management (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- Strategic Management (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Computer And Data Communications (AREA)
Abstract
The present invention provides a kind of common recognition algorithm of utilization software defined network optimization, the bright use SDN design grid network layers, it is ensured that after the order of data transfer, simplify the design of application layer algorithm, the Raft after improvement possesses response speed higher.Using Raft as privately owned chain common recognition algorithm, it is to avoid the common recognition algorithm such as PoW shortens the time of generation block to calculating the waste of power resource, substantially increases the efficiency and unit interval accessible trading volume of common recognition mechanism.
Description
Technical field
The present invention relates to digital cash field, the common recognition more particularly, to a kind of optimization of utilization software defined network is calculated
Method.
Background technology
From Davos forum to International Monetary Fund, from People's Bank of China's digital cash seminar to american goods
The hearing of Commodity Futures Trading Commission, the scientific and technological giant, area such as from the financial circles big shot such as Nasdaq, Citibank to IBM, Microsoft
Block chain is just quickly coming into the public visual field and policy aspect, triggers global extensive concern.
Block chain is the core technology of digital encryption currency system.Block chain technology can by data encryption, timestamp,
The means such as distributed common recognition mechanism, realize the point-to-point transaction of decentralization in the distributed system that node need not be trusted each other
With cooperate so that centered on change the high cost of mechanism generally existing, inefficient and provide the problems such as be susceptible to Single Point of Faliure
One solution, this is also the Core Superiority of block chain.
Bit coin is block chain application scenarios the most successful so far.Show averagely there is about 7500 daily according to statistics
Ten thousand dollars of 120000 transactions are written into bit coin block chain, have generated at present more than 400,000 blocks.According to encryption currency city
Data-Statistics show, at the beginning of 2016, the whole world has 675 kinds of encryption currency, total market capitalisation more than 6,700,000,000 dollars, wherein bit coin
Market value accounts for 86%.Expect 2027, the GDP in the whole world 10% will be stored by block chain technology.
Bit coin is substantially the digital cash generated by distributed system, and its distribution is independent of specific centralization machine
Structure, and depend on the node in distributed system to participate in a kind of referred to as PoW (Proof of work, i.e. proof of work) jointly
Common recognition process with complete bit coin transaction checking with record.PoW common recognitions process (is commonly called as digging ore deposit, each node is referred to as miner)
It is that each node contributes the computing resource of oneself to carry out the process of the mathematical problem that one difficulty of contention resolved is dynamically adapted, successfully solves
Certainly the miner of the mathematical problem will obtain the book keeping operation power of block, and all bit coin transaction packing of current slot is charged into one
Individual new block, it is linked to sequentially in time on bit coin main chain.PoW (the Proof of Work) common recognitions that bit coin is used
Algorithm relies on machine and performs mathematical calculations to obtain book keeping operation power, and resource consumption is very high, calculates power and wastes serious.With block chain skill
The development of art, researcher proposes various mechanism that be independent of calculation power and can reach common understanding.Common common recognition on current block chain
Mechanism also has PoS (Proof of Stake) in addition to PoW:Rights and interests are proved, DPoS (Delegate Proof of Stake):Stock
Part authorisation verification etc., these common recognition mechanism respectively have quality.
The content of the invention
The present invention provides a kind of common recognition algorithm of utilization software defined network optimization, and the algorithm can lift the effect of common recognition mechanism
Rate.
In order to reach above-mentioned technique effect, technical scheme is as follows：
A kind of common recognition algorithm of utilization software defined network optimization, comprises the following steps：
S1：User end to server cluster broadcast request, returns result to client after server processing requests；
Server can produce different responses after receiving request according to role, and the role of server includes：Follower
Follower, applicant Candidate and leader Leader, server processing requests and after storing the result into daily record, clothes
Business device also completes the role of leader Leader simultaneously when completing follower Follower role, follower Follower is by result
Leader Leader is sent to, Leader is transmitted directly to client；When server completes Candidate role, electing
Journey just occurs, Leader to delay and enter election process after machine, elects new Leader.Server is not responding to client in election process
The request at end；
S2：Synchronization request implementing result between server, it is ensured that uniformity.
Further, in the step S1：
In server cluster, if follower Follower receives the request of client, execution is asked and will request
Cryptographic Hash Hash with result is stored in daily record Log, and then result hash value is adjusted by creating the teleprogram of new entry
With leader Leader is sent to, hash value computing formula is as follows：
Hashn=H (Hashn-1||operationn)
Above-mentioned formula represents that it is the hash value obtained after the operation of n to perform index index, if hash value is identical, is performed
The all operations crossed are consistent.
Further, in the step S1：
If leader Leader receives request, perform and by request storage to daily record Log, then return result to visitor
Family end client.
Further, in the step S2：
Leader Leader receives the remote procedure call new entry RPC of the new entry of follower Follower,
Index index therein is first checked, if index value is less than the index value commitIndex having been filed on, amendment knot is directly sent
Index values are remote procedure call new in remote procedure call correct RPC, remote procedure call the correct RPC of fruit
The index value of entry RPC；If the index>Local index, i.e. leader Leader do not receive this request also, then perform new entry
Remote procedure call in request and return result to client；If index>=commitIndex and index<=local
Index, then compare the hash value of implementing result, and the remote procedure call for allowing Follower to submit result to is sent if consistent
Commit RPC, its index are the index in new entry RPC；Ordered when this is performed more than half follower Follower
Order and hash value it is consistent when by local commitIndex be updated to this order index values；Correct is returned if inconsistent
RPC makes corresponding follower Follower modify, and now index values are local commitIndex in correct RPC.
Further, in the step S2：
If follower Follower receives the commit RPC of leader Leader, if in RPC in hash value and local Log
Hash value after corresponding commitIndex requests are performed is identical, then be updated to local commitIndex variate-values
Index values in commit RPC, if it is different, sending new entry RPC to Leader, index values in new entry RPC
It is the index of request newest in local Log, Log is the corresponding orders of the index, and Hash is the Hash of its operation result
Value；If local current period curTerm is less than the curTerm values in commit RPC, be updated to in commit RPC
Value；If receiving the correct RPC of Leader, roll back to forward index in correct RPC request perform after
State, then performs the request in the Log of correct RPC successively.
Compared with prior art, the beneficial effect of technical solution of the present invention is：
The present invention uses SDN design grid network layers, it is ensured that after the order of data transfer, simplify setting for application layer algorithm
Meter, the Raft after improvement possesses response speed higher.Using Raft as privately owned chain common recognition algorithm, it is to avoid PoW etc. is altogether
Algorithm is known to calculating the waste of power resource, the time of generation block is shortened, when substantially increasing the efficiency and unit of common recognition mechanism
Between accessible trading volume.
Brief description of the drawings
Fig. 1 is privately owned chain network structure in the present invention；
Fig. 2 is data center network topology structure in the present invention；
Fig. 3 is the transformational relation of server Three roles in the present invention；
Fig. 4 is the structural representation of Log in server in the present invention.
Specific embodiment
Accompanying drawing being for illustration only property explanation, it is impossible to be interpreted as the limitation to this patent；
In order to more preferably illustrate the present embodiment, accompanying drawing some parts have omission, zoom in or out, and do not represent actual product
Size；
To those skilled in the art, it can be to understand that some known features and its explanation may be omitted in accompanying drawing
's.
Technical scheme is described further with reference to the accompanying drawings and examples.
Embodiment 1
A kind of common recognition algorithm of utilization software defined network optimization, comprises the following steps：
S1：User end to server cluster broadcast request, returns result to client after server processing requests；
Server can produce different responses after receiving request according to role, and the role of server includes：Follower
Follower, applicant Candidate and leader Leader, server processing requests and after storing the result into daily record, clothes
Business device also completes the role of leader Leader simultaneously when completing follower Follower role, follower Follower is by result
Leader Leader is sent to, Leader is transmitted directly to client；When server completes Candidate role, electing
Journey just occurs, Leader to delay and enter election process after machine and elect new Leader.Server is not responding to client in election process
The request at end；
S2：Synchronization request implementing result between server, it is ensured that uniformity.
Further, in the step S1：
In server cluster, if follower Follower receives the request of client, execution is asked and will request
Cryptographic Hash Hash with result is stored in daily record Log, and then result hash value is adjusted by creating the teleprogram of new entry
With leader Leader is sent to, hash value computing formula is as follows：
Hashn=H (Hashn-1||operationn)
Above-mentioned formula represents that it is the hash value obtained after the operation of n to perform index index, if hash value is identical, is performed
The all operations crossed are consistent.
Further, in the step S1：
If leader Leader receives request, perform and by request storage to daily record Log, then return result to visitor
Family end client.
Further, in the step S2：
Leader Leader receives the remote procedure call new entry RPC of the new entry of follower Follower,
Index index therein is first checked, if index value is less than the index value commitIndex having been filed on, amendment knot is directly sent
Index values are remote procedure call new in remote procedure call correct RPC, remote procedure call the correct RPC of fruit
The index value of entry RPC；If the index>Local index, i.e. leader Leader do not receive this request also, then perform new entry
Remote procedure call in request and return result to client；If index>=commitIndex and index<=local
Index, then compare the hash value of implementing result, and the remote procedure call for allowing Follower to submit result to is sent if consistent
Commit RPC, its index are the index in new entry RPC；Ordered when this is performed more than half follower Follower
Order and hash value it is consistent when by local commitIndex be updated to this order index values；Correct is returned if inconsistent
RPC makes corresponding follower Follower modify, and now index values are local commitIndex in correct RPC.
Further, in the step S2：
If follower Follower receives the commit RPC of leader Leader, if in RPC in hash value and local Log
Hash value after corresponding commitIndex requests are performed is identical, then be updated to local commitIndex variate-values
Index values in commit RPC, if it is different, sending new entry RPC to Leader, index values in new entry RPC
It is the index of request newest in local Log, Log is the corresponding orders of the index, and Hash is the Hash of its operation result
Value；If local current period curTerm is less than the curTerm values in commit RPC, be updated to in commit RPC
Value；If receiving the correct RPC of Leader, roll back to forward index in correct RPC request perform after
State, then performs the request in the Log of correct RPC successively.
The present invention is directed to propose a kind of excellent using SDN (Software Defined Network, i.e. software defined network)
The common recognition algorithm of change improves the efficiency that block chain is reached common understanding.Default environment is privately owned chain, it is contemplated that privately owned chain does not exist visits
Front yard general's problem is accounted for, traditional distributed common recognition algorithm can be used, therefore common recognition mechanism is realized using Raft algorithms.
Be separated for network-based control and forwarding by SDN, datum plane is decoupling with control plane, it is allowed to User Defined
Router feature module, realizes the programmable of network, for research and development network new opplication provides a kind of new solution.Below
Part I of the invention is first introduced, the optimization to privately owned link network network layers based on SDN.
In traditional network, the reliability of software is completely dependent on application layer to realize.Order by data of the invention
Separated with reliability, using SDN, the guarantee to order is realized in Internet.The order of data refers to, if one in cluster
Individual server first receives a, after receive b, then do not have in cluster any server can receive a before receive b.At this
In individual network, although ensure that order, but information is it is possible to lose, postpone, and to the guarantee of information reliability, we give
Application layer is realized.
The structure of privately owned chain network is as shown in figure 1, because privately owned chain scope is smaller, we can regard as in a data
It is intracardiac.As shown in Fig. 2 in the network of this data center, we are asynchronous at this, no for the topological structure of data center network
Ordered broadcast is realized on reliable network.Asynchronous refers to that the delay of information does not know, and unreliable refers to deposit during Information Communication
In the possibility lost.
The effect of sequencer is the bag for receiving and forwarding client to send, and in the head addition numbering of bag.Each
Sequencer safeguards a counter, and the value of counter is the numbering of packet header, often encapsulates a bag counter+1.Profit
With SDN, we using the switch of the public father node of all server in the packet for receiving multicast as sequencer, if
Large-scale server is broadcast to, it is necessary to using a Root switch as sequencer, and if the broadcast of small range,
Aggregation switch or ToR (top of Rack) switch then can depending on circumstances be selected as sequencer, so
Design will not increase the path of information transmission, so will not increase extra information transmission postponing.The acpLib of server can know
The numbering in other packet header, in order by the messaging in bag to server, numbering discontinuous information can be rejected reception.So
Just the orderly transmission of information is realized.
On this basis, we realize Part II of the invention, and the common recognition of privately owned chain is realized with improved Raft algorithms
Mechanism.
In Raft algorithms, server has Three role：Follower, Candidate, Leader, these three roles'
Relation is as shown in Figure 3.One Leader is a term from being elected to the time for terminating, and term time spans are not fixed, often
A numerical variable curTerm of current term is all deposited in individual server, numeral Jia 1 after electing new Leader,
The request for having received is record in the Log of server, every request has corresponding index, and the structure of Log is as shown in Figure 4.One
A leader is up in individual term.Communicated using RPC (Remote Procedure Call) between Server.Table 1
The variable and method of server Three roles are summarized, table 2 summarizes the methodical parameter of server institutes and effect.
The variable and method of the server Three roles of table 1
The parameter of the server key methods of table 2 and effect
The responsibility of server Three roles is as follows：
Follower：
If receiving the request of client, perform and request is stored in Log, will be asked and implementing result after execution
Hash value is sent to leader by new entry RPC.
(1) if receiving the commit RPC of Leader, if hash value and corresponding commitIndex in local Log in RPC
Hash value after request is performed is identical, then local commitIndex variate-values are updated to the index in commit RPC
Value, if it is different, sending new entry RPC to Leader, index values are asked for newest in local Log in new entry RPC
The index for asking, Log are the corresponding orders of the index, and Hash is the hash value of its operation result.If local curTerm is less than
CurTerm values in commit RPC, are updated to and the value in commit RPC.
(2) if receiving the correct RPC of Leader, the request that the index in correct RPC is rolled back to forward is held
State after row, then performs the request in the Log of correct RPC successively.
(3) if receiving the submit RPC of Leader, timing is reset, if submitRPC is not sky, updates local dimension
The value of the block chain of shield.
(4) if not receiving Leader in a time for regulation fixes the submit RPC for sending, then it is assumed that need weight
It is new to start election, now make the curTerm+1 of oneself and be changed into Candidate states.
(5) if receiving the request vote RPC of Candidate, will be therein<curTerm,index>With oneself
Oneself compares, if oneself is big, returns to deny RPC, otherwise sends vote RPC for it is voted and by local curTerm
The value value that is updated in request vote RPC.If request vote RPC were received after throwing ticket again not respond.
Candidate:
(1) touted to all server broadcast request vote RPC and voted to oneself.
(2) if receiving the ballot paper more than half server and not receiving deny RPC, transition stage is Leader, and
To the empty submit RPC of cluster broadcast.
(3) if receiving deny RPC, commit RPC or submit RPC, Follower states are returned to.
(4) if time-out is not received more than half ballot paper yet, Candidate states are kept, it is by curTerm+1 and again wide
Broadcast request vote RPC.The setting time of time-out is a range of random number (such as 150-300ms).Overtime the reason for
It is that ballot paper is bisected into, for example, has 5 server, a Leader to delay after machine, two Follower is opened as Candidate simultaneously
Begin to campaign for, be left two Follower and respectively throw a ticket to two Candidate, then cannot determine next Leader, Zhi Nengchao
When after re-elect.
(5) if receiving the request vote RPC of Candidate, will be therein<curTerm,index>With oneself
Oneself compares, if oneself is big, sends deny RPC, otherwise returns to Follower states, by the value of local curTerm more
New value in request vote RPC and to send vote RPC be its ballot.
Leader:
(1) after being elected as Leader, if Log is not sky, first the request after committed marks in Log is carried out
It is synchronous, broadcast commit RPC and the result of each request is returned into corresponding client.
(2) if receiving the request of client, perform and request is stored in Log, return result to client.
(3) if receiving the new entry RPC of Follower, index therein is first checked, if index<
CommitIndex, then index values are the index of new entry RPC in directly sending correct RPC, correct RPC
Value；If index>Local index, i.e. Leader do not receive this request also, then perform the request in new entry RPC and return
Result is to user；If index>=commitIndex and index<=local index, then compare the hash value of implementing result, if
Consistent then send commit RPC, its index is the index in new entry RPC.Performed when more than half Follower
Local commitIndex is updated to the index values of this order when this order and consistent hash value.Returned if inconsistent
Correct RPC make corresponding Follower modify, and now index values are local commitIndex in correct RPC.
(4) all Follower broadcast submit RPC, upper one in a regular time is to cluster
Committed requests are packaged into a block if having new committed to ask after submitted requests and are added to block
Chain afterbody, and will ask and the data of new block chain are added in submit RPC；If being asked without new committed,
Broadcast empty submit RPC.
(5) if receiving the request vote RPC of Candidate, deny RPC are returned to.
(6) if receiving commit RPC of Leader and therein<curTerm,index>More than or equal to local<
curTerm,index>, then Follower states are returned to, local curTerm values are updated, and new entry RPC are beamed back, its
Middle index values are local index variate-values.Otherwise commit RPC are beamed back, index is local index variate-values.
Algorithm security is analyzed：
(1) if the request that client is sent to Leader is lost or delayed machine before Leader performs request, Leader can be from
Asked in the new entry RPC that Follower sends.
(2) if the request that client is sent to Follower is lost or Follower machines of delaying recover afterwards for a period of time, can root
Corrected according to the correct RPC of Leader.
(3) machine if Leader delays before commit RPC are broadcasted after performing request, because Internet ensure that having for request
Sequence and election mechanism ensure that the integrality of the Log of new Leader, and new Leader can first broadcast commit RPC after being elected
Ensure the consistent of data.
(4) machine if Leader delays before block is added, new Leader can still add block at the end of new term, according to area
The property of block chain, although number of blocks is different, but is not influenceed on the uniformity and security of data.
The present invention uses SDN design grid network layers, it is ensured that after the order of data transfer, simplify setting for application layer algorithm
Meter, the Raft after improvement possesses response speed higher.Using Raft as privately owned chain common recognition algorithm, it is to avoid PoW etc. is altogether
Algorithm is known to calculating the waste of power resource, the time of generation block is shortened, when substantially increasing the efficiency and unit of common recognition mechanism
Between accessible trading volume.
The same or analogous part of same or analogous label correspondence；
Position relationship for the explanation of being for illustration only property described in accompanying drawing, it is impossible to be interpreted as the limitation to this patent；
Obviously, the above embodiment of the present invention is only intended to clearly illustrate example of the present invention, and is not right
The restriction of embodiments of the present invention.For those of ordinary skill in the field, may be used also on the basis of the above description
To make other changes in different forms.There is no need and unable to be exhaustive to all of implementation method.It is all this
Any modification, equivalent and improvement made within the spirit and principle of invention etc., should be included in the claims in the present invention
Protection domain within.
Claims (5)
1. a kind of common recognition algorithm of utilization software defined network optimization, comprises the following steps：
S1：User end to server cluster broadcast request, returns result to client after server processing requests；
Server can produce different responses after receiving request according to role, and the role of server includes：Follower Follower,
Applicant Candidate and leader Leader, server processing requests and after storing the result into daily record, follower
Follower sends the result to leader Leader, and Leader is transmitted directly to client；Server completes Candidate angles
During color, just occur in election process, Leader delays and enters election process after machine, and server is not responding to client in election process
Request；
S2：Synchronization request implementing result between server, it is ensured that uniformity.
2. the common recognition algorithm that utilization software defined network according to claim 1 optimizes, it is characterised in that the step S1
In：
In server cluster, if follower Follower receives the request of client, execution is asked and will request and knot
The cryptographic Hash Hash of fruit is stored in daily record Log, and then result hash value is sent out by creating the remote procedure call of new entry
Give leader Leader, hash value computing formula is as follows：
Hashn=H (Hashn-1 | | operationn)
Above-mentioned formula represents that it is the hash value obtained after the operation of n to perform index index, if hash value is identical, was performed
All operations are consistent.
3. the common recognition algorithm that utilization software defined network according to claim 1 optimizes, it is characterised in that the step S1
In：
If leader Leader receives request, perform and by request storage to daily record Log, then return result to client
client。
4. the common recognition algorithm that utilization software defined network according to claim 3 optimizes, it is characterised in that the step S2
In：
Leader Leader receives the remote procedure call new entry RPC of the new entry of follower Follower, first examines
Index index therein is looked into, if index value is less than the index value commitIndex having been filed on, correction result is directly sent
Index values are remote procedure call new in remote procedure call correct RPC, remote procedure call correct RPC
The index value of entry RPC；If the index>Local index, i.e. leader Leader do not receive this request also, then perform new entry
Remote procedure call in request and return result to client；If index>=commitIndex and index<=local
Index, then compare the hash value of implementing result, and the remote procedure call for allowing Follower to submit result to is sent if consistent
Commit RPC, its index are the index in new entry RPC；Ordered when this is performed more than half follower Follower
Order and hash value it is consistent when by local commitIndex be updated to this order index values；Correct is returned if inconsistent
RPC makes corresponding follower Follower modify, and now index values are local commitIndex in correct RPC.
5. the common recognition algorithm that utilization software defined network according to claim 4 optimizes, it is characterised in that the step S2
In：
If follower Follower receives the commit RPC of leader Leader, if hash value is corresponding with local Log in RPC
CommitIndex request perform after hash value it is identical, then local commitIndex variate-values are updated to commit
Index values in RPC, if it is different, sending new entry RPC to Leader, index values are local in new entry RPC
The index of newest request in Log, Log are the corresponding orders of the index, and Hash is the hash value of its operation result；If this
Ground current period curTerm is updated to and the value in commit RPC less than the curTerm values in commit RPC；If
The correct RPC of Leader are received, then roll back to the index in correct RPC forward asks the state after performing, so
Perform the request in the Log of correct RPC successively afterwards.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710096499.4A CN106875165A (en) | 2017-02-22 | 2017-02-22 | A kind of common recognition algorithm of utilization software defined network optimization |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710096499.4A CN106875165A (en) | 2017-02-22 | 2017-02-22 | A kind of common recognition algorithm of utilization software defined network optimization |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN106875165A true CN106875165A (en) | 2017-06-20 |
Family
ID=59169214
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710096499.4A Pending CN106875165A (en) | 2017-02-22 | 2017-02-22 | A kind of common recognition algorithm of utilization software defined network optimization |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106875165A (en) |
Cited By (18)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107733651A (en) * | 2017-09-11 | 2018-02-23 | 联动优势科技有限公司 | A kind of block chain generation method, node and system |
| CN108170763A (en) * | 2017-12-25 | 2018-06-15 | 江南大学 | A kind of Distributed Calculation common recognition algorithm of low latency |
| CN108512699A (en) * | 2018-03-15 | 2018-09-07 | 中国联合网络通信集团有限公司 | Block chain service server data exception detection method, equipment and block catenary system |
| CN108596621A (en) * | 2018-04-28 | 2018-09-28 | 深圳市优学链科技有限公司 | Block chain accounting nodes generation method, device, computer equipment and storage medium |
| CN109039713A (en) * | 2018-07-16 | 2018-12-18 | 夸克链科技（深圳）有限公司 | A kind of block chain common recognition device and algorithm |
| CN109104474A (en) * | 2018-07-27 | 2018-12-28 | 深圳市汇尊区块链技术有限公司 | A kind of common recognition mechanism mutation method |
| CN109218289A (en) * | 2018-08-03 | 2019-01-15 | 中山大学 | A kind of common recognition mechanism of the entanglement network proved based on work in series amount |
| CN109246176A (en) * | 2018-07-03 | 2019-01-18 | 北京邮电大学 | Based on the multi-controller synchronous method and device of block chain in software defined network |
| CN109525636A (en) * | 2018-10-12 | 2019-03-26 | 上海保险交易所股份有限公司 | Block chain common recognition method based on Raft algorithm |
| CN111034134A (en) * | 2017-08-17 | 2020-04-17 | 诺基亚通信公司 | Selection of network routing topology |
| CN109066670B (en) * | 2018-09-13 | 2020-09-01 | 福建省农村信用社联合社 | Distributed power supply management method based on Internet of things block chain |
| CN108173827B (en) * | 2017-12-22 | 2020-09-08 | 南京邮电大学 | Block chain thinking-based distributed SDN control plane security authentication method |
| CN111818152A (en) * | 2020-07-02 | 2020-10-23 | 电子科技大学 | Leader election consensus method based on distributed network |
| CN112235252A (en) * | 2020-09-21 | 2021-01-15 | 西安电子科技大学 | Block chain-based security identification method, security identification system and storage medium |
| CN112395640A (en) * | 2020-11-16 | 2021-02-23 | 国网河北省电力有限公司信息通信分公司 | Industry Internet of things data lightweight credible sharing technology based on block chain |
| CN112424782A (en) * | 2018-05-22 | 2021-02-26 | 西门子股份公司 | Device, system and method for running software defined networks |
| CN114448900A (en) * | 2022-04-02 | 2022-05-06 | 南京邮电大学 | SDN controller interaction method and system based on extended raft algorithm |
| CN111193596B (en) * | 2019-12-30 | 2023-09-05 | 达闼机器人股份有限公司 | Block generation system, method, server and workload verification device |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105511987A (en) * | 2015-12-08 | 2016-04-20 | 上海爱数信息技术股份有限公司 | Distributed task management system with high consistency and availability |
| CN106060036A (en) * | 2016-05-26 | 2016-10-26 | 布比（北京）网络技术有限公司 | Decentralized consenting method and apparatus |
-
2017
- 2017-02-22 CN CN201710096499.4A patent/CN106875165A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105511987A (en) * | 2015-12-08 | 2016-04-20 | 上海爱数信息技术股份有限公司 | Distributed task management system with high consistency and availability |
| CN106060036A (en) * | 2016-05-26 | 2016-10-26 | 布比（北京）网络技术有限公司 | Decentralized consenting method and apparatus |
Non-Patent Citations (1)
| Title |
|---|
| 李福荣: "一种高可扩展的SDN分布式控制平面的研究与实现", 《中国优秀硕士学位论文全文数据库信息科技辑》 * |
Cited By (26)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111034134A (en) * | 2017-08-17 | 2020-04-17 | 诺基亚通信公司 | Selection of network routing topology |
| CN107733651A (en) * | 2017-09-11 | 2018-02-23 | 联动优势科技有限公司 | A kind of block chain generation method, node and system |
| CN107733651B (en) * | 2017-09-11 | 2020-06-19 | 联动优势科技有限公司 | Block chain generation method, node and system |
| CN108173827B (en) * | 2017-12-22 | 2020-09-08 | 南京邮电大学 | Block chain thinking-based distributed SDN control plane security authentication method |
| CN108170763B (en) * | 2017-12-25 | 2021-07-27 | 江南大学 | Low-delay distributed computing consensus algorithm |
| CN108170763A (en) * | 2017-12-25 | 2018-06-15 | 江南大学 | A kind of Distributed Calculation common recognition algorithm of low latency |
| CN108512699A (en) * | 2018-03-15 | 2018-09-07 | 中国联合网络通信集团有限公司 | Block chain service server data exception detection method, equipment and block catenary system |
| CN108512699B (en) * | 2018-03-15 | 2020-08-14 | 中国联合网络通信集团有限公司 | Block chain service server data anomaly detection method and equipment and block chain system |
| CN108596621B (en) * | 2018-04-28 | 2020-10-27 | 三亚京牛数字科技有限公司 | Block chain accounting node generation method and device, computer equipment and storage medium |
| CN108596621A (en) * | 2018-04-28 | 2018-09-28 | 深圳市优学链科技有限公司 | Block chain accounting nodes generation method, device, computer equipment and storage medium |
| CN112424782A (en) * | 2018-05-22 | 2021-02-26 | 西门子股份公司 | Device, system and method for running software defined networks |
| CN109246176A (en) * | 2018-07-03 | 2019-01-18 | 北京邮电大学 | Based on the multi-controller synchronous method and device of block chain in software defined network |
| CN109246176B (en) * | 2018-07-03 | 2020-05-01 | 北京邮电大学 | Multi-controller synchronization method and device based on block chain in software defined network |
| CN109039713A (en) * | 2018-07-16 | 2018-12-18 | 夸克链科技（深圳）有限公司 | A kind of block chain common recognition device and algorithm |
| CN109104474A (en) * | 2018-07-27 | 2018-12-28 | 深圳市汇尊区块链技术有限公司 | A kind of common recognition mechanism mutation method |
| CN109218289A (en) * | 2018-08-03 | 2019-01-15 | 中山大学 | A kind of common recognition mechanism of the entanglement network proved based on work in series amount |
| CN109218289B (en) * | 2018-08-03 | 2021-03-26 | 中山大学 | Consensus mechanism of entangled network based on serial workload certification |
| CN109066670B (en) * | 2018-09-13 | 2020-09-01 | 福建省农村信用社联合社 | Distributed power supply management method based on Internet of things block chain |
| CN109525636B (en) * | 2018-10-12 | 2021-04-13 | 上海保险交易所股份有限公司 | Block chain consensus method based on Raft algorithm |
| CN109525636A (en) * | 2018-10-12 | 2019-03-26 | 上海保险交易所股份有限公司 | Block chain common recognition method based on Raft algorithm |
| CN111193596B (en) * | 2019-12-30 | 2023-09-05 | 达闼机器人股份有限公司 | Block generation system, method, server and workload verification device |
| CN111818152A (en) * | 2020-07-02 | 2020-10-23 | 电子科技大学 | Leader election consensus method based on distributed network |
| CN111818152B (en) * | 2020-07-02 | 2021-04-30 | 电子科技大学 | Leader election consensus method based on distributed network |
| CN112235252A (en) * | 2020-09-21 | 2021-01-15 | 西安电子科技大学 | Block chain-based security identification method, security identification system and storage medium |
| CN112395640A (en) * | 2020-11-16 | 2021-02-23 | 国网河北省电力有限公司信息通信分公司 | Industry Internet of things data lightweight credible sharing technology based on block chain |
| CN114448900A (en) * | 2022-04-02 | 2022-05-06 | 南京邮电大学 | SDN controller interaction method and system based on extended raft algorithm |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106875165A (en) | A kind of common recognition algorithm of utilization software defined network optimization | |
| US11669811B2 (en) | Blockchain-based digital token utilization | |
| US20230351367A1 (en) | Systems and methods of blockchain transaction recordation | |
| US10965446B2 (en) | Blockchain-based automated user matching | |
| EP3776437B1 (en) | Blockchain-based asset transfer method and apparatus, and electronic device | |
| US12008524B2 (en) | Method and system of mining blockchain transactions provided by a validator node | |
| Kaur et al. | Scalability in blockchain: Challenges and solutions | |
| US20200092084A1 (en) | System and methods for operating a blockchain network | |
| CN106991164A (en) | Method, device and electronic equipment that finance data is handled are used for based on block chain | |
| US20190251199A1 (en) | Transactions Across Blockchain Networks | |
| CN108776929A (en) | Bill processing method, system based on block chain database and readable storage medium storing program for executing | |
| WO2018223215A1 (en) | Scalable trading platform using central bank issued digital currency | |
| TWI729518B (en) | Block chain-based event processing method and device, and electronic equipment | |
| CN108881187A (en) | A kind of across chain data transferring method and equipment suitable for permitting chain scene | |
| CN107395353A (en) | A kind of block chain common recognition method and device | |
| CN109919756A (en) | Fund transfer system, checking method and method of commerce based on Merkle tree backtracking location technology | |
| Feng et al. | System architecture for high-performance permissioned blockchains | |
| CN108009818B (en) | Online payment method and system based on distributed network | |
| TWI705691B (en) | Block chain-based event processing method and device, and electronic equipment | |
| Xin et al. | On scaling and accelerating decentralized private blockchains | |
| Tsai et al. | A multi-chain model for CBDC | |
| US20230017790A1 (en) | Graphic-blockchain-orientated hybrid consensus implementation apparatus and implementation method thereof | |
| WO2020243961A1 (en) | Aggregated payment method and system for digital currencies, and edge server | |
| CN114626547A (en) | Group collaborative learning method based on block chain | |
| CN110428238A (en) | The account cancelling method and system of block chain |
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 | ||
| AD01 | Patent right deemed abandoned | ||
| AD01 | Patent right deemed abandoned |
Effective date of abandoning: 20210427 |