CN104820698B - A kind of distributed consensus implementation method of data screening algorithm - Google Patents
A kind of distributed consensus implementation method of data screening algorithm Download PDFInfo
- Publication number
- CN104820698B CN104820698B CN201510230896.7A CN201510230896A CN104820698B CN 104820698 B CN104820698 B CN 104820698B CN 201510230896 A CN201510230896 A CN 201510230896A CN 104820698 B CN104820698 B CN 104820698B
- Authority
- CN
- China
- Prior art keywords
- rule
- distributed
- resource
- centralized
- agency
- 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.)
- Expired - Fee Related
Links
Landscapes
- Multi Processors (AREA)
Abstract
The present invention provides a kind of distributed consensus implementation method of data screening algorithm, and avoid centralized fashion causes the global disabled situation of system to occur because the node at regular center is abnormal, while also ensures that all rules to come into force that create by examination ＆ approval.Using the solution of " centralization+distributed " double trestle structures, two stacks run at the same time in wide area network aspect, are non-interference the present invention, reconcile the inconsistent state of result on two stacks on endpoint, realize and concentrate examination ＆ approval function and local availability preferential.With audit generation examination ＆ approval for condition of grant, support part can use precedence constraint.
Description
Technical field
The present invention relates to a kind of distributed consensus implementation method of data screening algorithm, belongs to modern data filtering
Field.
Background technology
Data screening algorithm will be applied in the environment of multi-user, distribution and wide area networking, in its data
For the heart often in network tip, resource is big, and interconnection bandwidth is low, local to use there is also certain constraints policy between resource and user
Family can directly manage local resource, and long-distance user then needs to be connected to resource-side by comprehensively utilizing server.
The characteristics of different from general distributed system " decentralization ", data screening algorithm requirement have a management and control/
Role is arbitrated, the concentration to complete to rule is examined, to realize the screening to regular legitimacy.This just needs us to design one
Centralized management scheme.Distributed wide area networking is not very reliable, there are interruption, bandwidth is low, packet loss, big delay the shortcomings of, such as
Fruit Distributed-solution designs unreasonable, for global coherency, it is possible to must sacrifice local availability, or even cause to use
Family is using the obstacle on local resource, and local availability is preferentially the primary demand of user.
CAP (Consistency, Availability, Partition tolerance) law is taught that：At one
In distributed system, these three guarantees of uniformity, availability and subregion fault-tolerance can not be met at the same time.It is for distribution
System, subregion fault-tolerance is basic demand, therefore design can only make balance between uniformity and availability, and here it is have CP
System, AP systems and BASE model systems【I.e. basically available (Basically Available), flexible consistent (Soft
State) with final consistent (Eventually consistent)】The reason for Deng design pattern.
Data Consistency mostlys come from more copies in distributed system (referring mainly to geographic distribution here),
Modification i.e. in system there are multiple copies, data would generally carry out on the different copies.In order to solve one in distribution
Sex chromosome mosaicism is caused, existing several typical algorithms mainly have：Two-phase commitment algorithm, Lamport bakerys algorithm, Paxos algorithms,
Method of synchronization that Gossip algorithm and the optimistic lock principle of use are realized etc..Three of Google in 2006 are on " chubby lock clothes
The paper of business " points out that other distributed algorithms are all considered as the specialization form of Paxos.In consideration of it, only introduce below
Paxos algorithms once：
Paxos algorithms are that distributed consensus algorithm is used for solving how a distributed system reaches with regard to some value (resolution)
Into it is consistent the problem of.One typical scene is, in a distributed data base system, if the original state one of each node
Cause, each node is carried out the identical sequence of operation, then they can finally obtain a consistent state.To ensure each section
Point performs identical command sequence, it is necessary to perform one " consistency algorithm " in each instruction to ensure that each node is seen
Instruction it is consistent.Paxos algorithms are the consistency algorithms of a more efficient, and traditional distributed lock algorithm or not quite alike
, such as RA algorithms, the locking and de-locking on it and unit have one it is maximum what is common is that have it is apparent " request -- etc.
Treat " process, and relatively independent between Paxos algorithms each examples, election process can be with parallel execution, the example that occurs afterwards
It is that the example that can first occur again is decided by vote before, the sensation of not obvious " request -- wait ".Specific in application,
Distributed lock algorithm is more the sensation of " mutual exclusion ", and consistency algorithm is more the sensation of " synchronization ".Whole Paxos algorithms
It can be regarded as multiple intersection execution and interactional Two-phase commitment algorithm, the algorithm have the characteristics that：
1st, 3 points based on message transmission are it is assumed that i.e. no Byzantium general problem (Byzantine failure)；As long as
Time enough is waited, message will be transferred to；And the Congressman on Paxos islands is will not to oppose determining for other Congressmen proposition
View.
2nd, still can normally work in the case where nodal point number is less than half failure, node fails can be at any time
Occur normally to perform without influencing algorithm；Before proposer proposes a motion, first have to and be enough to form majority
Acceptors communicates, and obtains the last motion received of their progress.
3rd, whole algorithm is basically to be carried out around motion numbering：Proposer is busy with selecting the numbering of bigger to carry
Friendship proposal, whether the numbering that acceptor then compares the proposal of submission has been maximum, as long as numbering determines, institute is right
The value answered is also determined that.
4th, a distributed problem is converted into a single-point problem, and the robustness of single-point is ensured by election mechanism,
Its solution is to elect a proposer to make leader, and all proposal are submitted by leader, when
Leader delay machine when at once elect other Leader again.
5th, proposer, acceptor, learner cannot be promised to undertake and necessarily occurred when others needs in Paxos algorithms,
Also it can not promise to undertake approval resolution or transmit the time of message.
Paxos algorithms are widely used in distributed consensus, but are needed towards our algorithm application
Ask, still there are following problem to be difficult to overcome for Paxos algorithms：
1st, the message in algorithm may lose during (storage forwarding) is transmitted, and Paxos algorithms
Message is then required all must reliably to reach.
2nd, in the case of wide area network failure, this resource user remains to manage this resource apparatus for algorithm requirement, but
Paxos algorithms can not be worked normally in the case where number of nodes is more than half failure conditions, also can not just realize this resource user to this money
The management of source device.
3rd, algorithm needs regular center to examine rule, and Paxos algorithms have the characteristics that decentralization, section
It is completely reciprocity between point, it is not necessary to any Centroid, so examination ＆ approval function can not be performed.
4th, algorithm plays the part of " grand justice " role using the regular center of centralization, and Paxos algorithms using random or
Timeout mechanism realizes election algorithm.
The content of the invention
The present invention provides a kind of distributed consensus implementation method of data screening algorithm, avoids centralized fashion
Cause the global disabled situation of system to occur because the node at regular center is abnormal, while also ensure that all rule for creating and coming into force
Then by examination ＆ approval.
Technical scheme is as follows：
A kind of distributed consensus implementation method of data screening algorithm, comprises the following steps：
Step 1: subscription client by WebService by rule set RuSend to user agent, user agent is by RuSolution
Analyse as Ru={ M1Ru, M2Ru..., MnRu, wherein M represents means, MiRuIt is unique by database for atomic rule, user agent
Property the constraint storage rule on centralized and distributed respectively；
Step 2: DDS middlewares are passed through as theme, distributed user agency using the resource of atomic rule and means classification
" publication/subscription " pattern is by MiRuIt is delivered to corresponding resource broker service device；At the same time, centralized user agent also by
Atomic rule is committed to regular center by DDS middlewares；If deliver failure if asynchronous return mistake, successful synchronization state after
Afterflow journey；
Step 3: rule centrally through database unique constraints storage rule, builds strictly all rules view, while to rule
Then examined；Distributed resource agency is put in storage the atomic rule received, and submits them to centralized resources agency
Enter library storage, while all atomic rules are deployed to corresponding resource apparatus；
Step 4: approval results are acted on behalf of and delivered by regular center by DDS middlewares to centralized resources；Lost if delivered
Lose then asynchronous return mistake, successful synchronization state and then continue flow；
Step 5: centralized resources agency corrects atomic rule state according to approval results, and by revised rule
State submits to distributed resource agency and regular center respectively；Distributed resource agency waits resource apparatus to return to deployment message
Examination ＆ approval message is returned with centralized Resource Broker, if resource apparatus and centralized Resource Broker return to validation message, is distributed
Formula Resource Broker acts on behalf of Feedback Rule to distributed user and comes into force；Otherwise, if resource apparatus and centralized Resource Broker wherein
Any one returns to Pending The Entry Into Force message, and distributed resource agency then acts on behalf of Feedback Rule Pending The Entry Into Force to distributed user；
Step 6: distributed resource agency is come into force to distributed user agency and centralized Resource Broker Feedback Rule respectively
Whether message；Meanwhile centralized resources are acted on behalf of to message whether regular center feedback taking effect rules, regular center is again to centralization
User agent's Feedback Rule comes into force situation；
Step 7: distributed user is acted on behalf of to centralized user agent's co-ordination principle uniformity, subscription client is from distribution
Formula user agent obtains the state of rule, mutually coordinated by two kinds of frameworks of Distribution and Centralization, to reach rule state
Final consistency.
Beneficial effects of the present invention：
1st, the present invention is directed to the application scenarios of multi-user, distribution and wide area networking, analyzes data screening algorithm
Application demand, have studied relevant distributed consensus algorithm, drawn one can use engineering solution substitute science solution knot
By finally giving a specific Project Realization scheme.
2nd, in the environment that more Autonomous Domains are integrated, the thought of internal inconsistency is not transmitted externally based on information, basic
It is " autonomous uniformity " in domain by the consistency problem Mandatory Decomposition on multiple domains on the premise of meeting user's needs, and finally
Ensure two domains at borderline " coordinative coherence ", so can it is one big the problem of spatial decomposition and defeat in detail.
3rd, using a kind of solution of " centralization+distributed " double trestle structures, two stacks in wide area network aspect at the same time
Operation, it is non-interference, on endpoint reconcile two stacks on result inconsistent state, realize concentrate examination ＆ approval function and part can
It is preferential with property.
4th, with audit generation examination ＆ approval for condition of grant, support part can use precedence constraint.Audit needs people to participate in, for a long time
Hang-up is unfavorable for uniformity reconciliation, after being analysed in depth to user demand, iting is found that examination ＆ approval in advance completely can be subsequent
Audit substituted, and this replacement can make the realization of local availability preference strategy more unsophisticated.
Brief description of the drawings
Fig. 1 is double trestle structures of algorithm of the present invention.
Fig. 2 is that the state machine of algorithm of the present invention migrates flow.
Embodiment
The invention will be described further below in conjunction with the accompanying drawings.
In order to avoid centralized fashion causes the global disabled situation of system to occur because the node at regular center is abnormal,
Again ensure at the same time it is all create the rule to come into force by examination ＆ approval, centralized and distributed be combined this paper presents a kind of
Double trestle structures (see Fig. 1).Wherein, thick dashed line represents the connection of distributed structure/architecture, and heavy line represents the connection of centralized architecture, is
System uses Message-Passing Model.
System is made of user agent, regular four layers of center, Resource Broker and resource apparatus, wherein user agent and resource
Agency is using way to manage that is centralized and distributed and depositing.In new algorithm, centralized user agent, regular center
Acted on behalf of with centralized resources and form centralized architecture, and distributed user agency, the equity interconnection of distributed resource agency are formed
Distributed structure/architecture, centralization are run, are not interfere with each other in communication aspect parallel with distributed double stacks.
During increase rule, the Rule content of establishment is sent to distributed user and acted on behalf of by user, by it directly by under rule
Distributed resource agency is sent to, then rule is delivered to corresponding resource apparatus, rule need not examine first in distributed structure/architecture
Come into force temporarily；Centralized user agent then sends rule to regular center, and received rule is examined by regular center,
And approval results are handed down to centralized resources agency, which is issued dividing in same level by centralization again after receiving message
Cloth；Distributed resource agency is modified the state of rule according to approval results, and by revised rule state to disappear
Breath form passes to distributed user agency, centralized resources agency and resource apparatus at the same time；Centralized resources are acted on behalf of message
Be transferred to centralized user agent step by step upwards, same level it is distributed to centralized coordinative coherence；User is then from distribution
Formula user agent knows specifying information whether taking effect rules.
During deletion rule, distributed structure/architecture issues the Rule content of deletion step by step, and then need not again in centralized architecture
The rule of deletion is examined, is directly issued step by step, it is at the same time, same on user agent and Resource Broker layer
Level it is distributed to centralized coordinative coherence；User still knows the specific feelings of redundant rule elimination from distributed user Agency
Condition.
In algorithm, whether distributed or centralized architecture, creates or during deletion rule, message is all by upper
Down transmit step by step, and message whether taking effect rules or deletion is then to transmit step by step from lower to upper.
Whole algorithm framework is designed based on following principle：
1. functionally in a distributed manner based on, in effectiveness based on centralization
Strictly all rules does not have to the first approval results for coming into force temporarily, waiting rule center of examination ＆ approval in distribution, if center is examined
Criticize not by the rule to come into force in resource being modified to Pending The Entry Into Force state, and reason feedback is to terminal user.Accordingly even when
In the case that regular center is abnormal, distributed structure/architecture operates as usual, and system still can normally complete the increase of rule, delete
Work, so that it is guaranteed that system functionally and is not affected by too big influence.
In new algorithm, centralized and distributed two sets of solutions exist at the same time in wide area network aspect,
Both ends (resource-side and user terminal) while coordinate the inconsistent of both effectiveness, based on the regular center of centralization.
2. not transmitting the thought of internal inconsistency externally based on information, the reliable delivery step by step of message is realized
2012, Poulin proposed a kind of thought that identity is not transmitted in SOA (Services Oriented Achitecture) and cloud,
Given this thought, security and managerial demand based on system, in cascaded form network environment, tandem node will need to transmit
Message encapsulated on the border of cascade, by cascade (dividing domain) coherency management, ensure two domains border uniformity, from
And a big consistency problem is tied under small environment.
In this rule system, user encapsulates and transmits on the two border with wide area internetwork message using networking, wide area network
Also only encapsulate and transmit on the two border with resource group internetwork message, and user can not then be disappeared with resource networking by border
Breath transmits, and the network environment entirely cascaded is thus divided into two points of domains, the consistent performance on domain border accesses guarantee, disappears
Breath does not transmit the inconsistency of inside externally.
3. with audit generation examination ＆ approval for condition of grant, support part can use preference strategy
Required according to original system, the examination ＆ approval function of executing rule is not only wanted at regular center, can also be realized to rule
Audit, if it will audit and examination ＆ approval function separately forms two kinds of management modes, will destroy the local availability of system, be
Avoid this problem, this rule system with generation examination ＆ approval of auditing for condition of grant so that the part for supporting system can use preferentially
Strategy.
First, the implementation method of algorithm
1st, state machine migration pattern, the coherence request of implementation rule distributed deployment are passed through
The state of state machine description has two kinds of major classes, logic when one kind is task run.Second of type is algorithm logic,
Using logic state machine, clearly characteristic describes complicated algorithm.
This rule system uses first kind state machine, by the migration of state machine come the consistent of implementation rule distributed deployment
Property.The state of this state diagram is typically that task is waiting some condition to reach, that is, task is in " wait state ".Usually
Task is to push directly on the engine of state machine running in itself, and the event of task inspection state machine itself reaches situation and divided
Hair.The transition of task status reach triggering by some event, it is desirable to which synchronization mechanism has readjustment ability between task, so as in bar
Part is pressed into event when setting up into state machine events queue.
User is by regular RuIt is issued to user agent, user agent creates rule and by R on ituResolve to Ru={ M1Ru,
M2Ru..., MnRu(wherein M represents means, MiRuFor atomic rule), user agent feeds back according to regular center and Resource Broker
Atomic rule status message carry out regulation rule state：During increase rule, as long as there is an atomic rule MiRuCome into force user i.e.
Rule R on agencyuState be adjusted to come into force, and to the concrete condition of the other Pending The Entry Into Force atomic rules of user's feedback；Delete rule
When then, only all atomic rule MiRuAll delete successfully, user agent just will rule R thereonuState be adjusted to delete,
For the not deleted atomic rule in part, then using persistence deleting mechanism untill it is all deleted successfully.
This rule system uses two sets of state machine modes, its atomic rule state machine transition graph is as shown in Fig. 2, wherein each layer
Level is expressed as：Distributed user Agent layer-DUL, centralized user agent layer-CUL, regular central core-RCL, distribution
Formula Resource Broker layer-DPL；Centralized resources Agent layer-CPL, processing equipment layer-EL.Migration is defined as：Trigger event E |
State operates (outgoing event E ')；Trigger event defines：Level _ event-action occurs for event；In addition to local operation is completed, send
Message need to determine that other side receives and stores, and at this moment just the state of rule can be considered as stable state.
When to create rule exemplified by the state machine migration flow of atomic rule, in distributed structure/architecture, distributed user generation
After reason receives the rule creation U_create message that user sends, i.e., the atomic rule is 1. created in the database, and will
The rule state is set to DUL_created (establishment)；2. export DUL_create message to distributed resource to act on behalf of, it is thus necessary to determine that
DPL is received and stored, while DUL_create message is sent to centralized user agent.Defined according to state transition, Fig. 2 is used
" U_create | UP1 (DUL_create) " represents aforesaid operations.After distributed resource agency receives DUL_create message,
1. creating the atomic rule in the database, and the rule state is set to DPL_created；2. DPL_create message is sent out
Send to CPL, while send to EL, it is thus necessary to determine that EL is received and stored.Acted on behalf of similar to distributed user, we use " DUL_
Create | PP1 (DPL_create) " represent aforesaid operations.After resource apparatus receives DPL_create message, in resource apparatus
The atomic rule is created, with " DPL_create | EP1 " is represented.
In centralized architecture, centralized user agent receives the DUL_create message from distributed user agency
Afterwards, the atomic rule is 1. created in the database, and the rule state is set to CUL_created；2. CUL_create is disappeared
Breath is sent to regular center, it is thus necessary to determine that RCL is received and stored.Aforesaid operations use " DUL_create | UCP1 (CUL_
Create) " represent.After regular center receives CUL_create message, the atomic rule is 1. created in the database, and this is advised
Then state is set to RCL_created；2. RCL_create message is sent to CPL, it is thus necessary to determine that CPL is received and stored.With
" CUL_create | RCP1 (RCL_create) " is represented.Centralized resources are acted on behalf of after RCL_create message is received, and are 1. existed
The atomic rule is created in database, and the rule state is set to CPL_created；2. CPL_create is sent to same
The distribution of layer.Represented herein with " RCL_create | PCP1 (CPL_create) ".
When creating rule, if regular center is broken down, centralized resources agency can not receive RCL_create message,
But the DPL_create message from distributed resource agency can be received；If there is abnormal, distribution in wan communication
Resource Broker may can not receive DUL_create message, but has no effect on and receive the centralized resources agency of same layer and send
CPL_create message.
To sum up, by the contrast and amendment of two sets of state machines of Distribution and Centralization, this rule system is realized to apply and needed
Ask concentration examination ＆ approval function and the local availability of middle proposition preferential.
2nd, the publish/subscribe model based on DDS, realizes reliable communication under wide area network distributed environment
Publisher and subscriber are associated by theme in publish/subscribe model, and both sides need not know about other side wherein,
Need not be online at the same time, realize the multidimensional loose coupling of communicating pair time, space and data communication.
Existing Publish/Subscribe Middleware product is very much, as Java Message Service (Java message service,
JMS) specification solves the interconnection problem between each vendor product substantially, but the specification is used in distributed real time environment and also deposits
In many problems：It is realized using Java, have impact on the real-time of system；QoS constraints are not proposed in JMS, user cannot
Communication mode is specified according to their needs, limits the flexibility of communication；Master is preserved using fixed node server in JMS
Topic or queue, it is impossible to equally loaded or failure transfering node server, presence server bottleneck and security risk.
Data distributing (data distribution service, DDS) be OMG after CORBA specifications are released, specially
Door is directed to the latest specification that data publication/subscription model is promulgated in distributed real-time systems, it is purely data-centered
To carry out data distribution, and resource situation, the expectation degree to resource, Network status etc. are all described with qos parameter, significantly
Enhance real-time and the flexibility of communication.
3rd, the reconciliation mechanism based on checkpoint, realizes the uniformity revision to rule state
Data screening algorithm needs to ensure that the permanent of local data can use, cannot lose, once loss of data is run into,
The situation of storage disk array corrupted, above-mentioned requirements do not ensure that this requires we have to carry out reconciliation.
Reconciliation is from regular center to distributed user agency, centralized user agent, distributed resource is acted on behalf of and resource generation
Reason centralization initiates reconciliation request, is obtained according to checkpoint points from this in certain time (before checkpoint points
Time of reconciliation was not carried out in checkpoint points) the rule state sequence completed, then with the rule at regular center
Then status switch is compared.When rule state sequence order occurs inconsistent, " establishment " state is subject to user agent,
" coming into force ", " Pending The Entry Into Force " and " deletion " state is subject to Resource Broker.
Claims (1)
1. a kind of distributed consensus implementation method of data screening algorithm, it is characterised in that comprise the following steps：
Step 1: subscription client by WebService by rule set RuSend to user agent, user agent is by RuResolve to
Ru={ M1Ru, M2Ru..., MnRu, wherein M represents means, MiRuFor atomic rule, user agent by database uniqueness about
The beam storage rule on centralized and distributed respectively；
Step 2: " gone out by DDS middlewares as theme, distributed user agency using the resource of atomic rule and means classification
Version/subscription " pattern is by MiRuIt is delivered to corresponding resource broker service device；At the same time, centralized user agent is also by DDS
Atomic rule is committed to regular center by middleware；The asynchronous return mistake if failure is delivered, successful synchronization state continue
Flow；
Step 3: rule centrally through database unique constraints storage rule, builds strictly all rules view, at the same to rule into
Row examination ＆ approval；Distributed resource agency is put in storage the atomic rule received, and submits them to centralized resources agency's storage
Storage, while all atomic rules are deployed to corresponding resource apparatus；
Step 4: approval results are acted on behalf of and delivered by regular center by DDS middlewares to centralized resources；If failure is delivered
Asynchronous return mistake, successful synchronization state then continue flow；
Step 5: centralized resources agency corrects atomic rule state according to approval results, and by revised rule state
Distributed resource agency and regular center are submitted to respectively；Distributed resource agency waits resource apparatus to return to deployment message sum aggregate
Chinese style Resource Broker returns to examination ＆ approval message, if resource apparatus and centralized Resource Broker return to validation message, distribution money
Source, which is acted on behalf of, to be acted on behalf of Feedback Rule to distributed user and comes into force；Otherwise, as long as resource apparatus and centralized Resource Broker are wherein any
One return Pending The Entry Into Force message, distributed resource agency then act on behalf of Feedback Rule Pending The Entry Into Force to distributed user；
Step 6: whether distributed resource agency is come into force to distributed user agency and centralized Resource Broker Feedback Rule respectively
Message；Meanwhile centralized resources are acted on behalf of to message whether regular center feedback taking effect rules, regular center is again to centralized user
Feedback Rule is acted on behalf of to come into force situation；
Used Step 7: distributed user is acted on behalf of to centralized user agent's co-ordination principle uniformity, subscription client from distribution
Family agency obtains the state of rule, mutually coordinated by two kinds of frameworks of Distribution and Centralization, to reach the final of rule state
Uniformity.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510230896.7A CN104820698B (en) | 2015-05-08 | 2015-05-08 | A kind of distributed consensus implementation method of data screening algorithm |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510230896.7A CN104820698B (en) | 2015-05-08 | 2015-05-08 | A kind of distributed consensus implementation method of data screening algorithm |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104820698A CN104820698A (en) | 2015-08-05 |
| CN104820698B true CN104820698B (en) | 2018-05-11 |
Family
ID=53730993
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510230896.7A Expired - Fee Related CN104820698B (en) | 2015-05-08 | 2015-05-08 | A kind of distributed consensus implementation method of data screening algorithm |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104820698B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105119992A (en) * | 2015-08-24 | 2015-12-02 | 用友网络科技股份有限公司 | Distributed task execution apparatus and method |
| CN107040618B (en) * | 2016-12-06 | 2020-09-11 | 北京信息科技大学 | Decentralized network domain name service system and method |
| CN109685360A (en) * | 2018-12-19 | 2019-04-26 | 成都四方伟业软件股份有限公司 | Data quality checking method and device |
| CN114510495B (en) * | 2022-04-21 | 2022-07-08 | 北京安华金和科技有限公司 | Database service data consistency processing method and system |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101410829A (en) * | 2006-02-13 | 2009-04-15 | 易邮服务公司 | System and method for message transmit-receive and document management |
| US8315975B2 (en) * | 2002-12-09 | 2012-11-20 | Hewlett-Packard Development Company, L.P. | Symbiotic wide-area file system and method |
| CN104063473A (en) * | 2014-06-30 | 2014-09-24 | 江苏华大天益电力科技有限公司 | Database auditing monitoring system and database auditing monitoring method |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101771715B (en) * | 2008-12-26 | 2014-04-16 | 华为技术有限公司 | Method, device and system for establishing distribution type network |
-
2015
- 2015-05-08 CN CN201510230896.7A patent/CN104820698B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8315975B2 (en) * | 2002-12-09 | 2012-11-20 | Hewlett-Packard Development Company, L.P. | Symbiotic wide-area file system and method |
| CN101410829A (en) * | 2006-02-13 | 2009-04-15 | 易邮服务公司 | System and method for message transmit-receive and document management |
| CN104063473A (en) * | 2014-06-30 | 2014-09-24 | 江苏华大天益电力科技有限公司 | Database auditing monitoring system and database auditing monitoring method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104820698A (en) | 2015-08-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11552950B2 (en) | Blockchain interoperability | |
| US10931599B2 (en) | Automated failure recovery of subsystems in a management system | |
| CN111183625B (en) | System and method for deleting nodes in a blockchain network | |
| EP3652893B1 (en) | Efficient distribution of peer zone database in fibre channel fabric | |
| US10949548B2 (en) | Systems and methods for providing multi-node resiliency for blockchain peers | |
| CN104820698B (en) | A kind of distributed consensus implementation method of data screening algorithm | |
| US6662219B1 (en) | System for determining at subgroup of nodes relative weight to represent cluster by obtaining exclusive possession of quorum resource | |
| CN105607954B (en) | A kind of method and apparatus that stateful container migrates online | |
| US7870230B2 (en) | Policy-based cluster quorum determination | |
| US6324590B1 (en) | Replicated resource management system for managing resources in a distributed application and maintaining a relativistic view of state | |
| US5612865A (en) | Dynamic hashing method for optimal distribution of locks within a clustered system | |
| CN108234306A (en) | Network equipment, network method and computer readable storage medium | |
| CN113037552A (en) | Network method, network device, and computer-readable storage medium | |
| CN108234302A (en) | Keep the consistency in the distributed operating system of network equipment | |
| US20010042139A1 (en) | Replicated resource management system for managing resources in a distributed application and maintaining a relativistic view of state | |
| CN111309374A (en) | Micro-service system and service calling method in micro-service system | |
| Quesnel et al. | Cooperative and reactive scheduling in large‐scale virtualized platforms with DVMS | |
| CN111181715A (en) | Multi-party cross-linking method based on consistent Hash consensus protocol | |
| US10270759B1 (en) | Fine grained container security | |
| US20210194890A1 (en) | In a distributed computing system with untrusted entities method and apparatus for enabling coordinated executions of actions | |
| CN105610947A (en) | Method, device and system for realizing high-available distributed queue service | |
| CN113055190B (en) | Access control method for client | |
| US9342291B1 (en) | Distributed update service | |
| US20170300553A1 (en) | System and methodology for propagating modifications in key-value pairs across a cluster of computers | |
| US8799922B2 (en) | Programming model for collaborative distributed systems |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| EXSB | Decision made by sipo to initiate substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB03 | Change of inventor or designer information | ||
| CB03 | Change of inventor or designer information |
Inventor after: Guo Tong Inventor after: Zhang Ju Inventor after: Dong Hongjun Inventor after: Liu Peng Inventor after: Yang Lijun Inventor after: Sun Jiahui Inventor after: Sun Zhanjun Inventor after: Li Cong Inventor after: Wang Yunkuo Inventor before: Guo Tong Inventor before: Wen Tao Inventor before: Sun Jiahui Inventor before: Zhang Ju Inventor before: Dong Hongjun Inventor before: Wang Xin Inventor before: Yang Lijun Inventor before: Liu Peng Inventor before: Li Kai Inventor before: Sun Zhanjun Inventor before: He Guoxi |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20180511 Termination date: 20210508 |