CN110392115B - Block chain node management method, device and readable storage medium - Google Patents
Block chain node management method, device and readable storage medium Download PDFInfo
- Publication number
- CN110392115B CN110392115B CN201910680752.XA CN201910680752A CN110392115B CN 110392115 B CN110392115 B CN 110392115B CN 201910680752 A CN201910680752 A CN 201910680752A CN 110392115 B CN110392115 B CN 110392115B
- Authority
- CN
- China
- Prior art keywords
- node
- nodes
- connection information
- information
- block
- 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
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/14—Session management
- H04L67/141—Setup of application sessions
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a block link point management method. The method comprises the following steps: acquiring node information of other nodes which can be connected with the first node in the block chain at preset time intervals; calculating the connection information of other nodes according to the node information; sequencing the connection information to obtain sequencing results corresponding to other nodes; and controlling the first node to be connected with other nodes according to the sequencing result according to a preset rule. The invention also discloses a block link point management device and a computer readable storage medium. The invention can realize the calculation management of the information of the nodes in the block chain, and the connection between the nodes in the block chain is more optimized.
Description
Technical Field
The present invention relates to the field of blockchain network technologies, and in particular, to a method and an apparatus for managing blockchain link points, and a computer-readable storage medium.
Background
The blockchain is a novel application mode of computer technologies such as distributed data storage, point-to-point transmission, a consensus mechanism and an encryption algorithm. The blockchain technology is a brand new distributed infrastructure and computing mode that uses blockchain data structures to verify and store data, uses distributed node consensus algorithms to generate and update data, uses cryptography to secure data transmission and access, and uses intelligent contracts composed of automated script codes to program and manipulate data. The blockchain network comprises a plurality of nodes, and the nodes in the blockchain network can be divided into consensus nodes, accounting nodes, consensus candidate nodes and the like according to roles.
At present, with the development of a block chain, nodes participating in consensus increase, but the process of consensus needs to occupy a large amount of network resources, while some weak-computation-force nodes are poor in computation force, and in the process of participating in consensus and not tracking blocks, the efficiency of generating the blocks is easily reduced, even the blocks cannot be generated, and the weak-computation-force nodes are called problem nodes. And the block chain network is difficult to judge which nodes are problem nodes and which nodes are normal nodes, so that other nodes in the block chain network can not work normally due to the connection of the problem nodes, and further network jitter occurs, the operation of the whole block chain network is affected, and the final block chain network can not work normally.
Disclosure of Invention
The invention mainly aims to provide a block chain link point management method, a block chain link point management device and a computer readable storage medium, aiming at realizing the calculation management of information on nodes in a block chain and optimizing the connection between the nodes in the block chain.
In order to achieve the above object, the present invention provides a block link point management method, including the following steps:
acquiring node information of other nodes which can be connected with the first node in the block chain at preset time intervals;
calculating the connection information of other nodes according to the node information;
sequencing the connection information to obtain sequencing results corresponding to other nodes;
and controlling the first node to be connected with other nodes according to the sequencing result according to a preset rule.
Optionally, the node information includes at least one of a node IP address, a node domain name, and node block chain address information.
Optionally, the step of calculating connection information of other nodes according to the node information includes:
obtaining IO load values and CPU load values of other nodes according to the node information;
and calculating the connection information of other nodes by using a preset formula according to the IO load value and the CPU load value.
Optionally, the connection information comprises a connection strength and/or a transmission speed.
Optionally, the step of sorting the connection information to obtain a sorting result corresponding to another node includes:
grading the connection information to obtain a corresponding grading result;
and sequencing the scoring results to obtain sequencing results corresponding to other nodes.
Optionally, the step of scoring the connection information to obtain a corresponding scoring result includes:
determining a first score corresponding to the connection information in a preset score list according to the connection information;
carrying out weighted summation on the first scores to obtain a score sum, and determining the state type of the connection information according to a preset neural network model and the connection information;
and adjusting the total scoring according to the state type to obtain a scoring result.
Optionally, the step of sorting the scoring results and obtaining sorting results corresponding to other nodes includes:
and sequencing the scoring results from high to low to obtain sequencing results of other corresponding nodes.
Optionally, the step of controlling the first node to connect with other nodes according to the sorting result according to a preset rule includes:
and controlling the first node to be connected with other nodes from the first sequencing position according to a preset rule according to the sequencing result.
In addition, to achieve the above object, the present invention also provides a block link point management device, including: a memory, a processor and a block-link point manager stored on the memory and executable on the processor, the block-link point manager when executed by the processor implementing the steps of the block-link point management method as described above.
In addition, to achieve the above object, the present invention further provides a computer readable storage medium having a block link point management program stored thereon, where the block link node management program, when executed by a processor, implements the steps of the above block link point management method.
The invention provides a block link point management method, a block link point management device and a computer storage medium. In the method, node information of other nodes which can be connected with a first node in a block chain is obtained at intervals of preset time; calculating the connection information of other nodes according to the node information; sequencing the connection information to obtain sequencing results corresponding to other nodes; and controlling the first node to be connected with other nodes according to the sequencing result according to a preset rule. Through the mode, the connection information of other nodes connected with the nodes in the block chain can be obtained through the node information, the nodes corresponding to the connection information are sorted according to the connection information, the first node is connected with other nodes according to the sorting result, so that the connection efficiency is high, other nodes with high reaction speed can be preferentially connected with the nodes, the connection time of the nodes and other malignant nodes is reduced, the management of the nodes in the block chain is realized, and the connection of the nodes in the block chain is optimized.
Drawings
FIG. 1 is a schematic diagram of an apparatus in a hardware operating environment according to an embodiment of the present invention;
FIG. 2 is a flowchart illustrating a block link point management method according to a first embodiment of the present invention;
FIG. 3 is a flowchart illustrating a block link point management method according to a second embodiment of the present invention;
FIG. 4 is a flowchart illustrating a block link point management method according to a third embodiment of the present invention;
FIG. 5 is a flowchart illustrating a block link point management method according to a fourth embodiment of the present invention;
FIG. 6 is a flowchart illustrating a fifth exemplary embodiment of a block link point management method according to the present invention;
fig. 7 is a flowchart illustrating a block link point management method according to a sixth embodiment of the present invention.
The implementation, functional features and advantages of the objects of the present invention will be further explained with reference to the accompanying drawings.
Detailed Description
It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
As shown in fig. 1, fig. 1 is a schematic device structure diagram of a hardware operating environment according to an embodiment of the present invention.
The terminal of the embodiment of the invention can be a PC, and can also be a terminal device with a data processing function, such as a smart phone, a tablet computer, a portable computer and the like.
As shown in fig. 1, the terminal may include: a processor 1001, such as a CPU, a network interface 1004, a user interface 1003, a memory 1005, a communication bus 1002. Wherein a communication bus 1002 is used to enable connective communication between these components. The user interface 1003 may include a Display screen (Display), an input unit such as a Keyboard (Keyboard), and the optional user interface 1003 may also include a standard wired interface, a wireless interface. The network interface 1004 may optionally include a standard wired interface, a wireless interface (e.g., WI-FI interface). The memory 1005 may be a high-speed RAM memory or a non-volatile memory (e.g., a magnetic disk memory). The memory 1005 may alternatively be a storage device separate from the processor 1001.
Optionally, the terminal may further include a camera, a Radio Frequency (RF) circuit, a sensor, an audio circuit, a Wi-Fi module, and the like. Such as light sensors, motion sensors, and other sensors. Specifically, the light sensor may include an ambient light sensor that may adjust the brightness of the display screen according to the brightness of ambient light, and a proximity sensor that may turn off the display screen and/or the backlight when the mobile terminal is moved to the ear. As one of the motion sensors, the gravity acceleration sensor can detect the magnitude of acceleration in each direction (generally, three axes), detect the magnitude and direction of gravity when the mobile terminal is stationary, and can be used for applications (such as horizontal and vertical screen switching, related games, magnetometer attitude calibration), vibration recognition related functions (such as pedometer and tapping) and the like for recognizing the attitude of the mobile terminal; of course, the mobile terminal may also be configured with other sensors such as a gyroscope, a barometer, a hygrometer, a thermometer, and an infrared sensor, which are not described herein again.
Those skilled in the art will appreciate that the terminal structure shown in fig. 1 is not intended to be limiting and may include more or fewer components than those shown, or some components may be combined, or a different arrangement of components.
As shown in fig. 1, a memory 1005, which is a kind of computer storage medium, may include therein an operating system, a network communication module, a user interface module, and a block link node management program.
In the terminal shown in fig. 1, the network interface 1004 is mainly used for connecting to a backend server and performing data communication with the backend server; the user interface 1003 is mainly used for connecting a client (user side) and performing data communication with the client; the processor 1001 may be configured to call the block link node management program stored in the memory 1005, and perform the following operations:
acquiring node information of other nodes which can be connected with the first node in the block chain at preset time intervals;
calculating the connection information of other nodes according to the node information;
sequencing the connection information to obtain sequencing results corresponding to other nodes;
and controlling the first node to be connected with other nodes according to the sequencing result according to a preset rule.
Further, the processor 1001 may call the block link node management program stored in the memory 1005, and further perform the following operations:
the node information includes at least one of a node IP address, a node domain name, and node block chain address information.
Further, the processor 1001 may call the block link node management program stored in the memory 1005, and further perform the following operations:
obtaining IO load values and CPU load values of other nodes according to the node information;
and calculating the connection information of other nodes by using a preset formula according to the IO load value and the CPU load value.
Further, the processor 1001 may call the block link node management program stored in the memory 1005, and further perform the following operations:
the connection information includes connection strength and/or transmission speed.
Further, the processor 1001 may call the block link node management program stored in the memory 1005, and further perform the following operations:
grading the connection information to obtain a corresponding grading result;
and sequencing the scoring results to obtain sequencing results corresponding to other nodes.
Further, the processor 1001 may call the block link node management program stored in the memory 1005, and further perform the following operations:
determining a first score corresponding to the connection information in a preset score list according to the connection information;
carrying out weighted summation on the first scores to obtain a score sum, and determining the state type of the connection information according to a preset neural network model and the connection information;
and adjusting the total scoring according to the state type to obtain a scoring result.
Further, the processor 1001 may call the block link node management program stored in the memory 1005, and further perform the following operations:
and sequencing the scoring results from high to low to obtain sequencing results of other corresponding nodes.
Further, the processor 1001 may call the block link node management program stored in the memory 1005, and further perform the following operations:
and controlling the first node to be connected with other nodes from the first sequencing position according to a preset rule according to the sequencing result.
The specific embodiment of the block link node management apparatus of the present invention is substantially the same as the following embodiments of the block link node management method, and will not be described herein again.
Referring to fig. 2, fig. 2 is a schematic flowchart of a block link point management method according to a first embodiment of the present invention, where the block link point management method includes:
step S100, acquiring node information of other nodes which can be connected with a first node in a block chain at intervals of preset time;
the present embodiment is a node management method for a block chain. In this embodiment, the node information of the other nodes connected to the first node in the block chain is obtained at preset time intervals. The preset time interval can be preset for a system or set according to user node customization, and in the subsequent process, the preset time can be changed according to the situation. In this embodiment, the connection of the first node in the block chain is adjusted, and node information of other nodes that can be connected to the first node is obtained first. If there are 10 nodes that can be connected to the first node, the node information of the 10 nodes is obtained first, and the node information includes at least one of the node IP address, the node domain name, and the node block chain address information. The node IP address, the node domain name and the node block chain address information are identification information of the node, and a corresponding specific node can be found according to the identification information. For example, after obtaining an IP address of a certain node connectable to a first node, it may be determined, according to the IP address, which specific node among other nodes connectable to the first node corresponds to the IP address. Such as the fourth of 10 nodes. And other nodes corresponding to the node information can be accurately positioned according to the node information.
Step S200, calculating the connection information of other nodes according to the node information;
and after the node information is obtained, calculating the connection information of other nodes corresponding to the node information according to the node information. The connection information is the connection strength and/or the transmission speed. Specifically, the IO load value and the CPU load value of the other node corresponding to the node information may be found through the node information, and the connection information is obtained according to the IO load value and the CPU load value and according to a preset formula. The IO load value and the CPU load value are important performance values reflecting the running speed and the response speed of the node client. And obtaining the connection strength and/or the transmission speed of the node client according to the IO load value and the CPU load value and a preset formula.
S300, sequencing the connection information to obtain sequencing results corresponding to other nodes;
after the connection information of other nodes is obtained, the connection information may be sorted to obtain a sorting result of the corresponding other nodes. After the connection information is obtained, the nodes may be sorted according to the connection information, that is, other nodes connected to the first node are sorted to obtain a sorting result. Specifically, the ranking results of the corresponding other nodes can be obtained according to the ranking from high to low according to the scoring results; or the ranking results of other corresponding nodes can be obtained according to the ranking of the scoring results from low to high.
And step S400, controlling the first node to be connected with other nodes according to the sequencing result according to a preset rule.
After the sorting result is determined, the first node may be controlled to be connected with other nodes according to the sorting result according to a preset rule. And if the grading result is in a high-to-low sequence, controlling the first node to be connected with other nodes from the head of the sequence. And if the grading result is in a low-to-high sequence, controlling the first node to be connected with other nodes from the last sequence. Of course, the connection may be made according to other rules.
The invention provides a block link point management method, a block link point management device and a computer storage medium. In the method, node information of other nodes which can be connected with a first node in a block chain is obtained at intervals of preset time; calculating the connection information of other nodes according to the node information; sequencing the connection information to obtain sequencing results corresponding to other nodes; and controlling the first node to be connected with other nodes according to the sequencing result according to a preset rule. Through the mode, the connection information of other nodes connected with the nodes in the block chain can be obtained through the node information, the nodes corresponding to the connection information are sorted according to the connection information, the first node is connected with other nodes according to the sorting result, so that the connection efficiency is high, other nodes with high reaction speed can be preferentially connected with the nodes, the connection time of the nodes and other malignant nodes is reduced, the management of the nodes in the block chain is realized, and the connection of the nodes in the block chain is optimized.
Referring to fig. 3, fig. 3 is a flowchart illustrating a block link point management method according to a second embodiment of the present invention.
Based on the foregoing embodiment, in this embodiment, step S200 includes:
step S210, obtaining IO load values and CPU load values of other nodes according to the node information;
in this embodiment, the IO load value and the CPU load value of the other node corresponding to the node information are obtained according to the node information. The IO load value and the CPU load value are important performance values reflecting the running speed and the response speed of the node client. And obtaining the connection strength and/or the transmission speed of the node client according to the IO load value and the CPU load value and a preset formula. The node information includes at least one of node IP address, node domain name, and node block chain address information. After the node domain name of a certain node is obtained, which node of all other nodes that can be connected with the current first node is determined specifically according to the node domain name, and then the IO load value and the CPU load value of the specific node are obtained.
And step S220, calculating the connection information of other nodes by using a preset formula according to the IO load value and the CPU load value.
After the IO load value and the CPU load value of the other node are obtained according to the node information, the connection information of the other node may be calculated by using a preset formula according to the IO load value and the CPU load value. The connection information is the connection strength and/or the transmission speed. Specifically, the preset formula for calculating the connection information of the other nodes according to the IO load value and the CPU load value by using the preset formula is as follows:
wherein J1 is an IO load value, J2 is a CPU load value, W is a connection strength, S is a distributed performance value of the blockchain system, K is a first guini coefficient related to a geographical position distribution of a node in the blockchain system, Kb is a block height of the node, P is a transmission speed, and M is a weight fraction value.
The connection strength and/or transmission speed of other nodes can be calculated according to the IO load value and the CPU load value through the formula.
Referring to fig. 4, fig. 4 is a flowchart illustrating a block link point management method according to a third embodiment of the present invention.
Based on the foregoing embodiment, in this embodiment, step S300 includes:
step S310, scoring the connection information to obtain a corresponding scoring result;
in this embodiment, the scoring result may be obtained by scoring the connection information, and the ranking result of the corresponding other node may be obtained by ranking according to the scoring result. Specifically, a first score corresponding to the connection information may be obtained according to the connection information, weighted summation is performed according to the first score, a score sum is obtained, and finally, a type is determined according to a preset model and the connection information, and the score sum is adjusted according to the type, so that a score result is obtained. Of course, the ranking may also be performed in other manners according to the connection information, for example, the first score corresponding to the connection information may be obtained first according to the connection information, and the first score is weighted and summed to obtain a score sum, which may also be the final score result.
And S320, sorting the grading results to obtain sorting results corresponding to other nodes.
And after the grading result is obtained, sorting according to the grading result to obtain the sorting result of the corresponding other nodes. If the ranking is carried out according to the ranking result from high to low, the ranking result is obtained; or sorting according to the grading results from low to high to obtain sorting results.
Referring to fig. 5, fig. 5 is a flowchart illustrating a block link point management method according to a fourth embodiment of the present invention.
Based on the foregoing embodiment, in this embodiment, step S310 includes:
step S311, determining a first score corresponding to the connection information in a preset score list according to the connection information;
in this embodiment, a first score corresponding to the connection information in the preset score list is determined according to the connection information, where if the connection strength is within a certain high numerical range, the range corresponds to one first score in the preset score list, and if the connection strength is within another low numerical range, the range corresponds to another first score in the preset score list. A first score corresponding to the connection strength and/or the transmission speed can be obtained through the preset score list.
Step S312, carrying out weighted summation on the first scores to obtain a score sum, and determining the state type of the connection information according to a preset neural network model and the connection information;
and carrying out weighted summation on the first scores corresponding to the connection strength and/or the transmission speed to obtain the score sum of the connection strength and/or the transmission speed. The sum of the scores is a total score of the connection strength and/or transmission speed.
And after the score sum of the connection strength and/or the transmission speed is obtained, determining the state type of the connection information according to a preset neural network model and the connection information. The preset neural network model is a grading compensation model obtained by training according to a large amount of sample data, and the state type of the connection information can be determined by inputting the connection information into the model. Such as a positive compensation type, a negative compensation type, etc.
And step S313, adjusting the total scoring according to the state type to obtain a scoring result.
And after the state type is determined, adjusting the total scoring sum according to the state type to obtain a scoring result. And if the state type is a positive compensation type, carrying out positive compensation on the total score according to the parameters of the model, if the state type is a negative compensation type, carrying out negative compensation on the total score according to the parameters of the model, and finally, adjusting to obtain a score result.
Referring to fig. 6, fig. 6 is a flowchart illustrating a block link point management method according to a fifth embodiment of the present invention.
Based on the foregoing embodiment, in this embodiment, step S320 includes:
and S321, sorting the scoring results from high to low to obtain sorting results of other corresponding nodes.
In this embodiment, the scoring results are ranked from high to low, and ranking results of other corresponding nodes are obtained. After the scoring results are obtained, the scoring results are ranked from high to low, and then the ranking results are obtained.
Referring to fig. 7, fig. 7 is a flowchart illustrating a block link point management method according to a sixth embodiment of the present invention.
Based on the foregoing embodiment, in this embodiment, step S400 includes:
and step S410, controlling the first node to be connected with other nodes from the first ranking position according to the ranking result according to a preset rule.
In this embodiment, the first node is controlled to be connected with other nodes according to the sorting result according to a preset rule, and the first node may be controlled to be connected with other nodes from the top of the sorting according to the sorting result according to the preset rule. That is, the first bit in the sorting result is preferentially connected, and when the first bit cannot be connected, the second bit in the sorting result is preferentially connected in sequence until a suitable connection point is found.
In addition, the embodiment of the invention also provides a computer readable storage medium.
The computer readable storage medium of the present invention stores thereon a block link point management program, which when executed by a processor implements the steps of the block link point management method as described above.
The method implemented when the block link point management program running on the processor is executed may refer to various embodiments of the block link point management method of the present invention, and details thereof are not described herein.
It should be noted that, in this document, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or system 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 system. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a process, method, article, or system that comprises the element.
The above-mentioned serial numbers of the embodiments of the present invention are merely for description and do not represent the merits of the embodiments.
Through the above description of the embodiments, those skilled in the art will clearly understand that the method of the above embodiments can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware, but in many cases, the former is a better implementation manner. Based on such understanding, the technical solution of the present invention may be embodied in the form of a software product, which is stored in a storage medium (e.g., ROM/RAM, magnetic disk, optical disk) as described above and includes instructions for enabling a terminal device (e.g., a mobile phone, a computer, a server, an air conditioner, or a network device) to execute the method according to the embodiments of the present invention.
The above description is only a preferred embodiment of the present invention, and not intended to limit the scope of the present invention, and all modifications of equivalent structures and equivalent processes, which are made by using the contents of the present specification and the accompanying drawings, or directly or indirectly applied to other related technical fields, are included in the scope of the present invention.
Claims (8)
1. A block chain node management method is characterized by comprising the following steps:
acquiring node information of other nodes which can be connected with the first node in the block chain at preset time intervals;
calculating the connection information of other nodes according to the node information;
sequencing the connection information to obtain sequencing results corresponding to other nodes;
controlling the first node to be connected with other nodes according to a sequencing result according to a preset rule;
wherein the step of calculating the connection information of other nodes according to the node information comprises:
obtaining IO load values and CPU load values of other nodes according to the node information;
calculating the connection information of other nodes by using a preset formula according to the IO load value and the CPU load value;
the connection information includes connection strength and/or transmission speed.
2. A block link node management method according to claim 1, wherein the node information includes at least one of a node IP address, a node domain name, and node block chain address information.
3. The block link node management method according to claim 1, wherein the step of sorting the connection information to obtain sorting results corresponding to other nodes comprises:
grading the connection information to obtain a corresponding grading result;
and sequencing the scoring results to obtain sequencing results corresponding to other nodes.
4. The method of claim 3, wherein the step of scoring the connection information to obtain corresponding scoring results comprises:
determining a first score corresponding to the connection information in a preset score list according to the connection information;
carrying out weighted summation on the first scores to obtain a score sum, and determining the state type of the connection information according to a preset neural network model and the connection information;
and adjusting the total scoring according to the state type to obtain a scoring result.
5. A block link node management method according to claim 3, wherein the step of ranking the scoring results and obtaining ranking results corresponding to other nodes comprises:
and sequencing the scoring results from high to low to obtain sequencing results of other corresponding nodes.
6. The method for block link node management according to claim 1, wherein the step of controlling the first node to connect with other nodes according to the sorting result according to the preset rule comprises:
and controlling the first node to be connected with other nodes from the first sequencing position according to a preset rule according to the sequencing result.
7. A block link node management apparatus, comprising: memory, processor and a block-link point management program stored on the memory and executable on the processor, the block-link point management program when executed by the processor implementing the steps of the block-link point management method according to any one of claims 1 to 6.
8. A computer-readable storage medium, having stored thereon a block-chain node management program which, when executed by a processor, implements the steps of the block-chain node management method according to any one of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910680752.XA CN110392115B (en) | 2019-07-25 | 2019-07-25 | Block chain node management method, device and readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910680752.XA CN110392115B (en) | 2019-07-25 | 2019-07-25 | Block chain node management method, device and readable storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110392115A CN110392115A (en) | 2019-10-29 |
| CN110392115B true CN110392115B (en) | 2022-03-01 |
Family
ID=68287622
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910680752.XA Active CN110392115B (en) | 2019-07-25 | 2019-07-25 | Block chain node management method, device and readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110392115B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111263012B (en) * | 2020-01-17 | 2021-08-27 | 西安迪科数金智能科技有限公司 | Digital centerless calling system and method |
| CN114979148B (en) * | 2022-06-16 | 2023-07-14 | 中国联合网络通信集团有限公司 | Data transmission method, device and computer readable storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108810157A (en) * | 2018-06-20 | 2018-11-13 | 泰链（厦门）科技有限公司 | The connection method of block chain network, medium, apparatus and system |
| CN109617992A (en) * | 2018-12-29 | 2019-04-12 | 杭州趣链科技有限公司 | A kind of edge calculations node dynamic electoral machinery based on block chain |
| CN109981405A (en) * | 2019-03-20 | 2019-07-05 | 上海和数软件有限公司 | Node administration method, device and computer readable storage medium |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US11095432B2 (en) * | 2017-04-05 | 2021-08-17 | Samsung Sds Co., Ltd. | System for processing data based on blockchain and operating method thereof |
-
2019
- 2019-07-25 CN CN201910680752.XA patent/CN110392115B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108810157A (en) * | 2018-06-20 | 2018-11-13 | 泰链（厦门）科技有限公司 | The connection method of block chain network, medium, apparatus and system |
| CN109617992A (en) * | 2018-12-29 | 2019-04-12 | 杭州趣链科技有限公司 | A kind of edge calculations node dynamic electoral machinery based on block chain |
| CN109981405A (en) * | 2019-03-20 | 2019-07-05 | 上海和数软件有限公司 | Node administration method, device and computer readable storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110392115A (en) | 2019-10-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11169827B2 (en) | Resource loading at application startup using attributes of historical data groups | |
| CN109670174B (en) | Training method and device of event recognition model | |
| CN111813910A (en) | Method, system, terminal device and computer storage medium for updating customer service problem | |
| CN112101360B (en) | Target detection method and device and computer readable storage medium | |
| CN109783859A (en) | Model building method, device and computer readable storage medium | |
| WO2022105297A1 (en) | Table structure recovery method and system, computer device, and storage medium | |
| CN110264093B (en) | Credit model establishing method, device, equipment and readable storage medium | |
| CN110392115B (en) | Block chain node management method, device and readable storage medium | |
| CN105468161A (en) | Instruction execution method and device | |
| CN113822460A (en) | Traffic flow prediction method and device, electronic equipment and storage medium | |
| CN115145801B (en) | A/B test flow distribution method, device, equipment and storage medium | |
| CN115392405A (en) | Model training method, related device and storage medium | |
| CN115022098A (en) | Artificial intelligence safety target range content recommendation method, device and storage medium | |
| CN107368998A (en) | Agenda managing method and Related product | |
| CN114266601A (en) | Marketing strategy determination method and device, terminal equipment and storage medium | |
| CN115203194A (en) | Metadata information generation method, related device, equipment and storage medium | |
| CN117009659A (en) | Package recommendation method, device, equipment and storage medium | |
| CN111859136A (en) | Personalized recommendation method, device, equipment and readable storage medium | |
| CN111291868A (en) | Network model training method, device, equipment and computer readable storage medium | |
| CN114821173A (en) | Image classification method, device, equipment and storage medium | |
| CN108009393B (en) | Data processing method, device and computer readable storage medium | |
| CN111784376B (en) | Method and device for processing information | |
| CN112418441A (en) | Data processing method, device and equipment based on transfer learning and storage medium | |
| CN112465117A (en) | Contract generation model construction method, device, equipment and storage medium | |
| CN114547430A (en) | Information object label labeling method, device, equipment and storage medium |
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 |