CN110493300A - A kind of distributed data system and Distributed Data Synchronization method - Google Patents
A kind of distributed data system and Distributed Data Synchronization method Download PDFInfo
- Publication number
- CN110493300A CN110493300A CN201811128035.8A CN201811128035A CN110493300A CN 110493300 A CN110493300 A CN 110493300A CN 201811128035 A CN201811128035 A CN 201811128035A CN 110493300 A CN110493300 A CN 110493300A
- Authority
- CN
- China
- Prior art keywords
- node
- distributed
- data
- client
- stored
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 28
- 238000004891 communication Methods 0.000 claims description 19
- 238000003860 storage Methods 0.000 claims description 15
- 238000001514 detection method Methods 0.000 claims description 8
- 238000009826 distribution Methods 0.000 claims description 8
- 239000004744 fabric Substances 0.000 claims description 6
- 230000001360 synchronised effect Effects 0.000 description 13
- 230000006870 function Effects 0.000 description 6
- 238000010586 diagram Methods 0.000 description 4
- 230000000712 assembly Effects 0.000 description 3
- 238000000429 assembly Methods 0.000 description 3
- 230000000977 initiatory effect Effects 0.000 description 3
- 238000007726 management method Methods 0.000 description 3
- 230000008569 process Effects 0.000 description 3
- 239000007787 solid Substances 0.000 description 3
- 241001269238 Data Species 0.000 description 2
- 230000008901 benefit Effects 0.000 description 2
- 230000005540 biological transmission Effects 0.000 description 2
- 230000008859 change Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 230000002159 abnormal effect Effects 0.000 description 1
- 238000012217 deletion Methods 0.000 description 1
- 230000037430 deletion Effects 0.000 description 1
- 230000014759 maintenance of location Effects 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000004321 preservation Methods 0.000 description 1
- 230000002035 prolonged effect Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 230000001755 vocal effect Effects 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/06—Network architectures or network communication protocols for network security for supporting key management in a packet data network
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L65/00—Network arrangements, protocols or services for supporting real-time applications in data packet communication
- H04L65/40—Support for services or applications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1095—Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/56—Provisioning of proxy services
- H04L67/568—Storing data temporarily at an intermediate stage, e.g. caching
- H04L67/5682—Policies or rules for updating, deleting or replacing the stored data
Abstract
The invention discloses a kind of distributed data system and Distributed Data Synchronization methods.Disclosed distributed data system includes: distributed node, for active or according to request to the direct synchrodata of adjacent node of distributed node, and according to data access request, the data not stored into nonneighbor node indirect synchronization nonneighbor node of the nonneighbor node for distributed node.Disclosed technical solution, can between numerous nodes quickly and reliably shared data.
Description
Technical field
The present invention relates to computer network and field of information security technology more particularly to a kind of distributed data system and divide
Cloth method of data synchronization.
Background technique
The appearance of computer network brings convenience to the work and life of people, people can by computer network come
Shared information.The form of computer network is varied, network, the distributed p 2 p of the CS/BS mode including centralization
Deng.Either any network, it is how quickly and reliably total between numerous nodes since the node of network consisting is numerous
Enjoy the important topic that data are always people's research.
In addition, also needing to share some significant datas relevant to information security in a computer network --- key, this
A little significant datas need to be managed using special key management system (KMS), prevent from revealing.For distributed key
Management system, the problem of being equally also faced between numerous nodes quickly and reliably shared key data.
Therefore, to solve the above-mentioned problems, need to propose new technical solution.
Summary of the invention
Distributed data system according to the present invention, comprising:
Distributed node, for active or according to request to the direct synchrodata of adjacent node of distributed node, and
According to the data access request of the nonneighbor node for distributed node, into nonneighbor node indirect synchronization nonneighbor node
Not stored data.
Distributed data system according to the present invention, further includes:
Client node, for sending data access request to distributed node；
Distributed node is also used to:
When user is by stored data in client-node access distributed node, directly returned to client node
Return stored data；
When user is by data not stored in client-node access distributed node, to the adjacent of distributed node
The not stored data of querying node, if inquiring not stored data, indirect synchronization is simultaneously looked into client node return indirectly
The not stored data ask repeat query steps until inquiring not stored number if not inquiring not stored data
Until returning to the not stored data inquired indirectly according to and to client node, or until all points in the system of having inquired
Until cloth node,
Wherein, data include that user passes through client node to distributed node upload and/or the life on distributed node
At symmetric key and/or private key and/or public key.
Distributed data system according to the present invention, distributed node are also used to:
At least one adjacent node is determined based on the result of link communication quality detection.
Distributed data system according to the present invention, wherein the communication delay between distributed node is lesser extremely
A few distributed node is determined as the adjacent node of distributed node, by other distributions in system other than adjacent node
Formula node is determined as the nonneighbor node of distributed node.
Distributed data system according to the present invention, distributed node are also used to:
According to the data access request for deleting stored data in distributed node, while deleting distributed section
Point, distributed node adjacent node and nonneighbor node in stored corresponding data, and/or, in scheduled storage duration
After not accessed, it is automatically deleted the data obtained through indirect synchronization.
Distributed Data Synchronization method according to the present invention, comprising:
Via distributed node actively or according to the direct synchrodata of adjacent node requested to distributed node；
According to the data access request of the nonneighbor node for distributed node, to the non-phase of nonneighbor node indirect synchronization
Not stored data in neighbors.
Distributed Data Synchronization method according to the present invention, further includes:
Data access request is sent to distributed node via client node；
Following steps are executed via distributed node:
When user is by stored data in client-node access distributed node, directly returned to client node
Return stored data；
When user is by data not stored in client-node access distributed node, to the adjacent of distributed node
The not stored data of querying node, if inquiring not stored data, indirect synchronization is simultaneously looked into client node return indirectly
The not stored data ask repeat query steps until inquiring not stored number if not inquiring not stored data
Until returning to the not stored data inquired indirectly according to and to client node, or until all points in the system of having inquired
Until cloth node,
Wherein, data include that user passes through client node to distributed node upload and/or the life on distributed node
At symmetric key and/or private key and/or public key.
Distributed Data Synchronization method according to the present invention, further includes:
Following steps are executed via distributed node:
At least one adjacent node is determined based on the result of link communication quality detection.
Distributed Data Synchronization method according to the present invention, further includes:
Following steps are executed via distributed node:
At least one lesser distributed node of communication delay between distributed node is determined as distributed node
Adjacent node, other distributed nodes in system other than adjacent node are determined as to the non-adjacent section of distributed node
Point.
Distributed Data Synchronization method according to the present invention, further includes:
Following steps are executed via distributed node:
According to the data access request for deleting stored data in distributed node, while deleting distributed section
Point, distributed node adjacent node and nonneighbor node in stored corresponding data, and/or, in scheduled storage duration
After not accessed, it is automatically deleted the data obtained through indirect synchronization.
Above-mentioned technical proposal according to the present invention, can between numerous nodes quickly and reliably shared data.
Detailed description of the invention
It is incorporated into specification and the attached drawing for constituting part of specification shows the embodiment of the present invention, and with
Relevant verbal description principle for explaining the present invention together.In the drawings, similar appended drawing reference is for indicating class
As element.Drawings in the following description are some embodiments of the invention, rather than whole embodiments.It is common for this field
For technical staff, without creative efforts, other drawings may be obtained according to these drawings without any creative labor.
Fig. 1 schematically illustrates the schematic diagram of distributed data system according to the present invention.
Fig. 2 (a)-(b) schematically illustrates the schematic flow diagram of Distributed Data Synchronization method according to the present invention.
Specific embodiment
In order to make the object, technical scheme and advantages of the embodiment of the invention clearer, below in conjunction with the embodiment of the present invention
In attached drawing, technical scheme in the embodiment of the invention is clearly and completely described, it is clear that described embodiment is
A part of the embodiments of the present invention, instead of all the embodiments.Based on the embodiments of the present invention, ordinary skill people
Member's every other embodiment obtained without making creative work, shall fall within the protection scope of the present invention.It needs
It is noted that in the absence of conflict, the features in the embodiments and the embodiments of the present application can mutual any combination.
Fig. 1 schematically illustrates the schematic diagram of distributed data system according to the present invention.
As shown in Figure 1, distributed data system according to the present invention, comprising:
Distributed node (indicates in Fig. 1 with Nx, such as N1, N2, N3 etc.), for actively or according to request to distribution
The direct synchrodata of the adjacent node of node, and according to for distributed node nonneighbor node data access request,
The not stored data into nonneighbor node indirect synchronization nonneighbor node.
For example, for node N5 has updated data D in a distributed manner.N5 is after local update data D, Xiang Qixiang
Neighbors N4, N6, N7, N8 (direct) synchrodata D.For distributed node N5 adjacent node (that is, another distribution section
Point) for N4, although the adjacent node of itself includes N5 and N3, however, since N1, N2 and N3 are the nonneighbor nodes of N5,
Therefore, N4 does not continue to N3 synchrodata D.That is, above-mentioned active or according to request to distributed node adjacent node (direct)
Synchrodata.
If (for example, user or other equipment) are needed using data D (for example, initiating data for nonneighbor node N1
Access request) because N1 is not saved data D (that is, for N1, as above-mentioned not stored data), therefore N1 needs
The request that synchrodata D is initiated to its adjacent node N2, after N2 receives request, because N2 does not have data D, N1 to connect yet
The request of synchrodata D is initiated to its another adjacent node N3, since N3 does not have data D yet, N3 then Xiang Qixiang
The request of neighbors N4 initiation synchrodata D.N4 node has data D, therefore data D can be returned to N3 by N4 node, and N3 continues
According to backtracking until N1.After N1 obtains data D, it just will use data D and carry out subsequent processing.In this process,
N2 and N3 can also save data D.That is, according to the data access request of the nonneighbor node for distributed node, to non-adjacent
Not stored data in (indirect) the synchronous nonneighbor node of node.
That is, distributed node can only be to or from the direct synchrodata of its adjacent node.If some distributed node institute
(user) data obtained are directly synchronized from its adjacent node, then are not continued directly same to other adjacent nodes of oneself
Step should (user) data.Wherein, other adjacent nodes are the non-adjacent of the adjacent node as the source of the data synchronized
Node.
Although being not shown in Fig. 1, However, alternatively, distributed data system can also include:
Client node, for sending data access request to distributed node；
Distributed node is also used to:
When user is by stored data in client-node access distributed node, directly returned to client node
Return stored data；
When user is by data not stored in client-node access distributed node, to the adjacent of distributed node
The not stored data of querying node, if inquiring not stored data, indirect synchronization is simultaneously looked into client node return indirectly
The not stored data ask repeat query steps until inquiring not stored number if not inquiring not stored data
Until returning to the not stored data inquired indirectly according to and to client node, or until all points in the system of having inquired
Until cloth node,
Wherein, data include that user passes through client node to distributed node upload and/or the life on distributed node
At symmetric key and/or private key and/or public key.
For example, data access at this time includes:
User's (via client node) uploads (for example, by client node generation) private key to distributed node.
That is, above-mentioned distributed data system according to the present invention can be distributed KMS system, distribution KMS system
It is made of multiple distributed nodes (that is, KMS node).
At this point, the data that distributed node directly synchronizes are the user keys that are stored of distributed node (for example, private
Key).That is, distributed node directly synchronizes the user key itself stored to its adjacent node.
As described above, only node progress immediate data adjacent thereto is synchronous for KMS node.That is, not every KMS node
Between can directly be connected to (that is, not immediate data synchronous).
At this point, each KMS node all can serve as working node to serve client (that is, above-mentioned client node),
The basic function of KMS can be exactly provided, the generation etc. of upload, use and key including key.
Optionally, distributed node is also used to:
At least one adjacent node is determined based on the result of link communication quality detection.
Optionally, at least one lesser distributed node of the communication delay between distributed node is determined as being distributed
Other distributed nodes in system other than adjacent node are determined as the non-of distributed node by the adjacent node of formula node
Adjacent node.
That is, each distributed node can according to " Optimal Connectivity " (that is, link communication quality is best --- for example, chain
Road communication delay is smaller) principle decide whether to be connected to (that is, determining adjacent node) with other distributed nodes.For example, can be with
Using step in detail below:
1, the access speed between each distributed node detection and other distributed nodes is (for example, above-mentioned communication is prolonged
Late).
2, based on the detection result of link communication quality, each distributed node chooses " partner node " of fixed quantity
(that is, above-mentioned adjacent node) is attached, and is specifically chosen that how much quantity can be configured by " connectivity " index.
For example, can be by access speed (access delay) (for example, unit is millisecond/ms) as the connectivity between node
Index.For example, can all nodes by access speed less than 100 milliseconds, be determined as the adjacent node of this node.
3, each distributed node will at least have an adjacent node, and the distributed node of adjacent node is not considered as
" lonely node ", this distributed node is considered as abnormal nodes, cannot continue to provide data service.
Therefore, it is not solid that entire distributed data system, which is the relationship between dynamic change, that is, node and node,
Fixed, but dynamic adjustment can be carried out according to the connectivity index between node.
Optionally, distributed node is also used to:
According to the data access request for deleting stored data in distributed node, while deleting distributed section
Point, distributed node adjacent node and nonneighbor node in stored corresponding data, and/or, in scheduled storage duration
After not accessed, it is automatically deleted the data obtained through indirect synchronization.
For example, scheduled storage duration can be 1 day, 1 week etc..
Fig. 2 (a)-(b) schematically illustrates the schematic flow diagram of Distributed Data Synchronization method according to the present invention.
As shown in the solid box of Fig. 2 (a), Distributed Data Synchronization method according to the present invention, comprising:
Step S202s: actively or directly synchronous according to the adjacent node of request to distributed node via distributed node
Data；
Step S204s: according to the data access request of the nonneighbor node for distributed node, between nonneighbor node
Connect data not stored in synchronous nonneighbor node.
For example, above-mentioned Distributed Data Synchronization method may include step in detail below:
1, start each distributed node.
2, each distributed node is initialized.
1) service function (being key management functions for example, corresponding to KMS system) of each distributed node is initialized
2) (link communication quality) detecting function of each distributed node is initialized
3, " Quan Jiedian " list is obtained, in order to which each distributed node determines respective adjacent node and non-adjacent respectively
Node.
Optionally, as shown in the solid box of Fig. 2 (b) and the dotted line frame of Fig. 2 (a), distributed data according to the present invention is same
One step process, further includes:
Step S202c: data access request is sent to distributed node via client node；
Following steps are executed via distributed node:
Step S206s: when user is by stored data in client-node access distributed node, directly to visitor
Family end node returns to stored data；
Step S208s: when user is by data not stored in client-node access distributed node, to distribution
The adjacent node of node inquires not stored data, if inquiring not stored data, indirect synchronization and to client node
The not stored data inquired indirectly are returned, if not inquiring not stored data, repeat query steps until inquiring
Until not stored data and the not stored data inquired indirectly to client node return, or until the system of having inquired
In all distributed nodes until,
Wherein, data include that user passes through client node to distributed node upload and/or the life on distributed node
At symmetric key and/or private key and/or public key.
For example, above-mentioned steps S206s and step S208s can correspond to following steps:
A, certain user initiates the operation (for example, inquire private key or handle data using private key) using private key to certain node
If B, the node then be used directly there are the corresponding private key of this user
If C, corresponding private key is not present in the node, which initiates to inquire to its adjacent node
D, its adjacent node repeats step C, until some node returns to the private key
E, participation node all in step D, will save this private key
It illustrates and describes below in conjunction with Fig. 1:
If the private key K (for example, initiating from N1 using request) that user needs to upload before use, because N1 is not saved
Private key K (that is, above-mentioned not stored data), therefore N1 needs to initiate the request of synchronous private key K to its adjacent node N2, N2 connects
After receiving request, because it does not have private key K, N1 then to initiate asking for synchronous private key K to its another adjacent node N3 yet
It asks, final request can reach N4.N4 node has private key K, therefore private key K can be returned to N3 by N4 node, and N3 continues according to former road
It returns until N1.After N1 obtains private key K, the use request of private key K processing user just will use.In this process, N2
Private key K (corresponding to above-mentioned steps S202s) can be also saved with N3.So, whole nodes in KMS network are just all synchronized
Private key K.
At this point, above-mentioned user's access includes:
User's (via client node) uploads (for example, by client node generation) private key to distributed node.
At this point, (direct) the synchronous data of institute are the user keys that distributed node is stored in above-mentioned steps S202s
(for example, private key).That is, distributed node actively or according to request to the adjacent node of distributed node synchronizes what itself was stored
User key.
Optionally, as shown in the dotted line frame of Fig. 2 (a), Distributed Data Synchronization method according to the present invention, further includes:
Following steps are executed via distributed node:
Step S210s: at least one adjacent node is determined based on the result of link communication quality detection.
For example, the coconnected whole distributed nodes of physics are performed both by above-mentioned steps S210s, to make each distributed section
Point determines respective adjacent node and nonneighbor node respectively.
Optionally, as shown in the dotted line frame of Fig. 2 (a), Distributed Data Synchronization method according to the present invention, further includes:
Following steps are executed via distributed node:
Step S212s: at least one lesser distributed node of the communication delay between distributed node is determined as
Other distributed nodes in system other than adjacent node are determined as distributed node by the adjacent node of distributed node
Nonneighbor node.
Optionally, as shown in the dotted line frame of Fig. 2 (a), Distributed Data Synchronization method according to the present invention, further includes:
Following steps are executed via distributed node:
Step S214s: it according to the data access request for deleting stored data in distributed node, deletes simultaneously
Distributed node, distributed node adjacent node and nonneighbor node in stored corresponding data, and/or, scheduled
After storage duration is accessed, it is automatically deleted the data obtained through indirect synchronization.
For example, scheduled storage duration can be 1 day, 1 week etc..
For example, above-mentioned steps S214s can correspond to following steps:
A, user sends the data access request for deleting the stored private key in some specified distributed node
B, the node for receiving data access request is issued to its adjacent node deletes instruction
C, it receives and deletes the private key that the knot removal of instruction locally saves
D, the node repetition step B for deleting instruction is received
It illustrates and describes below in conjunction with Fig. 1:
If user wants to delete private key K --- correspond to above-mentioned stored data (for example, it initiates to delete to N3 node
Request), then N3 node deletes the private key K of oneself preservation first, then N2 and N4 is notified to delete private key K.N2 and N4 are carried out class
It is similar to the operation of N3, continue to delete private key and notifies their adjacent node, so that whole network can be by private key K complete deletion.
Above-mentioned technical proposal according to the present invention, can between numerous nodes quickly and reliably shared data (for example,
Key).
Above-mentioned technical proposal according to the present invention, also has the advantage that
1, data (for example, key), which are not all of, is synchronized to all nodes, but the mode for taking part synchronous, saves not
The expense needed.
2, distributed data system (for example, above-mentioned KMS network) dynamic change, it is ensured that each node node adjacent thereto it
Between access speed be it is optimal, play accelerate data transmission purpose.
3, each node is only responsible for limited direct locking range, reduces the probability of error.
Descriptions above can combine implementation individually or in various ways, and these variants all exist
Within protection scope of the present invention.
It will appreciated by the skilled person that whole or certain steps, system, dress in method disclosed hereinabove
Functional module/unit in setting may be implemented as software, firmware, hardware and its combination appropriate.In hardware embodiment,
Division between the functional module/unit referred in the above description not necessarily corresponds to the division of physical assemblies；For example, one
Physical assemblies can have multiple functions or a function or step and can be executed by several physical assemblies cooperations.Certain groups
Part or all components may be implemented as by processor, such as the software that digital signal processor or microprocessor execute, or by
It is embodied as hardware, or is implemented as integrated circuit, such as specific integrated circuit.Such software can be distributed in computer-readable
On medium, computer-readable medium may include computer storage medium (or non-transitory medium) and communication media (or temporarily
Property medium).As known to a person of ordinary skill in the art, term computer storage medium is included in for storing information (such as
Computer readable instructions, data structure, program module or other data) any method or technique in the volatibility implemented and non-
Volatibility, removable and nonremovable medium.Computer storage medium include but is not limited to RAM, ROM, EEPROM, flash memory or its
His memory technology, CD-ROM, digital versatile disc (DVD) or other optical disc storages, magnetic holder, tape, disk storage or other
Magnetic memory apparatus or any other medium that can be used for storing desired information and can be accessed by a computer.This
Outside, known to a person of ordinary skill in the art to be, communication media generally comprises computer readable instructions, data structure, program mould
Other data in the modulated data signal of block or such as carrier wave or other transmission mechanisms etc, and may include any information
Delivery media.
Finally, it should be noted that the above embodiments are merely illustrative of the technical solutions of the present invention, rather than its limitations.Although
Present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that: it still may be used
To modify the technical solutions described in the foregoing embodiments or equivalent replacement of some of the technical features；
And these are modified or replaceed, the spirit of the technical solution for various embodiments of the present invention that it does not separate the essence of the corresponding technical solution
And range.
Claims (10)
1. a kind of distributed data system characterized by comprising
Distributed node, for active or according to request to the direct synchrodata of adjacent node of the distributed node, and
According to the data access request of the nonneighbor node for the distributed node, Xiang Suoshu nonneighbor node indirect synchronization
Not stored data in nonneighbor node.
2. distributed data system as described in claim 1, which is characterized in that further include:
Client node, for sending data access request to the distributed node；
The distributed node is also used to:
When user is by stored data in distributed node described in the client-node access, directly to the client
End node returns to the stored data；
When user is by data not stored in distributed node described in the client-node access, to the distributed section
The adjacent node of point inquires the not stored data, if inquiring the not stored data, indirect synchronization and to described
Client node returns to the not stored data inquired indirectly, if not inquiring the not stored data, repeats
Query steps until inquire the not stored data and to the client node return inquire indirectly described in do not deposit
Until the data of storage, or until all distributed nodes in the system of having inquired,
Wherein, the data include that user is uploaded and/or at described point by the client node to the distributed node
The symmetric key and/or private key and/or public key generated on cloth node.
3. distributed data system as described in claim 1, which is characterized in that the distributed node is also used to:
At least one adjacent node is determined based on the result of link communication quality detection.
4. distributed data system as claimed in claim 3, which is characterized in that by the communication between the distributed node
Postpone the adjacent node that at least one lesser distributed node is determined as the distributed node, by system in addition to the phase
Other distributed nodes except neighbors are determined as the nonneighbor node of the distributed node.
5. distributed data system as claimed in claim 2, which is characterized in that the distributed node is also used to:
According to the data access request for deleting stored data in the distributed node, while deleting the distribution
Node, the distributed node adjacent node and nonneighbor node in stored corresponding data, and/or, deposited scheduled
After storage duration is accessed, it is automatically deleted the data obtained through indirect synchronization.
6. a kind of Distributed Data Synchronization method characterized by comprising
Via distributed node actively or according to the direct synchrodata of adjacent node requested to the distributed node；
According to data access request, the Xiang Suoshu nonneighbor node indirect synchronization of the nonneighbor node for the distributed node
Not stored data in the nonneighbor node.
7. Distributed Data Synchronization method as claimed in claim 6, which is characterized in that further include:
Data access request is sent to the distributed node via client node；
Following steps are executed via the distributed node:
When user is by stored data in distributed node described in the client-node access, directly to the client
End node returns to the stored data；
When user is by data not stored in distributed node described in the client-node access, to the distributed section
The adjacent node of point inquires the not stored data, if inquiring the not stored data, indirect synchronization and to described
Client node returns to the not stored data inquired indirectly, if not inquiring the not stored data, repeats
Query steps until inquire the not stored data and to the client node return inquire indirectly described in do not deposit
Until the data of storage, or until all distributed nodes in the system of having inquired,
Wherein, the data include that user is uploaded and/or at described point by the client node to the distributed node
The symmetric key and/or private key and/or public key generated on cloth node.
8. Distributed Data Synchronization method as claimed in claim 6, which is characterized in that further include:
Following steps are executed via the distributed node:
At least one adjacent node is determined based on the result of link communication quality detection.
9. Distributed Data Synchronization method as claimed in claim 8, which is characterized in that further include:
Following steps are executed via the distributed node:
At least one lesser distributed node of communication delay between the distributed node is determined as the distribution
Other distributed nodes in system other than the adjacent node are determined as the distributed section by the adjacent node of node
The nonneighbor node of point.
10. Distributed Data Synchronization method as claimed in claim 7, which is characterized in that further include:
Following steps are executed via the distributed node:
According to the data access request for deleting stored data in the distributed node, while deleting the distribution
Node, the distributed node adjacent node and nonneighbor node in stored corresponding data, and/or, deposited scheduled
After storage duration is accessed, it is automatically deleted the data obtained through indirect synchronization.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811128035.8A CN110493300B (en) | 2018-09-27 | 2018-09-27 | Distributed data system and distributed data synchronization method |
| PCT/CN2019/106550 WO2020063424A1 (en) | 2018-09-27 | 2019-09-19 | Distributed data system, distributed data synchronization method, computer storage medium, and computer device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811128035.8A CN110493300B (en) | 2018-09-27 | 2018-09-27 | Distributed data system and distributed data synchronization method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110493300A true CN110493300A (en) | 2019-11-22 |
| CN110493300B CN110493300B (en) | 2021-11-23 |
Family
ID=68545740
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811128035.8A Active CN110493300B (en) | 2018-09-27 | 2018-09-27 | Distributed data system and distributed data synchronization method |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN110493300B (en) |
| WO (1) | WO2020063424A1 (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101090401A (en) * | 2007-05-25 | 2007-12-19 | 金蝶软件（中国）有限公司 | Data buffer store method and system at duster environment |
| CN101932065A (en) * | 2010-07-30 | 2010-12-29 | 中国科学院软件研究所 | Method for discovering distributed satellite network resources |
| US20140347974A1 (en) * | 2011-11-22 | 2014-11-27 | Thales | Data transmission network and programmable network node |
| CN106506704A (en) * | 2016-12-29 | 2017-03-15 | 北京奇艺世纪科技有限公司 | A kind of buffering updating method and device |
| CN106937327A (en) * | 2017-03-22 | 2017-07-07 | 安徽师范大学 | The network-building method of the wireless sensor network based on backup node |
| CN107947955A (en) * | 2016-10-13 | 2018-04-20 | 中国科学院声学研究所 | One kind combines virtual tree mapping and central network robustness Enhancement Method |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1326045C (en) * | 2003-06-09 | 2007-07-11 | 浪潮电子信息产业股份有限公司 | Method for constructing high-available distributed memory system |
| US9525735B2 (en) * | 2013-10-30 | 2016-12-20 | Futurewei Technologies, Inc. | Lock elevation in a distributed file storage system |
| CN106648970A (en) * | 2016-11-04 | 2017-05-10 | 北京华为数字技术有限公司 | File backup method and distributed file system |
| CN106851741B (en) * | 2016-12-10 | 2020-02-28 | 浙江大学 | Distributed mobile node file caching method based on social relation in cellular network |
-
2018
- 2018-09-27 CN CN201811128035.8A patent/CN110493300B/en active Active
-
2019
- 2019-09-19 WO PCT/CN2019/106550 patent/WO2020063424A1/en active Application Filing
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101090401A (en) * | 2007-05-25 | 2007-12-19 | 金蝶软件（中国）有限公司 | Data buffer store method and system at duster environment |
| CN101932065A (en) * | 2010-07-30 | 2010-12-29 | 中国科学院软件研究所 | Method for discovering distributed satellite network resources |
| US20140347974A1 (en) * | 2011-11-22 | 2014-11-27 | Thales | Data transmission network and programmable network node |
| CN107947955A (en) * | 2016-10-13 | 2018-04-20 | 中国科学院声学研究所 | One kind combines virtual tree mapping and central network robustness Enhancement Method |
| CN106506704A (en) * | 2016-12-29 | 2017-03-15 | 北京奇艺世纪科技有限公司 | A kind of buffering updating method and device |
| CN106937327A (en) * | 2017-03-22 | 2017-07-07 | 安徽师范大学 | The network-building method of the wireless sensor network based on backup node |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110493300B (en) | 2021-11-23 |
| WO2020063424A1 (en) | 2020-04-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP4732661B2 (en) | How to synchronize the client database with the server database | |
| US8538923B2 (en) | Method, node and system for controlling version in distributed system | |
| CN106911728B (en) | The choosing method and device of host node in distributed system | |
| EP3490224B1 (en) | Data synchronization method and system | |
| EP3039549B1 (en) | Distributed file system using consensus nodes | |
| CN103207867A (en) | Method for processing data blocks, method for initiating recovery operation and nodes | |
| CN103973725B (en) | A kind of distributed cooperative algorithm and synergist | |
| CN108829720B (en) | Data processing method and device | |
| US20150120662A1 (en) | Synchronizing event history for multiple clients | |
| CN109753364A (en) | A kind of implementation method, equipment and the medium of network-based distributed lock | |
| CN109547512A (en) | A kind of method and device of the distributed Session management based on NoSQL | |
| CN105610947A (en) | Method, device and system for realizing high-available distributed queue service | |
| US20210344971A1 (en) | A method and system for downloading a data resource | |
| CN109173270B (en) | Game service system and implementation method | |
| JP2018515850A (en) | Data copy method and device | |
| CN110874384A (en) | Database cluster capacity expansion method, device and system | |
| CN114844879B (en) | Mirror image management method, electronic device and storage medium | |
| CN110493027A (en) | A kind of distributed and management method | |
| CN110493300A (en) | A kind of distributed data system and Distributed Data Synchronization method | |
| WO2021212726A1 (en) | Software-defined network publish-subscribe system and method | |
| CN108650168B (en) | Method and device for acquiring member data of multi-person session, storage medium and processor | |
| CN105516343B (en) | A kind of file-sharing implementation method of network dynamic self-organizing | |
| CN108965398B (en) | Control method of Internet of things equipment based on block chain | |
| CN103685497A (en) | On-line storing and sharing method and system | |
| CN109962834B (en) | Information processing method, system, terminal and computer storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |