CN115086350B - Block chain node data synchronization method, equipment and storage medium - Google Patents
Block chain node data synchronization method, equipment and storage medium Download PDFInfo
- Publication number
- CN115086350B CN115086350B CN202210665315.2A CN202210665315A CN115086350B CN 115086350 B CN115086350 B CN 115086350B CN 202210665315 A CN202210665315 A CN 202210665315A CN 115086350 B CN115086350 B CN 115086350B
- Authority
- CN
- China
- Prior art keywords
- node
- synchronous
- nodes
- block
- task
- 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
- 238000000034 method Methods 0.000 title claims abstract description 31
- 230000001360 synchronised effect Effects 0.000 claims description 59
- 238000004590 computer program Methods 0.000 claims description 8
- 230000007246 mechanism Effects 0.000 abstract description 7
- 238000010586 diagram Methods 0.000 description 6
- 238000001514 detection method Methods 0.000 description 5
- 238000004891 communication Methods 0.000 description 4
- 230000006870 function Effects 0.000 description 4
- 239000012634 fragment Substances 0.000 description 3
- 230000005540 biological transmission Effects 0.000 description 2
- 230000004044 response Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
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
- 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
Abstract
The invention belongs to the technical field of computers, and particularly relates to a block chain link point data synchronization method, equipment and a storage medium, wherein the block chain link point data synchronization method provided by the invention is used for synchronously acquiring data from a traditional node, converting the block node synchronization into the active mode of enabling a connected node to actively compete for acquiring and providing block sending rights, and changing the passive provision into the active mode on a mechanism to provide data in a robbery mode; the mechanism can enable the nodes with strong data processing capacity to provide more services, does not need excessive other complicated strategies to detect that the network environment of a certain node is better, and then selects the nodes to download requests, so that the efficiency of data synchronization is effectively improved.
Description
Technical Field
The invention belongs to the technical field of computers, and particularly relates to a block link point data synchronization method, equipment and a storage medium.
Background
After the new blockchain node is started, the data is empty, and the blockdata needs to be acquired from other nodes for data synchronization, so that an independent but same data account book is maintained. The re-networking of the nodes after the nodes are closed requires re-acquisition of their blockchain data. The existing synchronous downloading scheme of the blockchain data generally selects some nodes randomly, distributes related downloading requests to the nodes in batches, and further acquires the blockdata from a plurality of nodes. Sometimes, some nodes with limited bandwidth or unstable bandwidth can compromise the downloading efficiency, and then the network environment of the detection node needs to be omitted by detection, so that the node for data synchronization is preferentially selected, however, the network environment detection of the node is usually very tedious, and the data synchronization efficiency is actually reduced by phase change.
Disclosure of Invention
In order to solve the above problems, the present invention provides a method, apparatus and storage medium for synchronizing data of a blockchain node, which aims to enable the node to download data more efficiently.
The invention adopts the following technical scheme:
in a first aspect, the present invention provides a block link point data synchronization method, the method comprising the steps of:
s1, starting a first node and accessing to a blockchain network;
s2, the first node sends a height query request to a first number of second nodes to acquire the block heights of the corresponding second nodes, acquires the block heights stored by the first node, and compares the block heights of the first node with the block heights of the acquired adjacent nodes; the second node is an adjacent node of the first node;
s3, if the height of the first node is behind, calculating the maximum difference between the height of the first node and the block height of the queried second node to obtain a synchronous height interval, wherein the first node divides the synchronous height interval into a second number of synchronous tasks according to a preset first height interval and sends the second number of synchronous tasks to all the second nodes;
s4, the second node receives the second number of synchronous tasks, determines a third number of synchronous tasks to feed back according to the self condition, and feeds back the synchronous request of the selected third number of synchronous tasks to the first node;
s5, the first node receives all the synchronous requests from all the second nodes, and determines corresponding second nodes for each synchronous task according to the time sequence of receiving the synchronous requests;
and S6, the first node sends a block data synchronizing signal of a height section corresponding to each synchronizing task to the second node corresponding to each synchronizing task, and the second node receiving the synchronizing signal sends corresponding block data to the first node.
Preferably, after step S6, the method further comprises:
and S7, after the first time interval, the first node judges whether the synchronous task which does not receive the synchronous request exists or not, and if so, the synchronous task which does not receive the synchronous request is resent to all the second nodes.
Preferably, after step S6, the method further comprises:
s8, after the second time interval, the first node judges whether a synchronous task which does not complete data synchronization exists or not, if yes, a second node corresponding to the synchronous task which does not complete data synchronization is recorded and is recorded as a timeout node, and the synchronous task which does not complete data synchronization is resent to the second node which is the timeout node.
In a second aspect, a computer device is provided that includes one or more processors;
a memory for storing one or more programs,
the one or more programs, when executed by the one or more processors, cause the one or more processors to perform the method as described in the first aspect above.
In a third aspect, there is provided a storage medium storing a computer program which, when executed by a processor, implements a method as described in the first aspect above.
The block chain link point data synchronization method provided by the invention has the beneficial effects that the block nodes are synchronously acquired from a certain node in the traditional request, the connected nodes are changed into active, free competition is carried out to acquire and provide the block sending right, and the passive provision is changed into active in mechanism, so that the data is provided in a single mode; the mechanism can enable the nodes with strong data processing capacity to provide more services, does not need excessive other complicated strategies to detect that the network environment of a certain node is better, and then selects the nodes to download requests, so that the efficiency of data synchronization is effectively improved.
Drawings
Fig. 1 is a flowchart of a block link point data synchronization method according to an embodiment of the present invention.
Fig. 2 is a schematic structural diagram of a computer device according to an embodiment of the present invention.
Detailed Description
The invention is described in further detail below with reference to specific examples and figures of the specification. Those of ordinary skill in the art will be able to implement the invention based on these descriptions. In addition, the embodiments of the present invention referred to in the following description are typically only some, but not all, embodiments of the present invention. Therefore, all other embodiments, which can be made by one of ordinary skill in the art without undue burden, are intended to be within the scope of the present invention, based on the embodiments of the present invention. It should be noted that, in the case of no conflict, the embodiments and features in the embodiments may be combined with each other. The methods outlined in the examples of the present invention are all those known to those skilled in the art unless specifically stated otherwise.
Fig. 1 is a flowchart of a block link point data synchronization method according to an embodiment of the present invention.
The embodiment provides a block link point data synchronization method, as shown in fig. 1, comprising the following steps:
s1, starting a first node and accessing to a blockchain network;
s2, the first node sends a height query request to a first number of second nodes to acquire the block heights of the corresponding second nodes, acquires the block heights stored by the first node, and compares the block heights of the first node with the block heights of the acquired adjacent nodes; the second node is an adjacent node of the first node;
s3, if the height of the first node is behind, calculating the maximum difference between the height of the first node and the block height of the queried second node to obtain a synchronous height interval, wherein the first node divides the synchronous height interval into a second number of synchronous tasks according to a preset first height interval and sends the second number of synchronous tasks to all the second nodes;
s4, the second node receives the second number of synchronous tasks, determines a third number of synchronous tasks to feed back according to the self condition, and feeds back the synchronous request of the selected third number of synchronous tasks to the first node;
s5, the first node receives all the synchronous requests from all the second nodes, and determines corresponding second nodes for each synchronous task according to the time sequence of receiving the synchronous requests;
and S6, the first node sends a block data synchronizing signal of a height section corresponding to each synchronizing task to the second node corresponding to each synchronizing task, and the second node receiving the synchronizing signal sends corresponding block data to the first node.
Further, after step S6, the method further includes:
and S7, after the first time interval, the first node judges whether the synchronous task which does not receive the synchronous request exists or not, and if so, the synchronous task which does not receive the synchronous request is resent to all the second nodes.
Further, after step S6, the method further includes:
s8, after the second time interval, the first node judges whether a synchronous task which does not complete data synchronization exists or not, if yes, a second node corresponding to the synchronous task which does not complete data synchronization is recorded and is recorded as a timeout node, and the synchronous task which does not complete data synchronization is resent to the second node which is the timeout node.
After the block chain node is started, when the stored block data is behind, the block data is required to be acquired from the adjacent node connected with the block chain node to carry out data synchronization, in the prior art, the related data quantity is generally allocated to randomly select the node to carry out data synchronization, and then the required block data is acquired from a plurality of nodes, and in some optimized schemes, the network environment of the detection node is omitted by selecting the node before the node is selected, then a downloading request is sent to the node for determining the synchronous data, and in general, the node selection strategy is complex, and the data synchronization efficiency of the node is essentially reduced. According to the block chain node data synchronization method provided by the embodiment, block node synchronization is changed from a traditional mode of requesting a certain node to acquire data, connected nodes are changed into a mode of actively, free competition is carried out to acquire and provide block sending rights, passive provision is changed into an mode of actively in a mechanism, data is provided in a robbery mode, so that the nodes do not need to select the nodes through strategies, the robbery mode competes to acquire the sending rights of the block data according to the network service condition of the nodes, detection is carried out after a certain time is needed after the synchronous nodes are determined, and nodes which rob to the block sending rights but are slow in transmission are eliminated and compete again.
For example, the node A issues a block synchronization requirement, divides the requirement into X data fragments and sends the X data fragments to N nodes connected with the node A; after receiving the downloading requirement of the X data fragments issued by the A, the node B replies the task which can be met by the node A, wherein the task can be any one of 1-X tasks, the node B is set by the node B, after receiving the responses of the B and other nodes, the node A distributes the responses, the node which is fed back first obtains the authority, and other later nodes under the same task continue to switch other downloading tasks to carry out negotiation. The node which obtains the task permission can send the corresponding data to A at the moment; after the set time, a checks whether the current remaining task and the monitoring task are overtime or not while receiving the block data. A reissues the remaining tasks, as well as the timed-out tasks, to other nodes and excludes those timed-out nodes. For example, if the current block height of the node a is 1000 and the height synchronization state of other nodes is 2500, the task content is: down [1001-1100, 1101-1200,1201-1300,1301-1400,1401-1500],5 sync tasks, if N nodes are connected at the time, then N nodes are simultaneously issued, and each node can receive the 5 tasks. Node B feeds back three tasks of down [1201-1300,1301-1400,1401-1500] and down [1201-1300,1301-1400] is the earliest to feed back the task down [1401-1500] according to the assigned, then node B acquires the transmission right of the block of 1401-1500, if after a preset time, such as 15 minutes, the synchronous tasks of 1001-1100 and 1101-1200 have not been responded to by the node, then node a issues the synchronous tasks of 1001-1100 and 1101-1200 again, on the other hand, if after another preset time, such as 10 minutes, the data synchronization of the task down [1401-1500] has not been completed by the node B, node a also reissues the task down [1401-1500], and node B is excluded at the time of reissuing.
In the embodiment, the block nodes synchronously acquire data from a certain node in the traditional request, and the connected nodes are changed into active, free competition is carried out to acquire and provide the block sending right, and the mechanism is changed from passive provision to active, so that the data is provided in a robbery mode; the mechanism can enable the nodes with strong data processing capacity to provide more services, does not need excessive other complicated strategies to detect that the network environment of a certain node is better, and then selects the nodes to download requests, so that the efficiency of data synchronization is effectively improved.
Fig. 2 is a schematic structural diagram of an apparatus according to an embodiment of the present invention.
As shown in fig. 2, as another aspect, the present application also provides a computer apparatus 100 including one or more Central Processing Units (CPUs) 101 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM) 102 or a program loaded from a storage section 108 into a Random Access Memory (RAM) 103. In the RAM103, various programs and data required for the operation of the device 100 are also stored. The CPU101, ROM102, and RAM103 are connected to each other through a bus 104. An input/output (I/O) interface 105 is also connected to bus 104.
The following components are connected to the I/O interface 105: an input section 106 including a keyboard, a mouse, and the like; an output section 107 including a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker, and the like; a storage section 108 including a hard disk or the like; and a communication section 109 including a network interface card such as a LAN card, a modem, and the like. The communication section 109 is also connected to the I/O interface 105 as necessary via a network execution communication processing driver 110 such as the internet. A removable medium 111 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is installed on the drive 110 as needed, so that a computer program read out therefrom is installed into the storage section 108 as needed.
In particular, according to embodiments of the present disclosure, the method described in embodiment 1 above may be implemented as a computer software program. For example, embodiments disclosed herein include a computer program product comprising a computer program tangibly embodied on a machine-readable medium, the computer program comprising program code for performing the method described in any of the embodiments above. In such an embodiment, the computer program may be downloaded and installed from a network through the communication portion 109, and/or installed from the removable medium 111.
As yet another aspect, the present application also provides a computer-readable storage medium, which may be a computer-readable storage medium contained in the apparatus of the above-described embodiment; or may be a computer-readable storage medium, alone, that is not assembled into a device. The computer readable storage medium stores one or more programs for use by one or more processors in performing the methods described herein.
The flowcharts and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The units or modules described in the embodiments of the present application may be implemented by software, or may be implemented by hardware. The described units or modules may also be provided in a processor, for example, each of the units may be a software program provided in a computer or a mobile smart device, or may be separately configured hardware devices. Wherein the names of the units or modules do not in some cases constitute a limitation of the units or modules themselves.
The foregoing description is only of the preferred embodiments of the present application and is presented as a description of the principles of the technology being utilized. It will be appreciated by persons skilled in the art that the scope of the invention referred to in this application is not limited to the specific combinations of features described above, but also covers other embodiments which may be formed by any combination of features described above or their equivalents without departing from the spirit of the application. Such as the above-described features and technical features having similar functions (but not limited to) disclosed in the present application are replaced with each other.
Claims (5)
1. A method for synchronizing block link point data, the method comprising the steps of:
s1, starting a first node and accessing to a blockchain network;
s2, the first node sends a height query request to a first number of second nodes to acquire the block heights of the corresponding second nodes, acquires the block heights stored by the first node, and compares the block heights of the first node with the block heights of the acquired adjacent nodes; the second node is an adjacent node of the first node;
s3, if the height of the first node is behind, calculating the maximum difference between the height of the first node and the block height of the queried second node to obtain a synchronous height interval, wherein the first node divides the synchronous height interval into a second number of synchronous tasks according to a preset first height interval and sends the second number of synchronous tasks to all the second nodes;
s4, the second node receives the second number of synchronous tasks, determines a third number of synchronous tasks to feed back according to the self condition, and feeds back the synchronous request of the selected third number of synchronous tasks to the first node;
s5, the first node receives all the synchronous requests from all the second nodes, and determines corresponding second nodes for each synchronous task according to the time sequence of receiving the synchronous requests;
and S6, the first node sends a block data synchronizing signal of a height section corresponding to each synchronizing task to the second node corresponding to each synchronizing task, and the second node receiving the synchronizing signal sends corresponding block data to the first node.
2. The method for synchronizing block link point data according to claim 1, further comprising, after step S6:
and S7, after the first time interval, the first node judges whether the synchronous task which does not receive the synchronous request exists or not, and if so, the synchronous task which does not receive the synchronous request is resent to all the second nodes.
3. The method for synchronizing block link point data according to claim 1, further comprising, after step S6:
s8, after the second time interval, the first node judges whether a synchronous task which does not complete data synchronization exists, if yes, a second node corresponding to the synchronous task which does not complete data synchronization is recorded, the second node is recorded as a timeout node, and the synchronous task which does not complete data synchronization is resent to the second nodes except the timeout node.
4. A computer device, characterized by one or more processors;
a memory for storing one or more programs,
the one or more programs, when executed by the one or more processors, cause the one or more processors to perform the method of claim 1 or 2 or 3.
5. A storage medium storing a computer program, characterized in that the program, when executed by a processor, implements the method of claim 1 or 2 or 3.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210665315.2A CN115086350B (en) | 2022-06-13 | 2022-06-13 | Block chain node data synchronization method, equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210665315.2A CN115086350B (en) | 2022-06-13 | 2022-06-13 | Block chain node data synchronization method, equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115086350A CN115086350A (en) | 2022-09-20 |
| CN115086350B true CN115086350B (en) | 2024-01-19 |
Family
ID=83251192
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210665315.2A Active CN115086350B (en) | 2022-06-13 | 2022-06-13 | Block chain node data synchronization method, equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115086350B (en) |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111159289A (en) * | 2019-12-17 | 2020-05-15 | 深圳前海微众银行股份有限公司 | Method and device for synchronizing blocks |
| CN111241593A (en) * | 2020-01-02 | 2020-06-05 | 支付宝(杭州)信息技术有限公司 | Data synchronization method and device for block chain nodes |
| CN111294390A (en) * | 2020-01-17 | 2020-06-16 | 腾讯科技（深圳）有限公司 | Block data rapid synchronization method, device, equipment and storage medium |
| CN111444206A (en) * | 2020-03-24 | 2020-07-24 | 腾讯科技（深圳）有限公司 | Synchronous processing method, device, equipment and medium |
| CN111444204A (en) * | 2020-03-24 | 2020-07-24 | 腾讯科技（深圳）有限公司 | Synchronous processing method, device, equipment and medium |
| CN111444203A (en) * | 2020-03-24 | 2020-07-24 | 腾讯科技（深圳）有限公司 | Synchronous processing method, device, equipment and medium |
| CN111913833A (en) * | 2020-06-28 | 2020-11-10 | 华南理工大学 | Medical Internet of things transaction system based on block chain |
| CN112231414A (en) * | 2020-12-14 | 2021-01-15 | 腾讯科技（深圳）有限公司 | Data synchronization method and device of block chain system, readable medium and electronic equipment |
| CN114281542A (en) * | 2021-12-27 | 2022-04-05 | 深圳前海微众银行股份有限公司 | Block data synchronization method and device for block link points |
| CN114416883A (en) * | 2022-01-27 | 2022-04-29 | 成都质数斯达克科技有限公司 | Block chain light node data synchronization method, device, equipment and readable storage medium |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108924223B (en) * | 2018-06-29 | 2020-11-06 | 北京金山安全软件有限公司 | Node synchronization method and device for block chain |
| CN108848184B (en) * | 2018-06-29 | 2020-08-28 | 北京金山安全软件有限公司 | Block link point synchronization method and device based on trust mechanism |
| CN110798509B (en) * | 2019-07-15 | 2021-09-17 | 腾讯科技（深圳）有限公司 | Block data synchronization method, device, medium and electronic equipment |
| CN111935315B (en) * | 2020-09-25 | 2021-01-12 | 支付宝(杭州)信息技术有限公司 | Block synchronization method and device |
| US20220150169A1 (en) * | 2020-11-06 | 2022-05-12 | Electronics And Telecommunications Research Institute | Method and apparatus for blockchain based on information-centric networking |
-
2022
- 2022-06-13 CN CN202210665315.2A patent/CN115086350B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111159289A (en) * | 2019-12-17 | 2020-05-15 | 深圳前海微众银行股份有限公司 | Method and device for synchronizing blocks |
| CN111241593A (en) * | 2020-01-02 | 2020-06-05 | 支付宝(杭州)信息技术有限公司 | Data synchronization method and device for block chain nodes |
| CN111294390A (en) * | 2020-01-17 | 2020-06-16 | 腾讯科技（深圳）有限公司 | Block data rapid synchronization method, device, equipment and storage medium |
| CN111444206A (en) * | 2020-03-24 | 2020-07-24 | 腾讯科技（深圳）有限公司 | Synchronous processing method, device, equipment and medium |
| CN111444204A (en) * | 2020-03-24 | 2020-07-24 | 腾讯科技（深圳）有限公司 | Synchronous processing method, device, equipment and medium |
| CN111444203A (en) * | 2020-03-24 | 2020-07-24 | 腾讯科技（深圳）有限公司 | Synchronous processing method, device, equipment and medium |
| CN111913833A (en) * | 2020-06-28 | 2020-11-10 | 华南理工大学 | Medical Internet of things transaction system based on block chain |
| CN112231414A (en) * | 2020-12-14 | 2021-01-15 | 腾讯科技（深圳）有限公司 | Data synchronization method and device of block chain system, readable medium and electronic equipment |
| CN114281542A (en) * | 2021-12-27 | 2022-04-05 | 深圳前海微众银行股份有限公司 | Block data synchronization method and device for block link points |
| CN114416883A (en) * | 2022-01-27 | 2022-04-29 | 成都质数斯达克科技有限公司 | Block chain light node data synchronization method, device, equipment and readable storage medium |
Non-Patent Citations (1)
| Title |
|---|
| 区块链关键技术中的数据一致性研究;翟社平;李兆兆;段宏宇;高山;;计算机技术与发展(09);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115086350A (en) | 2022-09-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP0577780A1 (en) | Method for controlling the scheduling of multiple access to communication resources | |
| CN104243405A (en) | Request processing method, device and system | |
| CN105335231B (en) | server thread dynamic allocation method and device | |
| US20140153514A1 (en) | Method and device for optimizing access to a medium in a communication network | |
| US7392252B2 (en) | System, apparatus, and method for processing information, and computer program, and recording medium | |
| US5034881A (en) | Method of and system for controlling common bus | |
| CN113014666B (en) | Block chain protocol stack architecture method, system, equipment and storage medium | |
| CN103248656B (en) | Method for achieving data reading and writing as well as DSF (distributed file system) and client side | |
| CN110796545A (en) | Batch processing method, equipment and storage medium for blockchain transaction | |
| CN110417876B (en) | Session method, node server in distributed system and master control equipment | |
| CN115086350B (en) | Block chain node data synchronization method, equipment and storage medium | |
| US20030131111A1 (en) | Information processing system, information processing apparatus and access distributing method | |
| JPH03500237A (en) | multi-access communication system | |
| CN105338258B (en) | A kind of video transmission method and equipment | |
| US6009473A (en) | Using callbacks to effectively manage resources | |
| CN112929251A (en) | CAN-based slave station data refreshing method, device and system | |
| CN112491951A (en) | Request processing method, server and storage medium in peer-to-peer network | |
| CN114513535B (en) | Data transmission system, method, device and equipment | |
| CN116173495A (en) | Game progress distribution control method and device, electronic equipment and storage medium | |
| CN116166421A (en) | Resource scheduling method and equipment for distributed training task | |
| US8577281B2 (en) | Distribution system, distribution apparatus, terminal apparatus, and method which distribute a common control signal | |
| CN113805802A (en) | Method, server and storage medium for accessing current limit | |
| CN112307064A (en) | Data management system, method and storage medium | |
| CN109995577B (en) | Method, device and system for updating strategy | |
| JP2000047890A (en) | Distributed object managing system, its object selecting method and storage medium recording its processing program |
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 | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20231214 Address after: 518000 Qianhai Xiangbin Building 312-A137, No. 18 Zimao West Street, Nanshan Street, Qianhai Shenzhen Hong Kong Cooperation Zone, Shenzhen, Guangdong Province Applicant after: Yidu Kechuang (Shenzhen) Co.,Ltd. Address before: 310000 Room 702, 7th Floor, Building 6, East Software Park, No. 90 Wensan Road, Xihu District, Hangzhou City, Zhejiang Province Applicant before: HANGZHOU FUZAMEI TECHNOLOGY Co.,Ltd. |
|
| TA01 | Transfer of patent application right | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |