CN103118084B - The electoral machinery of a kind of host node and node - Google Patents
The electoral machinery of a kind of host node and node Download PDFInfo
- Publication number
- CN103118084B CN103118084B CN201310022088.2A CN201310022088A CN103118084B CN 103118084 B CN103118084 B CN 103118084B CN 201310022088 A CN201310022088 A CN 201310022088A CN 103118084 B CN103118084 B CN 103118084B
- Authority
- CN
- China
- Prior art keywords
- motion
- node
- cluster
- self
- initiate
- 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.)
- Active
Links
- 230000004044 response Effects 0.000 claims description 66
- 230000000977 initiatory effect Effects 0.000 claims description 16
- 238000000034 method Methods 0.000 claims description 9
- 238000012544 monitoring process Methods 0.000 claims description 5
- 235000013399 edible fruits Nutrition 0.000 claims description 4
- 238000011156 evaluation Methods 0.000 claims 1
- 230000008569 process Effects 0.000 description 5
- 238000002372 labelling Methods 0.000 description 3
- 239000000203 mixture Substances 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000008520 organization Effects 0.000 description 2
- 230000003213 activating effect Effects 0.000 description 1
- 230000004888 barrier function Effects 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 239000012141 concentrate Substances 0.000 description 1
- 238000005538 encapsulation Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000002045 lasting effect Effects 0.000 description 1
- 238000002360 preparation method Methods 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Abstract
The invention discloses electoral machinery and the node of a kind of host node, including: motion is initiated in the request of the node in addition to self in cluster of each node in cluster, judge whether the quantity of the node allowing self to initiate motion reaches the minimum required value allowing to initiate motion, if reached, the then node broadcasts motion in addition to self in cluster, and judge whether the quantity of the node accepting motion reaches the received minimum required value of motion, if reached, the node then determining motion is host node, the received motion of the node broadcasts in addition to self in cluster.Present invention dynamic negotiation from the node of group system elects host node, determines the purpose of host node in the case of reaching number of nodes elastic telescopic in the cluster.
Description
Technical field
The present invention relates to cluster (Cluster) system regions, particularly relate to the electoral machinery of a kind of host node
And node.
Background technology
The fast development of network technology, promotes development and the extensively application of group system.One cluster by
The server composition all interconnected, these servers are by the calculating resource unified as, externally
Show as single system, and managed with the pattern of triangular web.Progressively one-tenth along with cluster topology
Ripe, cluster has become a hot technology in fields such as finance, telecommunications and government network at present, and it is permissible
The high availability of guarantee system, expandability and anti-calamity.
For a preferable cluster, user is without paying close attention to the composition node of group system, and a cluster is just
A system rather than some independent calculating nodes, cluster administrator can increase as required or
Person deletes the node of group system.Group system has the advantage that high scalability, high availability, height
Performance and high performance-price ratio.According to the different characteristic of group system, group system can be divided three classes: high
Availability cluster, load balancing cluster and HPCC.
High-availability cluster is again HA cluster, is the one of cluster, is to be based upon terminal use to provide lasting
Property service and produce, for externally providing highly reliable service, in this kind of group system, institute
Have node use Master (leading)/Slave (from) or Multi-Active (activating) mode more external
Thering is provided same service, it is contemplated that conforming problem, Multi-Active mode deals with extremely complex,
Often lead to the reduction for the treatment of effeciency, the most more employing Master/Slave mode, Master accept
Request is distributed unitedly, and the main distinction of Master/Slave with Multi-Active is that existence one is special
Node, functional role is different from other nodes.The selection of Master is the most dynamic, it is to avoid single-point event
The generation of barrier (SPOF, Single Point of Failure).The selection of Master is a typical Leader
(host node) election process, the application in high-availability cluster is the most universal.
One qualified Leader electoral machinery needs to solve following problem: avoid the occurrence of multiple
Leader (＞ 1)；Process network divides；Avoid election process node collapses；Tolerance slow network etc..
The most traditional Leader electoral machinery includes following several:
(1) it is that each node in group system is respectively configured numbering, selects the joint that numbering is maximum or minimum
Point is as host node；
(2) numbering of the node stochastic generation in group system, selects the node of numbering maximum as host node；
(3) node in group system all uses identical major key to write data base, is successfully written data base's
Node is as host node.
Above-mentioned traditional Leader electoral machinery can realize the Master of the group system of stationary nodes number
Election, but the requirement of cluster dynamic cannot be met, and the number of nodes in group system dynamically changes
Time, it is impossible to realize the selection of host node.
Summary of the invention
The technical problem to be solved in the present invention is to provide electoral machinery and the node of a kind of host node, it is possible to
In the group system that number of nodes dynamically changes, it is achieved the election of host node.
For solving above-mentioned technical problem, the electoral machinery of a kind of host node of the present invention, including:
Motion is initiated in the request of the node in addition to self in cluster of each node in cluster, it is judged that allow self
Whether the quantity of the node initiating motion reaches the minimum required value allowing to initiate motion, if reached, then
The node broadcasts motion in addition to self in cluster, and judge whether the quantity of the node accepting motion reaches
The received minimum required value of motion, if reached, it is determined that the node of motion is host node, to cluster
In the received motion of node broadcasts in addition to self.
Further, it is judged that allow whether the quantity of the node self initiating motion reaches to allow to initiate motion
Minimum required value, including:
After motion is initiated in the request of the node in addition to self in cluster, receive response message, according to response
The motion response message carried in message judges whether the node sending response message allows to initiate motion, as
Fruit allows, then to allowing the quantity initiating the node of motion to add up, and according to total nodes of cluster
Amount judges whether the quantity allowing to initiate the node of motion reaches the minimum required value allowing to initiate motion.
Further, it is judged that whether the quantity of the node accepting motion reaches the received minimum requirement of motion
Value, including:
After the node broadcasts motion in addition to self in cluster, receive response message, according to response message
In whether carry the information of acceptance judge send response message node whether accept motion, if accept, then
The quantity of the node accepting motion is added up, and judges to accept motion according to total number of nodes of cluster
The quantity of node whether reach the received minimum required value of motion.
Further, the described minimum required value allowing to initiate motion and the received minimum required value of motion
Be total number of nodes add 1 1/2nd the value that rounds up.
Further, total number of nodes of described cluster is preserved by each node in cluster, each in cluster
Joining and departing from of monitoring nodes cluster interior joint, fashionable there being node to add, add in total number of nodes
The quantity of the node increased, when there being node to leave, deducts the number of the node left on total number of nodes
Amount.
Further, the electoral machinery of a kind of host node, including:
Each node in cluster, after the message of motion is initiated in the request of receiving, disappears according to described in receiving
The most accept motion before breath, returned response message to the node sending described message, indicated whether to allow
The node sending described message initiates motion, and, after receiving motion, it may be judged whether allow to send out
The node sending motion initiates motion, if it is, return response message, instruction to the node sending motion
Accept motion.
Further, also include:
Each node in cluster, after the message of motion is initiated in the request of receiving, also judges that described request is initiated
Whether request mark (request ID) of the message of motion is more than the maximum request ID having been received by, as
Fruit is then to perform described basis and the most accepted motion before receiving described message, disappears described in sending
The node of breath returns response message, and the request ID recording the message that motion is initiated in current request is
The maximum request ID received.
Further, also include:
Return response message to the node sending motion, after instruction accepts motion, wait motion to be sent
The received motion of node broadcasts, if do not receive the node broadcasts sending motion within the waiting time
Received motion, then labelling does not currently accept motion, it is allowed to request motion node initiate motion.
Further, a kind of node, including: motion is initiated unit, motion unit and host node and is determined list
Unit, wherein:
Unit is initiated in described motion, initiates motion for the request of the node in addition to self in cluster, it is judged that
Whether the quantity allowing the node self initiating motion reaches the minimum required value allowing to initiate motion, if
Reach, then notify described motion unit；
Described motion unit, for the node broadcasts motion in addition to self in cluster, and judges that acceptance carries
Whether the quantity of the node of case reaches the received minimum required value of motion, if reached, then notice is described
Host node determines unit；
Described host node determines unit, is host node for determining the node of motion, except self in cluster
The received motion of outer node broadcasts.
Further, a kind of node, including: initiate judging unit and motion judging unit, wherein:
Described initiation judging unit, after the message initiating motion in the request of receiving, according to receiving
Before described message, the most accept motion, return response message, instruction to the node sending described message
Permission sends the node of described message and initiates motion；
Described motion judging unit, for after receiving motion, it may be judged whether has allowed to send motion
Node initiates motion, if it is, return response message to the node sending motion, instruction accepts motion.
In sum, present invention dynamic negotiation from the node of group system elects host node, reaches
The purpose of host node is determined in the case of number of nodes elastic telescopic in cluster.
Accompanying drawing explanation
Fig. 1 is the flow chart of the electoral machinery of the host node of the present invention；
Fig. 2 is the Organization Chart of a kind of node of the present invention；
Fig. 3 is the Organization Chart of the another kind of node of the present invention.
Detailed description of the invention
This paper presents a kind of Leader electoral machinery that node elastic can be supported flexible, be used for realizing joint
The host node election of the point dynamically group system of change, dynamically obtains the information of node in the method, according to
Number of nodes actual in group system, adjusts Leader election process, reaches flexible at node elastic
In the case of determine the purpose of Leader.
The electoral machinery of the host node of present embodiment comprises two message exchange passages, and election information exchanges
Passage and information about firms interchange channel, concrete channel selecting mode can select according to reality application
(such as heartbeat or arbitration disk).
In present embodiment, each node has Three role concurrently, i.e. Proposer (motion side), Acceptor
(reciever) and Learner (study side), Proposer sends prepare request (preparation request)
(accurate with propose request (motion request) to Acceptor, Acceptor feedback prepare response
Standby response) and propose response (motion response) to Proposer.Once Proposer obtains and rents
About note that all of after (Lease, has the lock of time limit, it is thus achieved that the node of lease is host node)
Learner.These message are transmitted by election information interchange channel, and election information interchange channel can be different
Step, unstable.
Concrete election information exchange flow process is as it is shown in figure 1, oneself become Leader with the election of certain node and be
Example, time a length of T, the electoral machinery of the host node of present embodiment, including:
Step 101: in cluster, the Proposer of each node generates Prepare Request, including encapsulation
The request ID (request ID) of Prepare Request, the type arranging message is Prepare Request,
Node in cluster is broadcasted, and motion is initiated in request；
Request ID is monotonic increase.
The false code generating and broadcasting Prepare Request is as follows:
After step 102:Acceptor receives Prepare Request, it is judged that Prepare Request's
Whether request ID is more than the maximum request ID having been received by, if it is, record current Prepare
The request ID of Request is the maximum request ID having been received by, and generates PrepareResponse,
In Prepare Response, carry motion response message, be sent to Proposer；
When Acceptor allows Proposer to initiate motion, motion response message comprises instruction Acceptor
Allowing the information of motion, such as motion response message is empty (null)；Other joints have been accepted at Acceptor
The motion of point, when not allowing Proposer to initiate motion, motion response message comprises Acceptor and accepts
Motion (ID of accepted node).
The false code of step 102 is as follows:
After step 103:Proposer receives Prepare Response, it is judged that Prepare Response
The most legal, if legal, then judge whether Acceptor allows Proposer according to motion response message
Initiate motion, if it is allowed, then judge the number allowing to initiate the Acceptor of motion according to total number of nodes
Whether amount reaches the minimum required value allowing to initiate motion, if reached, registers an intervalometer, generates
Propose Request carries the ID of the node of motion, and the node broadcasts motion in cluster carries out formal Shen
Please；
In Propose Request, also carry the timing of intervalometer, Proposer is waited Propose
The time announcement Acceptor of Response.
Proposer judges that Prepare Response is the most legal and includes: judge Prepare Response's
The request ID of response ID and Prepare Request is the most identical, if identical, then judges
Prepare Response is legal；If it is not the same, then judge that Prepare Response is illegal.
According to motion response message, Proposer judges whether Acceptor allows Proposer to initiate motion bag
Include: judge whether motion response message is null, if null, then judge that Acceptor allows Proposer
Initiate motion；Otherwise, it is determined that Acceptor does not allow Proposer to initiate motion.
When Acceptor allows Proposer to initiate motion, Proposer is also to allowing to initiate motion
The quantity of Acceptor adds up.
According to total number of nodes, Proposer judges whether the quantity allowing to initiate the Acceptor of motion reaches
Allow to initiate the minimum required value of motion, including: judge that the quantity allowing to initiate the Acceptor of motion is
No reach total number of nodes adds 1 1/2nd the value that rounds up.
Proposer is not in the case of intervalometer arrival timing receives Propose Response yet, really
Determine motion failure, mark host node and do not determine.
The false code of step 103 is as follows:
After step 104:Acceptor receives Propose Request, it may be judged whether allowed Proposer
Initiate motion, if it is, generate Propose Response, carry the information of acceptance, by Propose Response
It is sent to Proposer；
Acceptor judges whether to allow Proposer to initiate application, including: judge Propose Request
Request ID whether less than the maximum request ID received, if it is, judge not allow
Proposer initiates application；If it is not, then judge to have allowed Proposer to initiate application.
Acceptor registers an intervalometer, record according further to the timing carried in Propose Request
Wait the time of lease broadcast, in the case of not receiving lease broadcast in intervalometer arrival,
Labelling does not currently accept motion, it is allowed to the Proposer of request motion initiates motion.
The false code of step 104 is as follows:
After step 105:Proposer receives Propose Response message, according to Propose
Whether Response carries the information of acceptance, it is judged that whether the quantity of the Acceptor accepting motion reaches motion
Received minimum required value, if reached, illustrates that present node becomes Leader, broadcast lease broadcast
Message gives all of Learner, broadcasts received motion.
Proposer, after receiving Propose Response, also judges the response of Propose Response
The request ID of ID with Prepare Request is the most identical, if identical, then to accepting motion
The quantity of Acceptor adds up, and judges whether the quantity of the Acceptor accepting motion minimizes
Required value.
Proposer judges according to total number of nodes whether the quantity of the Acceptor accepting motion minimizes
Required value, including: judge whether the quantity of the Acceptor accepting motion reaches what total number of nodes added 1
The value that rounds up of 1/2nd.
Proposer, when the quantity judging to accept the Acceptor of motion minimizes required value, determines
Motion success, marks host node and has determined that.
The false code of step 105 is as follows:
Judge whether the quantity of the Acceptor accepting motion minimizes the puppet of required value in step 105
Code is as follows:
As a example by MajorityQuorum, the function accepting election results is as follows:
QuorumAccept(numAccepted){
Return (numAccepted ＞=ceil ((double) (numNodes+1)/2))；
}
Judge whether the quantity allowing to initiate the Acceptor of application minimizes required value in step 103
False code similar with above-mentioned false code, differ only in variable and be slightly different.
The addition of the main monitor node in information about firms interchange channel or leave in present embodiment, relevant
Message includes MemberJoin and MemberLeave between node, and the node in cluster all preserves cluster
Total number of nodes, plus the number of node increased in total number of nodes after receiving MemberJoin
Amount；In total number of nodes, the quantity of the node left is deducted after receiving MemberLeave.
False code is as follows:
As in figure 2 it is shown, present embodiment additionally provides a kind of node, including: motion is initiated unit, is carried
Case unit and host node determine unit, wherein:
Unit is initiated in motion, initiates motion for the request of the node in addition to self in cluster, it is judged that allow
Whether the quantity of the node that self initiates motion reaches the minimum required value allowing to initiate motion, if reached,
Then notice motion unit；
Motion unit, for the node broadcasts motion in addition to self in cluster, and judges to accept motion
Whether the quantity of node reaches the received minimum required value of motion, if reached, then notice host node is true
Cell；
Host node determines unit, is host node for determining the node of motion, in cluster in addition to self
The received motion of node broadcasts.
Motion initiate unit, specifically for the node except self in addition in cluster request initiation motion after,
Receive response message, judge to send the joint of response message according to the motion response message carried in response message
Whether point allows to initiate motion, if it is allowed, then to allowing the quantity initiating the node of motion to add up,
And judge whether the quantity allowing to initiate the node of motion reaches to allow to initiate according to total number of nodes of cluster
The minimum required value of motion.
Motion unit, specifically for after the node broadcasts motion in addition to self in cluster, receives response
According to whether carrying the information of acceptance in response message, message, judges whether the node sending response message accepts
Motion, if accepted, then adds up the quantity of the node accepting motion, and according to total joint of cluster
Point quantity judges whether the quantity of the node accepting motion reaches the received minimum required value of motion.
The minimum required value of permission initiation motion and the received minimum required value of motion are total nodes of cluster
Quantity add 1 1/2nd the value that rounds up.
Total number of nodes of cluster is initiated unit by motion and motion unit preserves, each node prison in cluster
Joining and departing from of control cluster interior joint, fashionable there being node to add, plus increase in total number of nodes
The quantity of node, when there being node to leave, deducts the quantity of the node left on total number of nodes.
As it is shown on figure 3, the another kind of node of present embodiment, including: initiate judging unit and motion is sentenced
Disconnected unit, wherein:
Initiate judging unit, after the message initiating motion in the request of receiving, according to disappearing receiving
The most accept motion before breath, returned response message to the node sending message, indicated whether to allow to send
The node of message initiates motion；
Motion judging unit, for after receiving motion, it may be judged whether has allowed to send the node of motion
Initiating motion, if it is, return response message to the node sending motion, instruction accepts motion.
Initiate judging unit, be additionally operable to after the message of motion is initiated in the request of receiving, it is judged that request is initiated
Whether the request ID of the message of motion is more than the maximum request ID having been received by, if it is,
Perform according to the most having accepted motion before receiving message, return response message to the node sending message,
And the request ID recording the message that motion is initiated in current request is the maximum request having been received by
ID。
Motion judging unit, is additionally operable to returning response message to the node sending motion, and instruction acceptance carries
After case, wait the received motion of the node broadcasts of motion to be sent, if do not received within the waiting time
To the received motion of the node broadcasts sending motion, then labelling does not currently accept motion, it is allowed to request
The node of motion initiates motion.
Obviously, those skilled in the art should be understood that each module of the above-mentioned present invention or each step can
To realize with general calculating device, they can concentrate on single calculating device, or distribution
On the network that multiple calculating devices are formed, alternatively, they can be with calculating the executable journey of device
Sequence code realizes, and performs such that it is able to be stored in storing in device by calculating device, or
They are fabricated to respectively each integrated circuit modules, or the multiple modules in them or step are made
Single integrated circuit module is become to realize.So, the present invention is not restricted to any specific hardware and software
In conjunction with.
More than should be only the preferred embodiments of the present invention, be not limited to the present invention, for ability
For the technical staff in territory, the present invention can have various modifications and variations.All spirit in the present invention and former
Within then, any modification, equivalent substitution and improvement etc. made, should be included in the protection model of the present invention
Within enclosing.
Claims (4)
1. an electoral machinery for host node, including:
Motion is initiated in the request of the node in addition to self in cluster of each node in cluster, it is judged that allow self
Whether the quantity of the node initiating motion reaches the minimum required value allowing to initiate motion, if reached, then
The node broadcasts motion in addition to self in cluster, and judge whether the quantity of the node accepting motion reaches
The received minimum required value of motion, if reached, it is determined that the node of motion is host node, to cluster
In the received motion of node broadcasts in addition to self；
The method also includes: joining and departing from of each monitoring nodes cluster interior joint in cluster, is having joint
Point adds fashionable, plus the quantity of the node increased in total number of nodes, when there being node to leave, always
The quantity of the node left is deducted on number of nodes；
Judge whether the quantity of the node allowing self to initiate motion reaches to allow the minimum initiating motion to want
Evaluation, including:
After motion is initiated in the request of the node in addition to self in cluster, receive response message, according to response
The motion response message carried in message judges whether the node sending response message allows to initiate motion, as
Fruit allows, then to allowing the quantity initiating the node of motion to add up, and according to total nodes of cluster
Amount judges whether the quantity allowing to initiate the node of motion reaches the minimum required value allowing to initiate motion；
Or, it is judged that whether the quantity of the node accepting motion reaches the received minimum required value of motion,
Including:
After the node broadcasts motion in addition to self in cluster, receive response message, according to response message
In whether carry the information of acceptance judge send response message node whether accept motion, if accept, then
The quantity of the node accepting motion is added up, and judges to accept motion according to total number of nodes of cluster
The quantity of node whether reach the received minimum required value of motion.
2. the method for claim 1, it is characterised in that the minimum of motion is initiated in described permission
Required value and the received minimum required value of motion are 1/2nd that total number of nodes of cluster adds 1
Round up value.
3. the method for claim 1, it is characterised in that total number of nodes of described cluster by
Each node in cluster preserves.
4. a node, initiates unit including: motion, motion unit, host node determine unit and the
One monitoring processing unit, wherein:
Unit is initiated in described motion, initiates motion for the request of the node in addition to self in cluster, it is judged that
Whether the quantity allowing the node self initiating motion reaches the minimum required value allowing to initiate motion, if
Reach, then notify described motion unit；
Described motion unit, for the node broadcasts motion in addition to self in cluster, and judges that acceptance carries
Whether the quantity of the node of case reaches the received minimum required value of motion, if reached, then notice is described
Host node determines unit；
Described host node determines unit, is host node for determining the node of motion, except self in cluster
The received motion of outer node broadcasts；
First monitoring processing unit, for monitoring joining and departing from of cluster interior joint, adds there being node
Time, plus the quantity of the node increased in total number of nodes, when there being node to leave, at total nodes
The quantity of the node left is deducted in amount；
Unit is initiated in described motion, for judging whether the quantity of the node allowing self to initiate motion reaches
Allow to initiate the minimum required value of motion, including:
After motion is initiated in the request of the node in addition to self in cluster, receive response message, according to response
The motion response message carried in message judges whether the node sending response message allows to initiate motion, as
Fruit allows, then to allowing the quantity initiating the node of motion to add up, and according to total nodes of cluster
Amount judges whether the quantity allowing to initiate the node of motion reaches the minimum required value allowing to initiate motion；
Or, described motion unit, for judging whether the quantity of the node accepting motion reaches motion quilt
The minimum required value accepted, including:
After the node broadcasts motion in addition to self in cluster, receive response message, according to response message
In whether carry the information of acceptance judge send response message node whether accept motion, if accept, then
The quantity of the node accepting motion is added up, and judges to accept motion according to total number of nodes of cluster
The quantity of node whether reach the received minimum required value of motion.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310022088.2A CN103118084B (en) | 2013-01-21 | 2013-01-21 | The electoral machinery of a kind of host node and node |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310022088.2A CN103118084B (en) | 2013-01-21 | 2013-01-21 | The electoral machinery of a kind of host node and node |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103118084A CN103118084A (en) | 2013-05-22 |
| CN103118084B true CN103118084B (en) | 2016-08-17 |
Family
ID=48416354
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310022088.2A Active CN103118084B (en) | 2013-01-21 | 2013-01-21 | The electoral machinery of a kind of host node and node |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103118084B (en) |
Families Citing this family (19)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103475742B (en) * | 2013-09-30 | 2017-02-01 | 北京华胜天成科技股份有限公司 | Method and system for determining master control node in cloud computing environment |
| CN104679796A (en) * | 2013-12-03 | 2015-06-03 | 方正信息产业控股有限公司 | Selecting method, selecting device and database mirror image cluster node |
| CN108183971B (en) * | 2015-03-13 | 2021-08-10 | 聚好看科技股份有限公司 | Node election method in distributed system |
| CN106161495A (en) * | 2015-03-25 | 2016-11-23 | 中兴通讯股份有限公司 | A kind of host node electoral machinery, device and storage system |
| CN106331046A (en) * | 2015-07-02 | 2017-01-11 | 中兴通讯股份有限公司 | Cluster main node voting method and device |
| CN105407087B (en) * | 2015-10-28 | 2019-01-01 | 杭州数梦工场科技有限公司 | Message method and device |
| CN106060036B (en) * | 2016-05-26 | 2019-07-16 | 布比（北京）网络技术有限公司 | Decentralization common recognition method and device |
| CN106331098B (en) * | 2016-08-23 | 2020-01-21 | 东方网力科技股份有限公司 | Server cluster system |
| CN106372165A (en) * | 2016-08-31 | 2017-02-01 | 天津南大通用数据技术股份有限公司 | Leader selection method and device for cluster based on totem protocol |
| CN106453633A (en) * | 2016-11-10 | 2017-02-22 | 郑州云海信息技术有限公司 | Communication method for multiple nodes in non-stable communication link |
| CN107196786A (en) * | 2017-04-06 | 2017-09-22 | 阿里巴巴集团控股有限公司 | A kind of method and device for ensureing data consistency and availability |
| CN108063787A (en) * | 2017-06-26 | 2018-05-22 | 杭州沃趣科技股份有限公司 | The method that dual-active framework is realized based on distributed consensus state machine |
| CN109995835A (en) * | 2017-12-29 | 2019-07-09 | 浙江宇视科技有限公司 | Host node electoral machinery, device and distributed memory system |
| CN108763501A (en) * | 2018-05-30 | 2018-11-06 | 郑州云海信息技术有限公司 | A kind of main method of collection mass selection, system, equipment and computer readable storage medium |
| CN111737104A (en) * | 2019-10-25 | 2020-10-02 | 北京沃东天骏信息技术有限公司 | Block chain network service platform, test case sharing method thereof and storage medium |
| CN112911520B (en) * | 2019-12-04 | 2022-05-31 | 哈尔滨海能达科技有限公司 | Method, device and storage medium for determining master node in ad hoc network |
| CN111698315B (en) * | 2020-06-09 | 2021-10-15 | 腾讯科技（深圳）有限公司 | Data processing method and device for block and computer equipment |
| CN113641692A (en) * | 2021-08-18 | 2021-11-12 | 福建天晴数码有限公司 | Scheme and system for realizing distributed cluster node participation |
| CN115002120B (en) * | 2022-08-02 | 2022-10-25 | 蒲惠智造科技股份有限公司 | Method for determining main node in cluster network based on data synchronization |
-
2013
- 2013-01-21 CN CN201310022088.2A patent/CN103118084B/en active Active
Non-Patent Citations (1)
| Title |
|---|
| 基于消息传递的Paxos 算法研究;许子灿等;《计算机工程》;20111130;第37卷(第21期);287-291 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103118084A (en) | 2013-05-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103118084B (en) | The electoral machinery of a kind of host node and node | |
| US11728992B2 (en) | Cryptlet binding key graph | |
| US10740455B2 (en) | Encave pool management | |
| US10833858B2 (en) | Secure cryptlet tunnel | |
| US11176246B2 (en) | Enclave pool shared key | |
| EP3622661B1 (en) | Cryptlet identity | |
| US10681033B2 (en) | Selecting and securing proof delgates for cryptographic functions | |
| WO2020211484A1 (en) | Data processing method and device, block chain client and block chain node | |
| CN101127606B (en) | Method and device for transmitting data object | |
| US20220014594A1 (en) | Framework for dynamic brokerage and management of topics and data at the service layer | |
| US20180330077A1 (en) | Enclave pools | |
| CN112367684B (en) | Flow control method, device, storage medium and computer equipment | |
| Squicciarini et al. | Trust establishment in the formation of virtual organizations | |
| CN115883669A (en) | Data distribution method, system, equipment and medium | |
| US11290575B2 (en) | Connecting computer processing systems and transmitting data | |
| CN109032693A (en) | Method and device for loading display information, electronic equipment and readable storage medium | |
| US11405766B2 (en) | Connecting computer processing systems and transmitting data | |
| CN114363335A (en) | Cross-chain interaction method and device | |
| CN107911413A (en) | A kind of Distributed database service management system and method | |
| WO2024001507A1 (en) | Data processing method, system and apparatus, device, and storage medium | |
| CN117112451B (en) | Test method, test device, electronic equipment and computer readable storage medium | |
| TWI459766B (en) | Social network track-exchanging platform based on smart phone and message-oriented middleware | |
| Martınez et al. | A multimodal distributed architecture for indoor localization | |
| CN117294661A (en) | Nacos-based ubiquitous computing resource management method and device | |
| Wang | Performance evaluation of a resource discovery service |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20180920 Address after: 200436 Room 411, No. three, JIANGCHANG Road, Jingan District, Shanghai, 411 Patentee after: SHANGHAI INSPUR CLOUD CALCULATING SERVICE CO.,LTD. Address before: 100085 floor 1, C 2-1, No. 2, Shang Di Road, Haidian District, Beijing. Patentee before: INSPUR (BEIJING) ELECTRONIC INFORMATION INDUSTRY Co.,Ltd. |
|
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20221024 Address after: 071000 Room 502, Block B, East Lake Yunduan Science and Technology Industrial Park, No. 1111, Jinhe Street, Dongjinzhuang Township, Lianchi District, Baoding City, Hebei Province Patentee after: Baoding Inspur Cloud Computing Co.,Ltd. Address before: 200436 Room 411, No. three, JIANGCHANG Road, Jingan District, Shanghai, 411 Patentee before: SHANGHAI INSPUR CLOUD CALCULATING SERVICE CO.,LTD. |