Data-interoperability-oriented trusted processing method and system

Patent metadata

Field	Value
Publication number	US-11018980-B2
Application number	US-202017082492-A
Country	US
Kind code	B2
Filing date	Oct 28, 2020
Priority date	Oct 28, 2019
Publication date	May 25, 2021
Grant date	May 25, 2021

Abstract

A data-interoperability-oriented trusted processing method and system applied to a P2P network system are provided. The P2P network system includes a plurality of nodes. The trusted processing method includes a storage method and a query method. Firstly, a directed acyclic graph ledger structure is employed to be matched with an nRW consensus mechanism during a storage process, so that a supervision problem in a large-scale sharing exchange process is solved. Secondly, in a query process, a P2P network system is optimized by maintaining a tree structure with high fault tolerance and load balance through a hop optimization method to construct the P2P network system with a relatively balanced network, so that a query delay is not greatly influenced on the premise of ensuring the load balance, and an expandability of the system is ensured.

First claim

What is claimed is:

1. A data-interoperability-oriented trusted processing method, wherein the data-interoperability-oriented trusted processing method is applied to a P2P network system,
the P2P network system comprises a plurality of nodes,
the plurality of nodes comprise an Active List and a Passive List, and the Active List comprises an Eager List and a Lazy List;
wherein a quantity of nodes in the Active List is a fixed value, and third nodes establishing a TCP connection with the plurality of nodes on the P2P network system are stored in the Eager List for transmitting messages;
fourth nodes are remaining nodes in the Active List excluding the third nodes of the Eager List, wherein the fourth nodes are stored in the Lazy List, and the fourth nodes are configured for transmitting a message digest or a message ID, and for optimization and fault tolerance of the P2P network system;
random nodes are stored in the Passive List, and are configured for replacing disconnected nodes in the Active List, to ensure a connection between the plurality of nodes and a network in the P2P network system;
the data-interoperability-oriented trusted processing method comprises a storage method and a query method;
the storage method comprises:
in a process of initiating a transaction, randomly selecting, by a transaction initiating node in the P2P network system, a plurality of witness nodes from the P2P network system for witnessing the transaction;
packaging, by the plurality of witness nodes, transaction data generated by witnessing the transaction to generate blocks;
randomly selecting, by the plurality of witness nodes, a plurality of storage nodes from the P2P network system;
sending, by the plurality of witness nodes, the blocks to the plurality of storage nodes; and
storing, by the plurality of storage nodes, the blocks, wherein, for the transaction, the blocks of the plurality of witness nodes and the plurality of storage nodes form a directed acyclic graph (DAG) structure;
the query method comprises:
in the P2P network system, acquiring, by a first node, a query request broadcast by a father node of the first node, wherein the first node is a node of the plurality of nodes in the P2P network system;
broadcasting, by the first node, the query request to a child node of the first node through a tree maintenance program; wherein the child node is configured to broadcast the query request to the child node of the first node by using a tree structure of the P2P network system, and the child node of the first node repeats the step of broadcasting, by the first node, the query request to the child node of the first node through the tree maintenance program till the query request has been broadcast to the plurality of nodes on the P2P network system; each of the plurality of nodes retrieves a local database after receiving the query request, waits for a result of the child node of the first node, and after data returned by the child nodes is collected, each of the plurality of nodes performs settlement and de-duplication operations, and returns a result to the father node of the first node; after rounds of feedback, when a root node receiving the query request of a user receives the results returned by the child nodes, the root node performs final settlement and de-duplication operations to generate a final query result and returns the final query result to the user;
the tree maintenance program comprises an extensible maintenance program and a fault-tolerant maintenance program;
for the extensible maintenance program, the query method comprises:
when the first node broadcasts the query request to the child node of the first node, sending, by the first node, an IHAVE message to a second node in the child node of the first node, the IHAVE message comprising the message ID;
checking, by the second node, whether a NORMAL message corresponding to the message ID and configured for transmitting the query request is received by the second node;
if the second node does not receive the NORMAL message corresponding to the message ID within a timeout period, performing the following steps of:
generating, by the second node, a GRAFT message for repairing the P2P network system, the GRAFT message comprising the message ID and a request for receiving the IHAVE message;
by the second node, sending the GRAFT message to the first node, and moving the first node from a Lazy List of the first node to an Eager List of the first node, wherein the first node repairs the P2P network system;
if the second node receives the NORMAL message corresponding to the message ID within the timeout period, performing the following steps of:
calculating, by the second node, a hop difference between receiving hops of the IHAVE message and receiving hops of the NORMAL message;
determining, by the second node, whether the hop difference exceeds a hop threshold; and
if the hop difference exceeds the hop threshold, repairing, by the second node, the P2P network system; and
for the fault-tolerant maintenance program, the query method comprises:
when a connection between the first node and the second node constituting edges of the P2P network system is disconnected, removing, by the first node, the second node from the Eager List of the first node;
initiating, by the first node, the query request to first target nodes in a Passive List of the first node in sequence, the query request comprising an instruction configured to check whether the first target nodes are online and an instruction configured to query a size of a Lazy List of the first target nodes;
by the first node, receiving query results returned by the first target nodes for the query requests, and selecting a second target node with a smallest Lazy List and a lowest delay from the first target nodes according to delays in the query results and the sizes of the Lazy Lists of the first target nodes; and
by the first node, adding the second target node to the Lazy List of the first node, and using the fourth nodes in the Lazy List as substitute edges to repair the P2P network system.

2. The data-interoperability-oriented trusted processing method according to claim 1 , wherein
the storage method comprises: in the DAG structure, each of the blocks has a plurality of preceding blocks and a plurality of subsequent blocks.

3. The data-interoperability-oriented trusted processing method according to claim 2 , wherein
each of the blocks comprises a block header and a block body,
wherein the block header comprises IDs of the plurality of preceding blocks, a witness node signature, a timestamp, a unique identity Nonce, a data chain version, a number of the blocks and a Merkle Tree root, and
the block body comprises the transaction data.

4. The data-interoperability-oriented trusted processing method according to claim 1 ,
wherein for the transaction, a quantity of the plurality of witness nodes is three, and a quantity of the plurality of storage nodes selected by each of the plurality of witness nodes is three.

5. The data-interoperability-oriented trusted processing method according to claim 1 ,
wherein the P2P network system comprises a BroadcastTree protocol, an MsgTransferProt protocol and a PartialView protocol,
wherein the BroadcastTree protocol is configured for maintaining the P2P network system;
the MsgTransferProt protocol is configured for broadcasting a query message and verifying and transmitting a query result; and
the PartialView protocol is configured for managing neighbor nodes of each node of the plurality of nodes, wherein the neighbor nodes comprise the father node and the child node; and wherein the Active List and the Passive List are located in the PartialView protocol of the P2P network system;
each of the plurality of nodes comprises a first Map c

Assignees

• Univ Beijing

Inventors

• Huang Gang
• Cai Huaqian
• Zhang Ying
• Liu Xuanzhe
• Ma Yun

Classifications

• H04L9/50

  using hash chains, e.g. blockchains or hash trees · CPC title

• H04L63/123

  received data contents, e.g. message integrity · CPC title

• H04L47/125 Primary

  by balancing the load, e.g. traffic engineering · CPC title

• H04L45/20

  Hop count for routing purposes, e.g. TTL · CPC title

• H04L12/185

  with management of multicast group membership · CPC title