CN115314512B - Massive terminal data synchronization method and system - Google Patents
Massive terminal data synchronization method and system Download PDFInfo
- Publication number
- CN115314512B CN115314512B CN202211223870.6A CN202211223870A CN115314512B CN 115314512 B CN115314512 B CN 115314512B CN 202211223870 A CN202211223870 A CN 202211223870A CN 115314512 B CN115314512 B CN 115314512B
- Authority
- CN
- China
- Prior art keywords
- data
- terminal
- seed
- host
- server end
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1095—Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/02—Details
- H04L12/16—Arrangements for providing special services to substations
- H04L12/18—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Information Transfer Between Computers (AREA)
Abstract
The invention provides a mass terminal data synchronization method and a system, relating to the technical field of mass data.A server end responds to a user operating system to change data; the server end carries out data change, and selects a seed node through a seed selector to issue data; after receiving the message sent by the server, the seed node changes the local data; the seed node broadcasts data periodically and synchronizes the local data to the relevant host of the next stage of the terminal. Because the server end only carries out data interaction with the seed node, and the concurrent pressure and the network pressure are greatly reduced, the server end can carry out data pushing in real time after data change, and the real-time performance of data synchronization is ensured.
Description
Technical Field
The invention relates to the technical field of mass data, in particular to a mass terminal data synchronization method and system.
Background
With the rapid development of some enterprises, the number of client groups is continuously increased, so that the number of client terminals used in the enterprises is greatly increased, massive terminal data can be generated, and data interaction with a server is frequently performed, so that great pressure is caused on the server.
In order to deal with the situations, a server end is subjected to clustering transformation, but the field environment of a client is complex and harsh, and under the limited hardware resources and the bandwidth of a network, the server clustering cannot completely solve the field problem. Especially, the network bandwidth is limited by the individual client site, which has a great influence on the data interaction between the server side and the client side.
The current server and the client perform data synchronization in a timing and hash mode, that is, the management end configures the maximum synchronization time, for example, 1 day, and the terminal randomly performs data synchronization at a certain time point within 1 day.
The data synchronization real-time performance is not enough by adopting a timing + hashing mode. The existing mode only relieves the pressure of the server end to a certain degree, but the whole network flow is unchanged.
Disclosure of Invention
In order to overcome the defects in the prior art, the invention provides a mass terminal data synchronization method, which solves the problem of data consistency in a large-scale decentralized P2P network and realizes the synchronization of mass data.
The mass terminal data synchronization method comprises the following steps:
step one, a server end responds to a user operating system to carry out data change;
step two, the server side carries out data change, and selects a seed node through a seed selector to carry out data distribution;
after receiving the message sent by the server, the seed node changes the local data;
and step four, the seed node broadcasts data periodically and synchronizes the local data to the relevant host of the next stage of the terminal.
It should be further noted that the method further includes: the terminal is on line and sends a message to the server end;
the server end responds to the message sent by the terminal to obtain all host information and the number of the host information under the terminal;
and calculating the required seed number of the terminal according to the number of hosts under the terminal.
It should be further noted that the server performs seed verification;
and if the number of the seeds activated under the current terminal is equal to the calculated number of the seeds, the hosts are evenly distributed into the N seed nodes in a polling mode.
It should be further noted that the seed check is performed on the terminal by responding to the server end;
and the server terminal acquires the performance information of each terminal, and calls the terminal with the performance information matched with the preset condition as the seed node.
It should be further noted that the performance information is the available online time of the terminal, the cpu resource availability, the operation speed, and the master frequency data.
It should be further noted that the server performs seed check;
if the seed quantity activated under the current terminal is not equal to the calculated seed quantity, performing seed node election;
and if the election is successful, synchronizing all the service data and all the host data under the terminal.
It should be further noted that, if the election fails, the hosts are equally distributed to the N seed nodes in a polling manner.
It is further noted that in response to returning data to the terminal; and after receiving the data, the seed node starts a timing task and broadcasts the data to the subnode to which the seed node belongs at regular intervals.
It is further noted that the method further comprises:
a host A of the next stage of the terminal sends a handshake request to a host B;
if the host B does not respond, continuing to the next host C;
if the host B responds to the handshake request of the host A, the host B sends the local data id and the version number to the host A according to the data identification in the message;
after the host A receives the data of the host B, the local data is compared, and if the version numbers are not consistent, the version numbers are sent to the host B.
The invention also provides a mass terminal data synchronization system, which comprises: a server end, a seed selector and a terminal;
the terminal is cascaded with a plurality of hosts;
the server end responds to the user operating system to change data;
the server side carries out data change, and selects a seed node through a seed selector to carry out data distribution;
after receiving the message sent by the server, the seed node changes the local data;
the seed node broadcasts data periodically and synchronizes the local data to the relevant host of the next stage of the terminal.
According to the technical scheme, the invention has the following advantages:
the mass terminal data synchronization system provided by the invention can completely solve the problem of field data updating under the limited hardware resources and network bandwidth. And data interaction between the server and the terminal is realized, and timely processing of data updating is ensured. The problem that the real-time performance of data synchronization is not enough due to the adoption of a timing and hash mode is solved. The mass terminal data synchronization system provided by the invention relieves the pressure of the server end to a certain extent, and ensures the smoothness of the system network.
The massive terminal data synchronization method utilizes the Gossip protocol to solve the problem of data consistency in a large-scale decentralized P2P network, and is remarkably characterized in that the data change message can be broadcast to the whole communication network as long as one node can communicate with part of nodes without requiring mutual communication among the nodes.
The seed node is selected reasonably according to the organization, the number of terminals and the utilization condition of terminal machine resources. Under the condition of not influencing the use of a user, the real-time performance and the accuracy of the data synchronization of the seed node and the terminal are ensured.
Drawings
In order to more clearly illustrate the technical solution of the present invention, the drawings used in the description will be briefly introduced, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art that other drawings can be obtained based on these drawings without creative efforts.
FIG. 1 is a flow chart of a mass terminal data synchronization method;
FIG. 2 is a schematic diagram of an embodiment of a method for synchronizing mass terminal data;
fig. 3 is a schematic diagram of a mass terminal data synchronization system.
Detailed Description
The massive terminal data synchronization system architecture provided by the invention can comprise a terminal, a network and a server end. A network is a medium used to provide communication links between terminals and servers. The network may include various connection types, such as wired, wireless communication links, or fiber optic cables, to name a few.
It should be understood that the number of terminals, networks and server ends in fig. 1 is merely illustrative. There may be any number of terminals, networks, and server sides, as desired for an implementation. For example, the server side may be a server cluster composed of a plurality of servers.
The user can use the user operating system to interact with the server end through the network so as to receive or send messages and the like. The terminal may be a variety of electronic devices having a display screen including, but not limited to, smart phones, tablets, portable and desktop computers, digital cinema projectors, and the like.
The server side may be a server providing various services. For example, a user sends data information to a server by using a user operating system.
The server may broadcast the data change message to the entire communication network based on Gossip protocol. The massive terminal data synchronization method solves the problem of data consistency in a large-scale decentralized P2P network by utilizing the Gossip protocol, and is remarkably characterized in that the data change message can be broadcast to the whole communication network as long as one node can communicate with part of nodes without requiring mutual communication among the nodes. The problem that the data synchronization instantaneity is not enough due to the adoption of a timing and hash mode is solved.
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
It should be understood that, the sequence numbers of the steps in the foregoing embodiments do not imply an execution sequence, and the execution sequence of each process should be determined by its function and inherent logic, and should not constitute any limitation to the implementation process of the embodiments of the present invention.
The invention provides a mass terminal data synchronization method, as shown in fig. 1, the method comprises the following steps:
s101, the server side responds to a user operating system to change data;
the user operating system can perform operations such as adding, deleting, modifying and the like on system data. The server side obtains the data change information and can store the data. The data before and after the change is saved.
S102, a server side carries out data change, and a seed selector selects a seed node to send data;
s103, after receiving the message sent by the server, the seed node changes local data;
s104, the seed node broadcasts data periodically and synchronizes the local data to the relevant host of the next stage of the terminal.
Illustratively, the seed selector may periodically disseminate messages to the seed nodes. The infected node randomly selects N neighboring nodes to disseminate the message, e.g., fan-out set to 6, with up to 6 nodes being disseminated at a time. The node only receives the message and does not feed back the result. Each time the message is disseminated, the nodes that have not yet been sent are selected for dissemination. The node that receives the message no longer disseminates to the sending node: the host A broadcasts to the host B, and the host B does not send the broadcast to the host A any more when the host B broadcasts. Therefore, the problem that the real-time performance of data synchronization is insufficient due to the adoption of a timing and hashing mode is avoided. The invention can relieve the pressure of the server end and improve the data processing efficiency of the system.
Further, as a refinement and an extension of the specific implementation of the embodiment, in order to fully describe the specific implementation process in this embodiment, another method for synchronizing massive terminal data is provided, and the method further includes: s201, the terminal is on line and sends a message to a server end;
in the embodiment of the invention, the terminal is on-line and sends the on-line message to the server end, so that the server end can obtain the on-line state of the terminal.
S202, the server side responds to the message sent by the terminal to obtain all host information and the number of the host information under the terminal;
in some embodiments of the present invention, the terminal has a parent-child relationship with all hosts thereunder, wherein the terminal has an intercommunication path with a plurality of hosts. Multiple hosts can communicate with each other, can be a ring network, or a tree network, etc.
And S203, calculating the seed number required by the terminal according to the number of hosts under the terminal.
For example: if 100 hosts 1 seed node is specified, if 500 hosts are under one terminal, 5 seed nodes are needed.
In some embodiments of the present invention, the server performs seed check;
and if the number of the seeds activated under the current terminal is equal to the calculated number of the seeds, the hosts are evenly distributed into the N seed nodes in a polling mode.
After the distribution, the seed node responds to return data to the terminal; and after receiving the data, the seed node starts a timing task and broadcasts the data to the subnode to which the seed node belongs at regular intervals.
As another embodiment of the present invention, a seed check is performed on a terminal in response to a server end;
and the server terminal acquires the performance information of each terminal, and calls the terminal with the performance information matched with the preset condition as the seed node.
The performance information is the on-line time of the terminal, the CPU resource availability, the operation speed and the main frequency data;
the seed node responds to returning the data to the terminal; and after receiving the data, the seed node starts a timing task and broadcasts the data to the subnode to which the seed node belongs at regular intervals.
In this way, the seed node is selected reasonably according to the organization, the number of terminals and the resource utilization condition of the terminal machine. Under the condition of not influencing the use of a user, the real-time performance and the accuracy of the data synchronization of the seed node and the terminal are ensured.
In the related art, for example, a machine learning method, a deep learning method, and the like may be used to implement a massive terminal data synchronization method, and different methods are applicable to different ranges.
In one embodiment of the present disclosure, a server side performs seed verification;
if the seed quantity activated under the current terminal is not equal to the calculated seed quantity, performing seed node election;
and if the election is successful, synchronizing all the service data and all the host data under the terminal.
And if the election fails, the hosts are equally distributed into the N seed nodes in a polling mode.
Therefore, the 30W host and the 6W seed nodes are arranged on the site, the server end only needs to send data to the 6W seed nodes after receiving the data change, and compared with the previous 30W host, the concurrent bearing capacity of the server end is improved by 5 times.
In the embodiment of the present invention, as shown in fig. 2, the host a at the next stage of the terminal sends a handshake request to the host B, and if the host B does not respond, the next host C continues;
message example:
{
"source": "172.168.0.1",
"dataType": "org"
}
if the host B responds to the handshake request of the host A, the host B sends the local data id and the version number to the host A according to the data identification in the message;
message example:
{
"source": "172.168.0.2",
"dataType": "org",
"requestContent": [
{
"id": "1",
"version":"1"
},
{
"id": "2",
"version":"3"
}
]
}
after receiving the data of the host B, the host A compares the local data, and if the version numbers are not consistent, the version number is sent to the host B.
Message example:
{
"source": "172.168.0.1",
"dataType": "org",
"requestContent": [
{
"id": "1",
"name": department 1",
"version": "2"
}
]
}
the embodiment solves the problem of data consistency in the large-scale decentralized P2P network, and the invention has the obvious characteristic that the data change message can be broadcast to the whole communication network as long as one node can communicate with part of nodes without requiring mutual communication among the nodes. The problem that the data synchronization instantaneity is not enough due to the adoption of a timing and hash mode is solved.
Based on the above massive terminal data synchronization method, the present invention further provides a massive terminal data synchronization system, as shown in fig. 3, the system comprising: a server terminal, a seed selector and a terminal;
the terminal is cascaded with a plurality of hosts;
the server end responds to the user operating system to change data;
the server side carries out data change, and selects a seed node through a seed selector to carry out data distribution;
after receiving the message sent by the server, the seed node changes the local data;
the seed node broadcasts data periodically and synchronizes the local data to the relevant host of the next stage of the terminal.
In the implementation mode of the system, the terminal is on line and sends a message to a server end;
a server side acquires information and quantity of a terminal and all hosts;
the server end calculates the seed number required by the department according to the number of the hosts, for example: if 100 hosts are specified for 1 seed node, if 500 hosts are under one department, then 5 seed nodes are needed.
And the server end carries out seed verification, if the number of the currently activated seed under the department is equal to the calculated seed number, in order to prevent the pressure of a single seed node from being overlarge, a polling mode is adopted, and the host is evenly distributed into N seed nodes.
In another implementation mode of the invention, the collection of the terminal hardware configuration is considered, and the seed verification of the server end to the terminal is responded; the server terminal acquires the performance information of each terminal, and calls the terminal of which the performance information is matched with the preset condition as the seed node. The performance information is the on-line time of the terminal, the CPU resource availability, the operation speed and the main frequency data;
in this embodiment, the server performs seed verification; if the seed quantity activated under the current terminal is not equal to the calculated seed quantity, performing seed node election; and if the election is successful, synchronizing all the service data and all the host data under the terminal. And if the election fails, the hosts are equally distributed into the N seed nodes in a polling mode.
The seed node responds to return data to the terminal; and after receiving the data, the seed node starts a timing task and broadcasts the data to the subnode at regular intervals.
The mass terminal data synchronization system provided by the invention can completely solve the problem of field data updating under the limited hardware resources and network bandwidth. And data interaction between the server and the terminal is realized, and timely processing of data updating is ensured. The problem that the real-time performance of data synchronization is not enough due to the adoption of a timing and hash mode is solved. The mass terminal data synchronization system provided by the invention relieves the pressure of the server end to a certain extent, and ensures the smoothness of the system network.
The massive terminal data synchronization method utilizes the Gossip protocol to solve the problem of data consistency in a large-scale decentralized P2P network, and is remarkably characterized in that the data change message can be broadcast to the whole communication network as long as one node can communicate with part of nodes without requiring mutual communication among the nodes.
The seed node is selected reasonably according to the organization, the number of terminals and the resource utilization condition of the terminal machine. Under the condition of not influencing the use of a user, the real-time performance and the accuracy of the data synchronization of the seed node and the terminal are ensured.
The block diagrams shown in the drawings of the present invention providing a mass terminal data synchronization system are merely functional entities and do not necessarily correspond to physically independent entities. I.e. these functional entities may be implemented in the form of software, or in one or more hardware modules or integrated circuits, or in different networks and/or processor means and/or microcontroller means.
The present invention provides a system and method for synchronizing mass terminal data, which combines the elements and algorithmic steps of the various examples described in connection with the embodiments disclosed herein, either in electronic hardware, computer software, or a combination of both, and the components and steps of the various examples have been described in a functional generic sense in the foregoing description for clarity of explanation of the interchangeability of hardware and software. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. 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 invention.
The present invention provides a method for synchronizing mass terminal data, which can write program codes for performing the operations of the present disclosure in any combination of one or more programming languages, including an object-oriented programming language such as Java, C + +, etc., and a conventional procedural programming language such as "C" or similar programming languages. The program code may execute entirely on the user's computing device, partly on the user's device, as a stand-alone software package, partly on the user's computing device and partly on a remote computing device, or entirely on the remote computing device or server. In the case of a remote computing device, the remote computing device may be connected to the user computing device through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computing device (e.g., through the internet using an internet service provider).
The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present invention. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the invention. Thus, the present invention is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
Claims (6)
1. A mass terminal data synchronization method is characterized by comprising the following steps:
step one, a server end responds to a user operating system to change data;
step two, the server side carries out data change, and selects a seed node through a seed selector to send data;
after receiving the message sent by the server, the seed node changes the local data;
step four, the seed node broadcasts data periodically and synchronizes the local data to the relevant host of the next stage of the terminal;
the method further comprises the following steps: the terminal is on-line and sends a message to the server end;
the server side responds to the message sent by the terminal to obtain all host information and the number of the hosts under the terminal; the terminal and all the hosts under the terminal are in a parent-child relationship, wherein the terminal and the multiple hosts have communication channels which are communicated with each other;
calculating the required seed number of the terminal according to the number of hosts under the terminal;
in the method, a server end carries out seed verification;
if the number of seeds activated under the current terminal is equal to the calculated number of seeds, the host is evenly distributed into N seed nodes in a polling mode;
in the method, a seed check is carried out on a terminal in response to a server end;
the server end acquires the performance information of each terminal, and calls the terminal with the performance information matched with the preset condition as a seed node;
in the method, a server end carries out seed verification;
if the seed quantity activated under the current terminal is not equal to the calculated seed quantity, performing seed node election;
and if the election is successful, synchronizing all the service data and all the host data under the terminal.
2. The method for synchronizing mass terminal data according to claim 1,
the performance information includes the on-line time of the terminal, the availability of CPU resources, the operation speed and the main frequency data.
3. The method for synchronizing mass terminal data according to claim 1,
and if the election fails, the hosts are evenly distributed to the N seed nodes in a polling mode.
4. The method for synchronizing mass terminal data according to claim 1,
in response to returning the data to the terminal; and after receiving the data, the seed node starts a timing task and broadcasts the data to the subnode to which the seed node belongs at regular intervals.
5. The method for synchronizing mass terminal data according to claim 1,
the method further comprises the following steps:
the host A of the next stage of the terminal sends a handshake request to the host B;
if the host B does not respond, continuing to the next host C;
if the host B responds to the handshake request of the host A, the host B sends the local data id and the version number to the host A according to the data identification in the message;
after receiving the data of the host B, the host A compares the local data, and if the version numbers are not consistent, the version number is sent to the host B.
6. A mass terminal data synchronization system is characterized in that the system adopts the mass terminal data synchronization method according to any one of claims 1 to 5;
the system comprises: a server end, a seed selector and a terminal;
the terminal is cascaded with a plurality of hosts;
the server end responds to the user operating system to change data;
the server end carries out data change, and selects a seed node through a seed selector to issue data;
after receiving the message sent by the server, the seed node changes the local data;
the seed node broadcasts data periodically and synchronizes the local data to the relevant host of the next stage of the terminal.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211223870.6A CN115314512B (en) | 2022-10-09 | 2022-10-09 | Massive terminal data synchronization method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211223870.6A CN115314512B (en) | 2022-10-09 | 2022-10-09 | Massive terminal data synchronization method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115314512A CN115314512A (en) | 2022-11-08 |
| CN115314512B true CN115314512B (en) | 2023-02-17 |
Family
ID=83867476
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211223870.6A Active CN115314512B (en) | 2022-10-09 | 2022-10-09 | Massive terminal data synchronization method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115314512B (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102025756A (en) * | 2009-09-09 | 2011-04-20 | 中兴通讯股份有限公司 | Distributed system and data synchronization method thereof |
| US8745264B1 (en) * | 2011-03-31 | 2014-06-03 | Amazon Technologies, Inc. | Random next iteration for data update management |
| CN108833554A (en) * | 2018-06-22 | 2018-11-16 | 哈尔滨工业大学 | A kind of real-time highly reliable message distributing system and its method towards large scale network |
| CN110933134A (en) * | 2019-10-30 | 2020-03-27 | 中国科学院计算机网络信息中心 | Industrial internet-oriented edge computing server load balancing method and system |
| CN112699091A (en) * | 2021-01-04 | 2021-04-23 | 国网电子商务有限公司 | Distributed file sharing system and method |
| CN113032412A (en) * | 2021-03-03 | 2021-06-25 | 北京沃东天骏信息技术有限公司 | Data synchronization method and device, electronic equipment and computer readable medium |
| CN113377863A (en) * | 2020-03-10 | 2021-09-10 | 阿里巴巴集团控股有限公司 | Data synchronization method and device, electronic equipment and computer readable storage medium |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109450664B (en) * | 2018-10-09 | 2022-07-12 | 北京医拍智能科技有限公司 | Data cooperative processing method and device based on block chain P2P network |
-
2022
- 2022-10-09 CN CN202211223870.6A patent/CN115314512B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102025756A (en) * | 2009-09-09 | 2011-04-20 | 中兴通讯股份有限公司 | Distributed system and data synchronization method thereof |
| US8745264B1 (en) * | 2011-03-31 | 2014-06-03 | Amazon Technologies, Inc. | Random next iteration for data update management |
| CN108833554A (en) * | 2018-06-22 | 2018-11-16 | 哈尔滨工业大学 | A kind of real-time highly reliable message distributing system and its method towards large scale network |
| CN110933134A (en) * | 2019-10-30 | 2020-03-27 | 中国科学院计算机网络信息中心 | Industrial internet-oriented edge computing server load balancing method and system |
| CN113377863A (en) * | 2020-03-10 | 2021-09-10 | 阿里巴巴集团控股有限公司 | Data synchronization method and device, electronic equipment and computer readable storage medium |
| CN112699091A (en) * | 2021-01-04 | 2021-04-23 | 国网电子商务有限公司 | Distributed file sharing system and method |
| CN113032412A (en) * | 2021-03-03 | 2021-06-25 | 北京沃东天骏信息技术有限公司 | Data synchronization method and device, electronic equipment and computer readable medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115314512A (en) | 2022-11-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11632441B2 (en) | Methods, systems, and devices for electronic note identifier allocation and electronic note generation | |
| CN104836821B (en) | A kind of network accelerating method based on router device, device and equipment | |
| KR102566892B1 (en) | Blockchain consensus method, device and system | |
| CN110019125B (en) | Database management method and device | |
| CN109831334B (en) | Network topology construction method and device and terminal equipment | |
| CN112860451A (en) | Multi-tenant data processing method and device based on SaaS | |
| CN111143382B (en) | Data processing method, system and computer readable storage medium | |
| CN101686145A (en) | Equipment capable of upgrading, upgrading method and system | |
| Shahsavari et al. | Performance modeling and analysis of the bitcoin inventory protocol | |
| CN101083557A (en) | SNMP based IP network cluster managerial approach | |
| CN112416969B (en) | Parallel task scheduling system in distributed database | |
| CN110727738B (en) | Global routing system based on data fragmentation, electronic equipment and storage medium | |
| CN111064626B (en) | Configuration updating method, device, server and readable storage medium | |
| CN114090388A (en) | Information acquisition method, server cluster, server and equipment | |
| JP2005518016A (en) | Method and apparatus for reconfiguring server system | |
| US10701027B2 (en) | Self-organizing distributed computation grid | |
| CN113254050A (en) | Micro front-end system | |
| CN115314512B (en) | Massive terminal data synchronization method and system | |
| CN113242317A (en) | Addressing route synchronization method and related device for alliance chain supervision system | |
| CN110290206B (en) | Distributed computing system and method for internet bar environment | |
| CN111343220B (en) | Repeater, distributed file transmission method, distributed file transmission system, medium and electronic equipment | |
| US11595471B1 (en) | Method and system for electing a master in a cloud based distributed system using a serverless framework | |
| CN114090687A (en) | Data synchronization method and device | |
| CN116095081A (en) | Event processing method and device based on block chain system, equipment and medium | |
| CN110661857B (en) | Data synchronization method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |