CN111447087B - Block chain configuration method for dynamic networking - Google Patents

Block chain configuration method for dynamic networking Download PDF

Info

Publication number
CN111447087B
CN111447087B CN202010207170.2A CN202010207170A CN111447087B CN 111447087 B CN111447087 B CN 111447087B CN 202010207170 A CN202010207170 A CN 202010207170A CN 111447087 B CN111447087 B CN 111447087B
Authority
CN
China
Prior art keywords
network
consensus
node
pbft
new
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
Application number
CN202010207170.2A
Other languages
Chinese (zh)
Other versions
CN111447087A (en
Inventor
吴飞鹏
卢小明
严挺
陈姝
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Peersafe Technology Co ltd
Original Assignee
Beijing Peersafe Technology Co ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Beijing Peersafe Technology Co ltd filed Critical Beijing Peersafe Technology Co ltd
Priority to CN202010207170.2A priority Critical patent/CN111447087B/en
Publication of CN111447087A publication Critical patent/CN111447087A/en
Application granted granted Critical
Publication of CN111447087B publication Critical patent/CN111447087B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • 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/08—Configuration management of networks or network elements
    • H04L41/0803—Configuration setting
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/08—Network architectures or network communication protocols for network security for authentication of entities
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/10—Network architectures or network communication protocols for network security for controlling access to devices or network resources
    • H04L63/101—Access control lists [ACL]
    • 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
    • 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/104—Peer-to-peer [P2P] networks
    • 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]
    • 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/2866—Architectures; Arrangements
    • H04L67/30—Profiles
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/50—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using hash chains, e.g. blockchains or hash trees
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management

Abstract

The invention relates to the field of block chains, and provides a block chain configuration method for dynamic networking, which comprises the following steps: s1, constructing a PBFT (provider function context) consensus network, wherein the PBFT consensus network consists of MN (MN) nodes; s2, constructing a basic network, wherein the basic network is composed of BN (boron nitride) nodes, participates in the consensus of all PBFT (basic packet transport function) consensus networks, and stores accounts of all the consensus networks; s3, a certain node MN in the dynamic PBFT consensus network X Applying for constructing a new PBFT consensus network to the basic network, confirming whether the node has authority through an intelligent contract by the basic network, and if the node is determined to be the certain node MN by the basic network X If qualified, each MN node in the original PBFT consensus network is MN-specific X The parameters specified in (1) construct a new dynamic network. The method of the invention enables the data to be visible only in a small range, and meanwhile, the initiator can freely designate which nodes in the block chain are the common participants.

Description

Block chain configuration method for dynamic networking
Technical Field
The present invention relates to a block chain technology, and more particularly, to a block chain configuration method for dynamic networking.
Background
Blockchain systems are increasingly used in engineering for a wide variety of engineering scenarios, such as: the data storage and source tracing well solves the problem of multi-party trust.
However, in practical use, data privacy is also required between the main parties sharing a blockchain network, and data is not intended to be completely disclosed on the network, or the main parties in common do not have sufficient resources and do not remain online for a long time. While acting as a leader of the data, it is desirable to be able to specify to itself that certain subjects become co-aware participants.
In all of the above situations, the existing single blockchain system cannot meet the requirements, and a new mechanism is needed to ensure the requirements of the user for "data security" and "node free assignment".
Disclosure of Invention
To solve the problems in the background art, the present invention provides a block chain configuration method for dynamic networking, comprising:
s1, constructing a PBFT (provider function context) consensus network, wherein the PBFT consensus network consists of MN (MN) nodes;
s2, constructing a basic network, wherein the basic network is formed by BN (boron nitride) nodes, participates in the consensus of all PBFT (boron doped fiber reinforced plastic) consensus networks, and stores accounts of all the consensus networks;
s3, PBFT recognizes a certain node MN in the network X Applying for constructing a new PBFT consensus network to the basic network, confirming whether the node has authority through an intelligent contract by the basic network, and if the node is confirmed to have authority, determining the MN of the certain node by the basic network X Qualified, each MN node in the original PBFT consensus network is MN-oriented X The parameters specified in (1) construct a new PBFT consensus network.
The invention provides a block chain architecture method, which enables data to be visible only in a small range, enables an initiator to freely designate which nodes are used as consensus participants, and has the following beneficial effects.
1. A plurality of private group accounts can be established based on one basic PBFT network, and the confidentiality of data is improved.
2. The participating nodes can designate the nodes outside the basic nodes as the consensus nodes, so that the cheating probability of the members of the account book is reduced.
3. Primary nodes in the PBFT network are fixed, the network consensus process is accelerated, and the transaction throughput is improved.
4. Except the basic network node, other nodes can be on line when consensus is needed, and resources are effectively saved.
5. The MN node dynamically establishes a consensus network, so that the mobile terminal can participate in the maintenance of the block chain account book.
Drawings
In order that the invention may be more readily understood, it will be described in more detail with reference to specific embodiments thereof that are illustrated in the accompanying drawings. These drawings depict only typical embodiments of the invention and are not therefore to be considered to limit the scope of the invention.
FIG. 1 is a flow chart of the method of the present invention.
Fig. 2 shows the data processing flow of a network node.
Fig. 3 is a schematic diagram of a network account book.
Fig. 4 is a flow chart of the basic network node response.
Fig. 5 is a protocol diagram of a practical byzantine fault-tolerant algorithm.
Detailed Description
Embodiments of the present invention will now be described with reference to the drawings, wherein like parts are designated by like reference numerals. The embodiments described below and the technical features of the embodiments may be combined with each other without conflict.
Figure 1 shows a flow chart of the method of the invention. As shown in fig. 1, the method of the present invention comprises steps S1-S3.
S1, constructing a dynamic PBFT consensus network, wherein the PBFT consensus network is composed of MN (member _ net) nodes, the member network only participates in the consensus of the PBFT consensus network where the member network is located, and only stores accounts of the consensus network related to the member network.
PBFT is a practical byzantine fault-tolerant algorithm to ensure system correctness (avoid forking) with fewer than one third of rogue nodes. Compared with the original BFT algorithm, the complexity of the algorithm is reduced from exponential level to polynomial level, so that the practical application of the BFT algorithm is possible. As shown in fig. 2, the intermediate consensus process needs to go through 3 stages from the initiation of a request to the final receipt of a reply:
1) pre-prepare stage: and primary receives the request, generates a new block and broadcasts the new block.
2) The prepare stage: after all replenicas receive the block, the block verification result is broadcasted while waiting for the reception of more than 2/3 of the node's broadcast.
3) And a commit stage: after receiving the broadcast of 2/3 nodes or overtime, the broadcast is sent again, and simultaneously the broadcast of the nodes beyond 2/3 is waited to be received again.
And S2, constructing a basic network, wherein the basic network is formed by BN (base _ net) nodes, participates in the consensus of all dynamic PBFT consensus networks, and simultaneously stores the accounts of all the consensus networks.
FIG. 2 shows a network request diagram for pbft. Fig. 3 shows a network ledger diagram.
S3, certain node MN in the dynamic PBFT consensus network X Applying for the basic network to construct a PBFT consensus network belonging to the basic network, confirming whether the node has the authority to establish a new PBFT network or not through an intelligent contract by the basic network, and if the basic network determines that the MN is established X If qualified, each node of the original PBFT consensus network can be as MN X The parameters specified in (1) construct a new dynamic network.
More specifically, the step S1 further includes a step S1-1: the MN node is configured to decide which nodes to accept the established consensus network. Additionally, the MN node is configured to: the consensus of MN nodes can only be one at the same time, namely, only one consensus process can be participated at the same time.
More specifically, step S2 includes steps S2-1 and S2-2.
S2-1, establishing an intelligent contract on the basis network. The intelligent contract realizes the following functions:
1) Setting a permission member list: and setting which users have the authority to dynamically establish a PBFT consensus network.
2) Delete rights Member List: and deleting the authorized user.
3) And (3) changing the local configuration file: the IP and address of each node on the new consensus network are specified.
4) Create a "consensus thread": and calling the main program to create a 'consensus thread' for the new consensus network so as to participate in the new consensus process.
S2-2, realizing multithreading consensus in a main program of the BN node, wherein the multithreading consensus refers to the following steps: in a main program, the common identification of different common identification networks is independently participated in a multithreading mode. One thread for each consensus network, and the consensus threads do not influence each other.
More specifically, step S3 includes S3-1-S3-6, which is described in detail below with reference to FIG. 4.
First node MN in an S3-1,MN (member _ net) network (i.e., a dynamic PBFT consensus network) 1 To the second node MN 2 A create request is initiated.
S3-2, second node MN 2 Making a decision to reply to the first node MN if it agrees 1 . If agreed, the first node MN 1 And becoming a newly-identified primary node.
First node MN 1 Receiving the second MN 2 If the second node MN replies 2 Disapproval, network creation terminates; if the second node MN 2 Agreeing to, the first node MN 1 And entering S3-3.
S3-3, first node MN 1 Third node BN to any node of BN (base _ net) network (i.e. base network) X Sending a request for creating a new consensus network, wherein the request carries a first node MN 1 And a second node MN 2 IP address, port.
S3-4, BN (base _ net) network starts own basic consensus and determines whether to allow the first node MN or not through a rule preset in an intelligent contract 1 A new consensus network is created. If the authority authentication fails, immediately returning to the first node MN 1 A failure result; if the authority authentication is passed, immediately returning to the first node MN 1 And (4) successful results.
Respective nodes of the S3-5, BN (base _ net) network are to be the first node MN 1 Primary node arranged as a consensus network and according to a first node MN 1 And configuring new BFT consensus network parameters by the transmitted IP address and the port. Optionally, the new PBFT consensus network comprises a first node MN 1 A second MN 2 And all nodes of the BN (base _ net) network. This is to configure all nodes of the BN (base _ net) network as a base, i.e. all new consensus networks must contain all nodes of these BN networks.
Meanwhile, MN (member _ net) of MN (member _ net) network 1 And receiving the result that the authority authentication is passed.
S3-6, first nodeMN 1 And locally monitoring whether the PBFT consensus network is successfully built. The criterion of success is that the second node MN can be received 2 And a P2P message sent from the BN (base _ net) network.
More specifically, the detailed flow of the processing of steps S3-4 and S3-5, i.e., BN nodes, is described with reference to fig. 5.
Step S3-4 includes:
s3-4-1, node BN X Node initialization, i.e. initialization of the underlying intelligent contract, is performed. The intelligent contract realizes the following functions: 1) Setting a permission member list: and setting which users have the authority to dynamically establish a PBFT consensus network. 2) Delete rights member list: and deleting the authorized user. 3) And (3) changing the local configuration file: the IP and address of each node on the new consensus network is specified. 4) Create a "consensus thread": and calling a main program to create a 'consensus thread' for the new consensus network so as to participate in the new consensus process.
S3-4-2, node BN X Receiving a first node MN 1 A request for establishing a network is sent, wherein the request comprises the network ID and the IP and the port of other nodes in the network. The network ID is the ID of the dynamic PBFT consensus network to be newly created. The ID is a unique random number that the MN1 node generates on its own initiative, and is generated by the supplicant.
S3-4-3, node BN X And judging whether the network already exists, and if so, directly returning success.
S3-4-4, node BN X Judging a first node MN 1 And if the rule of the intelligent contract is met, namely, the intelligent contract is in the white list, and if the rule is not in the white list, failure is directly returned.
S3-4-5, node BN X And changing local configuration to indicate IP and port required by the network ID.
S3-4-6, node BN X Setting a first node MN 1 Is the master node of the new consensus network.
And S3-4-7, starting P2P communication and returning to success.
The above-described embodiments are merely preferred embodiments of the present invention, and general changes and substitutions by those skilled in the art within the technical scope of the present invention are included in the protection scope of the present invention.

Claims (10)

1. A block chain allocation method for dynamic networking is characterized by comprising the following steps:
s1, constructing a PBFT (provider function context) consensus network, wherein the PBFT consensus network consists of MN (MN) nodes;
s2, constructing a basic network, wherein the basic network is composed of BN (boron nitride) nodes, participates in the consensus of all PBFT (basic packet transport function) consensus networks, and stores accounts of all the consensus networks;
s3, certain node MN in PBFT consensus network X To another node MN Y Initiating a create request, the other node MN Y Agreeing to the certain node MN X Becoming a new consensus master node; the certain node MN X Sending a construction request to any node BNx of the basic network to request the construction of a new PBFT consensus network, wherein the construction request comprises the certain node MN X IP address and port of; the basic network confirms the certain node MN through the intelligent contract X If the authority is established, if the basic network determines that the MN is in the certain node X If qualified, each MN node in the original PBFT consensus network is MN according to the certain node X The parameters specified in (1) construct a new PBFT consensus network.
2. The method according to claim 1, wherein the step S1 comprises:
s1-1: nodes in the PBFT consensus network are configured to decide which MN nodes to accept to form the consensus network.
3. The block chain configuration method for dynamic networking according to claim 2,
the MN node is configured to: the consensus of the MN nodes can only be one at a time.
4. The method according to claim 1, wherein the step S2 comprises:
s2-1, establishing an intelligent contract on a basic network, and based on the intelligent contract, realizing that: setting an authority member list, and determining members having authority to dynamically establish a PBFT consensus network; deleting the authority member list; changing a local configuration file, and specifying the IP and the address of each node on the new consensus network; and participating the new consensus network in the new consensus process.
5. The method according to claim 4, wherein the step S2 comprises:
and S2-2, each BN node independently participates in the consensus of different consensus networks.
6. The method according to claim 1, wherein the step S3 comprises:
1) The basic network starts the basic consensus of itself, and decides whether to allow the certain node MN or not through the preset rule in the intelligent contract X Creating a new PBFT consensus network;
2) Each node of the basic network connects the certain node MN X Set as the master node of the new PBFT consensus network and MN according to said certain node X And configuring new PBFT common network parameters by the transmitted IP address and port.
7. The block chain allocation method for dynamic networking according to claim 6,
in S3, the construction request further includes a network ID, where the network ID is an ID of a dynamic PBFT consensus network to be newly created, the network ID is a unique random number actively generated by the certain node MNx, and the arbitrary node BNx changes a local configuration, indicating an IP and a port required by the network ID.
8. The method for configuring a blockchain for dynamic networking according to claim 6, wherein the step S3 further comprises:
3) The certain node MN X Whether the new PBFT consensus network is built successfully or not is determined by monitoring P2P messages sent by the basic network.
9. The method for configuring blockchain in dynamic networking according to claim 6, wherein the step S3 further comprises:
node BN X Initializing nodes, establishing an intelligent contract, and realizing the following steps based on the intelligent contract: setting an authority member list, and determining members having authority to dynamically establish a PBFT consensus network; deleting the authority member list; changing a local configuration file, and specifying the IP and the address of each node on the new consensus network; and participating the new consensus network in the new consensus process.
10. The block chain configuration method for dynamic networking according to claim 5,
in S2-2, multithreading is realized in a main program in the BN node, the node independently participates in the consensus of different consensus networks in a multithreading mode, and each consensus network has one thread, so that the consensus threads do not influence each other.
CN202010207170.2A 2020-03-23 2020-03-23 Block chain configuration method for dynamic networking Active CN111447087B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010207170.2A CN111447087B (en) 2020-03-23 2020-03-23 Block chain configuration method for dynamic networking

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010207170.2A CN111447087B (en) 2020-03-23 2020-03-23 Block chain configuration method for dynamic networking

Publications (2)

Publication Number Publication Date
CN111447087A CN111447087A (en) 2020-07-24
CN111447087B true CN111447087B (en) 2023-04-07

Family

ID=71655658

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010207170.2A Active CN111447087B (en) 2020-03-23 2020-03-23 Block chain configuration method for dynamic networking

Country Status (1)

Country Link
CN (1) CN111447087B (en)

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109462587A (en) * 2018-11-09 2019-03-12 四川虹微技术有限公司 Block chain is layered common recognition method, block chain network system and block chain node

Family Cites Families (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2018073482A1 (en) * 2016-10-18 2018-04-26 Nokia Technologies Oy Accession control for network nodes
CN107171829B (en) * 2017-04-24 2019-12-24 杭州趣链科技有限公司 Dynamic node management method realized based on BFT consensus algorithm
CN107579848B (en) * 2017-08-30 2020-08-25 上海保险交易所股份有限公司 Method for dynamically changing consensus node in practical Byzantine fault-tolerant consensus mechanism
CN107807984A (en) * 2017-10-31 2018-03-16 上海分布信息科技有限公司 A kind of block chain network of subregion and its method for realizing subregion common recognition
CN108616596B (en) * 2018-05-09 2020-12-25 南京邮电大学 Block chain self-adaptive consensus method based on dynamic authorization and network environment perception
WO2019072294A2 (en) * 2018-12-13 2019-04-18 Alibaba Group Holding Limited Achieving consensus among network nodes in a distributed system
CN110727731B (en) * 2019-09-05 2021-12-21 创新先进技术有限公司 Method for adding node in block chain network and block chain system

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109462587A (en) * 2018-11-09 2019-03-12 四川虹微技术有限公司 Block chain is layered common recognition method, block chain network system and block chain node

Also Published As

Publication number Publication date
CN111447087A (en) 2020-07-24

Similar Documents

Publication Publication Date Title
CN111801925B (en) Block chain based system and method for propagating data in a network
EP1826979A1 (en) A system and method for establishing a secure group of entities in a computer network
AU2018422776B2 (en) Sybil-resistant identity generation
CN113067902B (en) Block chain message transmission method and device
KR20200081533A (en) Blockchain Consensus Method based Improved Dynamic Blind Voting for Internet of Things Environment
CN113824674B (en) Alliance chained data structure network management method, management node and medium
CN110971506B (en) Decentralized real-time cluster communication method, device, equipment and system
CN113746858A (en) Cross-chain communication method based on verifiable random function
CN114118447A (en) Novel federal learning system, method and device, computer equipment and storage medium
CN111798234A (en) Lightweight block chain system and construction method
CN112910663B (en) Method, device, equipment and storage medium for message broadcasting and terminal registration
CN111709053B (en) Operation method and operation device based on loose coupling transaction network
CN112202564B (en) Transaction transfer method and device, electronic equipment and readable storage medium
CN111447087B (en) Block chain configuration method for dynamic networking
CN115865705A (en) Multi-party federal learning system, method, equipment and medium based on supervision mechanism
US6771759B2 (en) Method and apparatus for managing parties to a multipoint conference using digital techniques
CN113612732B (en) Resource calling method and device and multiparty secure computing system
CN111541732B (en) Method for avoiding invalid occupation of connection resources by client in P2P network, computer readable storage medium and P2P network
KR100426314B1 (en) Multicast transmission system and method in capable of managing group membership information
CN111917683B (en) Secure interaction method, computing node, control center, cloud platform and storage medium
CN115426183B (en) Identity authentication method, device, equipment and computer readable medium
CN115914244A (en) Method for optimizing distributed account book interoperability
CN113905021A (en) Communication method and device for fixed telephone, electronic equipment and storage medium
CN114785801A (en) P2P engine for dynamically constructing distributed privacy network topology
CN113052610A (en) Data processing method and device based on block chain

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant