CN111131386A - Block chain network based on partitions and chain grouping method - Google Patents
Block chain network based on partitions and chain grouping method Download PDFInfo
- Publication number
- CN111131386A CN111131386A CN201911148318.3A CN201911148318A CN111131386A CN 111131386 A CN111131386 A CN 111131386A CN 201911148318 A CN201911148318 A CN 201911148318A CN 111131386 A CN111131386 A CN 111131386A
- Authority
- CN
- China
- Prior art keywords
- peer
- partition
- block
- coordination
- partitions
- 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
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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/04—Network management architectures or arrangements
-
- 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/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention provides a block chain network based on partitions and a chain grouping method, wherein the block chain network comprises a plurality of peer-to-peer computing nodes and one or more peer-to-peer coordination nodes, and the peer-to-peer coordination nodes divide all the peer-to-peer computing nodes into partitions in a grouping mode according to a preset allocation mechanism; each partition is allowed to adopt different independent parallel consensus algorithms, the limitation that the whole network can only use one consensus algorithm is avoided, the data storage adopts a block chain structure of a parallel chain, the transaction throughput of the network is improved, and the service requirements of different services are met.
Description
Technical Field
The invention relates to the technical field of block chains, in particular to a block chain network based on partitions and a chain grouping method.
Background
The block chain mainly has the functions of distributed data calculation and data storage; any information to be stored can be written into or read from the block chain; the flexible block chain network can realize that anyone can erect a server and join the block chain network to form a node.
The block chain technology developed by the bit currency bottom layer technology is also used for carrying out accounting on various bearing values and data states, and as time goes on and the network ecosystem expands, develops and is applied deeply, the number of users is more and more, the transaction times are more and more, and the transactions waiting for confirmation in the network are blocked.
All nodes in the bitcoin network calculate block hash, and only one node block is admitted in the final confirmation; this wastes computation and hash resources of many nodes; under the condition of the prior art, only a block calculated by one node is recorded in a chain within a certain time interval, which is the demand that high-efficiency calculation cannot be realized, and the realization of services in each field supported by the block chain is limited; therefore, when the block chain is applied, the problem that the block chain account book cannot be stored efficiently and with large throughput occurs.
Because of the size limitations of the blocks, a single block can only accommodate a very limited number of transactions; widely familiar and accustomed payment mechanisms in the market, the transaction processing speed can reach thousands of transactions per second; the problem of serious delay of mass transaction processing becomes a bottleneck of a block chain system, and the block chain industrialization is prevented; in addition, the whole network can only use one consensus algorithm, and the service requirement of the service is limited.
Disclosure of Invention
The invention aims to provide a block chain network based on partitions and a grouping method thereof, which aim to improve the transaction throughput of the network by changing a serial chain into a parallel chain, wherein the parallel chain is a scheme for solving the problem of better transaction throughput, and different consensus algorithms can be used according to different service requirements, so that the adaptability of the network is improved.
A partition-based blockchain network comprises a plurality of peer-to-peer computing nodes and one or more peer-to-peer coordination nodes, wherein the peer-to-peer coordination nodes divide all the peer-to-peer computing nodes into partitions in a small group mode through a preset allocation mechanism and uniformly control the partitions.
Further, the allocation mechanism includes random allocation or pre-made rule allocation.
Further, the random allocation mechanism comprises automatic allocation according to the factors of computing resources, data storage capacity and network performance indexes; the pre-established rule allocation mechanism comprises allocation according to a rule pre-established by service requirements or network operation.
A partition-based block chain grouping method comprises the following steps:
the peer-to-peer coordination node allocates all peer-to-peer computing nodes to partitions in a group mode according to a preset allocation mechanism;
after a certain peer-to-peer computing node in a partition calculates a partition block, broadcasting the partition block in the partition to which the peer-to-peer computing node belongs, verifying the block by the peer-to-peer computing node in the partition, and carrying out consensus voting on the block;
and after collecting the consensus voting result of each partition, the peer-to-peer coordination node forms a coordination block and broadcasts the coordination block to the peer-to-peer computing nodes of each partition, and the peer-to-peer computing nodes store the block which is the consensus of the partition and the coordination block broadcast by the peer-to-peer coordination node to form a parallel chain structure.
Furthermore, the peer-to-peer computing nodes of each partition calculate the blocks independently and in parallel, so that the whole blockchain network can generate more blocks within a specific time, and the throughput of the blockchain network is greatly improved.
Further, the various partitions are allowed to employ different consensus algorithms.
Further, the parallel chain structure comprises partition blocks and coordination blocks belonging to the partitions, the partition blocks are only stored in the belonging partitions, and the coordination blocks are stored in the respective partitions; in the same partition, the blocks have a logic sequence, and at most one partition block is arranged between every two coordination blocks; there is no logical ordering of partition blocks between different partitions.
Further, the allocation mechanism includes random allocation or pre-allocation.
Further, the random allocation mechanism comprises automatic allocation according to the factors of computing resources, data storage capacity and network performance indexes; the pre-established rule allocation mechanism comprises allocation according to a rule pre-established by service requirements or network operation.
The invention has the beneficial effects that: the method can solve the problem that the block chain account book cannot be stored efficiently and with large throughput; meanwhile, the problem of single consensus algorithm can be solved; the number of partitions is only required to be enlarged, and the accounting efficiency and the throughput are enlarged accordingly; different consensus algorithms can be used in the whole network to meet different service requirements and separately account the nodes of different service classes or different regions; so that the whole network can generate more blocks in a specific time.
When each peer-to-peer computing node is managed by using partitions, a plurality of blocks are recorded in a chain in the same time interval, so that the throughput of the whole network is greatly improved, and the wide application and development of a block chain network are accelerated; when the transaction amount is large, a plurality of partitions can be divided to calculate the blocks, so that the calculation power of each peer-to-peer calculation node is not wasted, and the transverse capacity expansion can be performed, so that the throughput of the whole network is increased in a multiplied way.
Drawings
FIG. 1 is a block chain network of the present invention;
FIG. 2 is a block chain set chain structure diagram according to the present invention.
Detailed Description
In order to more clearly understand the technical features, objects, and effects of the present invention, embodiments of the present invention will now be described with reference to the accompanying drawings.
A partition-based blockchain network comprises a plurality of peer computing nodes and one or more peer coordination nodes, wherein the peer coordination nodes are shown in FIG. 1, and divide all the peer computing nodes into partitions in a grouping mode according to preset allocation mechanisms through preset allocation mechanisms such as random allocation or preset rule allocation.
The random allocation mechanism performs automatic allocation according to the comprehensive consideration of factors such as computing resources, data storage capacity, network performance indexes and the like; the prefabricated rule distribution mechanism distributes according to the business requirement or the rule preset by the network operation; for example, the service prefabrication rule comprises that partitions are divided according to service classes or regions, and separate accounting of nodes in different service classes or different regions is realized.
In this embodiment, the peer-to-peer coordination nodes in the block chain network cooperate with the peer-to-peer computing nodes of each partition to form a block chain structure of a parallel chain, at most one block in each group of the parallel chain at the same time obtains consensus confirmation, and the blocks of the same group have a logical sequence; a plurality of groups can obtain consensus confirmation at the same time, and blocks among the groups have no logic sequence; it is obviously different from the serial chain that only one block at most obtains the consensus confirmation at the same time, and the blocks of the whole chain have the logic precedence order.
The coordination method comprises a block chain network based on partitions and a chain grouping method, and specifically comprises the following steps:
the peer-to-peer coordination node allocates all peer-to-peer computing nodes to partitions in a group mode according to a preset allocation mechanism;
after a certain peer-to-peer computing node in a partition calculates a block, namely a partition block, the partition block is broadcasted in the partition to which the peer-to-peer computing node belongs, the block is verified by the peer-to-peer computing node in the partition, and consensus voting is carried out on the block;
after collecting the consensus voting result of each partition, the peer-to-peer coordination node forms a special block, namely a coordination block, and broadcasts the special block to the peer-to-peer computing nodes of each partition, and the peer-to-peer computing nodes store the block which is the consensus of the partition and the coordination block broadcast by the peer-to-peer coordination node to form a parallel chain structure. Since the peer-to-peer computing nodes of each partition are independent and parallel to compute the blocks, the whole blockchain network can generate more blocks within a specific time, thereby greatly improving the throughput of the blockchain network.
Since the partitions can independently achieve consensus, the data storage and the service data storage of each partition have no logical relationship, thereby allowing the partitions to adopt different consensus algorithms.
As shown in fig. 2, the block chain structure of the parallel chain includes partition blocks and coordination blocks belonging to partitions, the partition blocks are stored in the belonging partitions only, and the coordination blocks are stored in each partition; in the same partition, the blocks have a logic sequence, and at most one partition block is arranged between every two coordination blocks; there is no logical ordering of partition blocks between different partitions.
In the scheme, in a block chain network comprising a plurality of peer-to-peer computing nodes and one or more peer-to-peer coordinating nodes, all the peer-to-peer computing nodes are divided into partitions in a grouping mode according to a preset allocation mechanism by the peer-to-peer coordinating nodes through a preset allocation mechanism so as to form a block chain structure of a parallel chain, and further the transaction throughput of the network is improved.
The foregoing shows and describes the general principles and broad features of the present invention and advantages thereof. It will be understood by those skilled in the art that the present invention is not limited to the embodiments described above, which are described in the specification and illustrated only to illustrate the principle of the present invention, but that various changes and modifications may be made therein without departing from the spirit and scope of the present invention, which fall within the scope of the invention as claimed. The scope of the invention is defined by the appended claims.
Claims (9)
1. A partition-based blockchain network comprises a plurality of peer-to-peer computing nodes and is characterized by further comprising one or more peer-to-peer coordination nodes, wherein the peer-to-peer coordination nodes divide all the peer-to-peer computing nodes into partitions in a small group mode through a preset allocation mechanism and uniformly control the partitions.
2. A partition-based blockchain network according to claim 1, wherein said allocation mechanism comprises random allocation or pre-made regular allocation.
3. A partition-based blockchain network in accordance with claim 2 wherein said random allocation mechanism includes automatic allocation based on factors including computational resources, data storage, network performance indicators; the pre-established rule allocation mechanism comprises allocation according to a rule pre-established by service requirements or network operation.
4. A partition-based block chain grouping method is characterized by comprising the following steps:
the peer-to-peer coordination node allocates all peer-to-peer computing nodes to partitions in a group mode according to a preset allocation mechanism;
after a certain peer-to-peer computing node in a partition calculates a partition block, broadcasting the partition block in the partition to which the peer-to-peer computing node belongs, verifying the block by the peer-to-peer computing node in the partition, and carrying out consensus voting on the block;
and after collecting the consensus voting result of each partition, the peer-to-peer coordination node forms a coordination block and broadcasts the coordination block to the peer-to-peer computing nodes of each partition, and the peer-to-peer computing nodes store the block which is the consensus of the partition and the coordination block broadcast by the peer-to-peer coordination node to form a parallel chain structure.
5. The partition-based blockchain grouping method of claim 4, wherein the peer nodes of each partition compute the computation of the blocks independently and in parallel, so that the whole blockchain network can generate more blocks in a specific time, thereby greatly improving the throughput of the blockchain network.
6. A partition-based blockchain grouping method according to claim 4, wherein each partition is allowed to adopt a different consensus algorithm.
7. The partition-based block chain grouping method according to claim 4, wherein the parallel chain structure comprises partition blocks belonging to partitions and a coordination block, the partition blocks are stored in the belonging partitions only, and the coordination block is stored in each partition; in the same partition, the blocks have a logic sequence, and at most one partition block is arranged between every two coordination blocks; there is no logical ordering of partition blocks between different partitions.
8. A partition-based blockchain grouping method according to claim 4, wherein said allocation mechanism comprises random allocation or pre-allocation.
9. The partition-based blockchain grouping method of claim 8, wherein the random allocation mechanism includes automatic allocation according to factors of computational resources, data storage capacity, network performance indicators; the pre-established rule allocation mechanism comprises allocation according to a rule pre-established by service requirements or network operation.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911148318.3A CN111131386A (en) | 2019-11-21 | 2019-11-21 | Block chain network based on partitions and chain grouping method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911148318.3A CN111131386A (en) | 2019-11-21 | 2019-11-21 | Block chain network based on partitions and chain grouping method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111131386A true CN111131386A (en) | 2020-05-08 |
Family
ID=70496136
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911148318.3A Pending CN111131386A (en) | 2019-11-21 | 2019-11-21 | Block chain network based on partitions and chain grouping method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111131386A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111835572A (en) * | 2020-07-23 | 2020-10-27 | 上海优扬新媒信息技术有限公司 | Communication method and device of block chain network |
| CN113487432A (en) * | 2021-07-05 | 2021-10-08 | 普华云创科技(北京)有限公司 | Block chain based segmented storage and consensus method and device |
| CN114764709A (en) * | 2021-01-14 | 2022-07-19 | 富士通株式会社 | Information processing apparatus, information processing method, and computer program |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107766540A (en) * | 2017-10-31 | 2018-03-06 | 上海分布信息科技有限公司 | A kind of block chain network of subregion and its method for realizing partitioned storage |
| CN108647947A (en) * | 2018-05-18 | 2018-10-12 | 江苏安纳泰克能源服务有限公司 | Electricity transaction matching process based on block chain technology |
| CN108881488A (en) * | 2018-08-01 | 2018-11-23 | 夸克链科技（深圳）有限公司 | It is a kind of based on the block chain transaction processing method and network that divide domain |
| CN109309708A (en) * | 2018-08-16 | 2019-02-05 | 泰链（厦门）科技有限公司 | The quickening method, medium, device and block catenary system of block speed of production in block catenary system |
| CN109995850A (en) * | 2019-03-05 | 2019-07-09 | 深圳前海微众银行股份有限公司 | A kind of transaction processing method of block catenary system and block catenary system |
-
2019
- 2019-11-21 CN CN201911148318.3A patent/CN111131386A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107766540A (en) * | 2017-10-31 | 2018-03-06 | 上海分布信息科技有限公司 | A kind of block chain network of subregion and its method for realizing partitioned storage |
| CN108647947A (en) * | 2018-05-18 | 2018-10-12 | 江苏安纳泰克能源服务有限公司 | Electricity transaction matching process based on block chain technology |
| CN108881488A (en) * | 2018-08-01 | 2018-11-23 | 夸克链科技（深圳）有限公司 | It is a kind of based on the block chain transaction processing method and network that divide domain |
| CN109309708A (en) * | 2018-08-16 | 2019-02-05 | 泰链（厦门）科技有限公司 | The quickening method, medium, device and block catenary system of block speed of production in block catenary system |
| CN109995850A (en) * | 2019-03-05 | 2019-07-09 | 深圳前海微众银行股份有限公司 | A kind of transaction processing method of block catenary system and block catenary system |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111835572A (en) * | 2020-07-23 | 2020-10-27 | 上海优扬新媒信息技术有限公司 | Communication method and device of block chain network |
| CN111835572B (en) * | 2020-07-23 | 2023-01-13 | 度小满科技(北京)有限公司 | Communication method and device of block chain network |
| CN114764709A (en) * | 2021-01-14 | 2022-07-19 | 富士通株式会社 | Information processing apparatus, information processing method, and computer program |
| CN113487432A (en) * | 2021-07-05 | 2021-10-08 | 普华云创科技(北京)有限公司 | Block chain based segmented storage and consensus method and device |
| CN113487432B (en) * | 2021-07-05 | 2024-09-27 | 山西数字政府建设运营有限公司 | Segmented storage and consensus method and device based on block chain |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111131386A (en) | Block chain network based on partitions and chain grouping method | |
| CN110868434B (en) | Block chain consensus method and system of multilayer fragment architecture | |
| CN113973021B (en) | Network transmission optimization device and method for image block chain | |
| CN113784373B (en) | Combined optimization method and system for time delay and frequency spectrum occupation in cloud edge cooperative network | |
| Xin et al. | On scaling and accelerating decentralized private blockchains | |
| CN113626875B (en) | Knowledge graph file storage method for block chain fragment enabling | |
| CN111047439A (en) | Transaction processing method based on block chain | |
| CN113032370A (en) | Design method of partitioned block chain system | |
| Tessier et al. | Topology-aware data aggregation for intensive I/O on large-scale supercomputers | |
| CN113553375A (en) | Partitioned storage device and method for schema block chain | |
| Anderson et al. | Service rate region of content access from erasure coded storage | |
| ElGindy et al. | RMB-a reconfigurable multiple bus network | |
| CN101207552A (en) | Method for scheduling of data block and network node | |
| CN110990413B (en) | Block chain data storage device and rapid storage method thereof | |
| CN116668135A (en) | Block chain consensus method, system and device participated in by mobile edge equipment | |
| CN109391684A (en) | A kind of block chain accounting nodes selection method and system being associated with related chain | |
| Zhu et al. | Mobile coded caching in small cell networks: Algorithm design and performance analysis | |
| CN101917334B (en) | Transmission network generation method by network coding of part of nodes | |
| CN111680996B (en) | Block chain-based life payment data processing method, device and system | |
| CN110704693A (en) | Distributed graph calculation system and distributed graph calculation method | |
| CN115134387B (en) | Adjustable load metering data linking method, device, equipment and medium | |
| Pinar et al. | Interprocessor communication with limited memory | |
| CN114020207B (en) | Tree structure data insertion method for distributed storage network | |
| Lv et al. | A greedy strategy of data dissemination over multi-channel in mobile computing environments | |
| Yang et al. | Adaptive wormhole routing in k-ary n-cubes |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20200508 |
|
| RJ01 | Rejection of invention patent application after publication |