CN109714398B - Data storage method and device - Google Patents
Data storage method and device Download PDFInfo
- Publication number
- CN109714398B CN109714398B CN201811511532.6A CN201811511532A CN109714398B CN 109714398 B CN109714398 B CN 109714398B CN 201811511532 A CN201811511532 A CN 201811511532A CN 109714398 B CN109714398 B CN 109714398B
- Authority
- CN
- China
- Prior art keywords
- block
- node
- node list
- ttl parameter
- network
- 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
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
- Information Transfer Between Computers (AREA)
Abstract
The application provides a data storage method and device. In this application, the network node sends the block either directly or after sending the block, but sends the first node list associated with the block before sending the block, when a response message which is returned by the first peer network node and responds to the first node list is received and a second TTL parameter carried by the response message meets a set condition, the block is sent, otherwise, broadcasting the block header of a block in a blockchain network, i.e. the block content is not sent, enables that not all network nodes in a blockchain network store the entire block in the blockchain, but where a portion of the network nodes store the entire block in the blockchain and another portion of the network nodes store the block header of the block in the blockchain, compared with the prior art that all network nodes need to store blocks on the block chain, the method greatly reduces the storage space of the nodes and well supports the application of big data based on the block chain.
Description
Technical Field
The present application relates to network communication technologies, and in particular, to a method and apparatus.
Background
The block chain technology, also called as distributed ledger technology, is an emerging technology in which a plurality of computing devices (also called as network nodes in a block chain network, hereinafter referred to as network nodes) participate in "accounting" together, and maintain a complete distributed database together.
The block chain technology has the characteristics of decentralization, openness and transparency, the network nodes can participate in database recording, and data synchronization can be rapidly carried out among the network nodes, so that the block chain technology is widely applied to the field of storage.
However, in the current storage application based on the block chain, each network node needs to store the same block, and if the data size is large, the storage space of the network node is greatly increased.
Disclosure of Invention
The application provides a data storage method and a data storage device, which are used for realizing the storage of a block by one part of network nodes and the block head of a block by the other part of network nodes in a block chain networking, and reducing the storage space requirement of the network nodes.
The technical scheme provided by the application comprises the following steps:
a data storage method is applied to a network node in a block chain network, and comprises the following steps:
broadcasting a first node list associated with a block in the block chain network before sending the block, wherein the first node list comprises a first Time To Live (TTL) parameter, and the block at least comprises a block head and a block body content;
receiving a response message which is returned by a first peer network node and used for responding to the first node list, wherein the response message carries a second TTL parameter, and the second TTL parameter is a difference value between the first TTL parameter and a first set value;
and checking whether the second TTL parameter meets a set condition, if so, broadcasting the block header in the block chain network, and if not, sending the block to the first peer network node.
A data storage apparatus for use in a network node in a blockchain network, comprising: a control unit and a transmitting unit;
the control unit is configured to broadcast a first node list associated with a block in the blockchain network before the sending unit sends the block, where the first node list includes a first Time To Live (TTL) parameter, and the block at least includes a block header and a block content; receiving a response message which is returned by the first peer network node and used for responding to the first node list, wherein the response message carries a second TTL parameter, and the second TTL parameter is a difference value between the first TTL parameter and a first set value; checking whether the second TTL parameter meets a set condition, if so, sending a block header notification to the sending unit, and if not, sending a block notification to the sending unit;
the sending unit is configured to broadcast the block header in the blockchain network when receiving the block header notification from the control unit, and send the block to the first peer network node when receiving the block notification from the control unit.
According to the technical scheme, the network node sends the block, does not directly send the block, but sends the first node list associated with the block before sending the block, and sends the block when receiving the response message which is returned by the first peer network node and responds to the first node list and the second TTL parameter carried by the response message meets the set condition, otherwise, broadcasts the block head of the block in the block chain network (namely, the content of the block is not sent). It can be seen that whether a block is sent or a block header of the block is sent (that is, the content of the block is not sent) is determined by judging whether a second TTL parameter carried by a response message returned by a first peer network node meets a set condition, so that it is achieved that not all network nodes in a block chain network store the whole block in a block chain, but a part of the network nodes store the whole block in the block chain (including the block header and the content of the block), and another part of the network nodes store the block header of the block chain, which greatly reduces the node storage space compared with the existing case that all network nodes store the block in the block chain, and well supports the application of big data based on the block chain.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present disclosure and together with the description, serve to explain the principles of the disclosure.
FIG. 1 is a flow chart of a method provided herein;
FIG. 2a is a block diagram of a conventional block structure;
FIG. 2b is a block diagram of the present application;
FIG. 3 is a block storage update diagram provided herein;
FIG. 4 is a schematic view of an embodiment provided herein;
FIG. 5 is a schematic diagram of the apparatus provided herein;
fig. 6 is a schematic hardware structure diagram of the apparatus shown in fig. 5 provided in the present application.
Detailed Description
According to the storage method based on the block chain, blocks on the block chain of part of network nodes are stored, compared with the existing storage method in which all the block chains local to all the network nodes store the blocks, the storage space of the nodes is greatly reduced, and the application of big data based on the block chain is well supported.
For the purposes of clarity, the present application will now be described with reference to the accompanying drawings and examples:
referring to fig. 1, fig. 1 is a flow chart of a method provided by the present application. The method is applied to network nodes in a blockchain network. The network node herein refers to any network node in a block chain network, and the present application is not particularly limited.
In the present application, in order to implement that only part of the network nodes store blocks on the block chain, the structure of the blocks may be improved.
Compared to the prior art block structure shown in fig. 2a, the block includes: block header, block body content, the present application adds a node list ID to the existing block structure shown in fig. 2a, specifically as shown in fig. 2 b. It should be noted that the position of the node list ID shown in fig. 2b is only an example, and may be in other positions, and the application is not particularly limited.
In the present application, the node list ID is a value similar to the relational database ID and is not changeable. The corresponding node list can be inquired in the relational database through the node list ID. Based on this, the first node list associated with the block is: and the node list corresponding to the node list ID.
And 102, receiving a response message which is returned by the first peer network node and used for responding to the first node list, wherein the response message carries a second TTL parameter, and the second TTL parameter is a difference value between the first TTL parameter and a first set value.
The first peer network node herein is not just one network node, but may refer to all network nodes that return the above-mentioned response message in a broad sense.
As can be seen from steps 101 to 103, in the present application, a network node does not directly send a block even if the block is sent, but sends a first node list associated with the block before sending the block, and sends the block when a response message returned by a first peer network node and responding to the first node list is received and a second TTL parameter carried in the response message meets a set condition, otherwise, broadcasts a block header of the block in a block chain network (that is, the content of the block is not sent). It can be seen that whether a block is sent or a block header of the block is sent is determined by judging whether a second TTL parameter carried by a response message returned by a first peer network node meets a set condition (i.e., the content of the block is not sent), so that it is realized that not all network nodes in a block chain network store the whole block in a block chain, but a part of network nodes store the whole block in the block chain, and another part of network nodes store the block header of the block chain, which greatly reduces the node storage space compared with the existing case that all network nodes store the block in the block chain, and well supports the application of big data based on the block chain.
In the above description, the first setting value, the setting condition may be set according to the actual situation.
In the present application, the blocks stored by any network node may be updated. The block update flow chart is described below.
Referring to fig. 3, fig. 3 is a block storage update flow chart provided in the present application. The process is performed after the block is sent. As shown in fig. 3, the process may include the following steps:
In step 301, the collection of the forwarding path topology is similar to the collection of the existing topology structure, and the description of the present application is not focused.
In the present application, the network node and the first peer network node perform heartbeat detection to determine whether the first peer network node is online, whether the first peer network node continues to store the block, and the like.
Based on the above heartbeat detection, this step 302 easily detects whether all first peer network nodes returning a response message delete the block in the block chain.
In this application, the notification message is used to indicate that any network node receiving the notification message first finds a third node list associated with the block locally, then checks whether a difference between a fourth TTL parameter in the third node list and the first setting value meets a set condition, if not, increases the fourth TTL parameter by the first setting value, and continues to send the notification message along the forwarding path topology, and if so, increases the fourth TTL parameter by the first setting value, and sends the block to the network node sending the response message.
Through the process shown in fig. 3, it is finally realized that when a network node deletes a block, a new network node storage block is added in time to ensure that the backup number of the block meets the requirement.
The flow shown in fig. 1 is described below by taking an example that the first set value is 1 and the set condition is equal to 0, through a specific embodiment:
referring to fig. 4, fig. 4 is a diagram of an application networking of an embodiment provided in the present application. In fig. 4, the block chain network is formed by connecting N nodes from node 401 to node N.
In fig. 4, it is assumed that node 401 newly generates one block. This block is denoted as block 400. The block 400 includes a block header, block contents, and a node list ID (denoted as ID 100).
Node 401 creates a node list (shown as table 1) corresponding to ID 100. Table 1 includes the IP address and TTL parameters of the node 401. The TTL parameter here is an initial value. As an example, in the present application, the initial value may be set according to actual conditions. The initial value is 16 in this embodiment.
Node 401 broadcasts table 1 in the blockchain network before sending block 400.
If node 402, node 403, and node 404 receive table 1 broadcast by node 401.
The node 402 calculates the difference between the TTL parameter in table 1 and 1, and checks whether the difference is 0. If not 0, table 2 is locally generated and recorded according to table 1. Table 2 is different from table 1, where the TTL parameter in table 2 is the difference, and table 2 further includes: IP address of node 402, IP address of node 401 recorded in table 1.
Node 402 returns a response message to node 401, which may carry the TTL parameter in table 2.
The node 403 and the node 404 perform operations similar to the node 402, and eventually return a response message to the node 401.
The node 401 receives response messages respectively returned by the nodes 402 to 404, and determines that TTL parameters carried in the response messages are not 0, adds new IP addresses from the node 402 to the node 404 in table 1, and sends the block 400 to the nodes 402 to 404. In one example, node 401 may send block 400 to nodes 402-404 in a multicast format.
Finally, nodes 402 to 404 receive the block 400, record the received block 400 into the local blockchain, and continue forwarding the block 400. Taking node 402 as an example:
node 402 broadcasts table 2 in the blockchain network before sending block 400.
If node 405, node 406 receive table 2 broadcast by node 402.
The node 405 calculates the difference between the TTL parameter in table 2 and 1, and checks whether the difference is 0. If not 0, table 5 is locally generated and recorded according to table 2. Table 5 is different from table 2, where the TTL parameter in table 5 is the difference, and table 5 further includes: IP address of node 405, IP address recorded in table 2.
Node 405 returns a response message to node 402, which may carry the TTL parameter in table 5.
Node 406 performs similar operations as node 405 and eventually also returns a response message to node 402.
The node 402 receives response messages respectively returned by the node 405 and the node 406, and sends the block 400 to the node 405 and the node 406 when judging that the TTL parameters carried in the response messages are not 0. In one example, node 402 may send block 400 to nodes 405, 406 in a multicast format.
By analogy, if the node 340 receives the response messages respectively returned by the nodes 331 to 336 and determines that the TTL parameter carried in the response message is 0, the node 340 does not send the block 400 any more but sends the block header of the block 400. Then, the network node receiving the block header of the block 400 will continue to send the block header of the block 400, and so on, and finally, a part of network nodes in the whole network will store the block 400 in the blockchain, and a part of network nodes will store the block header of the block 400 in the blockchain.
In this embodiment, as can be seen from the above description, each network node storing the block 400 records a node list associated with the block 400 locally. The node list associated with the block 400 recorded locally by each network node includes: the IP address of each network node through which the block 400 passes before reaching the own node, the IP address of the own node, and the next hop IP address of the own node forwarding block 400.
As illustrated in fig. 4, each network node performs heartbeat detection between neighboring neighbors according to the locally recorded IP addresses in the node list associated with the block 400, and each network node that finally stores the block 400 collects the forwarding path topology of the block 400 according to the heartbeat detection in a manner similar to the collection of the existing topology structure.
After each network node storing block 400 collects the forwarding path topology of block 400, a notification message is sent as described in step 302 above once all next-hop network nodes are found to delete block 400. The function of the notification message is described above and will not be described in detail here. Finally, based on the notification message, the network nodes storing the block 400 can be increased in time to meet the requirement of the backup number of the block 400.
Thus, the description of the embodiments is completed.
The method provided by the present application is described above, and the device provided by the present application is described below:
referring to fig. 5, fig. 5 is a diagram illustrating a structure of the apparatus according to the present invention. The device is applied to the network node in the block chain network, and comprises: a control unit and a transmitting unit;
the control unit is configured to broadcast a first node list associated with a block in the blockchain network before the sending unit sends the block, where the first node list includes a first Time To Live (TTL) parameter, and the block at least includes a block header and a block content; receiving a response message which is returned by the first peer network node and used for responding to the first node list, wherein the response message carries a second TTL parameter, and the second TTL parameter is a difference value between the first TTL parameter and a first set value; checking whether the second TTL parameter meets a set condition, if so, sending a block header notification to the sending unit, and if not, sending a block notification to the sending unit;
the sending unit is configured to broadcast the block header of the block in the blockchain network when receiving the block header notification from the control unit, and send the block to the first peer network node when receiving the block notification from the control unit.
In one example, the block further comprises: a node list ID;
the first node list is: and the node list corresponding to the node list ID.
In one example, the block is generated by the node;
the control unit further creates the first node list locally, and the first TTL parameter is a preset initial value.
In one example, the block is a block received by the node and sent by a second peer network node directly connected with the node;
the control unit further receives a second node list sent by the second peer network node, and generates a first node list according to the second node list, wherein the first TTL parameter is a difference value between a third TTL parameter in the second node list and the first set value.
In one example, the apparatus further comprises:
a topology collection unit, configured to obtain a forwarding path topology of the block;
an updating unit, configured to determine, according to the forwarding path topology, a next hop of the first peer network node and send a notification message to the next hop when detecting that all first peer network nodes returning the response message delete the block in a local block chain;
the notification message is used for indicating that any network node receiving the notification message searches a third node list associated with the block locally, then whether a difference between a fourth TTL parameter in the third node list and the first set value meets a set condition is checked, if not, the fourth TTL parameter is increased by the first set value, the notification message is continuously sent along the forwarding path topology, and if yes, the fourth TTL parameter is increased by the first set value, and the block is sent to the network node sending the response message.
Thus, the apparatus structure diagram provided in the present application is completed.
Correspondingly, the application also provides a hardware structure diagram of the device shown in fig. 5. As shown in fig. 6, the hardware structure may include: a machine-readable storage medium and a processor, wherein:
a machine-readable storage medium: the instruction code is stored.
A processor: the data storage method disclosed by the above examples of the present disclosure is realized by communicating with a machine-readable storage medium, reading and executing instruction codes in the machine-readable storage medium.
Thus, the hardware configuration of the apparatus shown in fig. 6 is completed.
In the present application, a machine-readable storage medium may be any electronic, magnetic, optical, or other physical storage device that can contain or store information such as executable instructions, data, and the like. For example, the machine-readable storage medium may be: a RAM (random Access Memory), a volatile Memory, a non-volatile Memory, a flash Memory, a storage drive (e.g., a hard drive), a solid state drive, any type of storage disk (e.g., an optical disk, a dvd, etc.), or similar storage medium, or a combination thereof.
The apparatuses, modules or units illustrated in the above embodiments may be implemented by a computer chip or an entity, or implemented by a product with certain functions. A typical implementation device is a computer, which may take the form of a personal computer, laptop computer, cellular telephone, camera phone, smart phone, personal digital assistant, media player, navigation device, email messaging device, game console, tablet computer, wearable device, or a combination of any of these devices.
For convenience of description, the above devices are described as being divided into various units by function, and are described separately. Of course, the functionality of the units may be implemented in one or more software and/or hardware when implementing the present application.
It will be apparent to those skilled in the art that embodiments of the present application may be provided as a method, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, embodiments of the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
Furthermore, these computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
The above description is only exemplary of the present application and should not be taken as limiting the present application, as any modification, equivalent replacement, or improvement made within the spirit and principle of the present application should be included in the scope of protection of the present application.
Claims (10)
1. A data storage method is applied to a network node in a block chain network, and comprises the following steps:
broadcasting a first node list associated with a block in the block chain network before sending the block, wherein the first node list comprises a first Time To Live (TTL) parameter, and the block at least comprises a block head and a block body content;
receiving a response message which is returned by a first peer network node and used for responding to the first node list, wherein the response message carries a second TTL parameter, and the second TTL parameter is a difference value between the first TTL parameter and a first set value;
and checking whether the second TTL parameter meets a set condition, if so, broadcasting the block header in the block chain network, and if not, sending the block to the first peer network node.
2. The method of claim 1, wherein the block further comprises: a node list ID;
the first node list is: and the node list corresponding to the node list ID.
3. The method of claim 1, wherein the block is generated by a local node;
the method further comprises the following steps: and establishing the first node list locally, wherein the first TTL parameter is a preset initial value.
4. The method of claim 1, wherein the block is a block received by the node and sent from a second peer network node directly connected to the node;
the method further comprises the following steps:
and receiving a second node list sent by the second peer network node, and generating a first node list according to the second node list, wherein the first TTL parameter is a difference value between a third TTL parameter in the second node list and the first set value.
5. The method of claim 1, further comprising:
collecting forwarding path topology for the block;
when detecting that all first peer network nodes returning the response message delete the block in a local block chain, determining a next hop of the first peer network nodes according to the forwarding path topology and sending a notification message to the next hop;
the notification message is used for indicating that any network node receiving the notification message searches a third node list associated with the block locally, then whether a difference between a fourth TTL parameter in the third node list and the first set value meets a set condition is checked, if not, the fourth TTL parameter is increased by the first set value, the notification message is continuously sent along the forwarding path topology, and if yes, the fourth TTL parameter is increased by the first set value, and the block is sent to the network node sending the response message.
6. A data storage device for use in a network node in a blockchain network, comprising: a control unit and a transmitting unit;
the control unit is configured to broadcast a first node list associated with a block in the blockchain network before the sending unit sends the block, where the first node list includes a first Time To Live (TTL) parameter, and the block at least includes a block header and a block content; receiving a response message which is returned by the first peer network node and used for responding to the first node list, wherein the response message carries a second TTL parameter, and the second TTL parameter is a difference value between the first TTL parameter and a first set value; checking whether the second TTL parameter meets a set condition, if so, sending a block header notification to the sending unit, and if not, sending a block notification to the sending unit;
the sending unit is configured to broadcast the block header in the blockchain network when receiving the block header notification from the control unit, and send the block to the first peer network node when receiving the block notification from the control unit.
7. The apparatus of claim 6, wherein the block further comprises: a node list ID;
the first node list is: and the node list corresponding to the node list ID.
8. The apparatus of claim 6, wherein the block is generated by a local node;
the control unit further creates the first node list locally, and the first TTL parameter is a preset initial value.
9. The apparatus of claim 6, wherein the block is a block received by the node and sent from a second peer network node directly connected to the node;
the control unit further receives a second node list sent by the second peer network node, and generates a first node list according to the second node list, wherein the first TTL parameter is a difference value between a third TTL parameter in the second node list and the first set value.
10. The apparatus of claim 6, further comprising:
a topology collection unit, configured to obtain a forwarding path topology of the block;
an updating unit, configured to determine, according to the forwarding path topology, a next hop of the first peer network node and send a notification message to the next hop when detecting that all first peer network nodes returning the response message delete the block in a local block chain;
the notification message is used for indicating that any network node receiving the notification message searches a third node list associated with the block locally, then whether a difference between a fourth TTL parameter in the third node list and the first set value meets a set condition is checked, if not, the fourth TTL parameter is increased by the first set value, the notification message is continuously sent along the forwarding path topology, and if yes, the fourth TTL parameter is increased by the first set value, and the block is sent to the network node sending the response message.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811511532.6A CN109714398B (en) | 2018-12-11 | 2018-12-11 | Data storage method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811511532.6A CN109714398B (en) | 2018-12-11 | 2018-12-11 | Data storage method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109714398A CN109714398A (en) | 2019-05-03 |
| CN109714398B true CN109714398B (en) | 2021-09-21 |
Family
ID=66256325
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811511532.6A Active CN109714398B (en) | 2018-12-11 | 2018-12-11 | Data storage method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109714398B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111711567B (en) * | 2020-06-12 | 2022-01-07 | 杭州溪塔科技有限公司 | Block chain-based network message transmission method and device and electronic equipment |
| CN113296707A (en) * | 2021-05-31 | 2021-08-24 | 尧领有限公司 | Disk storage method and system, block chain node and computer readable storage medium |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106506638A (en) * | 2016-11-04 | 2017-03-15 | 江苏通付盾科技有限公司 | Block storage method and device in block chain |
| EP3163446A1 (en) * | 2014-06-26 | 2017-05-03 | Hangzhou Hikvision System Technology Co., Ltd. | Data storage method and data storage management server |
| CN107317672A (en) * | 2017-05-10 | 2017-11-03 | 广东网金控股股份有限公司 | A kind of light weight terminating machine block catenary system |
| CN107360156A (en) * | 2017-07-10 | 2017-11-17 | 广东工业大学 | P2P network method for cloud storage based on block chain under a kind of big data environment |
| CN107992492A (en) * | 2016-10-26 | 2018-05-04 | 中国移动通信有限公司研究院 | A kind of storage method of data block, read method, its device and block chain |
| CN108270836A (en) * | 2017-01-03 | 2018-07-10 | 华为技术有限公司 | Data processing method, equipment and system based on block chain |
| CN108810119A (en) * | 2018-05-31 | 2018-11-13 | 中国联合网络通信集团有限公司 | block chain processing method, device and block chain node |
| WO2018222927A1 (en) * | 2017-05-31 | 2018-12-06 | Alibaba Group Holding Limited | Blockchain data processing method and apparatus |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108777710B (en) * | 2018-05-31 | 2021-06-08 | 中国联合网络通信集团有限公司 | Inter-node communication method and device of block chain and block chain node |
| CN108924252B (en) * | 2018-07-31 | 2021-06-04 | 泰链（厦门）科技有限公司 | Method, medium, and blockchain system for reducing storage load of nodes in blockchain system |
-
2018
- 2018-12-11 CN CN201811511532.6A patent/CN109714398B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP3163446A1 (en) * | 2014-06-26 | 2017-05-03 | Hangzhou Hikvision System Technology Co., Ltd. | Data storage method and data storage management server |
| CN107992492A (en) * | 2016-10-26 | 2018-05-04 | 中国移动通信有限公司研究院 | A kind of storage method of data block, read method, its device and block chain |
| CN106506638A (en) * | 2016-11-04 | 2017-03-15 | 江苏通付盾科技有限公司 | Block storage method and device in block chain |
| CN108270836A (en) * | 2017-01-03 | 2018-07-10 | 华为技术有限公司 | Data processing method, equipment and system based on block chain |
| CN107317672A (en) * | 2017-05-10 | 2017-11-03 | 广东网金控股股份有限公司 | A kind of light weight terminating machine block catenary system |
| WO2018222927A1 (en) * | 2017-05-31 | 2018-12-06 | Alibaba Group Holding Limited | Blockchain data processing method and apparatus |
| CN107360156A (en) * | 2017-07-10 | 2017-11-17 | 广东工业大学 | P2P network method for cloud storage based on block chain under a kind of big data environment |
| CN108810119A (en) * | 2018-05-31 | 2018-11-13 | 中国联合网络通信集团有限公司 | block chain processing method, device and block chain node |
Non-Patent Citations (2)
| Title |
|---|
| "Logchain: Blockchain-Assisted Log Storage";William Pourmajidi等;《2018 IEEE 11th International Conference on Cloud Computing (CLOUD)》;20180910;全文 * |
| "基于区块链的日志存储系统";费禹等;《网络空间安全》;20180630;第09卷(第6期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109714398A (en) | 2019-05-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111431800B (en) | Method, device and equipment for establishing path and machine-readable storage medium | |
| CN109714398B (en) | Data storage method and device | |
| CN107231400B (en) | Data synchronization method and device | |
| CN104468163A (en) | Method and device for disaster tolerant network construction, and disaster tolerant network | |
| CN107547283B (en) | Management method and device of distributed aggregation group | |
| CN109728972B (en) | Network connection detection method and device | |
| CN111083179A (en) | Internet of things cloud platform, and equipment interaction method and device based on same | |
| CN109167700B (en) | Detection method and device for Segment Routing (SR) tunnel | |
| CN111886843A (en) | Low power consumption Bluetooth network maintenance method, electronic device, Bluetooth network and medium | |
| CN111131484A (en) | Node mounting method, device, network node and storage medium | |
| CN115280745B (en) | Stream following detection method and electronic equipment | |
| CN108234358B (en) | Multicast message transmission method, device and machine readable storage medium | |
| CN113574834B (en) | Route updating method and device | |
| CN108259340B (en) | Topology information transmission method and device | |
| CN112422302A (en) | Message broadcasting method, device, network node and computer storage medium | |
| CN101674251B (en) | Method for upgrade processing for recursive router, device and router therefor | |
| CN112702361B (en) | Safety blocking method, device and equipment based on lightweight distributed cooperative equipment | |
| CN114490129A (en) | Message broadcasting method, device and storage medium in cluster | |
| CN112637053B (en) | Method and device for determining backup forwarding path of route | |
| CN103001987B (en) | A kind of data processing method and data processing node | |
| CN101150514B (en) | IS-IS route realization method and device for supporting additional SYS-ID | |
| CN109218196B (en) | Information collection method, device, equipment and machine-readable storage medium | |
| CN113794644B (en) | Method and device for deleting routing table entries | |
| US20240064094A1 (en) | Route information processing method and apparatus | |
| CN107864096B (en) | Path adjusting method and device |
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 |