CN111831674A - Block chain node, system and digital data copy distribution method - Google Patents
Block chain node, system and digital data copy distribution method Download PDFInfo
- Publication number
- CN111831674A CN111831674A CN202010603460.9A CN202010603460A CN111831674A CN 111831674 A CN111831674 A CN 111831674A CN 202010603460 A CN202010603460 A CN 202010603460A CN 111831674 A CN111831674 A CN 111831674A
- Authority
- CN
- China
- Prior art keywords
- node
- copy
- nodes
- neighbor
- digital data
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 29
- 238000009826 distribution Methods 0.000 title claims abstract description 20
- 238000003860 storage Methods 0.000 claims abstract description 43
- 238000013500 data storage Methods 0.000 claims description 7
- 238000012545 processing Methods 0.000 claims description 7
- 238000012423 maintenance Methods 0.000 claims description 6
- 238000004891 communication Methods 0.000 description 12
- 238000010586 diagram Methods 0.000 description 10
- 238000004590 computer program Methods 0.000 description 8
- 230000008569 process Effects 0.000 description 6
- 230000006870 function Effects 0.000 description 4
- 230000002159 abnormal effect Effects 0.000 description 2
- 230000007547 defect Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000036541 health Effects 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/23—Updating
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/14—Error detection or correction of the data by redundancy in operation
- G06F11/1402—Saving, restoring, recovering or retrying
- G06F11/1446—Point-in-time backing up or restoration of persistent data
- G06F11/1448—Management of the data involved in backup or backup restore
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
Abstract
The invention provides a block chain node, a system and a digital data copy distribution method, belonging to the technical field of block chains, wherein any node acquires metadata of a neighbor node after receiving a request for storing digital data; selecting a preset number of neighbor nodes as replica nodes according to the acquired metadata of each neighbor node; sending a copy storage request to a neighbor node selected as a copy node, wherein the neighbor node responds to the copy storage request; the digital data copy is self-managed, self-scheduled and self-controlled by the nodes, so that the scheduling pressure of the nodes can be reduced, the performance requirement of the nodes is lowered, the operation cost is saved, and the storage of the digital data is distributed storage, thereby really conforming to the idea of block chaining to a center or multiple centers.
Description
Technical Field
The present disclosure relates to the field of blockchain technologies, and in particular, to a blockchain node, a system, and a digital data copy allocation method.
Background
The statements in this section merely provide background information related to the present disclosure and may not necessarily constitute prior art.
The block chain technology is gradually applied to various aspects of life such as entertainment, medical treatment, finance and the like, digital data formed after physical data such as film and television copyright, health files, financial reports and the like are electronized is rapidly expanded, and the demand for supporting digital data distributed storage is more and more urgent.
The inventor of the present disclosure finds that due to the limitations in block size, network communication, etc., most alliance-link platforms in the industry do not support on-link storage of digital data, but adopt a digital data storage mode under a link: (1) centralized storage, which stores digital data in a data center, has high centralized risk and is contrary to the block chain de-centering idea; (2) digital data are stored in a distributed mode, a uniform digital data copy scheduling component is deployed among all nodes, and digital data copies are distributed among a plurality of nodes based on a CFT algorithm, so that the centralization degree of data storage is relieved to a certain extent, but the mode determines a copy distribution process by a main node, still cannot completely accord with the idea of decentering, and has higher requirements on the performance of the nodes; and the nodes adopt a communication mode of Remote Procedure Call (RPC), which is insufficient in the aspects of stability, time-delay and the like of cross-local area network communication.
Disclosure of Invention
In order to solve the defects of the prior art, the disclosure provides a blockchain node, a system and a digital data copy distribution method, wherein the digital data copy is self-managed, self-scheduled and self-controlled by the node, so that the scheduling pressure of the node can be reduced, the performance requirement of the node can be reduced, the operation cost can be saved, and the storage of the digital data is distributed storage, thereby really conforming to the idea of removing a center or multiple centers from a blockchain.
In order to achieve the purpose, the following technical scheme is adopted in the disclosure:
a first aspect of the present disclosure provides a block link point.
A block link node at least comprises a digital data memory and a digital data copy controller;
a digital data store configured to: receiving a request for storing digital data, storing the digital data locally, updating information in the distributed hash table, and declaring that the node has the stored digital data;
a digital material copy controller configured to: receiving a request for storing digital data sent by a digital data storage, acquiring metadata of neighbor nodes, selecting a preset number of neighbor nodes as replica nodes, and sending the replica storage request to the neighbor nodes selected as the replica nodes.
As some possible implementations, the digital material copy controller includes at least a copy scheduler, a message queue, and a coroutine pool;
the digital material copy controller puts the received request into a message queue, and the copy dispatcher acquires the message to be processed from the message queue and acquires the coroutine from the coroutine pool for processing.
As some possible implementation manners, the replica scheduler selects a preset number of neighbor nodes as replica nodes according to at least available storage space, online probability, network state and geographic position of the neighbor nodes, and the replica scheduler sends a digital material request to the selected nodes to request the other side to store the digital material.
As some possible implementation modes, after each neighbor node responds to the storage request, the replica controller updates the DHT and declares the node information for storing the digital material.
As some possible implementation manners, the copy controller reschedules one neighbor node when waiting for the receiving neighbor node to return the information whether the copy can be stored exceeds a specific time limit.
As some possible implementations, the node further includes an available copy controller for performing available copy maintenance.
A second aspect of the present disclosure provides a blockchain system.
A blockchain system comprises a plurality of blockchain nodes according To the first aspect of the present disclosure, and each blockchain node communicates with another blockchain node in a P2P (Peer-To-Peer) manner.
As some possible implementation manners, after receiving the storage request, each selected replica node detects whether the storage space is sufficient, and sends information to the request sender, indicating whether the digital material can be stored.
A third aspect of the present disclosure provides a neighbor-based method for distributing multicenter digital material replicas.
A neighbor-based multi-center digital material copy distribution method comprises the following steps:
any node acquires metadata of a neighbor node after receiving a request for storing digital data;
selecting a preset number of neighbor nodes as replica nodes according to the acquired metadata of each neighbor node;
and sending a copy storage request to the neighbor node selected as the copy node, wherein the neighbor node responds to the copy storage request.
As some possible implementations, if the node storing the digital material copy fails, so that the number of available digital material copies is less than the preset threshold, a neighboring node is rescheduled to store the digital material copy.
As some possible implementations, the selected preset number of nodes are located at least in two different geographical areas as replica nodes.
Compared with the prior art, the beneficial effect of this disclosure is:
1. the block chain node, the system and the method have the advantages that the neighbor-based multi-center digital data copy distribution strategy is not that the digital data copy distribution is managed through a single center node, but the node is self-managed, so that the scheduling pressure of the node can be reduced, the performance requirement of the node is reduced, the operation cost is saved, and the storage of the digital data is distributed storage, so that the block chain node, the system and the method really conform to the idea that a block chain goes to the center or multiple centers.
2. The block chain node, the system and the method realize the monitoring of the copy number by the real-time communication between the neighbor nodes, and detect the abnormal real-time copy redistribution of the neighbor nodes, thereby ensuring the available copy number in the system and the high availability of digital data.
3. According to the block chain node, the system and the method, a digital data copy scheduling component does not need to be additionally arranged, and the digital data storage module is simultaneously used as a copy control module, so that the complexity of system arrangement and operation and maintenance is reduced, and the operation and maintenance cost is saved.
4. The block chain node, the system and the method disclosed by the disclosure have the advantages that the real-time communication among the neighbor nodes is realized, the P2P asynchronous message communication is adopted for the communication among the neighbor-based multi-center digital data copy distribution strategy nodes, and the expandability, the high fault tolerance and the like are realized.
Drawings
Fig. 1 is a schematic diagram of module division of a block chain node according to embodiment 1 of the present disclosure.
Fig. 2 is a schematic flowchart of a neighbor-based multi-center digital material copy distribution method according to embodiment 3 of the present disclosure.
Fig. 3 is a topological diagram of a neighbor-based multi-center digital material replica distribution method according to embodiment 3 of the present disclosure.
Detailed Description
It should be noted that the following detailed description is exemplary and is intended to provide further explanation of the disclosure. Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this disclosure belongs.
It is noted that the terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of example embodiments according to the present disclosure. As used herein, the singular forms "a", "an" and "the" are intended to include the plural forms as well, and it should be understood that when the terms "comprises" and/or "comprising" are used in this specification, they specify the presence of stated features, steps, operations, devices, components, and/or combinations thereof, unless the context clearly indicates otherwise.
The embodiments and features of the embodiments in the present application may be combined with each other without conflict.
Example 1:
as shown in fig. 1, embodiment 1 of the present disclosure provides a blockchain node, where the node is composed of a digital data storage and a digital data copy controller component.
The digital data memory is a concrete execution module for processing digital data copy distribution and is responsible for writing the digital data into the local storage and updating the DHT routing table.
The digital material copy controller comprises a scheduler, an available copy controller, a message queue, a protocol pool and other components, and is responsible for copy scheduling, available copy maintenance and the like of the digital material.
The process for the node to schedule copies of the digital material is as follows:
s1.1: digital data storage receives a request to store digital data
S1.2: the digital material storage stores the digital material locally, and updates the information in the DHT (Distributed HashTable) to declare that the node stores the digital material
S1.3: the digital data memory sends the request to the digital data copy controller, which puts the request into the message queue, the copy dispatcher gets the message to be processed from the message queue and gets the coroutine from the coroutine pool to process
S1.4: the copy scheduler selects X nodes as copy nodes according to the available storage space, on-line probability, network state, geographical position and other information of the neighbor nodes, sends digital data requests to the X nodes and requests the other side to store the digital data
S1.5: after X copy nodes receive the storage request, whether the storage space is sufficient is detected, and information is sent to the request sender to indicate whether the digital data can be stored
S1.6: the replica controller updates the DHT to declare node information storing the digital material
And if the copy controller waits for the receiving neighbor node to return the information whether the copy can be stored or not, the copy controller reschedules one copy node. The copy controller sends a request to each neighbor node at regular time, and if the copy controller monitors that a certain copy node goes down, one copy node is rescheduled to ensure that the number of available digital data copies is not less than a certain threshold value.
Example 2:
an embodiment 2 of the present disclosure provides a blockchain system, including the blockchain nodes described in embodiment 1, where a P2P (peer to peer) message communication mode is adopted among the nodes, which is an asynchronous decentralized communication mode, and implements peer-to-peer communication.
Example 3:
as shown in fig. 2, embodiment 3 of the present disclosure provides a neighbor-based multi-center digital material copy distribution method, including the following steps:
after receiving a request for storing digital data, a node M acquires metadata of neighbor nodes, the node M selects X nodes from the neighbor nodes as replica nodes according to factors such as distance in the metadata and available storage, then sends a replica storage request to the neighbor nodes selected as the replica nodes, and the neighbor nodes respond to the storage replica request.
If the node storing the copy of the digital material fails (e.g., communications are not smooth or down), such that the number of available copies of the digital material is less than a threshold value, M will schedule a new copy.
The topology of the neighbor-based multi-center digital data replica distribution network is shown in fig. 3, and based on the neighbor-based multi-center digital data replica distribution strategy, replica nodes include nodes that are close to the node M network and also include nodes that are geographically distant from the node M. The nodes close to the network of the node M are selected as the copy nodes of the digital data, so that the query efficiency of the digital data can be improved, and the copy nodes in different geographical areas can be selected to prevent the copy nodes of the digital data which are stored the same from going down at the same time and influencing the usability of the digital data due to natural disaster factors such as power failure.
In this embodiment, the neighboring nodes are distributed in two different geographical areas.
It may be understood that, in some other embodiments, the neighboring nodes may be allocated in three, four, five, or more geographic areas, and the distances to the neighboring nodes may be configured in a step-by-step manner, and those skilled in the art may set the distances according to specific situations, which is not described herein again.
It is to be understood that in other embodiments, if the sets of neighboring nodes of two nodes intersect, as shown in fig. 3 for node 6 and node 7, node 6 is selected by M node, node 7 is selected by N node, or node 7 is selected by M node, node 6 is selected by N node;
it can be understood that in some other embodiments, as long as the information such as the available storage space, the online probability, the network state, the geographic location, and the like in the intersection meets the requirement, the node in each intersection may be a neighbor node of other nodes, that is, each node may be a neighbor node of multiple nodes at the same time, and those skilled in the art may design according to specific situations, and details are not described here.
The above embodiments described in the present disclosure also have the following advantages:
(1) a multi-center digital data copy distribution strategy is provided, self-management copy distribution of storage nodes is realized, a single center node is not relied on, the performance requirement and the operation and maintenance cost of the facility configuration of the single center node are reduced, and the defect of centralization is overcome;
(2) real-time communication is carried out between the neighbor nodes, when the neighbor nodes are detected to be abnormal, the copies stored by the neighbor nodes are redistributed, and the number of usable copies of the system is ensured;
(3) and the copy scheduler selects X nodes as copy nodes according to the available storage space, online probability, network state, geographical position and other information of the neighbor nodes, so that the high efficiency and availability of copy storage are ensured.
As will be appreciated by one skilled in the art, embodiments of the present disclosure may be provided as a method, system, or computer program product. Accordingly, the present disclosure may take the form of a hardware embodiment, a software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present disclosure may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, optical storage, and the like) having computer-usable program code embodied therein.
The present disclosure is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the disclosure. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by a computer program, which can be stored in a computer-readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. The storage medium may be a magnetic disk, an optical disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), or the like.
The above description is only a preferred embodiment of the present disclosure and is not intended to limit the present disclosure, and various modifications and changes may be made to the present disclosure by those skilled in the art. Any modification, equivalent replacement, improvement and the like made within the spirit and principle of the present disclosure should be included in the protection scope of the present disclosure.
Claims (10)
1. A block link node at least comprises a digital data memory and a digital data copy controller;
a digital data store configured to: receiving a request for storing digital data, storing the digital data locally, updating information in the distributed hash table, and declaring that the node has the stored digital data;
a digital material copy controller configured to: receiving a request for storing digital data sent by a digital data storage, acquiring metadata of neighbor nodes, selecting a preset number of neighbor nodes as replica nodes, and sending the replica storage request to the neighbor nodes selected as the replica nodes.
2. The block chain node of claim 1, wherein the digital data copy controller comprises at least a copy scheduler, a message queue, and a protocol pool;
the digital material copy controller puts the received request into a message queue, and the copy dispatcher acquires the message to be processed from the message queue and acquires the coroutine from the coroutine pool for processing.
3. The blockchain node of claim 1, wherein the replica scheduler selects a preset number of neighbor nodes as replica nodes according to at least available storage space, online probability, network status and geographical location of the neighbor nodes, and the replica scheduler sends a request for digital material to the selected nodes requesting the other side to store the digital material.
4. The blockchain node of claim 1, wherein the replica controller updates the DHT to declare node information that stores the digital material when each neighboring node responds to the storage request.
5. A block chain node according to claim 1, wherein the replica controller reschedules a neighbor node while waiting for the information on whether the neighbor node returns a storable replica exceeds a specified time limit;
or, the node further comprises an available copy controller for performing available copy maintenance.
6. A blockchain system comprising a plurality of blockchain nodes according to any one of claims 1 to 5, wherein each blockchain node communicates with another blockchain node using P2P.
7. The blockchain system of claim 6, wherein each selected replica node, upon receiving a storage request, detects whether storage space is sufficient and sends a message to the sender of the request indicating whether digital material can be stored.
8. A neighbor-based multi-center digital material copy distribution method is characterized by comprising the following steps:
any node acquires metadata of a neighbor node after receiving a request for storing digital data;
selecting a preset number of neighbor nodes as replica nodes according to the acquired metadata of each neighbor node;
and sending a copy storage request to the neighbor node selected as the copy node, wherein the neighbor node responds to the copy storage request.
9. The neighbor-based multi-center digital material copy distribution method of claim 8, wherein if the node storing the digital material copy fails such that the number of available digital material copies is less than a predetermined threshold, one neighbor node is rescheduled for digital material copy storage.
10. The neighbor-based multicenter digital material replica distribution method of claim 8 wherein the selected predetermined number of nodes are located as replica nodes in at least two different geographic regions.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010603460.9A CN111831674A (en) | 2020-06-29 | 2020-06-29 | Block chain node, system and digital data copy distribution method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010603460.9A CN111831674A (en) | 2020-06-29 | 2020-06-29 | Block chain node, system and digital data copy distribution method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111831674A true CN111831674A (en) | 2020-10-27 |
Family
ID=72899053
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010603460.9A Pending CN111831674A (en) | 2020-06-29 | 2020-06-29 | Block chain node, system and digital data copy distribution method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111831674A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112380287A (en) * | 2020-11-13 | 2021-02-19 | 浙江数秦科技有限公司 | Distributed credible statement generation method, system, equipment and storage medium |
| CN115720238A (en) * | 2022-09-01 | 2023-02-28 | 西安电子科技大学 | Block chain request processing system and method supporting high concurrency |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101909068A (en) * | 2009-06-02 | 2010-12-08 | 华为技术有限公司 | Method, device and system for managing file copies |
| CN103139226A (en) * | 2011-11-23 | 2013-06-05 | 中国科学院声学研究所 | Copy storage system and method based on peer-to-peer (P2P) on-line information aggregation |
| CN105577776A (en) * | 2015-12-17 | 2016-05-11 | 上海爱数信息技术股份有限公司 | Distributed storage system and method based on data arbiter copy |
| CN108615195A (en) * | 2018-04-28 | 2018-10-02 | 腾讯科技（深圳）有限公司 | Transmission method and device, storage medium, the electronic device of resource transfers information |
| CN109189751A (en) * | 2018-09-18 | 2019-01-11 | 平安科技（深圳）有限公司 | Method of data synchronization and terminal device based on block chain |
| US10193978B2 (en) * | 2015-06-15 | 2019-01-29 | Chongqing Gktsingchip Industry Technology Co., Ltd. | Distributed network node operation system based on operation control unit |
| CN109740038A (en) * | 2019-01-02 | 2019-05-10 | 安徽芃睿科技有限公司 | Network data distributed parallel computing environment and method |
| CN110213224A (en) * | 2019-04-19 | 2019-09-06 | 北京清红微谷技术开发有限责任公司 | Data packet asynchronous forwarding method and system, data processing system and common recognition nodal terminal |
| CN111339043A (en) * | 2019-12-24 | 2020-06-26 | 广州中安同创科技有限公司 | Block chain fragment optimization method, system and storage medium |
-
2020
- 2020-06-29 CN CN202010603460.9A patent/CN111831674A/en active Pending
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101909068A (en) * | 2009-06-02 | 2010-12-08 | 华为技术有限公司 | Method, device and system for managing file copies |
| CN103139226A (en) * | 2011-11-23 | 2013-06-05 | 中国科学院声学研究所 | Copy storage system and method based on peer-to-peer (P2P) on-line information aggregation |
| US10193978B2 (en) * | 2015-06-15 | 2019-01-29 | Chongqing Gktsingchip Industry Technology Co., Ltd. | Distributed network node operation system based on operation control unit |
| CN105577776A (en) * | 2015-12-17 | 2016-05-11 | 上海爱数信息技术股份有限公司 | Distributed storage system and method based on data arbiter copy |
| CN108615195A (en) * | 2018-04-28 | 2018-10-02 | 腾讯科技（深圳）有限公司 | Transmission method and device, storage medium, the electronic device of resource transfers information |
| CN109189751A (en) * | 2018-09-18 | 2019-01-11 | 平安科技（深圳）有限公司 | Method of data synchronization and terminal device based on block chain |
| CN109740038A (en) * | 2019-01-02 | 2019-05-10 | 安徽芃睿科技有限公司 | Network data distributed parallel computing environment and method |
| CN110213224A (en) * | 2019-04-19 | 2019-09-06 | 北京清红微谷技术开发有限责任公司 | Data packet asynchronous forwarding method and system, data processing system and common recognition nodal terminal |
| CN111339043A (en) * | 2019-12-24 | 2020-06-26 | 广州中安同创科技有限公司 | Block chain fragment optimization method, system and storage medium |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112380287A (en) * | 2020-11-13 | 2021-02-19 | 浙江数秦科技有限公司 | Distributed credible statement generation method, system, equipment and storage medium |
| CN112380287B (en) * | 2020-11-13 | 2022-06-10 | 浙江数秦科技有限公司 | Distributed credible statement generation method, system, equipment and storage medium |
| CN115720238A (en) * | 2022-09-01 | 2023-02-28 | 西安电子科技大学 | Block chain request processing system and method supporting high concurrency |
| CN115720238B (en) * | 2022-09-01 | 2024-04-02 | 西安电子科技大学 | System and method for processing block chain request supporting high concurrency |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111831674A (en) | Block chain node, system and digital data copy distribution method | |
| CN105939389A (en) | Load balancing method and device | |
| CN107329820B (en) | Task processing method and device for cluster system | |
| CN111182067B (en) | Data writing method and device based on interplanetary file system IPFS | |
| CN101668046A (en) | Resource caching method, resource obtaining method, device and system thereof | |
| CN105159603A (en) | Repair method for distributed data storage system | |
| US11863636B2 (en) | Timer services | |
| CN103944974A (en) | Method for processing protocol messages, method for processing faults of controllers and related device | |
| CN112968969B (en) | Block chain system, message transmission method and device | |
| CN110912972A (en) | Service processing method, system, electronic equipment and readable storage medium | |
| CN101859139B (en) | Data sharing realizing method of distribution type control system and device thereof | |
| JP2007524325A (en) | Non-stop service system using voting and information updating and providing method in the system | |
| CN103164262B (en) | A kind of task management method and device | |
| WO2004040846A2 (en) | Method and apparatus for network management | |
| CN110661637A (en) | Distributed system member changing method and distributed system | |
| Yoichi et al. | Consistency preservation of replicas based on access frequency for content sharing in hybrid peer-to-peer networks | |
| CN108459926B (en) | Data remote backup method and device and computer readable medium | |
| WO2017031866A1 (en) | Service processing method and apparatus suitable for wireless capacity expansion | |
| CN111107103B (en) | Method, system and storage medium for maintaining performance of alliance chain | |
| CN101242251A (en) | Method and device for improving P2P overlapped network stability | |
| CN105893135B (en) | Distributed data processing method and data center | |
| CN115878729B (en) | Node block storage allocation optimization method and system based on alliance chain | |
| CN117041265A (en) | Edge computing installation package distribution method and system | |
| CN104468674B (en) | Data migration method and device | |
| CN112751890B (en) | Data transmission control 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 |