CN113709203A - Efficient communication method and system applied to block chain - Google Patents
Efficient communication method and system applied to block chain Download PDFInfo
- Publication number
- CN113709203A CN113709203A CN202110379184.7A CN202110379184A CN113709203A CN 113709203 A CN113709203 A CN 113709203A CN 202110379184 A CN202110379184 A CN 202110379184A CN 113709203 A CN113709203 A CN 113709203A
- Authority
- CN
- China
- Prior art keywords
- node
- nodes
- root
- tree
- balanced
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 27
- 238000004891 communication Methods 0.000 title claims abstract description 21
- 230000004044 response Effects 0.000 claims description 12
- 238000004590 computer program Methods 0.000 claims description 5
- 230000005540 biological transmission Effects 0.000 description 5
- 238000010586 diagram Methods 0.000 description 3
- 238000011160 research Methods 0.000 description 2
- 238000011161 development Methods 0.000 description 1
- 230000005284 excitation Effects 0.000 description 1
- 238000012795 verification Methods 0.000 description 1
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
- 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/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
-
- 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/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
- H04L67/1004—Server selection for load balancing
- H04L67/1019—Random or heuristic server selection
-
- 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)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a high-efficiency communication method and a system applied to a block chain.A node of a block chain network is divided into a plurality of node sets organized by a balanced tree structure, a balanced tree is randomly added into a new node, the new node is used as a leaf node of the balanced tree, and a newly generated balanced tree is broadcasted to other nodes in the balanced tree; the root node randomly generates a new balanced tree at regular time according to the balanced tree, and sends addresses of other root nodes in the block chain network stored by the original root node to the root node of the newly generated balanced tree, and because only a father node and a son node in the balanced tree directly communicate, the problem that too much bandwidth is occupied by the block chain through p2p communication is solved. The invention also limits the number of the nodes of the balance tree and prevents the block chain from tending to centralization.
Description
Technical Field
The present application relates to the field of blockchains, and more particularly to a method and system for communication in a blockchain P2P.
Background
The blockchain is a decentralized and non-falsifiable distributed book system, and due to the characteristics of decentralization, non-falsification and the like, the blockchain is more and more emphasized by people, many countries release blockchain development plans, and many colleges and scientific research institutions participate in the research of the blockchain. The architecture of the block chain comprises six layers, namely a representation layer, a transmission layer, a verification layer, an excitation layer, a contract layer and an application layer from bottom to top, wherein the transmission layer is responsible for node discovery, transaction broadcasting and the like of the block chain and is the basis of the block chain. One important attribute of a blockchain is decentralization, which is different from a client/server mode that people often contact in daily life, each node in the blockchain is Peer-to-Peer, a Peer-to-Peer network (P2P) is adopted by a blockchain transmission layer, each node is connected with other nodes in the network and is not connected through a server, decentralization is realized through a P2P communication mode, and the normal operation of the blockchain cannot be influenced even if the node fails and goes down.
In either the C/S or B/S mode, the client need only communicate with the server, but this increases communication costs compared to either C/S or B/S because the nodes in the P2P network need to communicate with multiple other nodes. If too many node connecting nodes in the block chain seriously affect the normal communication of the nodes, if too few connecting nodes reduce the robustness of the block chain, even affect the decentralization of the block chain, and by adopting p2p communication, the nodes can repeatedly receive the same message, namely redundant information, for many times, and how to improve the robustness of the block chain and reduce the transmission of the redundant information is an urgent technical problem to be solved by the block chain under the condition of reducing the number of connections or the number of communication times.
Disclosure of Invention
In order to solve the above problems, the present invention provides an efficient communication method and system applied in a block chain.
In one aspect, the present invention provides an efficient communication method applied in a block chain, which mainly includes the following steps:
step 1, a new node A broadcasts an address of the new node A to a block chain network, other nodes of the block chain network send response messages to the new node A after receiving the address broadcasted by the new node, and the new node A randomly determines the address of a node B from the previous N response messages and accesses the block chain network;
step 2, the node B adds the new node A as a leaf node into a balanced tree according to node information stored in the balanced tree structure, and broadcasts a newly generated balanced tree to the new node A and other nodes in the balanced tree, wherein the balanced tree is a data structure for transmitting data only between a father node and a son node, and the root node of the balanced tree stores the addresses of other root nodes in a block chain network;
and 3, randomly generating the balance tree by the root node every preset time, sending the addresses of other root nodes in the block chain network stored by the original root node to the root node of the newly generated balance tree, and broadcasting the addresses of the root node of the newly generated balance tree to other root nodes in the block chain network.
Preferably, the step 3 further includes, when the number of nodes in the balanced tree is greater than p, randomly splitting the balanced tree into two sub balanced trees, and broadcasting addresses of root nodes of the two self balanced trees to other root nodes in the blockchain network, so as to join the blockchain network; and when the number of the nodes in the balanced tree is less than q, taking the nodes in the balanced tree as new nodes, and entering the step 1.
Preferably, the step 3 further includes, if the node does not receive the message sent by the other node beyond the first preset time, further determining whether the node is a leaf node, if the node is a leaf node, the leaf node is taken as a new node, and the step 1 is performed, otherwise, the balanced tree is generated again at random.
Preferably, the root node of the balanced tree stores addresses of other root nodes in the blockchain network, specifically, the root node stores addresses of M other root nodes in the blockchain network, and if the number of the addresses of the other root nodes in the blockchain network stored by the root node is less than M, the root node discovers the other root nodes in a node discovery manner. There are various methods for node discovery, which are not further limited herein.
Preferably, the balanced tree is a balanced ternary tree, a balanced quaternary tree, a balanced quinary tree, a balanced hexaary tree or a balanced heptaary tree.
The invention also provides an efficient communication system applied to the block chain, which comprises the following modules:
the access module broadcasts the address of the new node A to the block chain network, other nodes of the block chain network send response messages to the new node A after receiving the address broadcasted by the new node, and the new node A randomly determines the address of a node B from the previous N response messages and accesses the block chain network;
the node B adds the new node A as a leaf node into the balanced tree according to node information stored in a balanced tree structure by the node B, and broadcasts a newly generated balanced tree to the new node A and other nodes in the balanced tree, wherein the balanced tree is a data structure for transmitting data only between a father node and a son node, and the root node of the balanced tree stores the addresses of other root nodes in a block chain network;
and the balance tree random generation module is used for randomly generating a balance tree again by the root node every preset time, sending the addresses of other root nodes in the block chain network stored by the original root node to the root node of the newly generated balance tree, and broadcasting the addresses of the root node of the newly generated balance tree to other root nodes in the block chain network.
Preferably, the system further includes a balanced tree splitting module, when the number of nodes in the balanced tree is greater than p, the balanced tree is split into two sub balanced trees at random, and the root nodes of the two balanced trees broadcast their addresses to other root nodes in the block chain network, so as to join the block chain network; and when the number of the nodes in the balanced tree is less than q, taking the nodes in the balanced tree as new nodes, and entering the step 1.
Preferably, the balanced tree random generation module is further configured to, if the node does not receive the message sent by the other node after exceeding the first preset time, further determine whether the node is a leaf node, if the node is a leaf node, the leaf node is used as a new node, and step 1 is performed, otherwise, the balanced tree is generated again at random.
Preferably, the root node of the balanced tree stores addresses of other root nodes in the blockchain network, specifically, the root node stores addresses of M other root nodes in the blockchain network, and if the number of the addresses of the other root nodes in the blockchain network stored by the root node is less than M, the root node discovers the other root nodes in a node discovery manner.
The invention also provides a computer readable storage medium for storing computer program instructions, characterized in that the computer program instructions, when executed by a processor, implement the method as described above.
The invention provides a high-efficiency communication method and a system applied to a block chain, which divide nodes of a block chain network into a plurality of node sets organized by a balanced tree structure, wherein root nodes in the block chain network are communicated in a p2p mode, and non-root nodes in the balanced tree are communicated between a father node and a child node, so that the problems that a transmission layer of the existing block chain is easy to occupy network bandwidth and even cause flooding by adopting p2p communication are effectively solved, and the nodes can not repeatedly receive the same message. The invention also limits the number of the nodes of the balanced tree and prevents the block chain from tending to centralization.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings needed in the description of the embodiments or the prior art will be briefly introduced below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and other drawings can be obtained according to the drawings without creative efforts for those skilled in the art.
Fig. 1 is a schematic diagram of block link point communication using peer-to-peer network (p2 p);
fig. 2 is a schematic diagram of a balanced trie network structure.
Fig. 3 is a schematic diagram of a block link point network connection according to the present invention.
Detailed Description
In this document, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Example one
The invention provides a high-efficiency communication method applied to a block chain, which mainly comprises the following steps:
step 1, a new node A broadcasts an address of the new node A to a block chain network, other nodes of the block chain network send response messages to the new node A after receiving the address broadcasted by the new node, and the new node A randomly determines the address of a node B from the previous N response messages and accesses the block chain network;
step 2, the node B adds the new node A as a leaf node into a balanced tree according to node information stored in the balanced tree structure, and broadcasts a newly generated balanced tree to the new node A and other nodes in the balanced tree, wherein the balanced tree is a data structure for transmitting data only between a father node and a son node, and the root node of the balanced tree stores the addresses of other root nodes in a block chain network;
and 3, randomly generating the balance tree by the root node every preset time, sending the addresses of other root nodes in the block chain network stored by the original root node to the root node of the newly generated balance tree, and broadcasting the addresses of the root node of the newly generated balance tree to other root nodes in the block chain network.
If there are too many nodes in a balanced tree, a large number of nodes are concentrated in a balanced tree, which results in centralization of the blockchain, but an important characteristic of the blockchain is decentralization. In order to prevent the blockchain from tending to centralization, in a specific embodiment, the step 3 further includes, when the number of nodes in the balanced tree is greater than p, randomly splitting the balanced tree into two sub-balanced trees, and broadcasting addresses of the root nodes of the two self-balanced trees to other root nodes in the blockchain network, so as to join the blockchain network; and when the number of the nodes in the balanced tree is less than q, taking the nodes in the balanced tree as new nodes, and entering the step 1. For example, there are 1000 blockchain nodes, p may be set to 50, and q may be set to 5, which is only an example, and the specific values of p and q may be determined according to the specific situation of the network bandwidth and/or the number of nodes, or may be determined according to the robustness required by the blockchain. For example, when the number of nodes is large, p and q may be set to be large, and conversely, may be set to be small. To improve the robustness of the blockchain, p and q can be set smaller, but this will increase the duplicate information received by the root node.
The method provided by the invention is not only suitable for public chains, but also suitable for private chains and alliance chains. However, if the number of nodes in the private chain or the federation chain is too small, for example, the number of nodes is less than a certain number, it is not necessary to adopt the method provided by the present invention.
The blockchain, especially the public chain, has a plurality of nodes, and during the operation of the blockchain, especially the public chain, the nodes frequently join and exit, and a fault node also occurs. In a specific embodiment, the step 3 further includes, if the node does not receive the message sent by the other node beyond the first preset time, further determining whether the node is a leaf node, if the node is a leaf node, taking the leaf node as a new node, and entering the step 1, otherwise, randomly generating the balanced tree again. And (3) because the stability of the new node is uncertain, if the new node is disconnected, the step 1 is directly carried out, the non-leaf node is stable, and if the non-leaf node has a problem, the balanced tree is randomly generated again.
When the nodes of the blockchain reach a certain scale, the number of root nodes in the blockchain is large, and if p2p peer-to-peer network communication is adopted between each root node and other root nodes, the number of connections maintained by the root nodes is large, and even the root nodes are directly dragged to death. To prevent this, the root node of the balanced tree may randomly select several other root nodes, or select a peer-to-peer network connection from several other root nodes held by the root node. In one embodiment, the root node stores addresses of M other root nodes in the blockchain network, and if the number of the addresses of the other root nodes in the blockchain network stored by the root node is less than M, the root node discovers the other root nodes in a node discovery manner. A number of root nodes are selected from the M other root nodes as the other root nodes to which the root node is connected.
Preferably, the balanced tree is a balanced ternary tree, a balanced quaternary tree, a balanced quinary tree, a balanced hexaary tree or a balanced heptaary tree. Fig. 2 and fig. 3 illustrate a block chain network constructed by balanced ternary trees, and it should be noted that the root node in fig. 3 is larger, but is equal to other nodes in the balanced tree. Other nodes in the balancing tree also have the opportunity to become root nodes, which can avoid the block chain from being centralized.
Example two
In another embodiment, the present invention further provides an efficient communication system applied in a block chain, including the following modules:
the access module broadcasts the address of the new node A to the block chain network, other nodes of the block chain network send response messages to the new node A after receiving the address broadcasted by the new node, and the new node A randomly determines the address of a node B from the previous N response messages and accesses the block chain network;
the node B adds the new node A as a leaf node into the balanced tree according to node information stored in a balanced tree structure by the node B, and broadcasts a newly generated balanced tree to the new node A and other nodes in the balanced tree, wherein the balanced tree is a data structure for transmitting data only between a father node and a son node, and the root node of the balanced tree stores the addresses of other root nodes in a block chain network;
and the balance tree random generation module is used for randomly generating a balance tree again by the root node every preset time, sending the addresses of other root nodes in the block chain network stored by the original root node to the root node of the newly generated balance tree, and broadcasting the addresses of the root node of the newly generated balance tree to other root nodes in the block chain network.
Preferably, the system further includes a balanced tree splitting module, when the number of nodes in the balanced tree is greater than p, the balanced tree is split into two sub balanced trees at random, and the root nodes of the two balanced trees broadcast their addresses to other root nodes in the block chain network, so as to join the block chain network; and when the number of the nodes in the balanced tree is less than q, taking the nodes in the balanced tree as new nodes, and entering the step 1.
Preferably, the balanced tree random generation module is further configured to, if the node does not receive the message sent by the other node after exceeding the first preset time, further determine whether the node is a leaf node, if the node is a leaf node, the leaf node is used as a new node, and step 1 is performed, otherwise, the balanced tree is generated again at random.
Preferably, the root node of the balanced tree stores addresses of other root nodes in the blockchain network, specifically, the root node stores addresses of M other root nodes in the blockchain network, and if the number of the addresses of the other root nodes in the blockchain network stored by the root node is less than M, the root node discovers the other root nodes in a node discovery manner.
EXAMPLE III
In another embodiment, the present invention further provides a computer-readable storage medium for storing computer program instructions, wherein the computer program instructions, when executed by a processor, implement the method of embodiment one.
The various embodiments described in the present invention may be combined to implement a corresponding technical solution. The steps of a method or algorithm described in connection with the embodiments disclosed herein may be embodied directly in hardware, in a software module executed by a processor, or in a combination of the two. A software module may reside in Random Access Memory (RAM), memory, Read Only Memory (ROM), electrically programmable ROM, electrically erasable programmable ROM, registers, hard disk, a removable magnetic disk, a CD-ROM, or any other form of storage medium known in the art.
Claims (10)
1. An efficient communication method applied in a block chain, the method comprising the steps of:
step 1, a new node A broadcasts an address of the new node A to a block chain network, other nodes of the block chain network send response messages to the new node A after receiving the address broadcasted by the new node, and the new node A randomly determines the address of a node B from the previous N response messages and accesses the block chain network;
step 2, the node B adds the new node A as a leaf node into a balanced tree according to node information stored in the balanced tree structure, and broadcasts a newly generated balanced tree to the new node A and other nodes in the balanced tree, wherein the balanced tree is a data structure for transmitting data only between a father node and a son node, and the root node of the balanced tree stores the addresses of other root nodes in a block chain network;
and 3, randomly generating the balance tree by the root node every preset time, sending the addresses of other root nodes in the block chain network stored by the original root node to the root node of the newly generated balance tree, and broadcasting the addresses of the root node of the newly generated balance tree to other root nodes in the block chain network.
2. The method of claim 1, wherein the step 3 further comprises, when the number of nodes in the balanced tree is greater than p, randomly splitting the balanced tree into two sub-balanced trees, wherein the root nodes of the two self-balanced trees broadcast their addresses to other root nodes in the blockchain network, thereby joining the blockchain network; and when the number of the nodes in the balanced tree is less than q, taking the nodes in the balanced tree as new nodes, and entering the step 1.
3. The method of claim 2, wherein the step 3 further comprises, if the node does not receive the message sent by other nodes beyond the first preset time, further determining whether the node is a leaf node, if the node is a leaf node, the leaf node is taken as a new node, and the step 1 is entered, otherwise, the balanced tree is generated again at random.
4. The method according to claim 1, wherein the root node of the balanced tree stores addresses of other root nodes in the blockchain network, specifically, the root node stores addresses of M other root nodes in the blockchain network, and if the number of the addresses of the other root nodes in the blockchain network stored by the root node is less than M, the root node discovers the other root nodes by means of node discovery.
5. The method of claim 1, wherein the balanced tree is a balanced ternary tree, a balanced quaternary tree, a balanced quinary tree, a balanced hexaary tree, or a balanced heptaary tree.
6. An efficient communication system for use in a blockchain, the system comprising:
the access module broadcasts the address of the new node A to the block chain network, other nodes of the block chain network send response messages to the new node A after receiving the address broadcasted by the new node, and the new node A randomly determines the address of a node B from the previous N response messages and accesses the block chain network;
the node B adds the new node A as a leaf node into the balanced tree according to node information stored in a balanced tree structure by the node B, and broadcasts a newly generated balanced tree to the new node A and other nodes in the balanced tree, wherein the balanced tree is a data structure for transmitting data only between a father node and a son node, and the root node of the balanced tree stores the addresses of other root nodes in a block chain network;
and the balance tree random generation module is used for randomly generating a balance tree again by the root node every preset time, sending the addresses of other root nodes in the block chain network stored by the original root node to the root node of the newly generated balance tree, and broadcasting the addresses of the root node of the newly generated balance tree to other root nodes in the block chain network.
7. The system of claim 6, further comprising a balanced tree splitting module that randomly splits a balanced tree into two sub-balanced trees when the number of nodes in the balanced tree is greater than p, the root nodes of the two self-balanced trees broadcasting their addresses to other root nodes in the blockchain network to join the blockchain network; and when the number of the nodes in the balanced tree is less than q, taking the nodes in the balanced tree as new nodes, and entering the step 1.
8. The system of claim 7, wherein the balanced tree random generation module is further configured to further determine whether the node is a leaf node if the node does not receive the message sent by other nodes over the first preset time, if the node is a leaf node, the leaf node is used as a new node, and step 1 is performed, otherwise, the balanced tree is generated again at random.
9. The system according to claim 6, wherein the root node of the balanced tree stores addresses of other root nodes in the blockchain network, specifically, the root node stores addresses of M other root nodes in the blockchain network, and if the number of the addresses of the other root nodes in the blockchain network stored by the root node is less than M, the root node discovers the other root nodes by means of node discovery.
10. A computer readable storage medium storing computer program instructions which, when executed by a processor, implement the method of any one of claims 1-5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110379184.7A CN113709203A (en) | 2021-04-08 | 2021-04-08 | Efficient communication method and system applied to block chain |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110379184.7A CN113709203A (en) | 2021-04-08 | 2021-04-08 | Efficient communication method and system applied to block chain |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN113709203A true CN113709203A (en) | 2021-11-26 |
Family
ID=78647959
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110379184.7A Pending CN113709203A (en) | 2021-04-08 | 2021-04-08 | Efficient communication method and system applied to block chain |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113709203A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115567542A (en) * | 2022-12-01 | 2023-01-03 | 杭州蚂蚁酷爱科技有限公司 | Node set maintenance method and device |
| CN115567541A (en) * | 2022-12-01 | 2023-01-03 | 杭州蚂蚁酷爱科技有限公司 | Block chain network, node set maintenance method and device |
| CN117811999A (en) * | 2024-02-28 | 2024-04-02 | 中国信息通信研究院 | Node data processing method and device of block chain network system |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20150288655A1 (en) * | 2014-04-07 | 2015-10-08 | Oracle International Corporation | Neighbor lookup operations in a network node |
| 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 |
| CN109450664A (en) * | 2018-10-09 | 2019-03-08 | 北京医拍智能科技有限公司 | A kind of data collaborative processing method and processing device based on block chain P2P network |
| CN111367916A (en) * | 2020-03-04 | 2020-07-03 | 浙江大华技术股份有限公司 | Data storage method and device |
| CN112565389A (en) * | 2020-11-30 | 2021-03-26 | 网易（杭州）网络有限公司 | Block chain based message broadcasting method and device, electronic equipment and storage medium |
-
2021
- 2021-04-08 CN CN202110379184.7A patent/CN113709203A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20150288655A1 (en) * | 2014-04-07 | 2015-10-08 | Oracle International Corporation | Neighbor lookup operations in a network node |
| 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 |
| CN109450664A (en) * | 2018-10-09 | 2019-03-08 | 北京医拍智能科技有限公司 | A kind of data collaborative processing method and processing device based on block chain P2P network |
| CN111367916A (en) * | 2020-03-04 | 2020-07-03 | 浙江大华技术股份有限公司 | Data storage method and device |
| CN112565389A (en) * | 2020-11-30 | 2021-03-26 | 网易（杭州）网络有限公司 | Block chain based message broadcasting method and device, electronic equipment and storage medium |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115567542A (en) * | 2022-12-01 | 2023-01-03 | 杭州蚂蚁酷爱科技有限公司 | Node set maintenance method and device |
| CN115567541A (en) * | 2022-12-01 | 2023-01-03 | 杭州蚂蚁酷爱科技有限公司 | Block chain network, node set maintenance method and device |
| CN115567541B (en) * | 2022-12-01 | 2023-03-10 | 杭州蚂蚁酷爱科技有限公司 | Block chain network, node set maintenance method and device |
| CN115567542B (en) * | 2022-12-01 | 2023-03-10 | 杭州蚂蚁酷爱科技有限公司 | Method and device for maintaining node set |
| CN117811999A (en) * | 2024-02-28 | 2024-04-02 | 中国信息通信研究院 | Node data processing method and device of block chain network system |
| CN117811999B (en) * | 2024-02-28 | 2024-05-14 | 中国信息通信研究院 | Node data processing method and device of block chain network system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN113709203A (en) | Efficient communication method and system applied to block chain | |
| CN101378409B (en) | Optimal operation of hierarchical peer-to-peer networks | |
| Pandurangan et al. | Building low-diameter peer-to-peer networks | |
| Montresor | A robust protocol for building superpeer overlay topologies | |
| CN101102250B (en) | Distributed hashing mechanism for self-organizing networks | |
| CN112311596B (en) | Data management method, device, equipment and computer storage medium | |
| Van Renesse et al. | Willow: DHT, aggregation, and publish/subscribe in one protocol | |
| CN101356769B (en) | Method for forming group on one node of equivalence content distribution cloud | |
| Abraham et al. | A generic scheme for building overlay networks in adversarial scenarios | |
| EP1968257A2 (en) | Methods for storing a file on a node of an overlay network | |
| CN112565389B (en) | Block chain based message broadcasting method and device, electronic equipment and storage medium | |
| CN110417870A (en) | configuration file management method, device, equipment and storage medium | |
| CN112637330B (en) | Block chain large file copy address selection method, system, equipment and storage medium | |
| CN108667928A (en) | A kind of method of data synchronization based on block chain state machine networking running | |
| Shen et al. | A proximity-aware interest-clustered P2P file sharing system | |
| Guerraoui et al. | Gosskip, an efficient, fault-tolerant and self organizing overlay using gossip-based construction and skip-lists principles | |
| CN113609231B (en) | Method and device for maintaining network architecture information of block chain system | |
| Demirci et al. | A hierarchical P2P clustering framework for video streaming systems | |
| Han et al. | A hybrid P2P overlay network for high efficient search | |
| CN106657333B (en) | Centralized directory data exchange system and method based on cloud service mode | |
| Abe | Blockchain storage load balancing among dht clustered nodes | |
| Caron et al. | Self-stabilization in tree-structured peer-to-peer service discovery systems | |
| Nakashima et al. | Tree-based consistency maintenance scheme for peer-to-peer file sharing systems | |
| Pujol-Ahullo et al. | Towards a lightweight content-based publish/subscribe services for peer-to-peer systems | |
| CN112738262B (en) | Computing method and system for selecting optimal node |
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 |