CN117834656A - Edge computing cross-domain synchronization method and system - Google Patents
Edge computing cross-domain synchronization method and system Download PDFInfo
- Publication number
- CN117834656A CN117834656A CN202410252372.7A CN202410252372A CN117834656A CN 117834656 A CN117834656 A CN 117834656A CN 202410252372 A CN202410252372 A CN 202410252372A CN 117834656 A CN117834656 A CN 117834656A
- Authority
- CN
- China
- Prior art keywords
- data
- target
- synchronization
- node
- synchronized
- 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 51
- 230000001360 synchronised effect Effects 0.000 claims abstract description 99
- 238000012545 processing Methods 0.000 abstract description 8
- 238000004364 calculation method Methods 0.000 abstract description 3
- 230000008569 process Effects 0.000 description 6
- 230000004044 response Effects 0.000 description 5
- 238000012986 modification Methods 0.000 description 4
- 230000004048 modification Effects 0.000 description 4
- 206010033799 Paralysis Diseases 0.000 description 3
- 230000009471 action Effects 0.000 description 3
- 238000013461 design Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 108020001568 subdomains Proteins 0.000 description 1
Landscapes
- Synchronisation In Digital Transmission Systems (AREA)
Abstract
The application provides a cross-domain synchronization method and a cross-domain synchronization system for edge calculation; the edge computing cross-domain synchronization method comprises the following steps: generating a first target master node according to the preamble master node generated in the previous data synchronization stage, so as to acquire a target receiving node and an initial synchronization list through the first target master node, and signing preset data in the initial synchronization list to acquire the target synchronization list; carrying out local synchronization on the target synchronization list through the target receiving node, and taking the target receiving node as a second target master node; and then judging whether the data in the target synchronization list is signed or not, and acquiring target data to be synchronized in the target synchronization list through the second target master node to perform global synchronization when the signature is completed. According to the method and the system, the node with higher data processing capacity is dynamically selected as the main node, and the main node is updated according to the data similarity, so that the quick and safe matching and synchronization of the whole network data are ensured, and the running efficiency of the system is improved.
Description
Technical Field
The present disclosure relates to the field of edge computing synchronization technologies, and in particular, to a method and a system for edge computing cross-domain synchronization.
Background
With the continuous progress of chip technology and integrated circuit technology, the performance of intelligent devices is continuously improved while the miniaturization of intelligent devices is developed, and more edge devices have relatively excessive computing power, so that the technical field of edge computing is generated. In general, edge devices are typically networked in a relatively loose distributed topology, and the efficiency of data transmission and synchronization between the edge devices is relatively low, thereby affecting the computing efficiency of the entire system. At present, scholars have proposed that edge computing nodes can be divided into a plurality of subfields according to different functions or performances, and then data synchronization is performed by taking the subfields as basic units. As for a specific synchronization strategy, no more reliable and efficient algorithm exists at present.
At present, some scholars propose that a global node can be selected from the whole system to serve as a relay scheduling node for data synchronization, each subdomain or node with data synchronization requirement needs to apply for the global node before data synchronization, and then the global node performs scheduling allocation operation in the data synchronization process. The method has the outstanding advantages that the algorithm is simple, and errors are not easy to occur in system design and code writing; however, the system has the defects of poor safety, easy attack of malicious nodes on the main node, overlarge data processing capacity of the global node and easy downtime, thereby causing paralysis of the system. Therefore, it is necessary to design an edge computing synchronization algorithm that combines security and efficiency.
Disclosure of Invention
The method and the system for the edge computing cross-domain synchronization are used for solving the technical problems that the existing method for the edge computing cross-domain synchronization is poor in system security, a main node is easy to attack by malicious nodes, and in addition, the data processing capacity of a global node is too large and is easy to downtime, so that system paralysis is caused.
Specifically, the application provides a method for edge computing cross-domain synchronization, which comprises the following steps:
s100: in response to the data synchronization request signal, a first target master node is generated from a preamble master node generated in a previous data synchronization stage.
S200: and acquiring a target receiving node and an initial synchronization list through the first target master node, and signing preset data in the initial synchronization list to acquire the target synchronization list.
S300: and locally synchronizing the target synchronization list through the target receiving node, and taking the target receiving node as a second target master node.
S400: judging whether the data in the target synchronous list is signed, if so, turning to step S500; otherwise, the process returns to step S200.
S500: and acquiring target data to be synchronized in a target synchronization list through the second target master node, and performing global synchronization on the target data to be synchronized.
Further, the step S100 includes:
generating a first random seed through a preamble master node, acquiring a first tuple according to the current data synchronization times, the preamble master node and the first random seed, and transmitting the first tuple to a preset node.
And acquiring a second random seed based on the first tuple, and generating a second tuple according to the current data synchronization times, the preamble master node, the preset node, the first random seed and the second random seed.
And signing the second tuple to generate a first target signature, generating a third tuple based on the first target signature and the second random seed, and simultaneously transmitting the third tuple to the preamble master node.
Further, the step S100 further includes:
and generating a third random seed through the preamble master node, generating a fourth tuple according to the third tuple and the third random seed, and signing the fourth tuple to obtain a second target signature.
And acquiring a first target master node according to the second target signature, generating a fifth tuple according to the third tuple, the third random seed and the second target signature, and transmitting the fifth tuple to a preset node.
Further, the step S200 includes:
and acquiring a target receiving node from the preset node through the first target main node, generating a sixth tuple according to the first target main node and the current data synchronization times, and sending the sixth tuple to the target receiving node.
And acquiring the first data to be synchronized and transmitting the first data to be synchronized to the first target master node.
And comparing the first data to be synchronized with preset data through the first target main node so as to acquire the same data, including data, intersecting data and irrelevant data of the first data to be synchronized and the preset data.
Further, the step S200 further includes:
and generating a first synchronization index according to the same data, the contained data, the intersected data and the irrelevant data, and generating a second synchronization index according to the first synchronization index.
Wherein, the first synchronization index =Second synchronization index = =>。
The said、/>、/>And->The same data, the contained data, the intersecting data and the irrelevant data, respectively +.>、/>、/>And->D is the first data to be synchronized, M is the number of target receiving nodes; r is R i,j Representing a first synchronization index, i representing the order of neighboring subfields, j representing the order of target receiving nodes.
Further, the step S200 further includes:
and acquiring a final receiving node according to the second synchronization index and the target receiving node.
Dividing first data to be synchronized into preset sub-data through a first target main node, and generating an initial synchronization list according to the sub-data.
And sending the initial synchronization list to a final receiving node.
Further, the step S200 further includes:
and acquiring second data to be synchronized according to the first data to be synchronized, and comparing the first data to be synchronized with the second data to be synchronized through the second target main node to acquire consistent sub-data as first signature data and inconsistent sub-data as second signature data.
The first signature data and the second signature data are respectively signed to generate a target synchronization list based on the initial synchronization list.
Further, after the step S300 is performed, the method further includes:
and acquiring data which is not subjected to signature operation in the target synchronous list by the second target receiving node as first data to be synchronized.
Further, the step S500 of obtaining the target data to be synchronized includes:
and acquiring sub-data, the number of which is larger than a first preset number, in the target synchronization list as first target data to be synchronized, and acquiring sub-data, the number of which is larger than a second preset number and the difference value between the average value of the data sizes and the data size of the first target data to be synchronized is smaller than a preset difference value, as second target data to be synchronized.
And generating target data to be synchronized based on the first target data to be synchronized and the second target data to be synchronized.
Based on the same conception, the application also provides an edge computing cross-domain synchronization system, which comprises:
the generation module is used for: for generating a first target master node in response to a data synchronization request signal from a preamble master node generated in a previous data synchronization stage.
A first acquisition module: the method comprises the steps of acquiring a target receiving node and an initial synchronization list through the first target main node, and signing preset data in the initial synchronization list to acquire the target synchronization list.
And a second acquisition module: and the target receiving node is used for carrying out local synchronization on the target synchronization list through the target receiving node and is used as a second target master node.
And a judging module: the method comprises the steps of judging whether the data in the target synchronous list is signed, and if so, transferring to a synchronous module; otherwise, returning to the first acquisition module.
And a synchronization module: and the second target master node is used for acquiring target data to be synchronized in a target synchronization list and performing global synchronization on the target data to be synchronized.
Compared with the prior art, the beneficial effect of this application lies in:
the method realizes a safe and efficient data synchronization algorithm of the edge computing system, and is particularly suitable for edge computing scenes which are large in network scale and are composed of heterogeneous devices; the existing edge calculation data synchronization algorithm usually needs to preset a global relay scheduling node, is insufficient in safety and has downtime risk, and the data flow is too concentrated and the peak performance is low, so that the method is not suitable for edge calculation scenes with high requirements on stability and instantaneity, particularly commercial scenes; according to the method, the node with higher data processing capacity is dynamically selected as the main node through the cryptographic digital signature algorithm, and the main node is updated according to the data similarity, so that the quick and safe matching and synchronization of the whole network data are ensured, and the operation efficiency of the whole system is improved.
Drawings
Fig. 1 is a flowchart of an edge computing cross-domain synchronization method described in the present application.
FIG. 2 is a system frame diagram of the edge computing cross-domain synchronization method described in FIG. 1.
Detailed Description
The application provides an edge computing cross-domain synchronization method and system, which are used for solving the technical problems that the existing edge computing cross-domain synchronization method is poor in system safety, a main node is easily attacked by malicious nodes, and in addition, the data processing amount of a global node is too large and is easily downtime, so that the system is paralyzed.
An edge computing cross-domain synchronization method and system of the present application are described in further detail below with reference to specific embodiments and accompanying drawings.
Examples
Referring to fig. 1, the present application provides a method for edge computing cross-domain synchronization, which includes the following steps:
s100: in response to the data synchronization request signal, a first target master node is generated from a preamble master node generated in a previous data synchronization stage.
Further, the step S100 includes:
generating a first random seed through a preamble master node, acquiring a first tuple according to the current data synchronization times, the preamble master node and the first random seed, and transmitting the first tuple to a preset node.
In this embodiment, in response to a data synchronization request signal of a preset subfield, a first random seed is generated according to a master node generated in a previous stage of the preset subfield, that is, the preamble master node yTo obtain a first tupleAnd sending the message to all nodes in a preset sub-domain, namely the preset nodes.
Wherein,the initial value is 0 for the number of times the entire system has completed synchronization.
And acquiring a second random seed based on the first tuple, and generating a second tuple according to the current data synchronization times, the preamble master node, the preset node, the first random seed and the second random seed.
In this embodiment, the other node x in the preset sub-domain receives the first random seedAfter that, a second random seed is generated +.>. And signing the second tuple to generate a first target signature, generating a third tuple based on the first target signature and the second random seed, and simultaneously transmitting the third tuple to the preamble master node.
In this embodiment, the private key is used for the second tupleAnd signing to generate a first target signature q.
When a second random seed is foundLet the first target signature q be the front +.>The sum of bits is greater than the default value, the third tuple +.>And sending the message to the preamble master node.
Further, the step S100 further includes:
and generating a third random seed through the preamble master node, generating a fourth tuple according to the third tuple and the third random seed, and signing the fourth tuple to obtain a second target signature.
In this embodiment, the preamble master node counts all third tuples meeting the requirements in a default time period, and then generates a third random seedAnd +.>And signing to generate a second target signature g.
And acquiring a first target master node according to the second target signature, generating a fifth tuple according to the third tuple, the third random seed and the second target signature, and transmitting the fifth tuple to a preset node.
In this embodiment, the leading master node that minimizes the second target signature g becomes the new master node, and the first target master node, and the fifth tupleAnd sending the message to all nodes in a preset sub-domain, namely the preset nodes.
Wherein the fifth tuple may be referred to as an election result tuple.
It should be noted that, through the algorithm, a new node with higher data processing capability can be selected, excessive operation time is not consumed, nodes inside and outside the preset subdomain are ensured not to learn the election result in advance, probability of the subdomain main node being attacked by the external node is reduced, and safety is improved.
S200: and acquiring a target receiving node and an initial synchronization list through the first target master node, and signing preset data in the initial synchronization list to acquire the target synchronization list.
Further, the step S200 includes:
and acquiring a target receiving node from the preset node through the first target main node, generating a sixth tuple according to the first target main node and the current data synchronization times, and sending the sixth tuple to the target receiving node.
In the present embodimentIn (a) the first target master node x randomly selects M receiving nodes (i.e. the target receiving nodes) from each adjacent sub-domain (N adjacent sub-domains in total) and tuples the synchronization signal, i.e. the sixth tupleTo each target receiving node.
It should be noted that x in the embodiment of step S200 refers to the first target master node, and is different from the other nodes x described in the embodiment of step S100.
And acquiring the first data to be synchronized and transmitting the first data to be synchronized to the first target master node.
In the present embodiment, the firstThe first part of the adjacent subfields>Individual target receiving node->The local data to be synchronized (namely the first data to be synchronized) are sent to a first target master node x, and the sent data areWherein->Is a receiving node->Local data not yet acknowledged synchronously, +.>Is a receiving node->For tuple->Is a signature of (a).
Wherein,is a list structure, and each element of the list stores asynchronous sub-data independent of each other.
And comparing the first data to be synchronized with preset data through the first target main node so as to acquire the same data, including data, intersecting data and irrelevant data of the first data to be synchronized and the preset data.
In this embodiment, the first target master node x will synchronize the local data D (also a list) to be synchronized with the received dataComparing, and recording the completely consistent data quantity in the two sub-data as +.>The data amount of the inclusion relationship is +.>The data amount with the intersecting relation is +.>The data quantity completely irrelevant is +.>。
Further, the step S200 further includes:
and generating a first synchronization index according to the same data, the contained data, the intersected data and the irrelevant data, and generating a second synchronization index according to the first synchronization index.
Wherein, the first synchronization index =Second synchronization index = =>。
Wherein the first synchronization index is a firstTarget master node x and target receiving nodeThe second sync index refers to the sync index of the neighbor subfield i with the current subfield.
The said、/>、/>And->The same data, containing data, intersecting data and irrelevant data, respectively, are identical to the +.>、/>、/>And->、/>、/>And->D is the first data to be synchronized, M is the number of target receiving nodes; r is R i,j Representing a first synchronization index, i representing the order of neighboring subfields, j representing the order of target receiving nodes.
Further, the step S200 further includes:
and acquiring a final receiving node according to the second synchronization index and the target receiving node.
In this embodiment, the first target master node x uses the adjacent sub-domain with the largest second synchronization index as the final receiving sub-domain, and uses the node with the largest second synchronization index in the sub-domain as the final receiving node。
Dividing first data to be synchronized into preset sub-data through a first target main node, and generating an initial synchronization list according to the sub-data.
In this embodiment, the first target master node x divides the local data D to be synchronized (i.e. the first data to be synchronized) into U mutually independent sub-data, the firstThe sub-data is denoted as D [ t ]]. Generating each element V [ t ] of the initial synchronization list V, V simultaneously]Stored is tuple->Wherein->Is the first target master node x pair sub-dataIs a signature of (a).
And sending the initial synchronization list to a final receiving node.
In the present embodiment, the initial synchronization list V is issued to the final receiving node. To this end, the signature count obtained for each subsection of data D is 1.
Further, the step S200 further includes:
and acquiring second data to be synchronized according to the first data to be synchronized, and comparing the first data to be synchronized with the second data to be synchronized through the second target main node to acquire consistent sub-data as first signature data and inconsistent sub-data as second signature data.
In this embodiment, the final receiving nodeAfter receiving the initial synchronization list V, the local data D to be synchronized and the local data D to be synchronized are added>(i.e. the second data to be synchronized) and then initially expanding the size of the list V toWherein->Is->And D, the number of the sub-data inconsistent with D, and putting all the inconsistent sub-data and the signature of the receiving node into an extension element of the list V.
The first signature data and the second signature data are respectively signed to generate a target synchronization list based on the initial synchronization list.
In this embodiment, for consistent sub-data, the final receiving nodeThen they are signed separately and the signature is placed in the element corresponding to the initial synchronization list V. Namely +.for the original inconsistent data in D>Element V t]The structure of (2) is still->The method comprises the steps of carrying out a first treatment on the surface of the For consistent sub-data D [ t ]]Element V t]The structure of (2) is->，/>Is a nodeFor->Is a signature of (a); for->New inconsistent data->Element V [ U+a ]]The structure of (1) is that，/>，/>Is->A-th sub-data inconsistent with D, -/-, a>Is a receiving node->For->Is a signature of (a).
After the corresponding signature is completed, a target synchronous list is further obtained.
So far, the signature count obtained by the data consistent part in the data D to be synchronized is 2, and the inconsistent parts are all 1.
S300: and locally synchronizing the target synchronization list through the target receiving node, and taking the target receiving node as a second target master node.
At the bookIn an embodiment, the final receiving nodeSending the target synchronous list to all nodes which sign the data in the target synchronous list, and enabling the final receiving node to be +.>Acting as a new master node x, the second target master node.
It should be noted that the master node x is different from the first target master node x in the embodiment of step S200, and is also different from the other nodes x described in the embodiment of step S100.
Further, after the step S300 is performed, the method further includes:
and acquiring data which is not subjected to signature operation in the target synchronous list by the second target receiving node as first data to be synchronized.
In this embodiment, all data to be synchronized in the target synchronization list V is used as new data to be synchronized D.
S400: judging whether the data in the target synchronous list is signed, if so, turning to step S500; otherwise, the process returns to step S200.
S500: and acquiring target data to be synchronized in a target synchronization list through the second target master node, and performing global synchronization on the target data to be synchronized.
Further, the step S500 of obtaining the target data to be synchronized includes:
and acquiring sub-data, the number of which is larger than a first preset number, in the target synchronization list as first target data to be synchronized, and acquiring sub-data, the number of which is larger than a second preset number and the difference value between the average value of the data sizes and the data size of the first target data to be synchronized is smaller than a preset difference value, as second target data to be synchronized.
In this embodiment, the second target master node of each preset subdomain performs statistical processing on the target synchronization list V, and the subdata meeting the following requirements is used as final confirmed synchronization data.
If it is sub-data D [ t ]]If the number of signatures exceeds half the number of subfields, then Dt]Meets the requirements, and D [ t ] is obtained at the moment]The first target data to be synchronized; otherwise, if there is signed sub-dataSatisfy->And thus->The number exceeds a default value->And all->Average value of the data size of (2) and +.>The difference in the data size is smaller than a given default value +.>D [ t ]]Also meets the requirements, and D [ t ] is obtained at this time]The second target is the data to be synchronized.
In practical development, the method can be based on D [ t ]]Is to adjust the importance of (a)And->Is of a size of (a) and (b).
And generating target data to be synchronized based on the first target data to be synchronized and the second target data to be synchronized.
In this embodiment, all obtained dt are target data to be synchronized, and each second target master node synchronizes list elements vt corresponding to all data dt that are finally obtained and confirmed to all nodes in a preset subdomain.
And then all nodes of all preset subdomains carry out global synchronization on the target data to be synchronized.
Examples
The application also provides an edge computing cross-domain synchronization system, comprising:
the generation module is used for: for generating a first target master node in response to a data synchronization request signal from a preamble master node generated in a previous data synchronization stage.
A first acquisition module: the method comprises the steps of acquiring a target receiving node and an initial synchronization list through the first target main node, and signing preset data in the initial synchronization list to acquire the target synchronization list.
And a second acquisition module: and the target receiving node is used for carrying out local synchronization on the target synchronization list through the target receiving node and is used as a second target master node.
And a judging module: the method comprises the steps of judging whether the data in the target synchronous list is signed, and if so, transferring to a synchronous module; otherwise, returning to the first acquisition module.
And a synchronization module: and the second target master node is used for acquiring target data to be synchronized in a target synchronization list and performing global synchronization on the target data to be synchronized.
In summary, the present application provides a method and a system for edge computing cross-domain synchronization; firstly, responding to a data synchronization request signal, and generating a first target master node according to a preamble master node generated in a previous data synchronization stage; then, acquiring a target receiving node and an initial synchronization list through the first target master node, and signing preset data in the initial synchronization list to acquire a target synchronization list; the target receiving node performs local synchronization on the target synchronization list, and the target receiving node is used as a second target master node; and then judging whether the data in the target synchronization list is signed or not, so that when the signature is finished, the target data to be synchronized in the target synchronization list is obtained through the second target master node, and global synchronization is carried out on the target data to be synchronized. According to the method, the node with higher data processing capacity is dynamically selected as the main node through the cryptographic digital signature algorithm, and the main node is updated according to the data similarity, so that the quick and safe matching and synchronization of the whole network data are ensured, and the operation efficiency of the whole system is improved.
Although the illustrative embodiments have been described herein with reference to the accompanying drawings, it is to be understood that the above illustrative embodiments are merely exemplary and are not intended to limit the scope of the present application thereto. Various changes and modifications may be made therein by one of ordinary skill in the art without departing from the scope and spirit of the present application. All such changes and modifications are intended to be included within the scope of the present application as set forth in the appended claims.
Those of ordinary skill in the art will appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.
In the several embodiments provided in this application, it should be understood that the disclosed apparatus and method may be implemented in other ways. For example, the above-described device embodiments are merely illustrative, e.g., the division of the elements is merely a logical functional division, and there may be additional divisions when actually implemented, e.g., multiple elements or components may be combined or integrated into another device, or some features may be omitted or not performed.
It is noted that relational terms such as first and second, and the like are used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Moreover, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.
While the present application has been described in conjunction with the specific embodiments above, it is evident that many alternatives, modifications and variations will be apparent to those skilled in the art in light of the foregoing description. Accordingly, all such alternatives, modifications, and variations are included within the spirit and scope of the following claims.
Claims (10)
1. An edge computing cross-domain synchronization method is characterized by comprising the following steps:
s100: responding to the data synchronization request signal, and generating a first target master node according to the preamble master node generated in the previous data synchronization stage;
s200: acquiring a target receiving node and an initial synchronization list through the first target master node, and signing preset data in the initial synchronization list to acquire a target synchronization list;
s300: locally synchronizing the target synchronization list through the target receiving node, and taking the target receiving node as a second target master node;
s400: judging whether the data in the target synchronous list is signed, if so, turning to step S500; otherwise, returning to the step S200;
s500: and acquiring target data to be synchronized in a target synchronization list through the second target master node, and performing global synchronization on the target data to be synchronized.
2. The edge computing cross-domain synchronization method according to claim 1, wherein the step S100 includes:
generating a first random seed through a preamble master node, acquiring a first tuple according to the current data synchronization times, the preamble master node and the first random seed, and transmitting the first tuple to a preset node;
acquiring a second random seed based on the first tuple, and generating a second tuple according to the current data synchronization times, the preamble master node, a preset node, the first random seed and the second random seed;
and signing the second tuple to generate a first target signature, generating a third tuple based on the first target signature and the second random seed, and simultaneously transmitting the third tuple to the preamble master node.
3. The edge computing cross-domain synchronization method according to claim 2, wherein the step S100 further comprises:
generating a third random seed through the preamble master node, generating a fourth tuple according to the third tuple and the third random seed, and signing the fourth tuple to obtain a second target signature;
and acquiring a first target master node according to the second target signature, generating a fifth tuple according to the third tuple, the third random seed and the second target signature, and transmitting the fifth tuple to a preset node.
4. The edge computing cross-domain synchronization method according to claim 3, wherein the step S200 includes:
acquiring a target receiving node from the preset node through the first target main node, generating a sixth tuple according to the first target main node and the current data synchronization times, and sending the sixth tuple to the target receiving node;
acquiring first data to be synchronized, and transmitting the first data to be synchronized to a first target master node;
and comparing the first data to be synchronized with preset data through the first target main node so as to acquire the same data, including data, intersecting data and irrelevant data of the first data to be synchronized and the preset data.
5. The edge computing cross-domain synchronization method according to claim 4, wherein the step S200 further comprises:
generating a first synchronization index according to the same data, the contained data, the intersected data and the irrelevant data, and generating a second synchronization index according to the first synchronization index;
wherein, the first synchronization index =Second synchronization index = =>；
The said、/>、/>And->The same data, the contained data, the intersecting data and the irrelevant data, respectively +.>、/>、/>Andd is the first data to be synchronized, M is the number of target receiving nodes; r is R i,j Representing a first synchronization index, i representing the order of neighboring subfields, j representing the order of target receiving nodes.
6. The edge computing cross-domain synchronization method according to claim 5, wherein the step S200 further comprises:
acquiring a final receiving node according to the second synchronization index and the target receiving node;
dividing first data to be synchronized into preset sub-data through a first target main node, and generating an initial synchronization list according to the sub-data;
and sending the initial synchronization list to a final receiving node.
7. The edge computing cross-domain synchronization method according to claim 6, wherein the step S200 further comprises:
acquiring second data to be synchronized according to the first data to be synchronized, and comparing the first data to be synchronized with the second data to be synchronized through the second target main node to acquire consistent sub-data as first signature data and inconsistent sub-data as second signature data;
the first signature data and the second signature data are respectively signed to generate a target synchronization list based on the initial synchronization list.
8. The edge computing cross-domain synchronization method of claim 7, further comprising, after performing step S300:
and acquiring data which is not subjected to signature operation in the target synchronous list by the second target receiving node as first data to be synchronized.
9. The edge computing cross-domain synchronization method according to claim 8, wherein the acquiring target data to be synchronized in step S500 includes:
acquiring sub-data with the number of completed signatures being larger than a first preset number in the target synchronization list as first target data to be synchronized, and acquiring sub-data with the number of completed signatures being larger than a second preset number and the difference value between the average value of the data sizes and the data size of the first target data to be synchronized being smaller than a preset difference value as second target data to be synchronized;
and generating target data to be synchronized based on the first target data to be synchronized and the second target data to be synchronized.
10. A system employing the edge computing cross-domain synchronization method of any of claims 1-9, the system comprising:
the generation module is used for: the first target master node is used for responding to the data synchronization request signal and generating a first target master node according to the preamble master node generated in the previous data synchronization stage;
a first acquisition module: the method comprises the steps that a target receiving node and an initial synchronization list are obtained through a first target main node, and preset data in the initial synchronization list are signed to obtain a target synchronization list;
and a second acquisition module: the target receiving node is used for carrying out local synchronization on the target synchronization list and is used as a second target master node;
and a judging module: the method comprises the steps of judging whether the data in the target synchronous list is signed, and if so, transferring to a synchronous module; otherwise, returning to the first acquisition module;
and a synchronization module: and the second target master node is used for acquiring target data to be synchronized in a target synchronization list and performing global synchronization on the target data to be synchronized.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410252372.7A CN117834656B (en) | 2024-03-06 | 2024-03-06 | Edge computing cross-domain synchronization method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410252372.7A CN117834656B (en) | 2024-03-06 | 2024-03-06 | Edge computing cross-domain synchronization method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN117834656A true CN117834656A (en) | 2024-04-05 |
| CN117834656B CN117834656B (en) | 2024-06-11 |
Family
ID=90506319
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202410252372.7A Active CN117834656B (en) | 2024-03-06 | 2024-03-06 | Edge computing cross-domain synchronization method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117834656B (en) |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2018045820A1 (en) * | 2016-09-07 | 2018-03-15 | 华为技术有限公司 | File synchronization method, device, and system |
| CN108810100A (en) * | 2018-05-22 | 2018-11-13 | 郑州云海信息技术有限公司 | A kind of electoral machinery of host node, device and equipment |
| CN110336707A (en) * | 2019-08-07 | 2019-10-15 | 卓尔智联(武汉)研究院有限公司 | Block chain common recognition device, method and computer readable storage medium |
| CN111274317A (en) * | 2020-01-07 | 2020-06-12 | 书生星际(北京)科技有限公司 | Method and device for synchronizing multi-node data and computer equipment |
| CN112804313A (en) * | 2020-12-31 | 2021-05-14 | 杭州雾联科技有限公司 | Data synchronization method, device, equipment and medium based on cross-domain edge node |
| CN114726871A (en) * | 2022-03-22 | 2022-07-08 | 阿里巴巴（中国）有限公司 | Data synchronization method, device and network system |
| CN115720227A (en) * | 2022-11-15 | 2023-02-28 | 杭州钛度科技有限公司 | Election method and device for consensus nodes of block chain and electronic equipment |
| US20230087138A1 (en) * | 2021-03-16 | 2023-03-23 | Tencent Technology (Shenzhen) Company Limited | Data processing method, apparatus, and storage medium |
| CN117061512A (en) * | 2023-08-10 | 2023-11-14 | ***通信集团广东有限公司 | Distributed information management method and system based on big data |
| CN117439998A (en) * | 2022-07-12 | 2024-01-23 | 华侨大学 | Alliance chain consensus protocol optimization method oriented to Internet of things |
-
2024
- 2024-03-06 CN CN202410252372.7A patent/CN117834656B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2018045820A1 (en) * | 2016-09-07 | 2018-03-15 | 华为技术有限公司 | File synchronization method, device, and system |
| CN108810100A (en) * | 2018-05-22 | 2018-11-13 | 郑州云海信息技术有限公司 | A kind of electoral machinery of host node, device and equipment |
| CN110336707A (en) * | 2019-08-07 | 2019-10-15 | 卓尔智联(武汉)研究院有限公司 | Block chain common recognition device, method and computer readable storage medium |
| CN111274317A (en) * | 2020-01-07 | 2020-06-12 | 书生星际(北京)科技有限公司 | Method and device for synchronizing multi-node data and computer equipment |
| CN112804313A (en) * | 2020-12-31 | 2021-05-14 | 杭州雾联科技有限公司 | Data synchronization method, device, equipment and medium based on cross-domain edge node |
| US20230087138A1 (en) * | 2021-03-16 | 2023-03-23 | Tencent Technology (Shenzhen) Company Limited | Data processing method, apparatus, and storage medium |
| CN114726871A (en) * | 2022-03-22 | 2022-07-08 | 阿里巴巴（中国）有限公司 | Data synchronization method, device and network system |
| CN117439998A (en) * | 2022-07-12 | 2024-01-23 | 华侨大学 | Alliance chain consensus protocol optimization method oriented to Internet of things |
| CN115720227A (en) * | 2022-11-15 | 2023-02-28 | 杭州钛度科技有限公司 | Election method and device for consensus nodes of block chain and electronic equipment |
| CN117061512A (en) * | 2023-08-10 | 2023-11-14 | ***通信集团广东有限公司 | Distributed information management method and system based on big data |
Non-Patent Citations (2)
| Title |
|---|
| 林波;杨睿哲;杨兆鑫;金凯;***;: "基于区块链和边缘计算的智慧农业***", 情报工程, no. 03, 15 June 2018 (2018-06-15) * |
| 梁任纲;何倩;刘鹏;蒋明: ""融合区块链和Rsync的边缘节点数据同步"", 《桂林电子科技大学学报》, vol. 41, no. 06, 25 December 2021 (2021-12-25) * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN117834656B (en) | 2024-06-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108847925B (en) | Fragment block chain generation method based on tree structure | |
| WO2020133326A1 (en) | Blockchain generation method and system, and computer storage medium and electronic device | |
| CN112003820B (en) | Block chain consensus optimization method based on ring signature and aggregated signature | |
| CN110198233B (en) | Block chain consensus method and system based on trusted execution environment and directed acyclic graph | |
| CN110213038B (en) | Method and system for forming consensus of block chain | |
| WO2019019056A1 (en) | Method for frontal machine to participate in block chain consensus | |
| CN111724145B (en) | Design method of block chain system fragmentation protocol | |
| CN108848146A (en) | A kind of method for optimizing scheduling based on time trigger communication service | |
| CN113612604B (en) | Asynchronous network-oriented safe distributed random number generation method and device | |
| CN113826355A (en) | Short transaction identifier collision detection and coordination | |
| CN109919760A (en) | Byzantine failure tolerance common recognition algorithm based on voting mechanism | |
| Xu et al. | Occam: A secure and adaptive scaling scheme for permissionless blockchain | |
| CN114556864A (en) | Method and device for safety symbiotic excavation | |
| CN117834656B (en) | Edge computing cross-domain synchronization method and system | |
| CN111667264A (en) | Block data transmission method and device, electronic equipment and nonvolatile computer storage medium | |
| CN115878729A (en) | Node block storage allocation optimization method and system based on alliance chain | |
| CN114928446A (en) | Efficient consensus method for large-scale nodes | |
| CN111464542B (en) | Accounting method and device for block chain network | |
| CN115189871A (en) | Byzantine fault-tolerant consensus algorithm based on verifiable random function and threshold signature | |
| CN109687954B (en) | Method and apparatus for algorithm acceleration | |
| CN114900319A (en) | Block chain transaction verification method and system | |
| CN117376137A (en) | Block chain node slicing method, equipment and storage medium | |
| CN115021945B (en) | Block chain transaction processing method and system | |
| US11449494B2 (en) | Distributed secure database system using an evolving nonce | |
| CN116012164B (en) | Block chain cross-fragment transaction method based on virtual account |
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 |