CN110493027A - A kind of distributed and management method - Google Patents
A kind of distributed and management method Download PDFInfo
- Publication number
- CN110493027A CN110493027A CN201811127823.5A CN201811127823A CN110493027A CN 110493027 A CN110493027 A CN 110493027A CN 201811127823 A CN201811127823 A CN 201811127823A CN 110493027 A CN110493027 A CN 110493027A
- Authority
- CN
- China
- Prior art keywords
- node
- distributed
- distributed management
- data
- management node
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000007726 management method Methods 0.000 title claims abstract description 182
- 238000004891 communication Methods 0.000 claims abstract description 35
- 238000001514 detection method Methods 0.000 claims abstract description 23
- 230000001360 synchronised effect Effects 0.000 claims abstract description 17
- 238000000034 method Methods 0.000 claims description 22
- 238000009826 distribution Methods 0.000 claims description 19
- 238000013523 data management Methods 0.000 claims description 17
- 238000003860 storage Methods 0.000 claims description 13
- 230000006855 networking Effects 0.000 claims description 7
- 230000006870 function Effects 0.000 description 7
- 238000010586 diagram Methods 0.000 description 4
- 230000000712 assembly Effects 0.000 description 3
- 238000000429 assembly Methods 0.000 description 3
- 239000004744 fabric Substances 0.000 description 3
- 241001269238 Data Species 0.000 description 2
- 230000002159 abnormal effect Effects 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
- 230000006399 behavior Effects 0.000 description 1
- 230000000977 initiatory effect 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
- 230000008569 process Effects 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 238000012384 transportation and delivery 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
- 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
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/04—Network management architectures or arrangements
- H04L41/042—Network management architectures or arrangements comprising distributed management centres cooperatively managing the network
-
- 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
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Hardware Design (AREA)
- Computer Security & Cryptography (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- Multimedia (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Computer And Data Communications (AREA)
Abstract
The invention discloses a kind of distributed and management methods.Disclosed distributed includes: distributed management node, for executing the detection of the link communication quality between distributed management node and other distributed management nodes, at least one level-one partner node is determined based on the result of link communication quality detection, and it is synchronous to carry out immediate data with level-one partner 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 distributeds
And management method.
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 according to the present invention, comprising:
Distributed management node is logical for executing the link between distributed management node and other distributed management nodes
Believe quality detection, at least one level-one partner node is determined based on the result of link communication quality detection, with level-one partner node
It is synchronous to carry out immediate data.
Distributed according to the present invention, distributed management node are also used to:
After the success networking of all distributed management nodes, the network topology including all distributed management nodes is obtained
Structure executes the link communication quality between distributed management node and adjacent distributions formula management node based on network topology structure
Detection, is determined as level-one partner node at least one lesser adjacent distributions formula management node of communication delay.
Distributed according to the present invention, further includes:
Client node accesses the data in distributed management node for user,
Wherein, data include that user is uploaded by client node to distributed management node and/or in distributed management
The symmetric key and/or private key and/or public key generated on node.
Distributed according to the present invention, distributed management node are also used to:
When user is by stored data in client-node access distributed management node, directly to client's end segment
Point returns to stored data；
When user is by data not stored in client-node access distributed management node, to distributed management section
The level-one partner node of point inquires not stored data, if inquiring not stored data, indirect synchronization and to client's end segment
Point returns to the not stored data inquired indirectly, if not inquiring not stored data, repeats query steps until inquiry
Until to not stored data and to client node returning to the not stored data that inquire indirectly, or until having inquired system
Until all distributed management nodes in system.
Distributed according to the present invention, distributed management node are also used to:
When user deletes stored data in distributed management node by client node, while deleting distribution
Stored corresponding data in the partner nodes at different levels of management node, and/or, it is not accessed in scheduled storage duration
Afterwards, the data obtained through indirect synchronization are automatically deleted,
Wherein, the partner nodes at different levels of distributed management node include the distributed pipes for not deleting stored corresponding data
Manage do not delete stored corresponding data one of the level-one partner node of node, the level-one partner node of distributed management node
Grade partner node.
Distributed data management method according to the present invention, comprising:
Following steps are executed via distributed management node:
The link communication quality executed between distributed management node and other distributed management nodes detects；
At least one level-one partner node is determined based on the result of link communication quality detection；
It is synchronous that immediate data is carried out with level-one partner node.
Distributed data management method according to the present invention, further includes:
Following steps are executed via distributed management node:
After the success networking of all distributed management nodes, the network topology including all distributed management nodes is obtained
Structure；
The link communication between distributed management node and adjacent distributions formula management node is executed based on network topology structure
At least one lesser adjacent distributions formula management node of communication delay is determined as level-one partner node by quality detection.
Distributed data management method according to the present invention, further includes:
Following steps are executed via client node:
User accesses the data in distributed management node,
Wherein, data include that user is uploaded by client node to distributed management node and/or in distributed management
The symmetric key and/or private key and/or public key generated on node.
Distributed data management method according to the present invention, further includes:
Following steps are executed via distributed management node:
When user is by stored data in client-node access distributed management node, directly to client's end segment
Point returns to stored data；
When user is by data not stored in client-node access distributed management node, to distributed management section
The level-one partner node of point inquires not stored data, if inquiring not stored data, indirect synchronization and to client's end segment
Point returns to the not stored data inquired indirectly, if not inquiring not stored data, repeats query steps until inquiry
Until to not stored data and to client node returning to the not stored data that inquire indirectly, or until having inquired system
Until all distributed management nodes in system.
Distributed data management method according to the present invention, further includes:
Following steps are executed via distributed management node:
When user deletes stored data in distributed management node by client node, while deleting distribution
Stored corresponding data in the partner nodes at different levels of management node, and/or, it is not accessed in scheduled storage duration
Afterwards, the data obtained through indirect synchronization are automatically deleted,
Wherein, the partner nodes at different levels of distributed management node include the distributed pipes for not deleting stored corresponding data
Manage do not delete stored corresponding data one of the level-one partner node of node, the level-one partner node of distributed management node
Grade partner node.
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 according to the present invention.
Fig. 2 schematically illustrates the schematic flow diagram of distributed data management 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 according to the present invention.
As shown in Figure 1, distributed according to the present invention, comprising:
Distributed management node (is indicated in Fig. 1 with Nx, such as N1, N2, N3 etc.), for executing distributed management node
Link communication quality detection between other distributed management nodes, is determined at least based on the result of link communication quality detection
It is synchronous to carry out immediate data with level-one partner node for one level-one partner node.
For example, for management node N5 has updated data D in a distributed manner.N5 after local update data D, to
Its level-one partner node N4, N6, N7, N8 (direct) synchrodata D.For distributed management node N5 level-one partner node (that is,
Another distributed management node) for N4, although the level-one partner node of its own other than distributed management node N5,
There are also N3, but N4 does not continue to N3 synchrodata D.
That is, distributed management node can only be to or from the direct synchrodata of (level-one) partner node.If some is distributed
(user) data acquired in formula management node be it is directly synchronous from its (level-one) partner node, then do not continue to oneself
Other (level-one) partner nodes are directly synchronous should (user) data.
Optionally, distributed management node is also used to:
After the success networking of all distributed management nodes, the network topology including all distributed management nodes is obtained
Structure executes the link communication quality between distributed management node and adjacent distributions formula management node based on network topology structure
Detection, is determined as level-one partner node at least one lesser adjacent distributions formula management node of communication delay.
That is, each distributed management node can according to " Optimal Connectivity " (that is, link communication quality is best --- example
Such as, link communication delay it is smaller) principle decide whether to be connected to other distributed management nodes (that is, above-mentioned immediate data is same
Step), to construct entire distributed (or network).For example, can be using step in detail below:
1, the access speed between each distributed management node detection and other distributed management nodes is (for example, above-mentioned
Communication delay).
2, based on the detection result of link communication quality, " partner's section of each distributed management node selection fixed quantity
Point " 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 (level-one) partner node of this node.
3, each distributed management node will at least have (level-one) partner node, not have point of (level-one) partner node
Cloth management node is considered as " lonely node ", this distributed management node is considered as abnormal nodes, cannot continue offer service.
Therefore, entire distributed be relationship between dynamic change, that is, node and node not
It is fixed, but dynamic adjustment can be carried out according to the connectivity index between node.
Optionally, distributed according to the present invention, further includes:
Client node (is not shown in Fig. 1), accesses the data in distributed management node for user,
Wherein, data include that user is uploaded by client node to distributed management node and/or in distributed management
The symmetric key and/or private key and/or public key generated on node.
For example, above-mentioned user's access includes:
User's (via client node) uploads (for example, by client node generation) private to distributed management node
Key.
That is, above-mentioned distributed according to the present invention can be distributed KMS system, distribution KMS
System is made of multiple distributed management nodes (that is, KMS node).
At this point, the data that distributed management node directly synchronizes are the user keys that distributed management node is stored
(for example, private key).That is, distributed management node directly synchronizes the user key itself stored to its (level-one) partner node.
As described above, it is synchronous only to carry out immediate data with its level-one partner node for KMS node.That is, not every KMS
(that is, immediate data is synchronous) can be directly connected between node.
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 management node is also used to:
When user is by stored data in client-node access distributed management node, directly to client's end segment
Point returns to stored data；
When user is by data not stored in client-node access distributed management node, to distributed management section
The level-one partner node of point inquires not stored data, if inquiring not stored data, indirect synchronization and to client's end segment
Point returns to the not stored data inquired indirectly, if not inquiring not stored data, repeats query steps until inquiry
Until to not stored data and to client node returning to the not stored data that inquire indirectly, or until having inquired system
Until all distributed management nodes in system.
Optionally, distributed management node is also used to:
When user deletes stored data in distributed management node by client node, while deleting distribution
Stored corresponding data in the partner nodes at different levels of management node, and/or, it is not accessed in scheduled storage duration
Afterwards, the data obtained through indirect synchronization are automatically deleted,
Wherein, the partner nodes at different levels of distributed management node include the distributed pipes for not deleting stored corresponding data
Manage do not delete stored corresponding data one of the level-one partner node of node, the level-one partner node of distributed management node
Grade partner node.
Fig. 2 (a)-(b) schematically illustrates the schematic flow diagram of distributed data management method according to the present invention.
As shown in the solid box of Fig. 2 (a), distributed data management method according to the present invention, comprising:
Following steps are executed via distributed management node:
Step S202s: the link communication quality executed between distributed management node and other distributed management nodes is visited
It surveys；
Step S204s: at least one level-one partner node is determined based on the result of link communication quality detection；
Step S206s: it is synchronous that immediate data is carried out with level-one partner node.
Optionally, as shown in the dotted line frame of Fig. 2 (a), distributed data management method according to the present invention, further includes:
Following steps are executed via distributed management node:
Step S208s: after the success networking of all distributed management nodes, obtaining includes all distributed management nodes
Network topology structure；
Step S210s: it is executed between distributed management node and adjacent distributions formula management node based on network topology structure
Link communication quality detection, by least one lesser adjacent distributions formula management node of communication delay be determined as level-one partner section
Point.
For example, the process of above-mentioned networking may comprise steps of:
1, start each distributed management node.
2, each distributed management node is initialized.
1) service function for initializing each distributed management node (is key management function for example, corresponding to KMS system
Can)
2) (link communication quality) detecting function of each distributed management node is initialized
Above-mentioned acquisition includes the steps that the network topology structure of all distributed management nodes, as acquisition " Quan Jiedian " column
The step of table.
The step of link communication quality detection between above-mentioned execution distributed management node and adjacent distributions formula management node
Suddenly, the step of as node starts detecting function.
That is, each distributed management node can according to " Optimal Connectivity " (that is, link communication quality is best --- example
Such as, link communication delay it is smaller) principle decide whether to be connected to other distributed management nodes (that is, above-mentioned immediate data is same
Step), to construct entire distributed (or network).For example, can be using step in detail below:
1, the access speed between each distributed management node detection and other distributed management nodes is (for example, above-mentioned
Communication delay).
2, based on the detection result of link communication quality, " partner's section of each distributed management node selection fixed quantity
Point " 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 (level-one) partner node of this node.
3, each distributed management node will at least have (level-one) partner node, not have point of (level-one) partner node
Cloth management node is considered as " lonely node ", this distributed management node is considered as abnormal nodes, cannot continue offer service.
The coconnected whole distributed management nodes of physics are performed both by above-mentioned steps S202s-S206s or above-mentioned steps
S208s, S210s, S206s, to complete building for entire distributed.
Optionally, as shown in the dotted line frame of Fig. 2 (b), distributed data management method according to the present invention, further includes:
Following steps are executed via client node:
Step S202c: user accesses the data in distributed management node,
Wherein, data include that user is uploaded by client node to distributed management node and/or in distributed management
The symmetric key and/or private key and/or public key generated on node.
For example, above-mentioned user's access includes:
User's (via client node) uploads (for example, by client node generation) private to distributed management node
Key.
At this point, the data directly synchronized are that the user that distributed management node is stored is close in above-mentioned steps S206s
Key (for example, private key).That is, directly to synchronize the user itself stored to its (level-one) partner node close for distributed management node
Key.
Optionally, as shown in the dotted line frame of Fig. 2 (a), distributed data management method according to the present invention, further includes:
Following steps are executed via distributed management node:
Step S212s: when user is by stored data in client-node access distributed management node, directly
Stored data are returned to client node；
Step S214s: when user is by data not stored in client-node access distributed management node, to point
The level-one partner node of cloth management node inquires not stored data, if inquiring not stored data, indirect synchronization is simultaneously
The not stored data inquired indirectly are returned to client node, if not inquiring not stored data, repeat inquiry step
Suddenly until inquiring not stored data and returning to the not stored data inquired indirectly to client node, Huo Zhezhi
Until all distributed management nodes into the system of having inquired.
That is, above-mentioned steps S212s and step S214s corresponds 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 (level-one) partner node
D, its (level-one) partner 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 asking for synchronous private key K to its (level-one) partner node N2
It asks, after N2 receives request, because it does not have private key K, N1 then to initiate to its another (level-one) partner node N3 yet
The request of synchronous private key K, final request can reach N4.N4 node has private key K, therefore private key K can be returned to N3, N3 by N4 node
Continue according to backtracking until N1.After N1 obtains private key K, the use request of private key K processing user just will use.At this
During a, N2, N3 can also save private key K (corresponding to above-mentioned steps S206s).So, the whole in above-mentioned KMS network
Node is just all synchronized private key K.
Optionally, as shown in the dotted line frame of Fig. 2 (a), distributed data management method according to the present invention, further includes:
Following steps are executed via distributed management node:
Step S216s: when user deletes stored data in distributed management node by client node, simultaneously
Stored corresponding data in the partner nodes at different levels of distributed management node is deleted, and/or, do not have in scheduled storage duration
After accessed, the data obtained through indirect synchronization are automatically deleted,
Wherein, the partner nodes at different levels of distributed management node include the distributed pipes for not deleting stored corresponding data
Manage do not delete stored corresponding data one of the level-one partner node of node, the level-one partner node of distributed management node
Grade partner node.
That is, above-mentioned steps S216s corresponds to following steps:
A, user deletes the private key saved in distributed KMS network
B, the node for receiving order is issued to its (level-one) partner 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 behavior of N3, continue to delete private key and notifies their (level-one) partner node, so that whole network can be thorough by private key K
It deletes.
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 (for example, KMS network) dynamic change, it is ensured that each node and its (level-one) partner
Access speed between node 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 characterized by comprising
Distributed management node is logical for executing the link between the distributed management node and other distributed management nodes
Believe quality detection, at least one level-one partner node is determined based on the result of link communication quality detection, with the level-one partner
It is synchronous that node carries out immediate data.
2. distributed as described in claim 1, which is characterized in that the distributed management node is also used
In:
After the success networking of all distributed management nodes, the network topology knot including all distributed management nodes is obtained
It is logical to execute the link between the distributed management node and adjacent distributions formula management node based on the network topology structure for structure
Believe quality detection, at least one lesser adjacent distributions formula management node of communication delay is determined as level-one partner node.
3. distributed as described in claim 1, which is characterized in that further include:
Client node accesses the data in the distributed management node for user,
Wherein, the data include that user is uploaded by the client node to the distributed management node and/or in institute
State the symmetric key generated on distributed management node and/or private key and/or public key.
4. distributed as claimed in claim 3, which is characterized in that the distributed management node is also used
In:
When user is by stored data in distributed management node described in the client-node access, directly to described
Client node returns to the stored data；
When user is by data not stored in distributed management node described in the client-node access, to the distribution
The level-one partner node of formula management node inquires the not stored data, if inquiring the not stored data, indirectly
It synchronizes and returns to the not stored data inquired indirectly to the client node, if do not inquired described not stored
Data, repeat query steps until inquire the not stored data and to the client node return inquire indirectly
The not stored data until, or until all distributed management nodes in the system of having inquired.
5. distributed as claimed in claim 3, which is characterized in that the distributed management node is also used
In:
When user deletes stored data in the distributed management node by the client node, while deleting institute
State stored corresponding data in the partner nodes at different levels of distributed management node, and/or, scheduled storage duration not by
After access, the data obtained through indirect synchronization are automatically deleted,
Wherein, the partner nodes at different levels of the distributed management node include do not delete the stored corresponding data described
The level-one partner node of distributed management node, the distributed management node level-one partner node do not delete described deposited
The level-one partner node of the corresponding data of storage.
6. a kind of distributed data management method characterized by comprising
Following steps are executed via distributed management node:
Execute the link communication quality detection between the distributed management node and other distributed management nodes；
At least one level-one partner node is determined based on the result of link communication quality detection；
It is synchronous that immediate data is carried out with the level-one partner node.
7. distributed data management method as claimed in claim 6, which is characterized in that further include:
Following steps are executed via distributed management node:
After the success networking of all distributed management nodes, the network topology knot including all distributed management nodes is obtained
Structure；
The link between the distributed management node and adjacent distributions formula management node is executed based on the network topology structure
Communication quality detection, is determined as level-one partner node at least one lesser adjacent distributions formula management node of communication delay.
8. distributed data management method as claimed in claim 6, which is characterized in that further include:
Following steps are executed via client node:
User accesses the data in the distributed management node,
Wherein, the data include that user is uploaded by the client node to the distributed management node and/or in institute
State the symmetric key generated on distributed management node and/or private key and/or public key.
9. distributed data management method as claimed in claim 8, which is characterized in that further include:
Following steps are executed via distributed management node:
When user is by stored data in distributed management node described in the client-node access, directly to described
Client node returns to the stored data；
When user is by data not stored in distributed management node described in the client-node access, to the distribution
The level-one partner node of formula management node inquires the not stored data, if inquiring the not stored data, indirectly
It synchronizes and returns to the not stored data inquired indirectly to the client node, if do not inquired described not stored
Data, repeat query steps until inquire the not stored data and to the client node return inquire indirectly
The not stored data until, or until all distributed management nodes in the system of having inquired.
10. distributed data management method as claimed in claim 8, which is characterized in that further include:
Following steps are executed via distributed management node:
When user deletes stored data in the distributed management node by the client node, while deleting institute
State stored corresponding data in the partner nodes at different levels of distributed management node, and/or, scheduled storage duration not by
After access, the data obtained through indirect synchronization are automatically deleted,
Wherein, the partner nodes at different levels of the distributed management node include do not delete the stored corresponding data described
The level-one partner node of distributed management node, the distributed management node level-one partner node do not delete described deposited
The level-one partner node of the corresponding data of storage.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811127823.5A CN110493027A (en) | 2018-09-27 | 2018-09-27 | A kind of distributed and management method |
| PCT/CN2019/107765 WO2020063650A1 (en) | 2018-09-27 | 2019-09-25 | Distributed data management system and management method, computer storage medium and computer device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811127823.5A CN110493027A (en) | 2018-09-27 | 2018-09-27 | A kind of distributed and management method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110493027A true CN110493027A (en) | 2019-11-22 |
Family
ID=68545743
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811127823.5A Pending CN110493027A (en) | 2018-09-27 | 2018-09-27 | A kind of distributed and management method |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN110493027A (en) |
| WO (1) | WO2020063650A1 (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111866178A (en) * | 2020-08-04 | 2020-10-30 | 蝉鸣科技(西安)有限公司 | Distributed FTP/FTPS file transmission method and device and computer storage medium |
Citations (5)
| 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 |
| US20130151558A1 (en) * | 2011-12-12 | 2013-06-13 | Telefonaktiebolaget L M Ericsson (Publ) | Methods and apparatus for implementing a distributed database |
| CN106648970A (en) * | 2016-11-04 | 2017-05-10 | 北京华为数字技术有限公司 | File backup method and distributed file system |
| CN106937327A (en) * | 2017-03-22 | 2017-07-07 | 安徽师范大学 | The network-building method of the wireless sensor network based on backup node |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8218522B2 (en) * | 2009-01-21 | 2012-07-10 | Raytheon Company | Communication scheduling of network nodes using a cluster coefficient |
| US10212597B2 (en) * | 2013-10-30 | 2019-02-19 | Nec Corporation | Apparatus, system and method for secure direct communication in proximity based services |
| CN104702655B (en) * | 2014-03-21 | 2018-04-27 | 杭州海康威视***技术有限公司 | Cloud storage resource allocation methods and its system |
-
2018
- 2018-09-27 CN CN201811127823.5A patent/CN110493027A/en active Pending
-
2019
- 2019-09-25 WO PCT/CN2019/107765 patent/WO2020063650A1/en active Application Filing
Patent Citations (5)
| 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 |
| US20130151558A1 (en) * | 2011-12-12 | 2013-06-13 | Telefonaktiebolaget L M Ericsson (Publ) | Methods and apparatus for implementing a distributed database |
| CN106648970A (en) * | 2016-11-04 | 2017-05-10 | 北京华为数字技术有限公司 | File backup method and distributed file system |
| CN106937327A (en) * | 2017-03-22 | 2017-07-07 | 安徽师范大学 | The network-building method of the wireless sensor network based on backup node |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111866178A (en) * | 2020-08-04 | 2020-10-30 | 蝉鸣科技(西安)有限公司 | Distributed FTP/FTPS file transmission method and device and computer storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2020063650A1 (en) | 2020-04-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP4732661B2 (en) | How to synchronize the client database with the server database | |
| CN106911728B (en) | The choosing method and device of host node in distributed system | |
| US8538923B2 (en) | Method, node and system for controlling version in distributed system | |
| US20190173739A1 (en) | Method, device and computer program product for managing distributed system | |
| CN103870570B (en) | A kind of HBase availability of data based on remote journal backup and persistent method | |
| CN109639794A (en) | A kind of stateful cluster recovery method, apparatus, equipment and readable storage medium storing program for executing | |
| US20130036105A1 (en) | Reconciling a distributed database from hierarchical viewpoints | |
| CN110874384B (en) | Method, device and system for expanding and shrinking capacity of database cluster | |
| CN103207867A (en) | Method for processing data blocks, method for initiating recovery operation and nodes | |
| CN109815248B (en) | Zookeeper-based distributed architecture data consistency method | |
| WO2018137327A1 (en) | Data transmission method for host and standby devices, control node, and database system | |
| CN105208058B (en) | The information interaction system shared based on web sessions | |
| CN109173270B (en) | Game service system and implementation method | |
| CN106603319A (en) | Fault processing method, management server, and logic server | |
| WO2016082594A1 (en) | Data update processing method and apparatus | |
| JP2018515850A (en) | Data copy method and device | |
| CN102710438B (en) | Node management method, device and system | |
| JP2011511362A5 (en) | ||
| CN110493027A (en) | A kind of distributed and management method | |
| EP2911068B1 (en) | Tree-structure storage method for managing computation offloading data | |
| CN108650168B (en) | Method and device for acquiring member data of multi-person session, storage medium and processor | |
| CN104468722A (en) | Method for classified storage of training data in navigation management training system | |
| CN110493300A (en) | A kind of distributed data system and Distributed Data Synchronization method | |
| CN113448976B (en) | Data processing method, device, computer equipment and storage medium | |
| CN106210038B (en) | The processing method and system of data operation request |
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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20191122 |