CN110417883B - Design method of point-to-point network structure applied to block chain - Google Patents
Design method of point-to-point network structure applied to block chain Download PDFInfo
- Publication number
- CN110417883B CN110417883B CN201910666377.3A CN201910666377A CN110417883B CN 110417883 B CN110417883 B CN 110417883B CN 201910666377 A CN201910666377 A CN 201910666377A CN 110417883 B CN110417883 B CN 110417883B
- Authority
- CN
- China
- Prior art keywords
- node
- network
- super
- nodes
- super node
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/06—Management of faults, events, alarms or notifications
- H04L41/0654—Management of faults, events, alarms or notifications using network fault recovery
- H04L41/0663—Performing the actions predefined by failover planning, e.g. switching to standby network elements
-
- 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
- H04L67/1042—Peer-to-peer [P2P] networks using topology management mechanisms
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Business, Economics & Management (AREA)
- General Business, Economics & Management (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a design method of a point-to-point network structure applied to a block chain, which relates to a three-layer network structure, namely a lower application layer network structure, a middle data layer network structure and an upper service layer network structure. The upper layer adopts a self-adaptive Chord structure, and the super nodes are organized into a self-adaptive distributed hash table; the data layer adopts a binary tree structure, and the backup nodes which backup the super nodes adopt actions to maintain the data and functions of the super nodes along with the change of the super nodes; the organization structure of the common nodes of the lower-layer network adopts a Napster model, a group is formed by using a server taking a super node for receiving node information as a center, and the common nodes can be connected with the nodes in the network according to the routing information of the nodes, so that data can be obtained. Based on the design method of the network structure, the network topology structure can be updated in real time, so that the stability of the network topology structure of the nodes is ensured, and the communication efficiency among the nodes is effectively improved.
Description
Technical Field
The invention belongs to the technical field of block chains and point-to-point, and particularly relates to a design method of a three-layer self-adaptive point-to-point network structure applied to a block chain.
Technical Field
The blockchain is a technology integrating key technologies such as a consensus algorithm, an intelligent contract, a distributed account book and an asymmetric encryption algorithm, and has the characteristics of decentralization, rule application trust removal, security protection monopoly removal and the like. There are many nodes on the blockchain, which are network or server members or systems that store data, that can issue, receive, and validate messages. The method can be divided into common nodes, backup nodes and super nodes according to function division, wherein the common nodes can perform block synchronization and can broadcast transactions but can not perform accounting, the backup nodes have the same function as the common nodes and also have the function of maintaining backup of the super nodes, the super nodes have the attributes and operations of the common nodes and have the functions of management and organization as actual executors of an upper network, forwarding of the upper network and the lower network needs to pass through the super nodes, and the super nodes contain all functions of the common nodes. A large number of transactions are conducted on the blockchain, and efficient communication between nodes ensures that transactions are achieved quickly. One of the key issues that is currently focused on by scholars is a method of enabling more efficient communication between nodes on a blockchain.
P2P technology is known to be the most widely used communication technology in block chaining. The P2P technology enables decentralization of communication between block link points. The topology of the blockchain network may change due to the change of the nodes, and in the case of a large number of nodes, the communication efficiency of the entire network may gradually decrease due to the frequent change of the nodes. In recent years, many scholars propose a plurality of methods for adapting a P2P network structure based on the P2P technology, and the blockchain technology of P2P of an adaptive two-layer network realizes the problem of node diversity, but the problem of node diversity in a network complex blockchain is still not solved.
A single model applied to a P2P network presents a number of problems. For example, DHT is a model (including several network structures of CAN, Chord, Tapestry, and peestry) applied to P2P network system, and this model does not need to maintain information of the whole network, and only stores network information of its neighboring nodes in the nodes, so that fewer routes CAN effectively respond to the request of the target node, but the DHT model does not consider actual physical topology, which results in time consuming query, where the Chord model adopts a one-dimensional ring topology, and both the key and the node are represented by m-bit identifiers, and the range is 0-2m-1, called Key value. The Napster architecture uses a centralized server, and thus this network architecture is too centralized. In the BinaryTree model, nodes are completely organized into a complete binary tree structure. The distributed P2P form addresses the attack-resistance problem, but lacks fast search and scalability. Hybrid P2P formal bindingThe advantages of both centralized and distributed forms of P2P have been the focus of recent research.
Disclosure of Invention
Based on the above technical background, in order to solve the problem of communication failure caused by the change of a complex network topology structure under the condition of variable nodes, the invention proposes to design a design method of a point-to-point network structure applied to a block chain, so that the data exchange on the block chain is achieved orderly, the request time of the nodes is shortened, and the accuracy of information exchange is ensured, thereby being an effective method for improving the communication efficiency between the nodes of the block chain.
The method is a design method applied to the change of a block chain self-adaptive network structure, is a coping method applied to the condition that the network topology of common nodes, backup nodes and super nodes changes, namely, a three-layer network structure self-adaptive mode is designed by utilizing the block chain P2P technology, and the structure specifically comprises the following network layers:
(1) a self-adaptive DHT (distributed hash table) network organized by super nodes is an upper service layer network, and because the state of the super nodes can change at any time and the logical topological structure of the network needs to be maintained and adjusted in real time, the query table needs to be continuously updated to keep the correctness of the system structure;
(2) the backup node reserves the attribute of the super node and the backup of the operation data, adopts a network structure of a binary tree model to form an intermediate data layer network and form a backup node list, and when the super node receives excessive common node requests in a block chain scene, or the existing super node leaves the network, or the super node fails due to the loss of credit, the backup node is converted into the super node again;
(3) the common nodes form a cluster by taking the corresponding super nodes as servers to form a common node list, so that the super nodes can be conveniently searched and inquired, and a Napster model is adopted to form a lower-layer common node organization structure which is a lower-layer application layer network. The ordinary node only stores the routing information of the super node which receives the request, and can be connected to other nodes in the network by itself according to the routing information of other nodes to obtain the corresponding requested data.
Further, in a design method of a peer-to-peer network structure applied to a block chain, an upper layer network is described as management, organization and execution of a super node, and specific behaviors of the super node in an upper layer service layer of the structure (1) include:
1.1Key value query;
1.2 super node requests to join network;
1.3 super node requests to forward message;
1.4 super node requests to leave the network or super node fails.
Further, the Key value query behavior of the upper service layer super node includes the following steps:
1) the super node inquires a subsequent node with the Key value of ID;
2) and inquiring the precursor node with the Key value of ID by the super node.
Further, the method for requesting to join the network behavior by the super node of the upper service layer comprises the following steps:
1) initializing a lookup table by a newly added super node, then initializing a corresponding super node list, and allocating an m-bit Identifier (ID) by a consistent hash function;
2) searching a precursor node and a successor node which have super node IDs to be added and corresponding super node tables;
3) initializing a lookup table (fingerTable) according to the routing information of the successor node to meet finger [ i]If the condition is that the subsequent node ID is the next 2 of the super node ID of the joining networki-1ID of the direct successor node of the distance;
4) updating the predecessor node to be a successor of the newly added super node, and updating the successor node to be a predecessor of the newly added super node;
5) the newly added super node sends a message to inform other nodes to update respective query tables;
6) and the newly added super node notifies the super node to move the responsible object data index to the newly added super node, and deletes the data indexes subsequently to complete the addition of the super node.
Further, the upper service layer super node requests to forward the message, comprising the following steps:
1) updating local query table according to the message sent by the sender, deleting the node routes which can not be connected in the table, and enabling each stored route to be close to the node ID 2i-1ID of the direct successor node of the distance;
2) the super node searches a node of which the first item is preceded by the query Key value according to the query table;
3) and if the node searched by the super node can be connected, forwarding the message.
Further, in the step 3) of requesting to forward the message, if the supernode finds that the ground node is not connectable, the supernode determines whether the node is the last item of the lookup table, if so, the supernode replaces the item by the local node route, otherwise, the supernode replaces the item by the previous item of the lookup table, and then the supernode searches for the node of which the first item is followed by the Key value according to the lookup table to forward the message.
Further, the super node of the upper service layer requests to leave the network or the super node fails, comprising the following steps:
1) the super node informs the subsequent leaving message, informs the predecessor node to change the route of the successor node to be the route of the successor node of the super node, and informs the successor node to change the route of the predecessor node to be the route of the predecessor node of the super node;
2) transferring the keyword information of the super node to a subsequent node of the super node, and informing the node sending the request to access the subsequent node;
3) the super node informs all the super nodes to update the query table, replaces the backup nodes including the super node with the successors thereof, and completes the normal network exit operation of the super node.
Further, a method for designing a peer-to-peer network structure applied to a block chain, where an intermediate data layer network is described as data backup contents of a backup node for a super node, and the data backup contents include a key value index cached by the super node, a super node ID, a successor node of the super node in an upper layer network, and a backup corresponding to a common node, such as routing information of the common node in the group, where a specific behavior of the backup node in the intermediate data layer of the structure (2) includes:
2.1 monitoring the super nodes in real time;
2.2 when the super node fails, repairing the network structure;
2.3 when the super node leaves or fails, the super node is converted into a super node;
2.4 selecting a new backup node.
Further, the specific behavior of the intermediate data layer backup node is that, along with the dynamic joining and exiting of the node, in the binary tree network structure, the node is divided into a leaf node having only a parent node and no child node, a branch node having both a child node and a parent node, and a root node having only a child node and no parent node according to the position in the network. In the intermediate data layer binary tree network, common nodes are selected as leaf nodes, backup nodes are branch nodes and serve as contacts of the common nodes and super nodes, and the super nodes serve as root nodes. Specifically, it can be described that when the super node changes, the look-up table of the backup node is updated; when the backup node finds that the super node is not connectable, namely the super node fails, the failed super node is replaced or backup information is added to the super node, a message is sent to inform a predecessor node of the super node in an upper layer network to update a successor of the predecessor node to be a self route, the successor node is updated to the predecessor of the successor node to be the self route, and a common node with the largest capacity is selected as a pre-selection backup node. The failure replacement mechanism is automatically started by the backup node and is transparent to the users of the lower application layer. The method comprises the following concrete implementation steps:
1) all nodes are organized into a complete binary tree structure;
2) and performing large top heap according to the node attribute and the function, and selecting the super node and the backup node.
Further, a method for designing a peer-to-peer network structure applied to a block chain is provided, where a lower application layer network faces users, and includes data publishing, data querying, joining and leaving of the users, and the (3) behaviors of the common nodes of the application layer include:
3.1 data publishing and querying;
3.2 the common node requests to join the network;
3.3 the ordinary node requests to leave the network;
further, the lower application layer adopts a Napster structure, and the data release of the common node comprises the following steps:
1) calculating a Key value of data to be issued by the common node through a consistent hash function, and generating a data index;
2) sending a Key value and an index to a super node receiving a message by a common node, and recording an identification ID of the super node;
3) and the super node receiving the message sends the index to the subsequent node storing the Key value and stores the index.
Further, in the lower application layer network, the data query of the common node includes the following steps:
1) calculating a Key value of data to be inquired by the common node through a consistent hash function, and generating a data index;
2) the common node sends a request for inquiring Key value as Key to the super node receiving the message;
3) the super node receiving the message forwards the message to a subsequent node of the Key value;
4) the subsequent node returns an index corresponding to the query Key value;
5) and the common node requesting for query is connected with the data storage node by itself.
Further, in the lower application layer network, the request of the common node to join the network includes the following steps:
1) the ordinary node sends a network joining request, the super node receives the network joining request, and the ordinary node stores the received identifier of the super node;
2) and the super node informs the ordinary node of joining the network and stores the identifier of the ordinary node.
Further, the ordinary node sends a request for joining the network, when the ordinary node received by the super node reaches the upper limit, the super node notifies the backup node which backs up the super node to convert into a new super node and receives the ordinary node, and then notifies the remaining ordinary nodes to join the new super node, thereby completing joining the network.
Further, in the lower application layer network, the request of the ordinary node to leave the network includes the following steps:
1) the ordinary node sends a network leaving request to the super node which receives the network joining;
2) and the super node receives the request and updates the query table.
Further, after the ordinary node requests to leave the network, when the number of the ordinary nodes received by the super node reaches the lower limit, the super node notifies a new super node converted from the backup node correspondingly, the ordinary node ID of the new super node is transferred to the super node, and the ordinary nodes are notified to join the super node of which the number of the nodes reaches the lower limit, and the backup node is recovered.
Based on the technical scheme, the invention provides a design method of a point-to-point network structure applied to a block chain, which designs a three-layer topological structure which is adaptive to the change of three nodes, namely a common node, a backup node and a super node and causes the change of the network topological structure, each layer adopts different network topological models to separate the communication of the three nodes respectively, an intermediate binary tree structure network combines an upper layer and a lower layer, and the advantages of the centralized P2P technology and the distributed P2P technology are combined, so that the point-to-point communication is more ordered, and the communication efficiency of the network nodes is improved.
Drawings
FIG. 1 is a block diagram of a three-tier adaptive P2P network applied to blockchains;
FIG. 2 is a flow chart of the implementation of Key value query in an upper service layer;
FIG. 3 is a flow chart of an implementation of an upper service layer super node requesting to join a network;
FIG. 4 is a flow chart of an implementation of an upper service layer super node requesting to forward a message;
FIG. 5 is a flow chart of an upper service layer super node requesting to leave the network or a super node failing;
FIG. 6 is a schematic diagram of an intermediate binary tree implementing node operations;
FIG. 7 is a flowchart illustrating operations of issuing data of a common node in a lower application layer;
FIG. 8 is a flowchart illustrating the operation of a lower application layer common node requesting query;
FIG. 9 is a flowchart illustrating the operation of a lower application layer normal node requesting to join a network;
fig. 10 is a flowchart of the operation of a lower application layer normal node requesting to leave the network.
Detailed Description
In order to clearly explain the implementation of the present invention, the following detailed description of the invention is provided in conjunction with the accompanying drawings.
1. Fig. 1 is a block diagram of a three-layer adaptive P2P network applied to a blockchain. The invention provides a three-layer model aiming at the problem that the network topological structure changes caused by the change of network nodes and the problem of inaccuracy of the technology based on network positioning models such as DHT and the like, wherein each layer adopts a network topological structure suitable for each layer of nodes, thereby ensuring the effective communication of each node. The method is a design method applied to the change of a block chain self-adaptive network structure, is a coping method applied to the condition that the network topology of common nodes, backup nodes and super nodes changes, namely, a three-layer network structure self-adaptive mode is designed by utilizing a block chain P2P technology and combining three network models, and specifically comprises the following network layers:
(1) the super node selects a Chord model in a self-adaptive DHT (distributed hash table) DHT network as an upper service layer network model;
(2) the backup node reserves the backup of the super node, adopts a binary tree structure to form an intermediate data layer network, and selects a binary tree structure model;
(3) the common nodes form a cluster by taking the corresponding super nodes as servers, and a Napster model is adopted to form a lower-layer common node organization structure which is a lower-layer application layer network.
2. Fig. 2, fig. 3, fig. 4, and fig. 5 are diagrams showing implementation steps of behaviors of a super node in an upper service layer. The upper network description is management, organization and execution of the super node, and the specific behaviors include: key value query, super node request to join the network, super node request to forward messages, super node request to leave the network, or super node failure. Fig. 2 is a flowchart of implementing Key value query of a super node in an upper service layer, which includes the following nodes and predecessor nodes respectively querying Key value ID for the super node:
fig. 3 is a flowchart illustrating an implementation of a super node in an upper service layer requesting to join a network, and the implementation steps are as follows:
step 1: initializing a lookup table by a newly added super node, then initializing a corresponding super node list, and allocating an m-bit Identifier (ID) by a consistent hash function;
step 2: searching a precursor node and a successor node which have super node IDs to be added and corresponding super node tables;
and 3, step 3: initializing a lookup table (fingerTable) according to the routing information of the successor node to meet finger [ i]If the condition is that the subsequent node ID is the next 2 of the super node ID of the joining networki-1The ID of the direct successor node of the distance, otherwise, the successor route of the predecessor node is recorded;
and 4, step 4: updating the predecessor node to be a successor of the newly added super node, and updating the successor node to be a predecessor of the newly added super node;
and 5, step 5: the newly added super node sends a message to inform other nodes to update respective query tables;
and 6, step 6: and the newly added super node notifies the super node to move the responsible object data index to the newly added super node, and deletes the data indexes subsequently to complete the addition of the super node.
Fig. 4 is a flowchart of an implementation of a supernode requesting to forward a message in an upper service layer, which includes the following steps:
step 1: updating local look-up table according to the message sent by the sender, and deleting the section which can not be connected in the tablePoint routing and making each saved route close to 2 after the node IDi-1ID of the direct successor node of the distance;
step 2: the super node searches a node of which the first item is preceded by the query Key value according to the query table;
and 3, step 3: if the nodes searched by the super nodes can be connected, message forwarding is carried out, otherwise, the super nodes search that the nodes can not be connected, the super nodes judge whether the nodes are the last item of the query table, if yes, the nodes are replaced by the nodes, if not, the nodes are replaced by the previous items of the query table, and then the super nodes search the nodes which are followed by the Key value of the first item according to the query table to carry out message forwarding.
Fig. 5 is a flow taken by a super node when the super node in an upper service layer requests to leave a network or the super node fails, and the specific implementation steps are as follows:
step 1: the super node informs the successor node of the leaving message, informs the predecessor node of changing the route of the successor node into the route of the successor node of the super node, and informs the successor node of changing the route of the predecessor node into the route of the predecessor node of the super node;
step 2: transferring the keyword information of the super node to a subsequent node of the super node, and informing other nodes of accessing the subsequent node;
and 3, step 3: and the super node informs all the nodes to update the query table, replaces all the accounting nodes including the super node with the successors of the accounting nodes, and completes the normal network exit operation of the super node.
3. Fig. 6 is a schematic diagram of an intermediate binary tree implementing backup node operation. The specific behavior of the intermediate data layer backup node is that a common node is selected as a leaf node, a backup node is a branch node and serves as a contact of the common node and a super node, and the super node is a root node in a binary tree network structure along with the dynamic addition and withdrawal of the node. Specifically, it can be described that when the super node changes, the look-up table of the backup node is updated; when the backup node finds that the super node is not connectable, namely the super node fails, the failed super node is replaced or backup information is added to the super node, a message is sent to inform a predecessor node of the super node in an upper layer network to update a successor of the predecessor node to be a self route, the successor node is updated to the predecessor of the successor node to be the self route, and a common node with the largest capacity is selected as a pre-selection accounting node.
4. Fig. 7, 8, 9 and 10 are implementation steps of behaviors of a common node of a lower application layer. Including data publishing, data querying, joining and leaving the network for the user.
Fig. 7 is an operation flowchart of issuing data of a common node in a lower application layer, which includes the following specific steps:
step 1: calculating a Key value of data to be issued by the common node through a consistent hash function, and generating a data index;
step 2: sending a Key value and an index to a super node receiving a message by a common node, and recording an identification ID of the super node;
and 3, step 3: and the super node receiving the message sends the index to the subsequent node storing the Key value and stores the index.
Fig. 8 is a flowchart of an operation of requesting query by a common node in a lower application layer, which includes the following steps:
step 1: calculating a Key value of data to be inquired by the common node through a consistent hash function, and generating a data index;
step 2: the common node sends a request for inquiring Key value as Key to the super node receiving the message;
and 3, step 3: the super node receiving the message forwards the message to a subsequent node of the Key value;
and 4, step 4: the subsequent node returns an index corresponding to the query Key value;
and 5, step 5: and the common node requesting for query is connected with the data storage node by itself.
Fig. 9 is an operation flowchart of a lower application layer common node requesting to join a network, which includes the specific implementation steps that the common node sends a request for joining the network, the request is received by a super node, the common node stores the received identifier of the super node, and then the super node notifies the common node to join the network and stores the identifier of the common node. The super node notifies the backup node which backs up the super node to convert into a new super node to receive the identifier of the common node, and then notifies the remaining common nodes to join the new super node to complete the joining of the network.
Fig. 10 is an operation flowchart of a lower application layer ordinary node requesting to leave the network, in a lower layer network structure, in order to implement that the ordinary node leaves the network, the ordinary node may send a network leaving request to a super node receiving the request to join the network, and when the super node receives the request, the super node updates the lookup table. After the common node requests to leave the network, the super node notifies a corresponding new super node when the number of the common nodes received by the super node reaches the lower limit, transfers the common node ID of the new super node to the super node and notifies the common nodes to join the super node of which the number of the nodes reaches the lower limit, and restores the backup node.
The embodiments described above are presented to enable a person having ordinary skill in the art to make and use the invention. It will be readily apparent to those skilled in the art that various modifications to the above-described embodiments may be made, and the generic principles defined herein may be applied to other embodiments without the use of inventive faculty. Therefore, the present invention is not limited to the above embodiments, and those skilled in the art should make improvements and modifications to the present invention based on the disclosure of the present invention within the protection scope of the present invention.
Claims (7)
1. The invention relates to a design method of a point-to-point network structure applied to a block chain, which is characterized in that the design method is a design method applied to the change of a block chain self-adaptive network structure, is a corresponding method applied to the situation that the network topology of a common node, a backup node and a super node changes, namely, a three-layer network structure self-adaptive mode is designed by utilizing a block chain point-to-point technology, and specifically comprises the following network layers:
(1) a self-adaptive DHT network organized by super nodes is an upper service layer network, a Chord model structure is adopted, the super nodes of the upper service layer network keep the correctness of a system structure by continuously updating a query table, and the logical topological structure of the network is maintained and adjusted in real time;
(2) the backup node reserves the backup of the super node, adopts a binary tree structure to form an intermediate data layer network, forms a backup node list, and is converted into the super node again when the super node receives excessive common node requests in a block chain scene, or the existing super node leaves the network, or the super node fails due to the credit loss behavior;
(3) the common nodes form a cluster by taking corresponding super nodes as servers to form a common node list, a Napster model is adopted to form a lower-layer common node organization structure, the lower-layer application layer network adopts a Napster structure, the lower-layer application layer network stores the routing information of the super nodes receiving the requests through the common nodes, and the routing information of other nodes can be automatically connected to other nodes in the network to obtain corresponding requested data.
2. The method as claimed in claim 1, wherein the specific behavior of the (1) upper service layer super node comprises:
1.1Key value query;
1.2 super node requests to join network;
1.3 super node requests to forward message;
1.4 super node requests to leave the network or super node fails.
3. The method for designing a peer-to-peer network structure applied to a blockchain according to claim 1, wherein the specific behavior of the (2) data layer backup node comprises:
2.1 monitoring the super nodes in real time;
2.2 when the super node fails, repairing the network structure;
2.3 when the super node leaves or fails, the super node is converted into a super node;
2.4 selecting a new backup node.
4. The method for designing a point-to-point network structure applied to a blockchain according to claim 1, wherein the (3) specific behaviors of the application layer common node include:
3.1 data publishing and querying;
3.2 the common node requests to join the network;
3.3 the ordinary node requests to leave the network.
5. The method for designing a point-to-point network structure applied to a block chain according to claim 2, wherein the Key value query content of the upper service layer super node comprises a successor node and a predecessor node, which query Key values are IDs; when the super node of the upper service layer requests to join the network, only the query table of the super node is synchronously updated, and the corresponding successor node and the successor node list are updated; before the super node of the upper service layer requests to forward the message, the local query table is updated according to the sender, and the node routes which cannot be connected in the query table are removed, so that each saved route is gradually close to the node ID back 2i-1The subsequent node ensures the query efficiency of the upper network; and the super node of the upper service layer only updates the query table of the super node when the super node requests to leave the network or the super node fails, and correspondingly updates the subsequent node and the previous node list.
6. The method of claim 3, wherein the backup node backing up the necessary information of the super node comprises: the Key value index of the super node, the super node ID, the routing information of the front node and the back node related to the super node, and the routing information of the common node.
7. The method according to claim 4, wherein the ordinary nodes send requests to obtain routing information of the super nodes that receive the processing requests when joining the network, and the routing information is set as a server route for joining the network; the common node failure does not affect the topological structure of the whole network, so that the common node failure is not processed; and when the common node leaves the network, the common node sends a leaving request to the super node which receives the processing, and at the moment, the super node changes the query table, so that the system efficiency is improved.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910666377.3A CN110417883B (en) | 2019-07-23 | 2019-07-23 | Design method of point-to-point network structure applied to block chain |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910666377.3A CN110417883B (en) | 2019-07-23 | 2019-07-23 | Design method of point-to-point network structure applied to block chain |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110417883A CN110417883A (en) | 2019-11-05 |
| CN110417883B true CN110417883B (en) | 2021-09-24 |
Family
ID=68362608
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910666377.3A Active CN110417883B (en) | 2019-07-23 | 2019-07-23 | Design method of point-to-point network structure applied to block chain |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110417883B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113132139A (en) * | 2019-12-31 | 2021-07-16 | 国民技术股份有限公司 | Block chain member management method and device, electronic equipment and computer readable medium |
| CN111431802B (en) * | 2020-03-25 | 2022-09-16 | 中国工商银行股份有限公司 | Block chain node communication optimization system and method |
| CN113709197B (en) * | 2020-05-21 | 2024-02-23 | 顺丰科技有限公司 | Alliance block chain organization system and block chain system |
| CN111600763A (en) * | 2020-06-03 | 2020-08-28 | 深圳市网心科技有限公司 | Method, system and related equipment for updating network access configuration information in DHT network |
| CN112465627B (en) * | 2020-11-26 | 2021-11-26 | 中科柏诚科技（北京）股份有限公司 | Financial loan auditing method and system based on block chain and machine learning |
| CN113395363B (en) * | 2021-08-18 | 2021-10-29 | 腾讯科技（深圳）有限公司 | Data processing method, device and equipment based on block chain and storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105976232A (en) * | 2016-06-24 | 2016-09-28 | 深圳前海微众银行股份有限公司 | Asset transaction method and device |
| CN108804229A (en) * | 2018-05-31 | 2018-11-13 | 胡晓东 | The block chain of a variety of digital assets is supported to dig mine method and relevant apparatus |
| CN109325854A (en) * | 2018-08-16 | 2019-02-12 | 北京京东尚科信息技术有限公司 | Block chain network, dispositions method and storage medium |
| CN109426952A (en) * | 2017-08-22 | 2019-03-05 | 汇链丰(北京)科技有限公司 | A kind of block chain framework |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20190108499A1 (en) * | 2017-10-09 | 2019-04-11 | Bing Liu | Decentralized Digital Token within an App Ecosystem |
| US11836721B2 (en) * | 2018-06-29 | 2023-12-05 | Intel Corporation | Protection of information in an information exchange |
-
2019
- 2019-07-23 CN CN201910666377.3A patent/CN110417883B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105976232A (en) * | 2016-06-24 | 2016-09-28 | 深圳前海微众银行股份有限公司 | Asset transaction method and device |
| CN109426952A (en) * | 2017-08-22 | 2019-03-05 | 汇链丰(北京)科技有限公司 | A kind of block chain framework |
| CN108804229A (en) * | 2018-05-31 | 2018-11-13 | 胡晓东 | The block chain of a variety of digital assets is supported to dig mine method and relevant apparatus |
| CN109325854A (en) * | 2018-08-16 | 2019-02-12 | 北京京东尚科信息技术有限公司 | Block chain network, dispositions method and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110417883A (en) | 2019-11-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110417883B (en) | Design method of point-to-point network structure applied to block chain | |
| US8166074B2 (en) | Index data structure for a peer-to-peer network | |
| US9015342B2 (en) | Two-level structured overlay design for cluster management in a peer-to-peer network | |
| CN109729129A (en) | Configuration modification method, storage cluster and the computer system of storage cluster | |
| CN110447021A (en) | For maintaining the methods, devices and systems of the consistency of metadata and data between data center | |
| US20060259525A1 (en) | Recovery method using extendible hashing-based cluster logs in shared-nothing spatial database cluster | |
| CN106161610A (en) | A kind of method and system of distributed storage | |
| CN100591028C (en) | Centralized service based distributed peer-to-peer network implementing method and system | |
| CN103150394A (en) | Distributed file system metadata management method facing to high-performance calculation | |
| CN101187931A (en) | Distribution type file system multi-file copy management method | |
| CN102866995B (en) | File access method for PPN (Peer-to-Peer Network), management method and distributed file system | |
| CN103905530A (en) | High-performance global load balance distributed database data routing method | |
| CN102891872B (en) | The method and system of data storage and query in a kind of peer-to-peer network | |
| CN104380289A (en) | Service-aware distributed hash table routing | |
| CN110990448B (en) | Distributed query method and device supporting fault tolerance | |
| CN109525678A (en) | Block chain network system and corresponding node device find method | |
| CN101344882B (en) | Data query method, insertion method and deletion method | |
| CN110336741A (en) | A kind of optimization method of the Kad algorithm suitable for P2P instant messaging | |
| CN107465706B (en) | Distributed data object storage device based on wireless communication network | |
| CN107547657A (en) | A kind of method, apparatus and storage medium numbered based on one point data in cloud storage system | |
| CN101360055B (en) | P2P network information resource location method having constant hop routing characteristic | |
| CN103118113B (en) | A kind of peer-to-peer network and network consultancy service method thereof | |
| Jin et al. | Supporting multiple-keyword search in a hybrid structured peer-to-peer network | |
| CN106657334B (en) | Improved data replication method based on Chord network model | |
| Liu et al. | A category overlay infrastructure for peer-to-peer content search |
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 |